Gaussian Sampling in Lattice-Based Cryptography
暂无分享,去创建一个
[1] Joseph H. Silverman,et al. NTRU: A Ring-Based Public Key Cryptosystem , 1998, ANTS.
[2] Nico Döttling,et al. Lossy Codes and a New Variant of the Learning-With-Errors Problem , 2013, EUROCRYPT.
[3] T. A. Bray,et al. A Convenient Method for Generating Normal Variables , 1964 .
[4] Phillip A. Porras,et al. A Multi-perspective Analysis of the Storm ( Peacomm ) Worm , 2007 .
[5] Eike Kiltz,et al. Identity-Based Signatures , 2009, Identity-Based Cryptography.
[6] Ron Steinfeld,et al. Hardness of k-LWE and Applications in Traitor Tracing , 2016, Algorithmica.
[7] Chunming Rong,et al. Identity-based key agreement and encryption for wireless sensor networks , 2006 .
[8] Philip N. Klein,et al. Finding the closest lattice vector when it's unusually close , 2000, SODA '00.
[9] G. W. Stewart,et al. Matrix Algorithms: Volume 1, Basic Decompositions , 1998 .
[10] Carsten Willems,et al. Automated Identification of Cryptographic Primitives in Binary Programs , 2011, RAID.
[11] Hideki Imai,et al. Applying Fujisaki-Okamoto to Identity-Based Encryption , 2006, AAECC.
[12] Chris Peikert,et al. Generating Shorter Bases for Hard Random Lattices , 2009, Theory of Computing Systems.
[13] Adi Shamir,et al. Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.
[14] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[15] Charles F. F. Karney. Sampling Exactly from the Normal Distribution , 2013, ACM Trans. Math. Softw..
[16] Vinod Vaikuntanathan,et al. Attribute-based encryption for circuits , 2013, STOC '13.
[17] Joseph H. Silverman,et al. NTRU in Constrained Devices , 2001, CHES.
[18] James Durbin,et al. The fitting of time series models , 1960 .
[19] Gene H. Golub,et al. Matrix computations (3rd ed.) , 1996 .
[20] Léo Ducas,et al. Efficient Identity-Based Encryption over NTRU Lattices , 2014, ASIACRYPT.
[21] Thijs Laarhoven,et al. Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems , 2012, IACR Cryptol. ePrint Arch..
[22] Don Davis,et al. Defective Sign & Encrypt in S/MIME, PKCS#7, MOSS, PEM, PGP, and XML , 2001, USENIX Annual Technical Conference, General Track.
[23] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[24] Léo Ducas,et al. Lattice Signatures and Bimodal Gaussians , 2013, IACR Cryptol. ePrint Arch..
[25] N. Wiener. The Wiener RMS (Root Mean Square) Error Criterion in Filter Design and Prediction , 1949 .
[26] Christian Rossow,et al. ProVeX: Detecting Botnets with Encrypted Command and Control Channels , 2013, DIMVA.
[27] D. Sweet. Fast Toeplitz orthogonalization , 1984 .
[28] Ron Steinfeld,et al. GGHLite: More Efficient Multilinear Maps from Ideal Lattices , 2014, IACR Cryptol. ePrint Arch..
[29] Robert H. Halstead,et al. Matrix Computations , 2011, Encyclopedia of Parallel Computing.
[30] Ricardo Dahab,et al. Identity-Based Encryption for Sensor Networks , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).
[31] Neal Koblitz,et al. Hyperelliptic cryptosystems , 1989, Journal of Cryptology.
[32] Vadim Lyubashevsky,et al. Towards practical lattice-based cryptography , 2008 .
[33] Ron Steinfeld,et al. Efficient Public Key Encryption Based on Ideal Lattices , 2009, ASIACRYPT.
[34] William Whyte,et al. On estimating the lattice security of NTRU , 2005, IACR Cryptol. ePrint Arch..
[35] Jung Hee Cheon,et al. Cryptanalysis of the Multilinear Map over the Integers , 2014, EUROCRYPT.
[36] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[37] Frederik Vercauteren,et al. High Precision Discrete Gaussian Sampling on FPGAs , 2013, Selected Areas in Cryptography.
[38] Joan Calvet,et al. Malware authors don't learn, and that's good! , 2009, 2009 4th International Conference on Malicious and Unwanted Software (MALWARE).
[39] 尚弘 島影. National Institute of Standards and Technologyにおける超伝導研究及び生活 , 2001 .
[40] Chris Peikert,et al. A Toolkit for Ring-LWE Cryptography , 2013, IACR Cryptol. ePrint Arch..
[41] W. M. Gentleman,et al. Fast Fourier Transforms: for fun and profit , 1966, AFIPS '66 (Fall).
[42] Daniel Dadush,et al. Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again! , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[43] Ron Steinfeld,et al. Making NTRU as Secure as Worst-Case Problems over Ideal Lattices , 2011, EUROCRYPT.
[44] Oded Goldreich,et al. Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme , 1986, CRYPTO.
[45] Jan Camenisch,et al. Efficient Group Signature Schemes for Large Groups (Extended Abstract) , 1997, CRYPTO.
[46] Tim Güneysu,et al. Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware , 2013, Selected Areas in Cryptography.
[47] Vadim Lyubashevsky,et al. Lattice Signatures Without Trapdoors , 2012, IACR Cryptol. ePrint Arch..
[48] Claus-Peter Schnorr,et al. Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.
[49] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[50] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.
[51] Chris Peikert,et al. On Ideal Lattices and Learning with Errors over Rings , 2010, JACM.
[52] Miklós Ajtai,et al. Generating hard instances of lattice problems (extended abstract) , 1996, STOC '96.
[53] Clifford C. Cocks. An Identity Based Encryption Scheme Based on Quadratic Residues , 2001, IMACC.
[54] Peter Martini,et al. Finding and extracting crypto routines from malware , 2009, 2009 IEEE 28th International Performance Computing and Communications Conference.
[55] Xiaotie Deng,et al. TinyPairing: A Fast and Lightweight Pairing-Based Cryptographic Library for Wireless Sensor Networks , 2010, 2010 IEEE Wireless Communication and Networking Conference.
[56] Vadim Lyubashevsky,et al. Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices , 2015, EUROCRYPT.
[57] Chris Peikert,et al. Lattice Cryptography for the Internet , 2014, PQCrypto.
[58] Nicolas Gama,et al. Symplectic Lattice Reduction and NTRU , 2006, EUROCRYPT.
[59] 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.
[60] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[61] Alexandre B. Tsybakov,et al. Introduction to Nonparametric Estimation , 2008, Springer series in statistics.
[62] Moti Yung,et al. Cryptovirology: extortion-based security threats and countermeasures , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.
[63] Xavier Boyen,et al. Lattice Mixing and Vanishing Trapdoors A Framework for Fully Secure Short Signatures and more , 2010 .
[64] Chris Peikert,et al. Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller , 2012, IACR Cryptol. ePrint Arch..
[65] Craig Gentry,et al. Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001 , 2001, ASIACRYPT.
[66] Mehdi Tibouchi,et al. Cryptanalysis of the Co-ACD Assumption , 2015, CRYPTO.
[67] Roman Vershynin,et al. Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.
[68] Chris Peikert,et al. An Efficient and Parallel Gaussian Sampler for Lattices , 2010, CRYPTO.
[69] Frederik Vercauteren,et al. High-Speed Polynomial Multiplication Architecture for Ring-LWE and SHE Cryptosystems , 2015, IEEE Transactions on Circuits and Systems I: Regular Papers.
[70] Tim Güneysu,et al. High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers , 2015, LATINCRYPT.
[71] John Malone-Lee,et al. Identity-Based Signcryption , 2002, IACR Cryptol. ePrint Arch..
[72] Jean-Yves Marion,et al. Aligot: cryptographic function identification in obfuscated binary programs , 2012, CCS.
[73] Sanjeev Arora,et al. New Algorithms for Learning in Presence of Errors , 2011, ICALP.
[74] Vincent Rijmen,et al. The Design of Rijndael , 2002, Information Security and Cryptography.
[75] Adeline Langlois,et al. Lattice-Based Cryptography: Security Foundations and Constructions , 2014 .
[76] Dawn Xiaodong Song,et al. Dispatcher: enabling active botnet infiltration using automatic protocol reverse-engineering , 2009, CCS.
[77] Rodrigo Roman,et al. A Killer Application for Pairings: Authenticated Key Establishment in Underwater Wireless Sensor Networks , 2008, CANS.
[78] Craig Gentry,et al. Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..
[79] Chris Peikert,et al. Hardness of SIS and LWE with Small Parameters , 2013, CRYPTO.
[80] A. A. Kamal,et al. An FPGA implementation of the NTRUEncrypt cryptosystem , 2009, 2009 International Conference on Microelectronics - ICM.
[81] W. Gragg. Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle , 1993 .
[82] Léo Ducas,et al. Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic , 2012, ASIACRYPT.
[83] Johannes A. Buchmann,et al. Discrete Ziggurat: A Time-Memory Trade-off for Sampling from a Gaussian Distribution over the Integers , 2013, IACR Cryptol. ePrint Arch..
[84] Damien Stehlé,et al. Short Bases of Lattices over Number Fields , 2010, ANTS.
[85] Nick Howgrave-Graham,et al. A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU , 2007, CRYPTO.
[86] Hideki Imai,et al. Generic Transforms to Acquire CCA-Security for Identity Based Encryption: The Cases of FOpkc and REACT , 2006, ACISP.
[87] Herbert Bos,et al. Highly resilient peer-to-peer botnets are here: An analysis of Gameover Zeus , 2013, 2013 8th International Conference on Malicious and Unwanted Software: "The Americas" (MALWARE).
[88] Jintai Ding,et al. A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem , 2012, IACR Cryptol. ePrint Arch..
[89] Daniele Micciancio,et al. Worst-case to average-case reductions based on Gaussian measures , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[90] Tim Güneysu,et al. Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems , 2012, CHES.
[91] Stephen A. Szygenda,et al. Security for Wireless Sensor Networks using Identity-Based Cryptography , 2012 .
[92] Peter Schwabe,et al. High-Speed Signatures from Standard Lattices , 2014, LATINCRYPT.
[93] Daniel Dadush,et al. Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract , 2014, STOC.
[94] Noah Stephens-Davidowitz,et al. Discrete Gaussian Sampling Reduces to CVP and SVP , 2015, SODA.
[95] Steven D. Galbraith,et al. Mathematics of Public Key Cryptography , 2012 .
[96] Damien Stehlé,et al. Classical hardness of learning with errors , 2013, STOC '13.
[97] Chris Peikert,et al. Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices , 2006, TCC.
[98] Zhe Liu,et al. Efficient Ring-LWE Encryption on 8-Bit AVR Processors , 2015, CHES.
[99] Christian Cachin,et al. Entropy measures and unconditional security in cryptography , 1997 .
[100] Oded Goldreich,et al. Public-Key Cryptosystems from Lattice Reduction Problems , 1996, CRYPTO.
[101] Michael Schneider,et al. Estimating the Security of Lattice-based Cryptosystems , 2010, IACR Cryptol. ePrint Arch..
[102] Nicholas J. Higham,et al. INVERSE PROBLEMS NEWSLETTER , 1991 .
[103] Arjen K. Lenstra,et al. Lattices and Factorization of Polynomials over Algebraic Number Fields , 1982, EUROCAM.
[104] Daniele Micciancio,et al. Generalized Compact Knapsacks Are Collision Resistant , 2006, ICALP.
[105] Xavier Boyen,et al. Sealing the Leak on Classical NTRU Signatures , 2014, PQCrypto.
[106] Silvio Micali,et al. On-Line/Off-Line Digital Schemes , 1989, CRYPTO.
[107] Craig Gentry,et al. Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits , 2014, EUROCRYPT.
[108] Ron Steinfeld,et al. Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance , 2015, Journal of Cryptology.
[109] Dan Boneh,et al. Efficient Lattice (H)IBE in the Standard Model , 2010, EUROCRYPT.
[110] James C. Schatzman,et al. Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform , 1996, SIAM J. Sci. Comput..
[111] Ronaldo M. Salles,et al. Botnets: A survey , 2013, Comput. Networks.
[112] IEEE P1363.1TMD,et al. IEEE P1363.1 Draft 10: Draft Standard for Public Key Cryptographic Techniques Based on Hard Problems over Lattices , 2008, IACR Cryptol. ePrint Arch..
[113] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[114] Ravi Kannan,et al. Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..
[115] Ping Yu. Direct Online/Offline Digital Signature Schemes. , 2008 .
[116] Chris Peikert,et al. SWIFFT: A Modest Proposal for FFT Hashing , 2008, FSE.
[117] Shafi Goldwasser,et al. Complexity of lattice problems - a cryptographic perspective , 2002, The Kluwer international series in engineering and computer science.
[118] Nicolas Gama,et al. Predicting Lattice Reduction , 2008, EUROCRYPT.
[119] Andreas Enge,et al. Practical Non-Interactive Key Distribution Based on Pairings , 2002, IACR Cryptology ePrint Archive.
[120] Brent Waters,et al. Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) , 2006, CRYPTO.
[121] H. Nussbaumer. Fast Fourier transform and convolution algorithms , 1981 .
[122] Yuliang Zheng,et al. Practical Signcryption , 2010, Information Security and Cryptography.
[123] Vinod Vaikuntanathan,et al. Functional Encryption for Inner Product Predicates from Learning with Errors , 2011, IACR Cryptol. ePrint Arch..
[124] Phong Q. Nguyen,et al. BKZ 2.0: Better Lattice Security Estimates , 2011, ASIACRYPT.
[125] Ingrid Verbauwhede,et al. Low-cost implementations of NTRU for pervasive security , 2008, 2008 International Conference on Application-Specific Systems, Architectures and Processors.
[126] G. Marsaglia,et al. The Ziggurat Method for Generating Random Variables , 2000 .
[127] Daniele Micciancio,et al. On Bounded Distance Decoding for General Lattices , 2006, APPROX-RANDOM.
[128] Ricardo Dahab,et al. TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).
[129] Tibor Juhas. The use of elliptic curves in cryptography , 2007 .
[130] Tim Güneysu,et al. Towards Efficient Arithmetic for Lattice-Based Cryptography on Reconfigurable Hardware , 2012, LATINCRYPT.
[131] Phong Q. Nguyen,et al. The LLL Algorithm - Survey and Applications , 2009, Information Security and Cryptography.
[132] Damien Stehlé,et al. Floating-Point LLL: Theoretical and Practical Aspects , 2010, The LLL Algorithm.
[133] Dan Boneh,et al. Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE , 2010, CRYPTO.
[134] Craig Gentry,et al. Candidate Multilinear Maps from Ideal Lattices , 2013, EUROCRYPT.
[135] Vinod Vaikuntanathan,et al. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption , 2012, STOC '12.
[136] David Cash,et al. Bonsai Trees, or How to Delegate a Lattice Basis , 2010, Journal of Cryptology.
[137] Hovav Shacham,et al. Short Group Signatures , 2004, CRYPTO.
[138] Tal Rabin,et al. On the Security of Joint Signature and Encryption , 2002, EUROCRYPT.
[139] Ronald Cramer,et al. Recovering Short Generators of Principal Ideals in Cyclotomic Rings , 2016, EUROCRYPT.
[140] Joseph H. Silverman,et al. NSS: An NTRU Lattice-Based Signature Scheme , 2001, EUROCRYPT.
[141] Atsushi Fujioka,et al. Practical and post-quantum authenticated key exchange from one-way secure key encapsulation mechanism , 2013, ASIA CCS '13.
[142] Phong Q. Nguyen,et al. Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures , 2009, Journal of Cryptology.
[143] M. Rabin. DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .
[144] Don H. Johnson,et al. Gauss and the history of the fast Fourier transform , 1984, IEEE ASSP Magazine.
[145] Vipul Goyal,et al. Identity-based encryption with efficient revocation , 2008, IACR Cryptol. ePrint Arch..
[146] Andreas Terzis,et al. A multifaceted approach to understanding the botnet phenomenon , 2006, IMC '06.
[147] M. E. Muller,et al. A Note on the Generation of Random Normal Deviates , 1958 .
[148] Piotr Szczechowiak,et al. TinyIBE: Identity-based encryption for heterogeneous sensor networks , 2009, 2009 International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP).
[149] Angelo De Caro,et al. Lattice-Based Hierarchical Inner Product Encryption , 2012, LATINCRYPT.
[150] Daniele Micciancio,et al. Worst-case to average-case reductions based on Gaussian measures , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[151] Xavier Boyen,et al. Attribute-Based Functional Encryption on Lattices , 2013, TCC.
[152] Craig Gentry,et al. Cryptanalysis of the Revised NTRU Signature Scheme , 2002, EUROCRYPT.
[153] Thomas Poppelmann,et al. Area optimization of lightweight lattice-based encryption on reconfigurable hardware , 2014, 2014 IEEE International Symposium on Circuits and Systems (ISCAS).
[154] Sorin A. Huss,et al. On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes , 2012, CHES.
[155] Léo Ducas,et al. Ring-LWE in Polynomial Rings , 2012, IACR Cryptol. ePrint Arch..
[156] Taher El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.
[157] Damien Stehlé,et al. Decoding by Embedding: Correct Decoding Radius and DMT Optimality , 2011, IEEE Transactions on Information Theory.
[158] William Whyte,et al. NTRUSIGN: Digital Signatures Using the NTRU Lattice , 2003, CT-RSA.
[159] Martin R. Albrecht,et al. On the concrete hardness of Learning with Errors , 2015, J. Math. Cryptol..
[160] Roger M. Needham,et al. TEA, a Tiny Encryption Algorithm , 1994, FSE.
[161] Léo Ducas,et al. Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures , 2012, ASIACRYPT.
[162] László Babai,et al. On Lovász’ lattice reduction and the nearest lattice point problem , 1986, Comb..
[163] Tim Güneysu,et al. Enhanced Lattice-Based Signatures on Reconfigurable Hardware , 2014, CHES.
[164] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[165] Kenneth G. Paterson,et al. On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups , 2009, Des. Codes Cryptogr..
[166] Ricardo Dahab,et al. TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks , 2008 .
[167] W. Arnoldi. The principle of minimized iterations in the solution of the matrix eigenvalue problem , 1951 .
[168] Steven D. Galbraith,et al. Sampling from discrete Gaussians for lattice-based cryptography on a constrained device , 2014, Applicable Algebra in Engineering, Communication and Computing.
[169] R. Servedio,et al. Learning, cryptography, and the average case , 2010 .
[170] Marc-Olivier Killijian,et al. XPIR : Private Information Retrieval for Everyone , 2016, Proc. Priv. Enhancing Technol..