Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The known security proofs for hash tree time-stamping as- sume collision-resistance (CR). An asymptotically optimally tight proof has the security loss formula t � δ� ≈ 14 √ C t δ 1.5 ,w here t � δ� is the time- success ratio of a collision-finder, t
['Ahto Buldas', 'Risto Laanoja']
I am writing a research paper on a idea Security Proofs for Hash Tree Time-Stamping Using Hash Functions with Small Output Size
[{"from": "human", "value": "I am writing a research paper on a idea Security Proofs for Hash Tree Time-Stamping Using Hash Functions with Small Output Size"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The known security proofs for hash tree time-stamping as- sume collision-resistance (CR). An asymptotically optimally tight proof has the security loss formula t \ufffd \u03b4\ufffd \u2248 14 \u221a C t \u03b4 1.5 ,w here t \ufffd \u03b4\ufffd is the time- success ratio of a collision-finder, t"}]