Practical Group Signatures without Random Oracles, 2005. ,
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme, Lect. Notes Comput. Sci, vol.1880, pp.255-270, 2000. ,
DOI : 10.1007/3-540-44598-6_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.7942
Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions, Advances in Cryptology -Eurocrypt 2003, pp.614-629, 2003. ,
DOI : 10.1007/3-540-39200-9_38
Random oracles are practical, Proceedings of the 1st ACM conference on Computer and communications security , CCS '93, pp.62-73, 1993. ,
DOI : 10.1145/168588.168596
Foundations of Group Signatures: The Case of Dynamic Groups, Lect. Notes Comput. Sci, vol.3376, pp.136-153, 2005. ,
DOI : 10.1007/978-3-540-30574-3_11
Short Signatures Without Random Oracles, Cachin and Camenisch [12], pp.56-73 ,
DOI : 10.1007/978-3-540-24676-3_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5374
Identity-Based Encryption from the Weil Pairing, SIAM Journal on Computing, vol.32, issue.3, pp.586-615, 2003. ,
DOI : 10.1137/S0097539701398521
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.3708
Group signatures with verifier-local revocation, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, pp.168-177, 2004. ,
DOI : 10.1145/1030083.1030106
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.8033
Compact Group Signatures Without Random Oracles, Full-Domain Subgroup Hiding and Constant-Size Group Signatures., 10th International Workshop on Practice and Theory in Public Key Cryptography, pp.427-444, 2006. ,
DOI : 10.1007/11761679_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.1318
The random oracle methodology, revisited, Journal of the ACM, vol.51, issue.4, pp.557-594, 2004. ,
DOI : 10.1145/1008731.1008734
URL : http://arxiv.org/abs/cs/0010019
An Efficient Protocol for Anonymously Providing Assurance of the Container of the Private Key., Submission to the Trusted Computing Group, 2003. ,
Group Signatures, Advances in Cryptology -Eurocrypt'91, pp.257-265, 1991. ,
DOI : 10.1007/3-540-46416-6_22
Short Traceable Signatures Based on Bilinear Pairings, Yoshiura et al. [37], pp.88-103 ,
DOI : 10.1007/11908739_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.8521
Dynamic Fully Anonymous Short Group Signatures, Lect. Notes Comput. Sci, vol.4341, pp.193-210, 2006. ,
DOI : 10.1007/11958239_13
How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Lect. Notes Comput. Sci, vol.263, pp.186-194, 1987. ,
DOI : 10.1007/3-540-47721-7_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.8796
Advances in Cryptology -Crypto, 24th Annual International Cryptology Conference, 2004. ,
An Efficient Group Signature Scheme from Bilinear Maps, ACISP Lect. Notes Comput. Sci, vol.3574, pp.455-467, 2005. ,
DOI : 10.1007/11506157_38
On the (In)security of the Fiat-Shamir paradigm, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp.102-113, 2003. ,
DOI : 10.1109/SFCS.2003.1238185
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures, Fully Anonymous Group Signatures Without Random Oracles., Advances in Cryptology -Asiacrypt, pp.444-459, 2006. ,
DOI : 10.1007/11935230_29
Efficient Non-interactive Proof Systems for Bilinear Groups, Lect. Notes Comput. Sci, vol.4965, pp.415-432, 2008. ,
DOI : 10.1007/978-3-540-78967-3_24
Programmable Hash Functions and Their Applications, Lect. Notes Comput. Sci, vol.5157, pp.21-38, 2008. ,
DOI : 10.1007/978-3-540-85174-5_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.7292
Group Signatures: Provable Security, Efficient Constructions and Anonymity from Trapdoor-Holders., Tech, Report, vol.076, 2003. ,
Append-Only Signatures, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005 (L. Caires and L. Monteiro, pp.434-445, 2005. ,
DOI : 10.1007/11523468_36
Efficient Traceable Signatures in the Standard Model., Pairing-Based Cryptography -Pairing, Third International Conference, pp.187-205, 2008. ,
Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps, Lect. Notes Comput. Sci, vol.3788, pp.533-548, 2005. ,
DOI : 10.1007/11593447_29
On Cryptographic Assumptions and Challenges, On Cryptographic Assumptions and Challenges. Lect. Notes Comput. Sci, vol.2729, pp.96-109, 2003. ,
DOI : 10.1007/978-3-540-45146-4_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.9911
Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings, Lect. Notes Comput. Sci, vol.3329, pp.372-386, 2004. ,
DOI : 10.1007/978-3-540-30539-2_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.352
Practical forward secure group signature schemes, Proceedings of the 8th ACM conference on Computer and Communications Security , CCS '01, pp.225-234, 2001. ,
DOI : 10.1145/501983.502015
Efficient Identity-Based Encryption Without Random Oracles, Lect. Notes Comput. Sci, vol.3494, pp.114-127, 2005. ,
DOI : 10.1007/11426639_7
Advances in Information and Computer Security, First International Workshop on Security, Proceedings, Lect. Notes Comput. Sci, vol.4266, 2006. ,
Group Signature with Verifier-Location Revocation and Backward Unlinkability 39. , Shorter Verifier-Local Revocation Group Signatures from Bilinear Maps, Cryptology and Network Security, 5th International Conference, pp.2006-126, 2006. ,