A Group Signature Scheme from Lattice Assumptions
- 1 January 2010
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- Vol. 2011, 395-412
- https://doi.org/10.1007/978-3-642-17373-8_23
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Full-Domain Subgroup Hiding and Constant-Size Group SignaturesPublished by Springer Science and Business Media LLC ,2007
- Compact Group Signatures Without Random OraclesLecture Notes in Computer Science, 2006
- Efficient Blind Signatures Without Random OraclesLecture Notes in Computer Science, 2005
- Foundations of Group Signatures: The Case of Dynamic GroupsLecture Notes in Computer Science, 2005
- Short Group SignaturesLecture Notes in Computer Science, 2004
- Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General AssumptionsLecture Notes in Computer Science, 2003
- Quasi-Efficient Revocation of Group SignaturesLecture Notes in Computer Science, 2003
- A Practical and Provably Secure Coalition-Resistant Group Signature SchemeLecture Notes in Computer Science, 2000
- Generating Hard Instances of the Short Basis ProblemLecture Notes in Computer Science, 1999
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993