Algebraic MACs and keyed-verification anonymous credentials

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2014, Pages 1205-1216

  Chase, Melissa ^a   Meiklejohn, Sarah ^b   Zaverucha, Gregory M ^a  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

ANONYMOUS CREDENTIAL; CREDENTIAL SYSTEMS; DECISIONAL DIFFIE HELLMAN; EFFICIENT PROTOCOLS; GROUP MODELING; MESSAGE AUTHENTICATION CODES; PUBLIC-KEY SIGNATURES; UNLINKABILITY;

NETWORK SECURITY;

EID: 84910625963     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2660267.2660328     Document Type: Conference Paper

References (33)

1. M. Au, W. Susilo, and Y. Mu. Constant-size dynamic k-TAA. Proceedings of SCN 2006, LNCS 4116 (2006), 111-125.
2. M. Chase, S. Meiklejohn, and G. Zaverucha. Full version of this paper. IACR Cryptology ePrint Archive, Report 2013/516.
3. F. Baldimtsi and A. Lysyanskaya. Anonymous Credentials Light. Proceedings of ACM CCS 2013, ACM Press, (2013). To appear.
4. M. Belenkiy, J. Camenisch, M. Chase, M. Kohlweiss, A. Lysyanskaya and H. Shacham. Randomizable proofs and delegatable anonymous credentials. Proceedings of CRYPTO 2009, LNCS 5677, (2009), 108-125.
5. M. Bellare and O. Goldreich. On Defining Proofs of Knowledge. Proceedings of CRYPTO 1992, LNCS 740 (1993), 390-420
6. P. Bichsel, J. Camenisch, T. Groß, and V. Shoup. Anonymous Credentials on a Standard Java Card. Proceedings ACM CCS 2009, ACM Press, (2009) 600-610.
7. D. Boneh. The Decision Diffie-Hellman Problem. Proceedings of ANTS-III, LNCS 1423 (1998), 48-63.
8. S. Brands. Rethinking Public Key Infrastructures and Digital Certificates. The MIT Press, August 2000.
9. J. Camenisch and A. Lysyanskaya. An Efficient System for Non-Transferable Anonymous Credentials with Optional Anonymity Revocation. Proceedings of EUROCRYPT 2001, LNCS 2045 (2001), 93-118.
10. J. Camenisch and A. Lysyanskaya. A Signature Scheme with Efficient Protocols. Proceedings of SCN 2003, LNCS 2576 (2003), 268-289.
11. J. Camenisch and A. Lysyanskaya. Signature Schemes and Anonymous Credentials from Bilinear Maps. Proceedings of CRYPTO 2004, LNCS 3152 (2004), 56-72.
12. J. Camenisch and M. Stadler. Proof Systems for General Statements About Discrete Logarithms. Technical Report TR 260 (1997), Institute for Theoretical Computer Science, ETH Zurich.
13. D. Cash, E. Kiltz, and V. Shoup. The Twin Diffie-Hellman Problem and Applications Proceedings of Eurocrypt 2008, LNCS 4965 (2008), 127-145.
14. D. Chaum. Security without Identification: Transaction Systems to Make Big Brother Obsolete. Communications of the ACM 28(10) (1985), 1030-1044.
15. J. Chen, H. Lim, S. Ling, H. Wang, and H. Wee. Shorter IBE and Signatures via Asymmetric Pairings. Proceedings of Pairing 2012, LNCS 7708,(2012), 122-140.
16. R. Cramer, R. Gennaro, and B. Schoenmakers. A Secure and Optimally Efficient Multi-Authority Election Scheme. Proceedings of EUROCRYPT'97, LNCS 1233, (1997), 103-118.
17. I. Damgárd. Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. Proceedings of EUROCRYPT 2000, LNCS 1807 (2000), 418-430.
18. Y. Dodis, E. Kiltz, K. Pietrzak, D. Wichs. Message Authentication, Revisited. Proceedings of EUROCRYPT'12, LNCS 7237 (2012), 355-374.
19. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. Proceedings of CRYPTO 1986, LNCS 263 (1987), 186-âA Ş194.
20. M. Fischlin. Communication-Efficient Non-Interactive Proofs of Knowledge with Online Extractors. Proceedings of CRYPTO 2005, LNCS 3621 (2005), 152-168.
21. M. Gerbush, A. Lewko, A. O'Neill, and B. Waters Dual Form Signatures: An Approach for Proving Security from Static Assumptions. Proceedings of ASIACRYPT 2012, LNCS 7658 (2012), 25-42.
22. O. Goldreich. The Foundations of Cryptography - Volume 2 Basic Applications. Cambridge University Press, New York, 2004.
23. IBM. Specification of the Identity Mixer Cryptographic Library (Revised version 2.3.0). IBM Research Report RZ 3730, April 2010.
24. M. Jakobsson, K.Sako, and R. Impagliazzo. Designated Verifier Proofs and Their Applications. Proceedings of EUROCRYPT 1996, LNCS 1070 (1996) 143-154.
25. NIST. FIPS 186-3: Digital Signature Standard (DSS), Federal Information Processing Standards Publication (2009).
26. C. Paquin and G. Zaverucha. U-Prove Cryptographic Specification V1.1 (Revision 2). April 2013. Available online: www.microsoft.com/uprove.
27. C. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology 4 (1991), 161-174.
28. C. Schnorr. Security of Blind Discrete Log Signatures Against Interactive Attacks. ICICS 2001, LNCS 2229 (2001), 1-12.
29. V. Shoup. Lower Bounds for Discrete Logarithms and Related Problems. Proceedings of EUROCRYPT'97, LNCS 1233 (1997), 256-266.
30. Y. Tsiounis and M. Yung On the security of ElGamal based encryption. Proceedings of PKC 1998, LNCS 1431 (1998), 117-134.
31. N. Smart. The Exact Security of ECIES in the Generic Group Model. Proceedings of Cryptography and Coding, IMA Int. Conf., LNCS 2260 (2001), 73-84.
32. R. Steinfeld, J. Pieprzyk and H. Wang. How to strengthen any weakly unforgeable signature into a strongly unforgeable signature. Proceedings of CT-RSA 2007, LNCS 4377 (2007), 357-371.
33. B. Waters. Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions. Proceedings of CRYPTO 2009, LNCS 5677 (2009), 619-636.