Structure-Preserving Signatures and Commitments to Group Elements, Crypto'10, vol.6223, pp.209-236, 2010. ,
An Efficient Anonymous Credential System, Financial Cryptography (FC'08), vol.5143, pp.272-286, 2008. ,
Randomizable Proofs and Delegatable Anonymous Credentials, Crypto'09, vol.5677, pp.108-125, 2009. ,
P-signatures and noninteractive anonymous credentials, TCC'08, vol.4948, pp.356-374, 2008. ,
, Pairing'09, vol.5671, pp.114-131, 2009.
Random oracles are practical: A paradigm for designing efficient protocols, ACM CCS'93, pp.62-73, 1993. ,
Batch Groth-Sahai, Applied Cryptography and Network Security (ACNS'10), vol.6123, pp.218-235, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00577167
Short signatures without random oracles, Eurocrypt'04, vol.3027, pp.56-73, 2004. ,
Short Group Signatures, Crypto'04, vol.3152, pp.41-55, 2004. ,
Collusion-Resistant Broadcast Encryption with Short Ciphertexts and Private Keys, Crypto'05, vol.3621, pp.258-275, 2005. ,
Full-domain subgroup hiding and constant-size group signatures, PKC'07, vol.4450, pp.1-15, 2007. ,
Efficient Protocols for Set Membership and Range Proofs, Asiacrypt'08, vol.5330, pp.234-252, 2008. ,
A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks, Eurocrypt'09, vol.5479, pp.351-368, 2009. ,
Efficient Attributes for Anonymous Credentials, ACM-CCS'08, pp.345-356, 2008. ,
Compact E-Cash, Eurocrypt'05, vol.3494, pp.302-321, 2005. ,
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials, PKC'09, vol.5443, pp.481-500, 2009. ,
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation, Eurocrypt'01, vol.2045, pp.93-118, 2001. ,
, A Signature Scheme with Efficient Protocols, SCN'02, vol.2576, pp.268-289, 2001.
, Signature Schemes and Anonymous Credentials from Bilinear Maps, Crypto'04, vol.3152, pp.56-72, 2004.
Security without identification: Transaction systems to make big brother obsolete, Communications of the ACM, vol.28, issue.10, pp.1030-1044, 1985. ,
Group Encryption: Non-Interactive Realization in the Standard Model, Asiacrypt'09, vol.5912, pp.179-196, 2009. ,
Anonymous Fuzzy Identity-based Encryption for Similarity Search, ISAAC 2010, vol.6506, pp.61-72, 2010. ,
How to prove yourself: Practical solutions to identification and signature problems, Crypto'86, vol.263, pp.186-194, 1986. ,
Automorphic Signatures in Bilinear Groups and an Application to Round-Optimal Blind Signatures. Cryptology ePrint Archive, 2009. ,
Commuting Signatures and Verifiable Encryption and an Application to Non-Interactively Delegatable Credentials, Eurocrypt'11, vol.6632, pp.224-245, 2011. ,
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations, Crypto'97, vol.1294, pp.16-30, 1997. ,
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, SIAM J. Comput, vol.17, issue.2, pp.281-308, 1988. ,
, On the (In)security of the Fiat-Shamir Paradigm In FOCS'03, pp.102-115, 2003.
Efficient non-interactive proof systems for bilinear groups, Eurocrypt'08, vol.4965, pp.415-432, 2008. ,
Designated Verifier Proofs and Their Applications, Eurocrypt'96, vol.1070, pp.143-154, 1996. ,
Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications, Eurocrypt'03, vol.2656, pp.211-228, 2003. ,
About the security of MTI/C0 and MQV, SCN'06, vol.4116, pp.156-172, 2006. ,
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products, Eurocrypt'08, vol.4965, pp.146-162, 2008. ,
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs, TCC'10, vol.5978, pp.499-517, 2010. ,
Attribute-based signatures, CT-RSA'11, vol.6558, pp.376-392, 2011. ,
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, Crypto'91, vol.576, pp.129-140, 1991. ,
Lower bounds for discrete logarithms and related problems, Eurocrypt'97, vol.1233, pp.256-66, 1997. ,
Universally Composable Adaptive Priced Oblivious Transfer, Pairing'09, vol.5671, pp.231-247, 2009. ,
Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems, Africacrypt'09, vol.5580, pp.198-216, 2009. ,
Fast probabilistic algorithms for verification of polynomial identities, Journal of the ACM, vol.27, p.701717, 1980. ,