Author of the publication

Secure Vickrey Auctions without Threshold Trust.

, , and . Financial Cryptography, volume 2357 of Lecture Notes in Computer Science, page 87-101. Springer, (2002)

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.

 

Other publications of authors with the same name

Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments.. IACR Cryptology ePrint Archive, (2011)Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK., , and . ASIACRYPT (2), volume 13792 of Lecture Notes in Computer Science, page 249-278. Springer, (2022)Efficient NIZKs for Algebraic Sets., , , and . ASIACRYPT (3), volume 13092 of Lecture Notes in Computer Science, page 128-158. Springer, (2021)More Efficient Shuffle Argument from Unique Factorization., and . CT-RSA, volume 12704 of Lecture Notes in Computer Science, page 252-275. Springer, (2021)A Shuffle Argument Secure in the Generic Model., , and . ASIACRYPT (2), volume 10032 of Lecture Notes in Computer Science, page 841-872. (2016)Key-and-Argument-Updatable QA-NIZKs.. IACR Cryptology ePrint Archive, (2019)IDEA: A Cipher For Multimedia Architectures?. Selected Areas in Cryptography, volume 1556 of Lecture Notes in Computer Science, page 248-263. Springer, (1998)Two New Efficient PIR-Writing Protocols., and . ACNS, volume 6123 of Lecture Notes in Computer Science, page 438-455. (2010)Efficient Algorithms for Computing Differential Properties of Addition., and . FSE, volume 2355 of Lecture Notes in Computer Science, page 336-350. Springer, (2001)Practical Fully Simulatable Oblivious Transfer with Sublinear Communication., , , and . Financial Cryptography, volume 7859 of Lecture Notes in Computer Science, page 78-95. Springer, (2013)