From post

Receipt-Free Electronic Voting Schemes for Large Scale Elections.

. Security Protocols Workshop, том 1361 из Lecture Notes in Computer Science, стр. 25-35. Springer, (1997)

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.

 

Другие публикации лиц с тем же именем

How to Utilize the Randomness of Zero-Knowledge Proofs., и . CRYPTO, том 537 из Lecture Notes in Computer Science, стр. 456-475. Springer, (1990)A Unified Paradigm of Organized Complexity and Semantic Information Theory.. CoRR, (2016)Meta-envy-free Cake-cutting and Pie-cutting Protocols., и . J. Inf. Process., 20 (3): 686-693 (2012)Standard model leakage-resilient authenticated key exchange using inner-product extractors., и . Des. Codes Cryptogr., 90 (4): 1059-1079 (2022)Resource Bounded Unprovability of Computational Lower Bounds., и . IACR Cryptology ePrint Archive, (2003)Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security., , и . IWSEC, том 7631 из Lecture Notes in Computer Science, стр. 216-232. Springer, (2012)On Key Distribution and Authentication in Mobile Radio Networks., , , и . EUROCRYPT, том 765 из Lecture Notes in Computer Science, стр. 461-465. Springer, (1993)How Intractable Is the Discrete Logarithm for a General Finite Group?, , и . EUROCRYPT, том 658 из Lecture Notes in Computer Science, стр. 420-428. Springer, (1992)Designated Confirmer Signatures and Public-Key Encryption are Equivalent.. CRYPTO, том 839 из Lecture Notes in Computer Science, стр. 61-74. Springer, (1994)Quantum Public-Key Cryptosystems., , и . CRYPTO, том 1880 из Lecture Notes in Computer Science, стр. 147-165. Springer, (2000)