2 Hits in 2.6 sec

Learning with Errors in the Exponent [chapter]

Özgür Dagdelen, Sebastian Gajek, Florian Göpfert
2016 Lecture Notes in Computer Science  
In fact, LWEE's duality is due to the reducibility to two seemingly unrelated assumptions: learning with errors and the representation problem [Brands, Crypto'93] in finite groups.  ...  Inspired by the theory of learning in presence of errors [Regev, STOC'05] we ask if noise in the exponent amplifies intractability.  ...  Acknowledgements The authors would like to thank Steven Galbraith and Dan Bernstein to point to a bug in a previous version of the paper, and the attendees of the Cryptography Workshop in Oberwolfach for  ... 
doi:10.1007/978-3-319-30840-1_5 fatcat:7i25r2bn6bdgphr3lzqj64zmxq

Black-box non-black-box zero knowledge

Vipul Goyal, Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti
2014 Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14  
Despite such positive results, even though nowadays we know black-box constructions for secure two-party and multi-party computation even in constant rounds, there still are in Cryptography several constructions  ...  that critically require non-black-box use of primitives in order to securely realize some fundamental tasks.  ...  Advances in Cryptology -CRYPTO 2012 -32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings, volume 7417 of Lecture Notes in Computer Science. Springer, 2012.  ... 
doi:10.1145/2591796.2591879 dblp:conf/stoc/GoyalOSV14 fatcat:2cn4htdd4req3lfcc5jumdhphy