Anonymous authentication of membership in dynamic groups

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

Volumn 1648, Issue , 1999, Pages 184-195

  Schechter, Stuart ^a   Parnell, Todd ^b   Hartemink, Alexander ^b  

^a HARVARD UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Anonymity; Authentication; Identification; Key replacement; Verifiably common secret encoding

Indexed keywords

CHROMIUM COMPOUNDS; ENCODING (SYMBOLS); IDENTIFICATION (CONTROL SYSTEMS); PUBLIC KEY CRYPTOGRAPHY; SIGNAL ENCODING;

ANONYMITY; ANONYMOUS AUTHENTICATION; DYNAMIC GROUPS; IMPROVE PERFORMANCE; KEY REPLACEMENT; MULTIPLE MESSAGES; PUBLIC KEY CRYPTOSYSTEMS; TRUSTED THIRD PARTIES;

AUTHENTICATION;

EID: 84956867779     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48390-x_14     Document Type: Conference Paper

References (19)

1. Anonymizer, Inc., http://www.anonymizer.com.
2. M. Blum and S. Goldwasser, “An Efficient Probabilistic Public-Key Encryption Scheme which Hides All Partial Information,” Advances of Cryptology - CRYPTO '84 Proceedings, Springer-Verlag, pp. 289-299.
3. J. Camenisch and M. Stadler, “Efficient Group Signature Schemes for Large Groups,” Advances in Cryptology - CRYPTO '97 Proceedings, Springer-Verlag, v. 1294, pp. 410-424
4. D. Chaum, “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms,” Communications of the ACM, v. 24, n. 2, Feb 1981, pp. 84-88.
5. D. Chaum, “Security without Identification: Card Computers to make Big Brother Obsolete,” Communications of the ACM, v. 28, n. 10, Oct 1985, pp. 1030-1044.
6. D. Chaum, A. Fiat, and M. Naor, “Untraceable Electronic Cash,” Advances in Cryptology - CRYPTO ’88 Proceedings, Springer-Verlag, pp. 319-327.
7. D. Chaum and E. van Heyst, “Group signatures,” Advances in Cryptology - EUROCRYPT ’91 Proceedings, Springer-Verlag, pp. 257-265.
8. D. Coppersmith, “Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities,” Journal of Cryptography, v. 10 n. 4, Autumn 1997, pp. 233-260.
9. R. Cramer, I. Damgard, B. Schoenmakers, “Proofs of partial knowledge and simplified design of witness hiding protocols,” Advances in Cryptology – CRYPTO ’94 Proceedings, pp. 174-187.
10. A. De Santis, G. Di Crescenzo, G. Persiano, “Communication-efficient anonymous group identification,” 5th ACM Conference on Computer and Communications Security, November 1998, pp. 73-82.
11. A. De Santis, G. Di Crescenzo, G. Persiano, M. Yung, “On monotone formula closure of SZK,” FOCS ’94.
12. S. Goldwasser and S. Micali, “Probabilistic Encryption,” Journal of Computer and Systems Sciences, v. 28 n. 2, Apr 1984, pp. 270-299.
13. J. Hastad and A. Shamir, “On Using RSA with Low Exponent in a Public Key Network,” Advances in Cryptology - CRYPTO ’85 Proceedings, Springer-Verlag, pp. 403-408.
14. J. Hastad, “Solving Simultaneous Modular Equations of Low Degree,” SIAM Journal on Computing, v. 17 no. 2, Apr 1988, pp. 336-341.
15. J. Kilian and E. Petrank, “Identity Escrow,” Advances in Cryptology - CRYPTO ’98 Proceedings, Springer-Verlag, pp. 167-185.
16. M. Reed, P. Syverson, and D. Goldschlag, “Anonymous Connections and Onion Routing,” IEEE Journal on Selected Areas in Communication Special Issue on Copyright and Privacy Protection, 1998.
17. M. Reiter and A. Rubin, “Crowds: Anonymity for Web Transactions” DIMACS Technical Report 97-15, Apr 1997.
18. P. Syverson, S. Stubblebine, and D. Goldschlag. “Unlinkable Serial Transactions,” Financial Cryptography ’97, Feb 1997.
19. The Wall Street Journal Online, http://www.wsj.com.