Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A sieve algorithm for the shortest lattice vector problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Complexity of Lattice Problems
Complexity of Lattice Problems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Hierarchical ID-Based Cryptography
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Trapdoors for hard lattices and new cryptographic constructions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Security Proofs for Identity-Based Identification and Signature Schemes
Journal of Cryptology
Towards practical lattice-based cryptography
Towards practical lattice-based cryptography
Efficient Public Key Encryption Based on Ideal Lattices
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Signature Schemes with Bounded Leakage Resilience
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Lattice-based identification schemes secure under active attacks
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Proceedings of the forty-second ACM symposium on Theory of computing
An efficient and parallel Gaussian sampler for lattices
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Generalized compact knapsacks are collision resistant
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Identity-based identification without random oracles
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Bonsai trees, or how to delegate a lattice basis
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
The geometry of lattice cryptography
Foundations of security analysis and design VI
A variant of schnorr identity-based identification scheme with tight reduction
FGIT'11 Proceedings of the Third international conference on Future Generation Information Technology
Security enhancements by OR-proof in identity-based identification
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Security enhancement of identity-based identification with reversibility
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
| Hi-index | 0.00 |
We propose a concurrently secure, identity-based identification scheme from lattices. It offers adaptive-identity security in the standard model, quasi optimal online performance, optimal leakage resilience, and its security is based on mild worst-case assumptions in ideal lattices. Our scheme uses an ideal-lattice interpretation of the Bonsai tree concept in lattices (EUROCRYPT 2010), which we call convoluted Bonsai trees. It allows us to build an identity-based identification scheme in a new "static identity" model that is weaker than the standard "adaptive identity" model. We show that both models are equivalent under the existence of Chameleon hash functions.