PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Cramer, Ronald"

Author of the publication

copydeleteadd this publication to your clipboard
On the Amortized Complexity of Zero-Knowledge Protocols.

, , and . J. Cryptology, 27 (2): 284-316 (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dr. -Ing. Michael Cramer University of Stuttgart

 

Other publications of authors with the same name

Signature schemes based on the strong RSA assumption., and . ACM Trans. Inf. Syst. Secur., 3 (3): 161-185 (2000)On the Amortized Complexity of Zero-Knowledge Protocols., , and . J. Cryptology, 27 (2): 284-316 (2014)Secure Computation from Random Error Correcting Codes., , , , and . EUROCRYPT, volume 4515 of Lecture Notes in Computer Science, page 291-310. Springer, (2007)General Secure Multi-party Computation from any Linear Secret-Sharing Scheme., , and . EUROCRYPT, volume 1807 of Lecture Notes in Computer Science, page 316-334. Springer, (2000)Improved Privacy in Wallets with Observers (Extended Abstract)., and . EUROCRYPT, volume 765 of Lecture Notes in Computer Science, page 329-343. Springer, (1993)A Secure and Optimally Efficient Multi-Authority Election Scheme., , and . EUROCRYPT, volume 1233 of Lecture Notes in Computer Science, page 103-118. Springer, (1997)Signature Schemes Based on the Strong RSA Assumption., and . ACM Conference on Computer and Communications Security, page 46-51. ACM, (1999)The ESPRIT Project CAFE - High Security Digital Payment Systems., , , , , , , , , and 3 other author(s). ESORICS, volume 875 of Lecture Notes in Computer Science, page 217-230. Springer, (1994)On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes., , , , , , and . CRYPTO, volume 3621 of Lecture Notes in Computer Science, page 327-343. Springer, (2005)Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups., and . CRYPTO, volume 2442 of Lecture Notes in Computer Science, page 272-287. Springer, (2002)