Public-Key cryptography from new multivariate quadratic assumptions
作者： Yun-Ju Huang , Feng-Hao Liu , Bo-Yin Yang
DOI: 10.1007/978-3-642-30057-8_12
关键词: Ciphertext 、 Key (cryptography) 、 Encryption 、 Security parameter 、 Mathematics 、 Public-key cryptography 、 Quadratic equation 、 Pseudorandom generator 、 Polynomial 、 Discrete mathematics
摘要: In this work, we study a new multivariate quadratic (MQ) assumption that can be used to construct public-key encryptions. particular, research in the following two directions: We establish precise asymptotic formulation of family hard MQ problems, and provide empirical evidence confirm hardness. We encryption schemes, prove their security under hardness family. Also, perspective look at systems plays key role our design proof security. As consequence, first scheme is provably secure assumption. Moreover, efficient sense it only needs ciphertext length L +poly(k ) encrypt message M ∈{0, 1}L for any un-prespecified polynomial , where k parameter. This essentially optimal since an additive overhead best hope for.
springer.com
core.ac.uk
brown.edu
sci-hub.st 参考文章(58)
Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Yang, Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$ PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography. pp. 181- 202 ,(2008) , 10.1007/978-3-540-88403-3_13
Gwénolé Ars, Jean-Charles Faugère, Hideki Imai, Mitsuru Kawazoe, Makoto Sugita, Comparison Between XL and Gröbner Basis Algorithms international conference on the theory and application of cryptology and information security. ,vol. 3329, pp. 338- 353 ,(2004) , 10.1007/978-3-540-30539-2_24
Yuanmi Chen, Phong Q. Nguyen, BKZ 2.0: better lattice security estimates international conference on the theory and application of cryptology and information security. ,vol. 7073, pp. 1- 20 ,(2011) , 10.1007/978-3-642-25385-0_1
Claus Diem, The XL-Algorithm and a Conjecture from Commutative Algebra international conference on the theory and application of cryptology and information security. pp. 323- 337 ,(2004) , 10.1007/978-3-540-30539-2_23
Andrey Bogdanov, Thomas Eisenbarth, Andy Rupp, Christopher Wolf, Time-Area Optimized Public-Key Engines: $\mathcal{MQ}$-Cryptosystems as Replacement for Elliptic Curves? cryptographic hardware and embedded systems. pp. 45- 61 ,(2008) , 10.1007/978-3-540-85053-3_4
Oded Goldreich, Foundations of Cryptography: Basic Tools Cambridge University Press. ,(2000)
Côme Berbain, Henri Gilbert, Jacques Patarin, QUAD: A Practical Stream Cipher with Provable Security Advances in Cryptology - EUROCRYPT 2006. pp. 109- 128 ,(2006) , 10.1007/11761679_8
Vivien Dubois, Pierre-Alain Fouque, Jacques Stern, Cryptanalysis of SFLASH with Slightly Modified Parameters international cryptology conference. ,vol. 4515, pp. 264- 275 ,(2007) , 10.1007/978-3-540-72540-4_15
Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan, Public-Key Encryption Schemes with Auxiliary Inputs theory of cryptography conference. pp. 361- 381 ,(2010) , 10.1007/978-3-642-11799-2_22
Thomas Holenstein, Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness Theory of Cryptography. pp. 443- 461 ,(2006) , 10.1007/11681878_23