Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes: (Extended abstract)

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

Volumn 1976, Issue , 2000, Pages 331-345

  Camenisch, Jan ^a   Damgård, Ivan ^b  

^a IBM RESEARCH ZURICH   (Switzerland)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK SECURITY;

BASIC PROTOCOLS; ENCRYPTION SCHEMES; EXTENDED ABSTRACTS; GROUP SIGNATURES; RANDOM ORACLE; SHARING SCHEMES; VERIFIABLE ENCRYPTIONS;

CRYPTOGRAPHY;

EID: 84937441148     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44448-3_25     Document Type: Conference Paper

References (34)

1. G. Ateniese Efficient Verifiable Encryption (and Fair Exchange) ofD igital Signatures, In 6th ACM CCS, pp. 138–146, 1999.
2. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. In EUROCRYPT’98, vol. 1403 of LNCS, pp. 591–606, 1998.
3. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications, 18(4):591–610, Apr. 2000.
4. F. Bao. An Efficient Verifiable Encryption Scheme for the Encryption of Discrete Logarithms, In CARDIS’98 vol. 1820 of LNCS, 2000.
5. J. Camenisch and I. Damgård. Verifiable encryption and applications to group signatures and signature sharing. Technical Report RS-98-32, BRICS, Department of Computer Science, University ofA arhus, Dec. 1998.
6. J. Camenisch. Efficient and generalized group signatures. In EUROCRYPT’97, vol. 1233 of LNCS, pp. 465–479, 1997.
7. J. Camenisch, U. Maurer, and M. Stadler. Digital payment systems with passive anonymity-revoking trustees. In Computer Security — ESORICS 96, vol. 1146 of LNCS, pp. 33–43. Springer Verlag, 1996.
8. J. Camenisch and M. Michels. Separability and Efficiency for Generic Group Signature Schemes In M. Wiener, CRYPTO’99, vol. 1666 of LNCS, 1998.
9. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In CRYPTO’97, vol. 1296 of LNCS, pp. 410–424, 1997.
10. D. Catalano and R. Gennaro. New efficient and secure protocols for verifiable signature sharing and other applications. In CRYPTO’98, vol. 1642 of LNCS, pp. 105–120, Berlin, 1998. Springer Verlag.
11. D. Chaum and E. van Heyst. Group signatures. In EUROCRYPT’91, vol. 547 of LNCS, pp. 257–265. Springer-Verlag, 1991.
12. L. Chen and T. P. Pedersen. New group signature schemes. In EUROCRYPT’94, vol. 950 of LNCS, pp. 171–181, 1995.
13. R. Cramer. Modular Design of Secure yet Practical Cryptographic Protocol. PhD thesis, University ofA msterdam, 1997.
14. R. Cramer and I. Damgård. Zero-knowledge prooff or finite field arithmetic, or: Can zero-knowledge be for free? In CRYPTO’98, vol. 1642 of LNCS, 1998.
15. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design ofwit ness hiding protocols. In CRYPTO’94, vol. 839 of LNCS, pp. 174–187. Springer Verlag, 1994.
16. I. B. Damgård. On the existence ofb it commitment schemes and zero-knowledge proofs. In CRYPTO’89, vol. 435 of LNCS, pp. 17–27, 1990.
17. Y. Desmedt and Y. Frankel. Threshold cryptography. In CRYPTO’89, vol. 435 of LNCS, pp. 307–315. Springer-Verlag, 1990.
18. C. Dwork, M. Naor, and A. Sahai. Concurrent zero knowledge. In Proc. 30th Annual ACM Symposium on Theory of Computing (STOC), 1998.
19. U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proofs of identity. Journal of Cryptology, 1:77–94, 1988.
20. A. Fiat and A. Shamir. How to prove yourself: Practical solution to identification and signature problems. In CRYPTO’86, vol. 263 of LNCS, pp. 186–194, 1987.
21. Y. Frankel, Y. Tsiounis, and M. Yung. “Indirect discourse proofs:” Achieving efficient fair off-line e-cash. In ASIACRYPT’96, vol. 1163 of LNCS, 1996.
22. M. Franklin and M. Reiter. Verifiable signature sharing. In EUROCRYPT’95, vol. 921 of LNCS, pp. 50–63. Springer Verlag, 1995.
23. O. Goldreich and A. Kahan. How to construct constant-round zero-knowledge proofsy stems for NP. Journal of Cryptology, 9(3):167–190, 1996.
24. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270–299, Apr. 1984.
25. L. C. Guillou and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In EUROCRYPT’88, vol. 330 of LNCS, pp. 123–128, 1988.
26. J. Kilian and E. Petrank. Identity escrow. In CRYPTO’98, vol. 1642 of LNCS, pp. 169–185, Berlin, 1998. Springer Verlag.
27. S. Micali. Efficient certificate revocation and certified e-mail with transparent post offices. Presentation at the 1997 RSA Security Conference.
28. S. Micali, C. Rackoff, and B. Sloan. The notion ofsecu rity for probabilistic cryptosystems. SIAM Journal on Computing, 17(2):412–426, April 1988.
29. H. Petersen. How to convert any digital signature scheme into a group signature scheme. In Security Protocols Workshop, Paris, 1997.
30. G. Poupard and J. Stern, Fair Encryption ofR SA Keys. In EUROCRYPT 2000, LNCS, pp. 173–190. Springer Verlag, 2000.
31. C. P. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239–252, 1991.
32. M. Stadler. Publicly verifiable secret sharing. In EUROCRYPT’96, vol. 1070 of LNCS, pp. 191–199. Springer Verlag, 1996.
33. M. Stadler, J.-M. Piveteau, and J. Camenisch. Fair blind signatures. In EUROCRYPT’95, vol. 921 of LNCS, pp. 209–219, 1995.
34. A. Young and M. Yung. Auto-Recoverable Auto-Certifiable Cryptosystems. In EUROCRYPT’98, vol. 1403 of LNCS, pp. 17–31, 1998.