연구동향 분석
박사

Efficient Instantiation of LWE-based Public-Key Encryption and Commitment Schemes

김진수 2018년

논문상세정보
인용/피인용
' Efficient Instantiation of LWE-based Public-Key Encryption and Commitment Schemes' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • 수학
  • commitment
  • lattice
  • learning with errors
  • lwe
  • public-key encryption
  • sparse
  • threshold cryptosystems
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
3,143 0

0.0%

' Efficient Instantiation of LWE-based Public-Key Encryption and Commitment Schemes' 의 참고문헌

  • [ZB12] Vinod Vaikuntanathan Zvika Brakerski, Craig Gentry. Fully homomorphic encryption without bootstrapping. In Innovations in Theoretical Computer Science(ITCS'12), 2012.
  • [Xag10] D Keita Xagawa. Cryptography with lattices. 2010.
  • [XXZ11] Xiang Xie, Rui Xue, and Rui Zhang. Efficient threshold encryption from lossy trapdoor functions. In PQCrypto, pages 163-178. Springer, 2011.
  • [XXW13] Xiang Xie, Rui Xue, and Minqian Wang. Zero knowledge proofs from ring-lwe. In International Conference on Cryptology and Network Security, pages 57-73. Springer, 2013.
  • [TU15] Ehsan Ebrahimi Targhi and Dominique Unruh. Quantum security of the fujisaki-okamoto transform. Technical report, 2015.
  • [Sin15] Vikram Singh. A practical key exchange for the internet using lattice cryptography. IACR Cryptology ePrint Archive, 2015:138, 2015.
  • [Sch03] Claus Peter Schnorr. Lattice reduction by random sampling and birthday methods. In Annual Symposium on Theoretical Aspects of Computer Science, pages 145-156. Springer, 2003.
  • [Reg09] Oded Regev. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM (JACM), 56(6):34, 2009.
  • [Reg05] Oded Regev. On lattices, learning with errors, random linear codes, and cryptography. In STOC, LNCS, pages 84-93, 2005.
  • [RVM+14] Sujoy Sinha Roy, Frederik Vercauteren, Nele Mentens, Donald Donglong Chen, and Ingrid Verbauwhede. Compact ring-lwe cryptoprocessor. In International Workshop on Cryptographic Hardware and Embedded Systems, pages 371-391. Springer, 2014.
  • [Pei16] Chris Peikert. Decade of Lattice Cryptography. World Scientific, 2016.
  • [Pei14] Chris Peikert. Lattice cryptography for the internet. In Inter- national Workshop on Post-Quantum Cryptography, pages 197- 219. Springer, 2014.
  • [NSA15] NSA. Cryptography today. Technical report, https://www.nsa.gov/ ia/programs/suiteb cryptography/, Also at: https://www.iad.gov/iad/programs/iad-initiatives/cnsasuite.cfm, 2015.
  • [NIS15] NIST. Technical report, http://www.nist.gov/itl/csd/ct/postquantum-crypto-workshop-2015.cfm, 2015.
  • [MW16] Pratyay Mukherjee and Daniel Wichs. Two round multiparty computation via multi-key fhe. In Annual International Con- ference on the Theory and Applications of Cryptographic Tech- niques, pages 735-763. Springer, 2016.
  • [MSS11] Steven Myers, Mona Sergi, and Abhi Shelat. Threshold fully homomorphic encryption and secure computation. IACR Cryp- tology ePrint Archive, 2011:454, 2011.
  • [Lyu12] Vadim Lyubashevsky. Lattice signatures without trapdoors. In Annual International Conference on the Theory and Appli- cations of Cryptographic Techniques, pages 738-755. Springer, 2012.
  • [Laa16] Thijs Laarhoven. Sieving for closest lattice vectors (with preprocessing). arXiv preprint arXiv:1607.04789, 2016.
  • [Laa15] Thijs Laarhoven. Search problems in cryptography. PhD thesis, PhD thesis, Eindhoven University of Technology, 2015. http://www.thijs.com/docs/phd-final.pdf. 8, 2015.
  • [LSR+15] Zhe Liu, Hwajeong Seo, Sujoy Sinha Roy, Johann Groschadl, Howon Kim, and Ingrid Verbauwhede. Efficient ring-lwe encryption on 8-bit avr processors. In International Workshop on Cryptographic Hardware and Embedded Systems, pages 663-682. Springer, 2015.
  • [LPR13] Vadim Lyubashevsky, Chris Peikert, and Oded Regev. A toolkit for ring-lwe cryptography. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 35-54. Springer, 2013.
  • [LPR10] Vadim Lyubashevsky, Chris Peikert, and Oded Regev. On ideal lattices and learning with errors over rings. In Annual Inter- national Conference on the Theory and Applications of Crypto- graphic Techniques, pages 1-23. Springer, 2010.
  • [LP11] Richard Lindner and Chris Peikert. Better key sizes (and attacks) for lwe-based encryption. In Aggelos Kiayias, editor, CT- RSA, volume 6558 of LNCS, pages 319-339. Springer, 2011.
  • [Koh16] Lisa Kohl. New tools for multi-party computation. IACR Cryp- tology ePrint Archive, 2016:417, 2016.
  • [KTX08] Akinori Kawachi, Keisuke Tanaka, and Keita Xagawa. Concurrently secure identification schemes based on the worst-case hardness of lattice problems. In ASIACRYPT, volume 5350, pages 372-389. Springer, 2008.
  • [KF15] Paul Kirchner and Pierre-Alain Fouque. An improved bkw algorithm for lwe with applications to cryptography and lattices. In Annual Cryptology Conference, pages 43-62. Springer, 2015.
  • [Joe98] Buhler Joe, editor. Algorithmic Number Theory, Third Inter- national Symposium, ANTS-III, Portland, Oregon, USA, June 21-25, 1998, Proceedings, volume 1423 of Lecture Notes in Com- puter Science. Springer, 1998.
  • [JKPT12] Abhishek Jain, Stephan Krenn, Krzysztof Pietrzak, and Aris Tentes. Commitments and efficient zero-knowledge proofs from learning parity with noise. In ASIACRYPT, volume 7658, pages 663-680. Springer, 2012.
  • [HPS11] Guillaume Hanrot, Xavier Pujol, and Damien Stehl . Analyzing blockwise lattice algorithms using dynamical systems. In Annual Cryptology Conference, pages 447-464. Springer, 2011.
  • [HKK16] Chen Hao, Lauter Kristin, and E. Stange Katherine. Vulnerable galois rlwe families and improved attacks. Cryptology ePrint Archive, Report 2016/193, 2016. http://eprint.iacr.org/2016/193.
  • [HKK15] Chen Hao, Lauter Kristin, and E. Stange Katherine. Attacks on search rlwe. Cryptology ePrint Archive, Report 2015/971, 2015. http://eprint.iacr.org/2015/971.
  • [GSW13] Craig Gentry, Amit Sahai, and Brent Waters. Homomorphic encryption from learning with errors: Conceptuallysimpler, asymptotically-faster, attribute-based. In Advances in Cryptology{CRYPTO 2013, pages 75{92. Springer, 2013.
  • [GPV08] Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In Proceedings of the fortieth annual ACM symposium on Theory of computing, pages 197-206. ACM, 2008.
  • [GLP12] Tim G neysu, Vadim Lyubashevsky, and Thomas Poppelmann. Practical lattice-based cryptography: A signature scheme for embedded systems. In International Workshop on Cryp- tographic Hardware and Embedded Systems, pages 530-547. Springer, 2012.
  • [GKPV10] Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, and Vinod Vaikuntanathan. Robustness of the learning with errors assumption. 2010.
  • [GJS15] Qian Guo, Thomas Johansson, and Paul Stankovski. Codedbkw: solving lwe using lattice codes. In Annual Cryptology Con- ference, pages 23-42. Springer, 2015.
  • [GFS+12] Norman Gottert, Thomas Feller, Michael Schneider, Johannes Buchmann, and Sorin Huss. On the design of hardware building blocks for modern lattice-based encryption schemes. In Inter- national Workshop on Cryptographic Hardware and Embedded Systems, pages 512-529. Springer, 2012.
  • [FS86] Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Con- ference on the Theory and Application of Cryptographic Tech- niques, pages 186-194. Springer, 1986.
  • [EBB13] Rachid El Bansarkhani and Johannes Buchmann. Improvement and efficient implementation of a lattice-based signature scheme. In International Conference on Selected Areas in Cryptography, pages 48-67. Springer, 2013.
  • [Dam10] Ivan Damgard. On -protocols. 2010. http://www.cs.au.dk/~ivan/Sigma.pdf.
  • [DTV15] Alexandre Duc, Florian Tramer, and Serge Vaudenay. Better algorithms for lwe and lwr. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 173-202. Springer, 2015.
  • [DM15] Lauren De Meyer. Security of LWE-based cryptosystems. PhD thesis, 2015. https://www.esat.kuleuven.be/cosic/publications/thesis-267.pdf.
  • [DL+15] Augot Daniel, Batina Lejla, et al. Initial recommendations of long-term secure post-quantum systems. Technical report, 2015. http://pqcrypto.eu.org/docs/initial-recommendations.pdf.
  • [DEBG+14] zg r Dagdelen, Rachid El Bansarkhani, Florian Gopfert, Tim G neysu, Tobias Oder, Thomas Poppelmann, Ana Helena S anchez, and Peter Schwabe. High-speed signatures from standard lattices. In International Conference on Cryptology and Information Security in Latin America, pages 84-103. Springer, 2014.
  • [DDLL13] L o Ducas, Alain Durmus, Tancrede Lepoint, and Vadim Lyubashevsky. Lattice signatures and bimodal gaussians. In Advances in Cryptology-CRYPTO 2013, pages 40-56. Springer, 2013.
  • [DCRVV15] Ruan De Clercq, Sujoy Sinha Roy, Frederik Vercauteren, and Ingrid Verbauwhede. Efficient software implementation of ringlwe encryption. In Proceedings of the 2015 Design, Automation & Test in Europe Conference & Exhibition, pages 339-344. EDA Consortium, 2015.
  • [Cra96] Ronald Cramer. Modular design of secure yet practical cryptographic protocol. PhD thesis, University of Amsterdam, 1996.
  • [Che13] Yuanmi Chen. R duction de r seau et s curit concrete du chiffrement completement homomorphe. PhD thesis, ENS-Lyon, France, 2013.
  • [CJL16] JungHee Cheon, Jinhyuck Jeong, and Changmin Lee. An algorithm for ntru problems and cryptanalysis of the ggh multilinear map without a low level encoding of zero. Cryptology ePrint Archive, Report 2016/139, 2016. http://eprint.iacr.org/2016/139.
  • [CHK+16] Jung Hee Cheon, Kyoo Hyung Han, Jinsu Kim, Changmin Lee, and Yongha Son. A practical post-quantum public-key cryptosystem based on splwe. In Information Security and Cryptology-ICISC 2016: 19th International Conference, Seoul, South Korea, November 30-December 2, 2016, Revised Selected Papers, volume 10157, page 51. Springer, 2016.
  • [Blu82] Manuel Blum. Coin flipping by telephone: A protocol for solving impossible problems. Advances in Cryptology-A Report on CRYPTO'81, 1982.
  • [Ban95] Wojciech Banaszczyk. Inequalities for convex bodies and polar reciprocal lattices inr n. Discrete & Computational Geometry, 13(2):217-231, 1995.
  • [BV14] Zvika Brakerski and Vinod Vaikuntanathan. Efficient fully homomorphic encryption from (standard) lwe. SIAM Journal on Computing, 43(2):831-871, 2014.
  • [BLP+13] Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, and Damien Stehl . Classical hardness of learning with er- rors. In Proceedings of the forty-fifth annual ACM symposium on Theory of computing, pages 575-584. ACM, 2013.
  • [BKLP15] Fabrice Benhamouda, Stephan Krenn, Vadim Lyubashevsky, and Krzysztof Pietrzak. Efficient zero-knowledge proofs for commitments from learning with errors over rings. In European Symposium on Research in Computer Security, pages 305-325. Springer, 2015.
  • [BGPW16] Johannes Buchmann, Florian Gopfert, Rachel Player, and Thomas Wunderer. On the hardness of lwe with binary error: revisiting the hybrid lattice-reduction and meet-in-the-middle attack. In International Conference on Cryptology in Africa, pages 24-43. Springer, 2016.
  • [BGGK17] Dan Boneh, Rosario Gennaro, Steven Goldfeder, and Sam Kim. A lattice-based universal thresholdizer for cryptographic systems. IACR Cryptology ePrint Archive, 2017:251, 2017.
  • [BG92] Mihir Bellare and Oded Goldreich. On defining proofs of knowledge. In Annual International Cryptology Conference, pages 390-420. Springer, 1992.
  • [BG14] Shi Bai and Steven D Galbraith. Lattice decoding attacks on binary lwe. In Australasian Conference on Information Security and Privacy, pages 322-337. Springer, 2014.
  • [BDOP16] Carsten Baum, Ivan Damgard, Sabine Oechsner, and Chris Peikert. Efficient commitments and zero-knowledge protocols from ring-sis with applications to lattice-based threshold cryptosystems. IACR Cryptology ePrint Archive, 2016:997, 2016.
  • [BDGL16] Anja Becker, L o Ducas, Nicolas Gama, and Thijs Laarhoven. New directions in nearest neighbor searching with applications to lattice sieving. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 10-24. SIAM, 2016.
  • [BD10] Rikke Bendlin and Ivan Damgard. Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems. In TCC, volume 5978, pages 201-218. Springer, 2010.
  • [BCNS15] Joppe W Bos, Craig Costello, Michael Naehrig, and Douglas Stebila. Post-quantum key exchange for the tls protocol from the ring learning with errors problem. In 2015 IEEE Symposium on Security and Privacy, pages 553-570. IEEE, 2015.
  • [BCK+14] Fabrice Benhamouda, Jan Camenisch, Stephan Krenn, Vadim Lyubashevsky, and Gregory Neven. Better zero-knowledge proofs for lattice encryption and their application to group signatures. In International Conference on the Theory and Appli- cation of Cryptology and Information Security, pages 551-572. Springer, 2014.
  • [BCD+16] Joppe Bos, Craig Costello, L o Ducas, Ilya Mironov, Michael Naehrig, Valeria Nikolaenko, Ananth Raghunathan, and Douglas Stebila. Frodo: Take off the ring! practical, quantum-secure key exchange from lwe. 2016.
  • [Ajt96] Mikl os Ajtai. Generating hard instances of lattice problems. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 99-108. ACM, 1996.
  • [APS15] Martin R Albrecht, Rachel Player, and Sam Scott. On the concrete hardness of learning with errors. Journal of Mathematical Cryptology, 9(3):169-203, 2015.
  • [AJLA+12] Gilad Asharov, Abhishek Jain, Adriana L opez-Alt, Eran Tromer, Vinod Vaikuntanathan, and Daniel Wichs. Multiparty computation with low communication, computation and interaction via threshold fhe. Advances in Cryptology-EUROCRYPT 2012, pages 483-501, 2012.
  • [AG11] Sanjeev Arora and Rong Ge. New algorithms for learning in presence of errors. In International Colloquium on Automata, Languages, and Programming, pages 403-415. Springer, 2011.
  • [AFG13] Martin R Albrecht, Robert Fitzpatrick, and Florian Gopfert. On the efficacy of solving lwe by reduction to unique-svp. In International Conference on Information Security and Cryptol- ogy, pages 293-310. Springer, 2013.
  • [ACF+14] Martin Albrecht, Carlos Cid, Jean-Charles Faugere, Robert Fitzpatrick, and Ludovic Perret. Algebraic algorithms for lwe problems. 2014.
  • [ABD16] Martin Albrecht, Shi Bai, and L o Ducas. A subfield lattice attack on overstretched ntru assumptions: Cryptanalysis of some fhe and graded encoding schemes. Cryptology ePrint Archive, Report 2016/127, 2016. http://eprint.iacr.org/2016/127.