How to leak a secret

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2248, Issue , 2001, Pages 552-565

  Rivest, Ronald L ^a   Shamir, Adi ^b   Tauman, Yael ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Designated verifier signature scheme; Group signature scheme; Ring signature scheme; Signature scheme; Signer ambiguous signature scheme

Indexed keywords

CRYPTOGRAPHY; NETWORK SECURITY;

DESIGNATED VERIFIER SIGNATURE SCHEME; GROUP SIGNATURE SCHEME; MODULAR MULTIPLICATION; MULTIPARTY COMPUTATION; RANDOM ORACLE MODEL; RING SIGNATURE SCHEMES; SIGNATURE SCHEME; SYMMETRIC ENCRYPTION;

AUTHENTICATION;

EID: 84946833891     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45682-1_32     Document Type: Conference Paper

References (10)

1. Jan Camenisch. Efficient and generalized group signatures. InWalter Fumy, editor, Advances in Cryptology – Eurocrypt’97, pages 465–479, Berlin, 1997. Springer. Lecture Notes in Computer Science 1233.
2. David Chaum and Eugѐne Van Heyst. Group signatures. In D.W. Davies, editor, Advances in Cryptology — Eurocrypt’91, pages 257–265, Berlin, 1991. Springer- Verlag. Lecture Notes in Computer Science No. 547.
3. Ronald Cramer, Ivan Damgård, and Berry Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Yvo Desmedt, editor, Advances in Cryptology – CRYPTO’94, pages 174–187, Berlin, 1994. Springer- Verlag. Lecture Notes in Computer Science Volume 839.
4. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. Inform. Theory, IT-22:644–654, November 1976.
5. G. H. Hardy and E. M. Wright. An Introduction to the Theory of Numbers. Oxford, fifth edition, 1979.
6. M. Jakobsson, K. Sako, and R. Impagliazzo. Designated verifier proofs and their applications. In Ueli Maurer, editor, Advances in Cryptology - EuroCrypt’96, pages 143–154, Berlin, 1996. Springer-Verlag. Lecture Notes in Computer Science Volume 1070.
7. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Computing, 17(2):373–386, April 1988.
8. M. Rabin. Digitalized signatures as intractable as factorization. Technical Report MIT/LCS/TR-212, MIT Laboratory for Computer Science, January 1979.
9. Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120–126, 1978.
10. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, and Moti Yung. On monotone formula closure of SZK. In Proc. 35th FOCS, pages 454–465. IEEE, 1994.