Group to group commitments do not shrink

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

Volumn 7237 LNCS, Issue , 2012, Pages 301-317

  Abe, Masayuki ^a   Haralambiev, Kristiyan ^b   Ohkubo, Miyako ^c  

^a NTT CORPORATION   (Japan)

^b NEW YORK UNIVERSITY   (United States)

^c NATIONAL INSTITUTE OF INFORMATION AND COMMUNICATIONS TECHNOLOGY   (Japan)

Author keywords

Homomorphic Trapdoor Commitments; Structure Preserving Commitments

Indexed keywords

COMMITMENT SCHEME; LOWER BOUNDS; OPTIMAL CONSTRUCTION; STRUCTURE-PRESERVING; TRAPDOOR COMMITMENTS; ZERO-KNOWLEDGE PROOFS OF KNOWLEDGE;

ARTIFICIAL INTELLIGENCE;

CRYPTOGRAPHY;

EID: 84859952528     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29011-4_19     Document Type: Conference Paper

References (23)

1. Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., Ohkubo, M.: Structure-Preserving Signatures and Commitments to Group Elements. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 209-236. Springer, Heidelberg (2010)
2. Abe, M., Groth, J., Haralambiev, K., Ohkubo, M.: Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 649-666. Springer, Heidelberg (2011)
3. Abe, M., Haralambiev, K., Ohkubo, M.: Signing on group elements for modular protocol designs. IACR ePrint Archive, Report 2010/133 (2010)
4. Barreto, P.S.L.M., Naehrig, M.: Pairing-Friendly Elliptic Curves of Prime Order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319-331. Springer, Heidelberg (2006)
5. Bellare, M., Palacio, A.: The knowledge-of-exponent assumptions and 3-round zeroknowledge protocols. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 273-289. Springer, Heidelberg (2004)
6. Boneh, D., Boyen, X., Shacham, H.: Short Group Signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41-55. Springer, Heidelberg (2004)
7. Boneh, D., Venkatesan, R.: Breaking RSA May Not Be Equivalent to Factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 59-71. Springer, Heidelberg (1998)
8. Camenisch, J., Haralambiev, K., Kohlweiss, M., Lapon, J., Naessens, V.: Structure Preserving CCA Secure Encryption and Applications. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 89-106. Springer, Heidelberg (2011)
9. Cathalo, J., Libert, B., Yung, M.: Group Encryption: Non-interactive Realization in the Standard Model. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 179-196. Springer, Heidelberg (2009)
10. Chase, M., Kohlweiss, M.: A domain transformation for structure-preserving signatures on group elements. IACR ePrint Archive, Report 2011/342 (2011)
11. Coron, J.-S.: Optimal Security Proofs for PSS and Other Signature Schemes. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 272-287. Springer, Heidelberg (2002)
12. Damgsard, I.: Towards Practical Public Key Systems Secure against Chosen Ciphertext Attacks. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 445-456. Springer, Heidelberg (1992)
13. Dodis, Y., Haralambiev, K., Ĺopez-Alt, A., Wichs, D.: Efficient Public-Key Cryptography in the Presence of Key Leakage. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 613-631. Springer, Heidelberg (2010)
14. Galbraith, S., Paterson, K., Smart, N.: Pairings for cryptographers. IACR ePrint archive, Report 2006/165 (2006)
15. Galbraith, S.D., Rotger, V.: Easy decision-Diffie-Hellman groups. LMS Journal of Computation and Mathematics 7 (2004)
16. Groth, J.: Homomorphic trapdoor commitments to group elements. IACR ePrint Archive, Report 2009/007 (January 2009)
17. Groth, J.: Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 431-448. Springer, Heidelberg (2011)
18. Groth, J., Sahai, A.: Efficient Non-interactive Proof Systems for Bilinear Groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415-432. Springer, Heidelberg (2008); Full version available: IACR ePrint Archive 2007/155
19. Hada, S., Tanaka, T.: On the Existence of 3-Round Zero-Knowledge Protocols. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 354-369. Springer, Heidelberg (1998); Full version available from IACR e-print archive 1999/009
20. Krawczyk, H., Rabin, T.: Chameleon hashing and signatures. IACR ePrint archive, Report 1998/010 (1998)
21. Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM 27(4) (1980)
22. Scott, M.: Authenticated id-based key exchange and remote log-in with simple token and pin number. IACR ePrint Archive, Report 2002/164 (2002)
23. Verheul, E.R.: Evidence that xtr is more secure than supersingular elliptic curve cryptosystems. J. Cryptology 17(4), 277-296 (2004)