2 Hits in 2.1 sec

Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem [chapter]

Jung Hee Cheon, Minki Hhan, Jiseung Kim, Changmin Lee
2018 Lecture Notes in Computer Science  
In this paper, we propose cryptanalyses of all existing indistinguishability obfuscation (iO) candidates based on branching programs (BP) over GGH13 multilinear map for all recommended parameter settings  ...  More precisely, the underlying lattice dimension of GGH13 should be set to n =Θ(κ 2 λ) to rule out attacks from the subfield algorithm for NTRU where κ is the multilinearity level and λ the security parameter  ...  Acknowledgement We sincerely thank the anonymous reviewers of Crypto 2018 for their fruitful comments.  ... 
doi:10.1007/978-3-319-96878-0_7 fatcat:e5hxxkrxizd2zdi2rpnfbgzcwi

Cryptanalyses of Candidate Branching Program Obfuscators [chapter]

Yilei Chen, Craig Gentry, Shai Halevi
2017 Lecture Notes in Computer Science  
For GGHRSW over GGH13, we show how to recover the ideal generating the plaintext space when the branching program has input partitioning.  ...  We describe new cryptanalytic attacks on the candidate branching program obfuscator proposed by Garg, Gentry, Halevi, Raykova, Sahai and Waters (GGHRSW) using the GGH13 graded encoding, and its variant  ...  Acknowledgments We thank Rex Fernando, Peter Rasmussen, Amit Sahai, and the anonymous reviewers for their comments on a previous version of this report.  ... 
doi:10.1007/978-3-319-56617-7_10 fatcat:tjabedgm2vdjvi5dtaoudnq67m