Fetching the paper…
Reading the bibliography…
In this work, we show how to construct indistinguishability obfuscation from subexponential hardness of four well-founded assumptions.
A comparison of signalling alphabets
E. N. Gilbert · 1952
Earlier work this paper cites.
Estimate of the number of signals in error correcting codes
Rom Varshamov · 1957
Earlier work this paper cites.
Candidate one-way functions based on expander graphs
Oded Goldreich · 2000
Earlier work this paper cites.
On the (im)possibility of obfuscating programs
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, and Ke Yang · 2001
Earlier work this paper cites.
On the (im)possibility of obfuscating programs
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, and Ke Yang · 2001
Earlier work this paper cites.
On pseudorandom generators in NC
Mary Cryan and Peter Bro Miltersen · 2001
Earlier work this paper cites.
Secure human identification protocols
Nicholas J. Hopper and Manuel Blum · 2001
Earlier work this paper cites.
Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
Eric R. Verheul · 2001
Earlier work this paper cites.
More on average case vs approximation complexity
Michael Alekhnovich · 2003
Earlier work this paper cites.
On e-biased generators in NC0
Elchanan Mossel, Amir Shpilka, and Luca Trevisan · 2003
Earlier work this paper cites.
Easy decision-diffie-hellman groups
Steven D. Galbraith and Victor Rotger · 2004
Earlier work this paper cites.
Worst-case to average-case reductions based on Gaussian measures
Daniele Micciancio and Oded Regev · 2004
Earlier work this paper cites.
Correlation-resistant storage via keyword-searchable encryption
Lucas Ballard, Matthew Green, Breno de Medeiros, and Fabian Monrose · 2005
Earlier work this paper cites.
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · 2005
Earlier work this paper cites.
One-time programs
Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum · 2008
Earlier work this paper cites.
Trapdoors for hard lattices and new cryptographic constructions
Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan · 2008
Earlier work this paper cites.
Efficient non-interactive proof systems for bilinear groups
Jens Groth and Amit Sahai · 2008
Earlier work this paper cites.
Secure arithmetic computation with no honest majority
Yuval Ishai, Manoj Prabhakaran, and Amit Sahai · 2009
Earlier work this paper cites.
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
Chris Peikert · 2009
Earlier work this paper cites.
Overcoming the hole in the bucket: Public-key cryptography resilient to continual memory leakage
Zvika Brakerski, Yael Tauman Kalai, Jonathan Katz, and Vinod Vaikuntanathan · 2010
Earlier work this paper cites.
Efficient fully homomorphic encryption from (standard) LWE
Zvika Brakerski and Vinod Vaikuntanathan · 2011
Earlier work this paper cites.
A dichotomy for local small-bias generators
Benny Applebaum, Andrej Bogdanov, and Alon Rosen · 2012
Earlier work this paper cites.
Pseudorandom generators with long stretch and low locality from random local one-way functions
Benny Applebaum · 2012
Earlier work this paper cites.
(Leveled) fully homomorphic encryption without bootstrapping
Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan · 2012
Earlier work this paper cites.
On the security of goldreich’s one-way function
Andrej Bogdanov and Youming Qiao · 2012
Earlier work this paper cites.
Shorter IBE and signatures via asymmetric pairings
Jie Chen, Hoon Wei Lim, San Ling, Huaxiong Wang, and Hoeteck Wee · 2012
Earlier work this paper cites.
Functional encryption with bounded collusions via multi-party computation
Sergey Gorbunov, Vinod Vaikuntanathan, and Hoeteck Wee · 2012
Earlier work this paper cites.
Key homomorphic PRFs and their applications
Dan Boneh, Kevin Lewi, Hart William Montgomery, and Ananth Raghunathan · 2013
Earlier work this paper cites.
Practical multilinear maps over the integers
Jean-Sébastien Coron, Tancrède Lepoint, and Mehdi Tibouchi · 2013
Earlier work this paper cites.
Candidate multilinear maps from ideal lattices
Sanjam Garg, Craig Gentry, and Shai Halevi · 2013
Earlier work this paper cites.
Candidate indistinguishability obfuscation and functional encryption for all circuits
Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova, Amit Sahai, and Brent Waters · 2013
Earlier work this paper cites.
Reusable garbled circuits and succinct functional encryption
Shafi Goldwasser, Yael Tauman Kalai, Raluca A. Popa, Vinod Vaikuntanathan, and Nickolai Zeldovich · 2013
Earlier work this paper cites.
Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based
Craig Gentry, Amit Sahai, and Brent Waters · 2013
Earlier work this paper cites.
Attribute-based encryption for circuits
Sergey Gorbunov, Vinod Vaikuntanathan, and Hoeteck Wee · 2013
Earlier work this paper cites.
Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures
Susan Hohenberger, Amit Sahai, and Brent Waters · 2013
Earlier work this paper cites.
Shorter quasi-adaptive NIZK proofs for linear subspaces
Charanjit S. Jutla and Arnab Roy · 2013
Earlier work this paper cites.
Hardness of SIS and LWE with small parameters
Daniele Micciancio and Chris Peikert · 2013
Earlier work this paper cites.
Optimizing obfuscation: Avoiding Barrington’s theorem
Prabhanjan Ananth, Divya Gupta, Yuval Ishai, and Amit Sahai · 2014
Cited alongside, same era.
Indistinguishability obfuscation and UCEs: The case of computationally unpredictable sources
Christina Brzuska, Pooya Farshim, and Arno Mittelbach · 2014
Cited alongside, same era.
Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
Dan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan, and Dhinakaran Vinayagamurthy · 2014
Cited alongside, same era.
Protecting obfuscation against algebraic attacks
Boaz Barak, Sanjam Garg, Yael Tauman Kalai, Omer Paneth, and Amit Sahai · 2014
Cited alongside, same era.
Virtual black-box obfuscation for all circuits via generic graded encoding
Zvika Brakerski and Guy N. Rothblum · 2014
Cited alongside, same era.
Immunizing multilinear maps against zeroizing attacks
Indistinguishability obfuscation from constant-degree graded encoding schemes
Huijia Lin · 2016
Later among the works it cites.
Compactness vs collusion resistance in functional encryption
Baiyu Li and Daniele Micciancio · 2016
Later among the works it cites.
Indistinguishability obfuscation with non-trivial efficiency
Huijia Lin, Rafael Pass, Karn Seth, and Sidharth Telang · 2016
Later among the works it cites.
Indistinguishability obfuscation from DDH-like assumptions on constant-degree graded encodings
Huijia Lin and Vinod Vaikuntanathan · 2016
Later among the works it cites.
Annihilation attacks for multilinear maps: Cryptanalysis of indistinguishability obfuscation over GGH13
Eric Miles, Amit Sahai, and Mark Zhandry · 2016
Later among the works it cites.
Two round multiparty computation via multi-key FHE
Pratyay Mukherjee and Daniel Wichs · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dan Boneh, David J. Wu, and Joe Zimmerman · 2014
Cited alongside, same era.
Multi-input functional encryption
Shafi Goldwasser, S. Dov Gordon, Vipul Goyal, Abhishek Jain, Jonathan Katz, Feng-Hao Liu, Amit Sahai, Elaine Shi, and Hong-Sheng Zhou · 2014
Cited alongside, same era.
Goldreich’s PRG: evidence for near-optimal polynomial stretch
Ryan O’Donnell and David Witmer · 2014
Cited alongside, same era.
Indistinguishability obfuscation from semantically-secure multilinear encodings
Rafael Pass, Karn Seth, and Sidharth Telang · 2014
Cited alongside, same era.
How to use indistinguishability obfuscation: deniable encryption, and more
Amit Sahai and Brent Waters · 2014
Cited alongside, same era.
Arithmetic cryptography: Extended abstract
Benny Applebaum, Jonathan Avron, and Christina Brzuska · 2015
Cited alongside, same era.
Indistinguishability obfuscation from compact functional encryption
Prabhanjan Ananth and Abhishek Jain · 2015
Cited alongside, same era.
Later among the works it cites.
Secure arithmetic computation with constant computational overhead
Benny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen, and Lior Zichron · 2017
Later among the works it cites.
Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
Prabhanjan Ananth and Amit Sahai · 2017
Later among the works it cites.
Limits on low-degree pseudorandom generators (or: Sum-of-squares meets program obfuscation)
Boaz Barak, Zvika Brakerski, Ilan Komargodski, and Pravesh Kothari · 2017
Later among the works it cites.
TinyOLE: Efficient actively secure two-party computation from oblivious linear function evaluation
Nico Döttling, Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges, and Roberto Trifiletti · 2017
Later among the works it cites.
Lockable obfuscation
Rishab Goyal, Venkata Koppula, and Brent Waters · 2017
Later among the works it cites.
Maliciously secure oblivious linear function evaluation with constant overhead
Satrajit Ghosh, Jesper Buus Nielsen, and Tobias Nilges · 2017
Later among the works it cites.
Sum of squares lower bounds for refuting any CSP
Pravesh K. Kothari, Ryuhei Mori, Ryan O’Donnell, and David Witmer · 2017
Later among the works it cites.
Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
Huijia Lin · 2017
Later among the works it cites.
Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
Huijia Lin and Stefano Tessaro · 2017
Later among the works it cites.
Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
Alex Lombardi and Vinod Vaikuntanathan · 2017
Later among the works it cites.
Obfuscating compute-and-compare programs under LWE
Daniel Wichs and Giorgos Zirdelis · 2017
Later among the works it cites.
Indistinguishability obfuscation without multilinear maps: io from lwe, bilinear maps, and weak pseudorandomness
Prabhanjan Ananth, Aayush Jain, and Amit Sahai · 2018
Later among the works it cites.
Compressing vector OLE
Elette Boyle, Geoffroy Couteau, Niv Gilboa, and Yuval Ishai · 2018
Later among the works it cites.
Threshold cryptosystems from threshold fully homomorphic encryption
Dan Boneh, Rosario Gennaro, Steven Goldfeder, Aayush Jain, Sam Kim, Peter M. R. Rasmussen, and Amit Sahai · 2018
Later among the works it cites.
On the complexity of simulating auxiliary input
Yi-Hsiu Chen, Kai-Min Chung, and Jyun-Jie Liao · 2018
Later among the works it cites.
On the concrete security of Goldreich’s pseudorandom generator
Geoffroy Couteau, Aurélien Dupin, Pierrick Méaux, Mélissa Rossi, and Yann Rotella · 2018
Later among the works it cites.
Obfuscation using tensor products
Craig Gentry, Charanjit S. Jutla, and Daniel Kane · 2018
Later among the works it cites.
Obfustopia built on secret-key functional encryption
Fuyuki Kitagawa, Ryo Nishimaki, and Keisuke Tanaka · 2018
Later among the works it cites.
Pseudo flawed-smudging generators and their application to indistinguishability obfuscation
Huijia Lin and Christian Matt · 2018
Later among the works it cites.
Indistinguishability obfuscation without multilinear maps: New methods for bootstrapping and instantiation
Shweta Agrawal · 2019
Later among the works it cites.
Indistinguishability obfuscation without multilinear maps: New paradigms via low degree weak pseudorandomness and security amplification
Prabhanjan Ananth, Aayush Jain, Huijia Lin, Christian Matt, and Amit Sahai · 2019
Later among the works it cites.
Efficient two-round OT extension and silent non-interactive secure computation
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, and Peter Scholl · 2019
Later among the works it cites.
Sum-of-squares meets program obfuscation, revisited
Boaz Barak, Samuel B. Hopkins, Aayush Jain, Pravesh Kothari, and Amit Sahai · 2019
Later among the works it cites.
In pursuit of clarity in obfuscation
Allison Bishop, Lucas Kowalczyk, Tal Malkin, Valerio Pastro, Mariana Raykova, and Kevin Shi · 2019
Later among the works it cites.
New techniques for obfuscating conjunctions
James Bartusek, Tancrède Lepoint, Fermi Ma, and Mark Zhandry · 2019
Later among the works it cites.
Simplifying constructions and assumptions for
Aayush Jain, Huijia Lin, and Amit Sahai · 2019
Later among the works it cites.
Indistinguishability obfuscation without maps: Attacks and fixes for noisy linear FE
Shweta Agrawal and Alice Pellet-Mary · 2020
Closest in time.
Candidate io from homomorphic encryption schemes
Zvika Brakerski, Nico Dottling, Sanjam Garg, and Guilio Malavolta · 2020
Closest in time.
Affine determinant programs: A framework for obfuscation and witness encryption
James Bartusek, Yuval Ishai, Aayush Jain, Fermi Ma, Amit Sahai, and Mark Zhandry · 2020
Closest in time.
Indistinguishability obfuscation from simple-to-state hard problems: New assumptions, new techniques, and simplification
Romain Gay, Aayush Jain, Huijia Lin, and Amit Sahai · 2020
Closest in time.
Amplifying functional encryption, unconditionally
Aayush Jain, Alexis Korb, Nathan Manohar, and Amit Sahai · 2020
Closest in time.