[1] |
CHARLES R , DANIEL R . Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack[A]. Cryptology -Crypto’91[C]. California USA, 1991.433-444.
|
[2] |
ODED R . On lattice, learning with errors, random linear codes, and cryptography[A]. Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing ACM[C]. New York, USA, 2005.84-93.
|
[3] |
CRAIG G , CHRIS P , VINOD V . Trapdoors for hard lattices and new cryptographic constructions[A]. STOC 2008[C]. Victoria, British Columbia, Canada, 2008.197-206.
|
[4] |
SHWETA A , DAN B , XAVIER B . Efficient lattice (H) IBE in the standard model[A]. Cryptology-EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications f Cryptographic Techniques[C]. French Riviera, 2010.553-572.
|
[5] |
VADIM L , CHRIS P , ODED R . On ideal Lattices and learning with errors over rings[A]. Cryptology-EUROCRYPT 2010:29th Annual International Conference on the Theory and Applications f Cryptographic Techniques[C]. French Riviera, 2010.1-23.
|
[6] |
CHRIS P , BRENT W . Lossy trapdoor functions and their application[A]. STOC 2008[C]. Victoria, British Columbia, Canada, 2008.187-196.
|
[7] |
CHRIS P . Public-key cryptosystems from the worst-case shortest vector problem[A]. STOC 2009[C]. Bethesda, Maryland, 2009.333-342.
|
[8] |
XAVIER B , MEI Q X , BRENT W . Dircet chosen ciphertext security from identity-based techniques[A]. Proceedings of the ACM CCS[C]. Alexandria, VAUSA, 2005.320-329.
|
[9] |
DAMIEN S , STEINFELD R . Making NTRU as secure as worst-case problems over ideal lattices[A]. Cryptology-EUROCRYPT 2011: 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques[C]. French Riviera, 2011.24-47.
|
[10] |
DAMIEN S , STEINFELD R , TANAKA K . Effcient public key encryption based on ideal lattices[A]. ASIACRYPT 2009[C]. Springer, 2009.617-635.
|
[11] |
VADIM L , MICCIANCIO D . Generalized compact knapsacks are collision resistant[A]. ICALP 2006:33rd International Colloquium on Automata, Languages and Programming[C]. Italy, 2006.144-155.
|
[12] |
VADIM L , MICCIANCIO D . Asymptotically efficient lattice-based digital signatures[A]. Proceedings of TCC 2008[C]. Springer, 2008.37-54.
|
[13] |
MICCIANCIO D . Generalized compact knapsacks, cyclic lattices, and efficient one way functions [J]. Computational Complexity, Springer, 2007,16(4): 365-411.
|
[14] |
VADIM L , MICCIANCIO D , CHRIS P . A modest proposal for FFT hashing[A]. Fast Software Encryption, 15th International Workshop, FSE 2008[C]. Lausanne, Switzerland, 2008.54-72.
|
[15] |
DENT A W . A note on game-hopping proofs[EB/OL]. .
|