The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs
暂无分享,去创建一个
[1] Victor Shoup,et al. A Proposal for an ISO Standard for Public Key Encryption , 2001, IACR Cryptol. ePrint Arch..
[2] Hugo Krawczyk,et al. A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract) , 1998, STOC '98.
[3] Léo Ducas,et al. Efficient Identity-Based Encryption over NTRU Lattices , 2014, ASIACRYPT.
[4] Chris Peikert,et al. A Toolkit for Ring-LWE Cryptography , 2013, IACR Cryptol. ePrint Arch..
[5] Ron Steinfeld,et al. Making NTRU as Secure as Worst-Case Problems over Ideal Lattices , 2011, EUROCRYPT.
[6] Léo Ducas,et al. A Hybrid Gaussian Sampler for Lattices over Rings , 2015, IACR Cryptol. ePrint Arch..
[7] David Pointcheval,et al. The Impact of Decryption Failures on the Security of NTRU Encryption , 2003, CRYPTO.
[8] Mihir Bellare,et al. Entity Authentication and Key Distribution , 1993, CRYPTO.
[9] Léo Ducas,et al. Lattice Signatures and Bimodal Gaussians , 2013, IACR Cryptol. ePrint Arch..
[10] Oded Regev,et al. Lattice-Based Cryptography , 2006, CRYPTO.
[11] Alfred Menezes,et al. An Efficient Protocol for Authenticated Key Agreement , 2003, Des. Codes Cryptogr..
[12] Ashley Montanaro,et al. Quantum walk speedup of backtracking algorithms , 2015, Theory Comput..
[13] Jintai Ding,et al. Authenticated Key Exchange from Ideal Lattices , 2015, EUROCRYPT.
[14] Tal Rabin,et al. On the Security of Joint Signature and Encryption , 2002, EUROCRYPT.
[15] Joseph H. Silverman,et al. NTRU: A Ring-Based Public Key Cryptosystem , 1998, ANTS.
[16] William Whyte,et al. Choosing Parameters for NTRUEncrypt , 2017, CT-RSA.
[17] Anja Becker,et al. New directions in nearest neighbor searching with applications to lattice sieving , 2016, IACR Cryptol. ePrint Arch..
[18] Chris Peikert,et al. Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller , 2012, IACR Cryptol. ePrint Arch..
[19] Hugo Krawczyk,et al. Security Analysis of IKE's Signature-Based Key-Exchange Protocol , 2002, CRYPTO.
[20] Chris Peikert,et al. An Efficient and Parallel Gaussian Sampler for Lattices , 2010, CRYPTO.
[21] Jacques Stern,et al. Flaws in Applying Proof Methodologies to Signature Schemes , 2002, CRYPTO.
[22] Mihir Bellare,et al. A concrete security treatment of symmetric encryption , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[23] Thijs Laarhoven,et al. Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing , 2015, CRYPTO.
[24] Jung Hee Cheon,et al. An Algorithm for NTRU Problems and Cryptanalysis of the GGH Multilinear Map without an encoding of zero , 2016, IACR Cryptol. ePrint Arch..
[25] Nick Howgrave-Graham,et al. A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU , 2007, CRYPTO.
[26] Jintai Ding,et al. A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem , 2012, IACR Cryptol. ePrint Arch..
[27] William Whyte,et al. Transcript Secure Signatures Based on Modular Lattices , 2014, PQCrypto.
[28] Michele Mosca,et al. Finding shortest lattice vectors faster using quantum search , 2015, Designs, Codes and Cryptography.
[29] Craig Costello,et al. Post-Quantum Key Exchange for the TLS Protocol from the Ring Learning with Errors Problem , 2015, 2015 IEEE Symposium on Security and Privacy.
[30] Craig Gentry,et al. Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..
[31] Hugo Krawczyk,et al. HMQV: A High-Performance Secure Diffie-Hellman Protocol , 2005, CRYPTO.
[32] Daniel Wichs,et al. Simple Lattice Trapdoor Sampling from a Broad Class of Distributions , 2015, Public Key Cryptography.
[33] Hugo Krawczyk,et al. SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE-Protocols , 2003, CRYPTO.
[34] Martin R. Albrecht,et al. A Subfield Lattice Attack on Overstretched NTRU Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes , 2016, CRYPTO.
[35] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[36] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[37] Erdem Alkim,et al. Post-quantum Key Exchange - A New Hope , 2016, USENIX Security Symposium.
[38] Vadim Lyubashevsky,et al. Lattice Signatures Without Trapdoors , 2012, IACR Cryptol. ePrint Arch..
[39] Chris Peikert,et al. On Ideal Lattices and Learning with Errors over Rings , 2010, JACM.
[40] Vadim Lyubashevsky,et al. Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices , 2015, EUROCRYPT.
[41] Patrick Longa,et al. Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography , 2016, CANS.
[42] Chris Peikert,et al. Lattice Cryptography for the Internet , 2014, PQCrypto.
[43] William Whyte,et al. NTRUSIGN: Digital Signatures Using the NTRU Lattice , 2003, CT-RSA.
[44] J. Cheon,et al. An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero , 2016, LMS J. Comput. Math..
[45] Tim Güneysu,et al. Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems , 2012, CHES.