Get shorty via group signatures without encryption

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

Volumn 6280 LNCS, Issue , 2010, Pages 381-398

  Bichsel, Patrik ^a   Camenisch, Jan ^a   Neven, Gregory ^a   Smart, Nigel P ^b   Warinschi, Bogdan ^b  

^a IBM RESEARCH ZURICH   (Switzerland)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

group signature security definition; Group signatures; pairings

Indexed keywords

COMPUTATION TIME; DIGITAL SIGNATURE SCHEMES; DYNAMIC GROUPS; GROUP MEMBERS; GROUP SIGNATURE SCHEME; GROUP SIGNATURES; PAIRINGS; RANDOM ORACLE MODEL; SCARCE RESOURCES; SECURITY DEFINITIONS; SECURITY LEVEL; SIGN MESSAGES; SIGNATURE SCHEME; TARGET APPLICATION; VEHICULAR COMMUNICATIONS;

AUTHENTICATION; CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; TELECOMMUNICATION SYSTEMS;

NETWORK SECURITY;

EID: 77958065231     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15317-4_24     Document Type: Conference Paper

References (33)

1. Abdalla, M., Warinschi, B.: On the minimal assumptions of group signature schemes. In: López, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol. 3269, pp. 1-13. Springer, Heidelberg (2004)
2. Ateniese, G., Camenisch, J., Joye, M., Tsudik, G.: A practical and provably secure coalition-resistant group signature scheme. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 255-270. Springer, Heidelberg (2000)
3. Ateniese, G., Song, D.X., Tsudik, G.: Quasi-efficient revocation in group signatures. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 183-197. Springer, Heidelberg (2003)
4. Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: Formal defini-tions, simplified requirements, and a construction based on general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 614-629. Springer, Heidelberg (2003)
5. Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: ACM CCS 2006, pp. 390-399 (October/November 2006)
6. Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM CCS 1993, pp. 62-73 (November 1993)
7. Bellare, M., Shi, H., Zhang, C.: Foundations of group signatures: The case of dynamic groups. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 136-153. Springer, Hei-delberg (2005)
8. Bleichenbacher, D.: Chosen ciphertext attacks against protocols based on the RSA encryp-tion standard PKCS #1. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 1-12. Springer, Heidelberg (1998)
9. Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41-55. Springer, Heidelberg (2004)
10. Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: ACM CCS 2004, pp. 168-177 (October 2004)
11. Boyen, X., Waters, B.: Compact group signatures without random oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 427-444. Springer, Heidelberg (2006)
12. Boyen, X., Waters, B.: Full-domain subgroup hiding and constant-size group signatures. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 1-15. Springer, Heidelberg (2007)
13. Brickell, E., Chen, L., Li, J.: A new direct anonymous attestation scheme from bilinear maps. In: Lipp, P., Sadeghi, A.-R., Koch, K.-M. (eds.) Trust 2008. LNCS, vol. 4968, pp. 1-20. Springer, Heidelberg (2008)
14. Camenisch, J., Kiayias, A., Yung, M.: On the portability of generalized schnorr proofs. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 425-442. Springer, Heidelberg (2010)
15. Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revo-cation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 61-76. Springer, Heidelberg (2002)
16. Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bi-linear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56-72. Springer, Heidelberg (2004)
17. Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups (extended abstract). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410-424. Springer, Heidelberg (1997)
18. Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257-265. Springer, Heidelberg (1991)
19. Chen, L., Cheng, M., Smart, N.P: Identity-based key agreement protocols from pairings. International Journal of Information Security 6, 213-241 (2007)
20. Chen, L., Morrissey, P., Smart, N.P: Pairings in trusted computing (invited talk). In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 1-17. Springer, Heidelberg (2008)
21. Chen, L., Morrissey, P., Smart, N.P: DAA: Fixing the pairing based protocols. Cryptology ePrintArchive, Report 2009/198 (2009)
22. Cramer, R., Damga°rd, I., MacKenzie, P.D.: Efficient zero-knowledge proofs of knowl-edge without intractability assumptions. In: Imai, H., Zheng, Y (eds.) PKC 2000. LNCS, vol. 1751, pp. 354-372. Springer, Heidelberg (2000)
23. Cramer, R., Shoup, V.: Design and analysis ofpractical public-key encryption schemes se-cure against adaptive chosen ciphertext attack. SIAM Journal on Computing 33(1), 167-226 (2003)
24. Damga°rd, I.: Efficient concurrent zero-knowledge in the auxiliary string model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 418-430. Springer, Heidelberg (2000)
25. Delerablée, C., Pointcheval, D.: Dynamic fully anonymous short group signatures. In: Nguyên, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol. 4341, pp. 193-210. Springer, Heidel-berg (2006)
26. Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186-194. Springer, Heidelberg (1987)
27. Galbraith, S.D., Paterson, K.G., Smart, N.P: Pairings for cryptographers. Discrete Applied Mathematics 156, 3113-3121 (2008)
28. Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing 17(2), 281-308 (1988)
29. Lysyanskaya, A., Rivest, R.L., Sahai, A., Wolf, S.: Pseudonym systems. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol. 1758, pp. 184-199. Springer, Heidelberg (2000)
30. Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal ofCryptology 13(3), 361-396 (2000)
31. Shacham, H.: New Paradigms in Signature Schemes. PhD thesis, Stanford University (2005)
32. Shacham, H.: A Cramer-Shoup encryption scheme from the linear assumption and from progressively weaker linear variants. Cryptology ePrint Archive, Report 2007/074 (2007)
33. Tsudik, G., Xu, S.: Accumulating composites and improved group signing. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 269-286. Springer, Heidelberg (2003)