| W. Mao. Timed-release cryptography. In SAC'01, Springer-Verlag LNCS vol. 2259, pages 342--357, August 2001. |
....tuples g; uK Gamma1 ; uK ; v 1 , and g; uK Gammaj ; v j Gamma1 ; v j , for 2 j K, are Diffie Hellman tuples. These 2K proofs are performed in parallel. We now argue how the properties mentioned at the beginning of the section are satisfied upon completion of the protocol. See also [Mao01] for a more efficient protocol. 8 1. The probability that a cheating prover successfully convinces the verifier that a wrong value lies on the MTL is 2K s , where ffl s is the soundness error of the zero knowledge protocol of step 3. Given the safe prime structure of N , and using the ZK ....
....protocol. 8 1. The probability that a cheating prover successfully convinces the verifier that a wrong value lies on the MTL is 2K s , where ffl s is the soundness error of the zero knowledge protocol of step 3. Given the safe prime structure of N , and using the ZK protocol presented in [Mao01] yields s = 2q 1 2q 2 Gamma 1 2q 1 q 2 p N : These protocols can be repeated to lower the error. 2. A sufficiently large period of the MTL follows from Theorem 1. Setting up an MTL requires a computational effort, particularly in the Setup phase for the proof of the safe prime ....
W. Mao. Timed-Release Cryptography. In Selected Areas in Cryptography VIII (SAC'01), volume 2259 of Lecture Notes in Computer Science, pages 342-357, Springer-Verlag, Toronto, Ontario, Canada, August 2001.
No context found.
W. Mao, Timed release cryptography, in the proceedings of SAC 2001. 3
No context found.
W. Mao. Timed-release cryptography. In SAC'01, Springer-Verlag LNCS vol. 2259, pages 342--357, August 2001.
No context found.
W. Mao. Timed-release cryptography. In In Selected Areas in Cryptography VIII (SAC'01), 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC