User menu

Accès à distance ? S'identifier sur le proxy UCLouvain

Block-wise P-signatures and Non-Interactive Anonymous Credentials with Efficient Attributes

Primary tabs

Izabachène, Malika [Université de Versailles St Quentin (France)] Libert, Benoît [UCL] Vergnaud, Damien [Ecole Normale Supérieure (France)]
Document type Communication à un colloque (Conference Paper) – Présentation orale avec comité de sélection
Access type Accès restreint
Publication date 2011
Language Anglais
Conference "13th IMA Conference on Cryptography and Coding (IMACC 2011)", Oxford (UK) (du 12/12/2011 au 15/12/2011)
Peer reviewed yes
Host document Liqun Chen ; "13th IMA International Conference on Cryptography and Coding (IMACC 2011)"- 431-450 (ISBN : 978-3-642-25515-1)
Collection Lecture Notes in Computer Science - 7089
Publisher Springer (Germany)
Publication status Publié
Affiliations UCL - FSA/ELEC - Département d'électricité
Université de Versailles St Quentin (France) - Département d'Informatique
Ecole Normale Supérieure (France) - Laboratoire d'Informatique
Links
  1. Abe Masayuki, Fuchsbauer Georg, Groth Jens, Haralambiev Kristiyan, Ohkubo Miyako, Structure-Preserving Signatures and Commitments to Group Elements, Advances in Cryptology – CRYPTO 2010 (2010) ISBN:9783642146220 p.209-236, 10.1007/978-3-642-14623-7_12
  2. Akagi Norio, Manabe Yoshifumi, Okamoto Tatsuaki, An Efficient Anonymous Credential System, Financial Cryptography and Data Security ISBN:9783540852292 p.272-286, 10.1007/978-3-540-85230-8_25
  3. Belenkiy Mira, Camenisch Jan, Chase Melissa, Kohlweiss Markulf, Lysyanskaya Anna, Shacham Hovav, Randomizable Proofs and Delegatable Anonymous Credentials, Advances in Cryptology - CRYPTO 2009 (2009) ISBN:9783642033551 p.108-125, 10.1007/978-3-642-03356-8_7
  4. Belenkiy Mira, Chase Melissa, Kohlweiss Markulf, Lysyanskaya Anna, P-signatures and Noninteractive Anonymous Credentials, Theory of Cryptography ISBN:9783540785231 p.356-374, 10.1007/978-3-540-78524-8_20
  5. Belenkiy Mira, Chase Melissa, Kohlweiss Markulf, Lysyanskaya Anna, Compact E-Cash and Simulatable VRFs Revisited, Pairing-Based Cryptography – Pairing 2009 (2009) ISBN:9783642032974 p.114-131, 10.1007/978-3-642-03298-1_9
  6. Bellare Mihir, Rogaway Phillip, Random oracles are practical : a paradigm for designing efficient protocols, 10.1145/168588.168596
  7. Blazy Olivier, Fuchsbauer Georg, Izabachène Malika, Jambert Amandine, Sibert Hervé, Vergnaud Damien, Batch Groth–Sahai, Applied Cryptography and Network Security (2010) ISBN:9783642137075 p.218-235, 10.1007/978-3-642-13708-2_14
  8. Boneh Dan, Boyen Xavier, Short Signatures Without Random Oracles, Advances in Cryptology - EUROCRYPT 2004 (2004) ISBN:9783540219354 p.56-73, 10.1007/978-3-540-24676-3_4
  9. Boneh Dan, Boyen Xavier, Shacham Hovav, Short Group Signatures, Advances in Cryptology – CRYPTO 2004 (2004) ISBN:9783540226680 p.41-55, 10.1007/978-3-540-28628-8_3
  10. Boneh Dan, Gentry Craig, Waters Brent, Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys, Advances in Cryptology – CRYPTO 2005 (2005) ISBN:9783540281146 p.258-275, 10.1007/11535218_16
  11. Boyen Xavier, Waters Brent, Full-Domain Subgroup Hiding and Constant-Size Group Signatures, Public Key Cryptography – PKC 2007 ISBN:9783540716761 p.1-15, 10.1007/978-3-540-71677-8_1
  12. Camenisch Jan, Chaabouni Rafik, shelat abhi, Efficient Protocols for Set Membership and Range Proofs, Advances in Cryptology - ASIACRYPT 2008 (2008) ISBN:9783540892540 p.234-252, 10.1007/978-3-540-89255-7_15
  13. Camenisch Jan, Chandran Nishanth, Shoup Victor, A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks, Advances in Cryptology - EUROCRYPT 2009 (2009) ISBN:9783642010002 p.351-368, 10.1007/978-3-642-01001-9_20
  14. Camenisch, J., Groß, T.: Efficient Attributes for Anonymous Credentials. In: ACM-CCS 2008, pp. 345–356. ACM Press (2008), http://eprint.iacr.org/2010/496
  15. Camenisch Jan, Hohenberger Susan, Lysyanskaya Anna, Compact E-Cash, Lecture Notes in Computer Science (2005) ISBN:9783540259107 p.302-321, 10.1007/11426639_18
  16. Camenisch Jan, Kohlweiss Markulf, Soriente Claudio, An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials, Public Key Cryptography – PKC 2009 (2009) ISBN:9783642004674 p.481-500, 10.1007/978-3-642-00468-1_27
  17. Camenisch Jan, Lysyanskaya Anna, An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation, Lecture Notes in Computer Science (2001) ISBN:9783540420705 p.93-118, 10.1007/3-540-44987-6_7
  18. Camenisch Jan, Lysyanskaya Anna, A Signature Scheme with Efficient Protocols, Security in Communication Networks (2003) ISBN:9783540004202 p.268-289, 10.1007/3-540-36413-7_20
  19. Camenisch Jan, Lysyanskaya Anna, Signature Schemes and Anonymous Credentials from Bilinear Maps, Advances in Cryptology – CRYPTO 2004 (2004) ISBN:9783540226680 p.56-72, 10.1007/978-3-540-28628-8_4
  20. Chaum David, Security without identification: transaction systems to make big brother obsolete, 10.1145/4372.4373
  21. Cathalo Julien, Libert Benoît, Yung Moti, Group Encryption: Non-interactive Realization in the Standard Model, Advances in Cryptology – ASIACRYPT 2009 (2009) ISBN:9783642103650 p.179-196, 10.1007/978-3-642-10366-7_11
  22. Cheung David W., Mamoulis Nikos, Wong W. K., Yiu S. M., Zhang Ye, Anonymous Fuzzy Identity-Based Encryption for Similarity Search, Algorithms and Computation (2010) ISBN:9783642175169 p.61-72, 10.1007/978-3-642-17517-6_8
  23. Fiat Amos, Shamir Adi, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Advances in Cryptology — CRYPTO’ 86 ISBN:9783540180470 p.186-194, 10.1007/3-540-47721-7_12
  24. Fuchsbauer, G.: Automorphic Signatures in Bilinear Groups and an Application to Round-Optimal Blind Signatures. Cryptology ePrint Archive: Report 2009/320 (2009)
  25. Fuchsbauer Georg, Commuting Signatures and Verifiable Encryption, Advances in Cryptology – EUROCRYPT 2011 (2011) ISBN:9783642204647 p.224-245, 10.1007/978-3-642-20465-4_14
  26. Fujisaki Eiichiro, Okamoto Tatsuaki, Statistical zero knowledge protocols to prove modular polynomial relations, Advances in Cryptology — CRYPTO '97 (1997) ISBN:9783540633846 p.16-30, 10.1007/bfb0052225
  27. Goldwasser Shafi, Micali Silvio, Rivest Ronald L., A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, 10.1137/0217017
  28. Goldwasser, S., Tauman-Kalai, Y.: On the (In)security of the Fiat-Shamir Paradigm. In: FOCS 2003, pp. 102–115 (2003)
  29. Groth Jens, Sahai Amit, Efficient Non-interactive Proof Systems for Bilinear Groups, Advances in Cryptology – EUROCRYPT 2008 ISBN:9783540789666 p.415-432, 10.1007/978-3-540-78967-3_24
  30. Jakobsson Markus, Sako Kazue, Impagliazzo Russell, Designated Verifier Proofs and Their Applications, Advances in Cryptology — EUROCRYPT ’96 (1996) ISBN:9783540611868 p.143-154, 10.1007/3-540-68339-9_13
  31. Katz Jonathan, Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications, Lecture Notes in Computer Science (2003) ISBN:9783540140399 p.211-228, 10.1007/3-540-39200-9_13
  32. Kunz-Jacques Sébastien, Pointcheval David, About the Security of MTI/C0 and MQV, Lecture Notes in Computer Science (2006) ISBN:9783540380801 p.156-172, 10.1007/11832072_11
  33. Katz Jonathan, Sahai Amit, Waters Brent, Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products, Advances in Cryptology – EUROCRYPT 2008 ISBN:9783540789666 p.146-162, 10.1007/978-3-540-78967-3_9
  34. Libert Benoît, Yung Moti, Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs, Theory of Cryptography (2010) ISBN:9783642117985 p.499-517, 10.1007/978-3-642-11799-2_30
  35. Maji Hemanta K., Prabhakaran Manoj, Rosulek Mike, Attribute-Based Signatures, Topics in Cryptology – CT-RSA 2011 (2011) ISBN:9783642190735 p.376-392, 10.1007/978-3-642-19074-2_24
  36. Pedersen Torben Pryds, Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, Advances in Cryptology — CRYPTO ’91 ISBN:9783540551881 p.129-140, 10.1007/3-540-46766-1_9
  37. Shoup Victor, Lower Bounds for Discrete Logarithms and Related Problems, Advances in Cryptology — EUROCRYPT ’97 (1997) ISBN:9783540629757 p.256-266, 10.1007/3-540-69053-0_18
  38. Rial Alfredo, Kohlweiss Markulf, Preneel Bart, Universally Composable Adaptive Priced Oblivious Transfer, Pairing-Based Cryptography – Pairing 2009 (2009) ISBN:9783642032974 p.231-247, 10.1007/978-3-642-03298-1_15
  39. Shahandashti Siamak F., Safavi-Naini Reihaneh, Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems, Progress in Cryptology – AFRICACRYPT 2009 (2009) ISBN:9783642023835 p.198-216, 10.1007/978-3-642-02384-2_13
  40. Schwartz J. T., Fast Probabilistic Algorithms for Verification of Polynomial Identities, 10.1145/322217.322225
Bibliographic reference Izabachène, Malika ; Libert, Benoît ; Vergnaud, Damien. Block-wise P-signatures and Non-Interactive Anonymous Credentials with Efficient Attributes.13th IMA Conference on Cryptography and Coding (IMACC 2011) (Oxford (UK), du 12/12/2011 au 15/12/2011). In: Liqun Chen, 13th IMA International Conference on Cryptography and Coding (IMACC 2011), Springer : Germany2011, p.431-450
Permanent URL http://hdl.handle.net/2078.1/91901