Fetching the paper…
Reading the bibliography…
Over the past few decades, we have seen a proliferation of advanced cryptographic primitives with lossy or homomorphic properties built from various assumptions such as Quadratic Residuosity, Decisional Diffie-Hellman, and Learning with Errors.
The use of information sets in decoding cyclic codes
Eugene Prange · 1962
Earlier work this paper cites.
Class of constructive asymptotically good algebraic codes
Jørn Justesen · 1972
Earlier work this paper cites.
A public-key cryptosystem based on algebraic coding theory
Robert J. McEliece · 1978
Earlier work this paper cites.
Computers and intractability: a guide to the theory of np-completeness (michael r. garey and david s. johnson)
Juris Hartmanis · 1982
Earlier work this paper cites.
Knapsack-type cryptosystems and algebraic coding theory
H. Niederreiter · 1986
Earlier work this paper cites.
One-way group actions
Gilles Brassard and Moti Yung · 1991
Earlier work this paper cites.
Reducing elliptic curve logarithms to logarithms in a finite field
Alfred Menezes, Scott A. Vanstone, and Tatsuaki Okamoto · 1991
Earlier work this paper cites.
On insecurity of cryptosystems based on generalized reed-solomon codes
V. M. SIDELNIKOV and S. O. SHESTAKOV · 1992
Earlier work this paper cites.
Cryptographic primitives based on hard learning problems
Avrim Blum, Merrick L. Furst, Michael J. Kearns, and Richard J. Lipton · 1994
Earlier work this paper cites.
A public-key cryptosystem based on binary reed-muller codes
Vladimir Michilovich Sidelnikov · 1994
Earlier work this paper cites.
Private information retrieval
Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan · 1995
Earlier work this paper cites.
A personal view of average-case complexity
Russell Impagliazzo · 1995
Earlier work this paper cites.
Mceliece public key cryptosystems using algebraic-geometric codes
Heeralal Janwa and Oscar Moreno · 1996
Earlier work this paper cites.
Replication is NOT needed: SINGLE database, computationally-private information retrieval
Eyal Kushilevitz and Rafail Ostrovsky · 1997
Earlier work this paper cites.
A complete promise problem for statistical zero-knowledge
Amit Sahai and Salil P. Vadhan · 1997
Earlier work this paper cites.
NTRU: A ring-based public key cryptosystem
Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman · 1998
Earlier work this paper cites.
Noise-tolerant learning, the parity problem, and the statistical query model
Avrim Blum, Adam Kalai, and Hal Wasserman · 2000
Earlier work this paper cites.
Candidate one-way functions based on expander graphs
Oded Goldreich · 2000
Earlier work this paper cites.
On pseudorandom generators in NC
Mary Cryan and Peter Bro Miltersen · 2001
Earlier work this paper cites.
A statistical decoding algorithm for general linear block codes
A Al Jabri · 2001
Earlier work this paper cites.
Efficient oblivious transfer protocols
Moni Naor and Benny Pinkas · 2001
Earlier work this paper cites.
Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption
Ronald Cramer and Victor Shoup · 2002
Earlier work this paper cites.
Relations between average case complexity and approximation complexity
Uriel Feige · 2002
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.
How to mask the structure of codes for a cryptographic use
Thierry P. Berger and Pierre Loidreau · 2005
Earlier work this paper cites.
One-way secret-key agreement and applications to circuit polarization and immunization of public-key encryption
Thomas Holenstein and Renato Renner · 2005
Earlier work this paper cites.
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · 2005
Earlier work this paper cites.
Hard homogeneous spaces
Jean-Marc Couveignes · 2006
Earlier work this paper cites.
Witnesses for non-satisfiability of dense random 3CNF formulas
Uriel Feige, Jeong Han Kim, and Eran Ofek · 2006
Earlier work this paper cites.
Public-Key Cryptosystem Based On Isogenies
Alexander Rostovtsev and Anton Stolbunov · 2006
Earlier work this paper cites.
Cryptanalysis of a new instance of mceliece cryptosystem based on QC-LDPC codes
Marco Baldi and Franco Chiaraluce · 2007
Earlier work this paper cites.
Cryptanalysis of the sidelnikov cryptosystem
Lorenz Minder and Amin Shokrollahi · 2007
Earlier work this paper cites.
A new analysis of the McEliece cryptosystem based on QC-LDPC codes
Marco Baldi, Marco Bodrato, and Franco Chiaraluce · 2008
Earlier work this paper cites.
On notions of security for deterministic encryption, and efficient constructions without random oracles
Alexandra Boldyreva, Serge Fehr, and Adam O’Neill · 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.
Cryptography with constant computational overhead
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai · 2008
Earlier work this paper cites.
A framework for efficient and composable oblivious transfer
Chris Peikert, Vinod Vaikuntanathan, and Brent Waters · 2008
Earlier work this paper cites.
Lossy trapdoor functions and their applications
Chris Peikert and Brent Waters · 2008
Earlier work this paper cites.
Hedged public-key encryption: How to protect against bad randomness
Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, and Scott Yilek · 2009
Earlier work this paper cites.
Possibility and impossibility results for encryption and commitment secure under selective opening
Mihir Bellare, Dennis Hofheinz, and Scott Yilek · 2009
Earlier work this paper cites.
On the security of goldreich’s one-way function
Andrej Bogdanov and Youming Qiao · 2009
Earlier work this paper cites.
Goldreich’s one-way function candidate and myopic backtracking algorithms
James Cook, Omid Etesami, Rachel Miller, and Luca Trevisan · 2009
Earlier work this paper cites.
Fully homomorphic encryption using ideal lattices
Craig Gentry · 2009
Earlier work this paper cites.
Efficient lattice (H)IBE in the standard model
Shweta Agrawal, Dan Boneh, and Xavier Boyen · 2010
Earlier work this paper cites.
Public-key cryptography from different assumptions
Benny Applebaum, Boaz Barak, and Avi Wigderson · 2010
Cited alongside, same era.
Wild mceliece
Daniel J Bernstein, Tanja Lange, and Christiane Peters · 2010
Cited alongside, same era.
Instantiability of RSA-OAEP under chosen-plaintext attack
Eike Kiltz, Adam O’Neill, and Adam Smith · 2010
Cited alongside, same era.
On ideal lattices and learning with errors over rings
Vadim Lyubashevsky, Chris Peikert, and Oded Regev · 2010
Cited alongside, same era.
Cryptanalysis of two mceliece cryptosystems based on quasi-cyclic codes
Ayoub Otmani, Jean-Pierre Tillich, and Léonard Dallot · 2010
Cited alongside, same era.
Cryptanalysis of the niederreiter public key scheme based on GRS subcodes
Christian Wieschebrink · 2010
Cited alongside, same era.
Compressing vector OLE
Elette Boyle, Geoffroy Couteau, Niv Gilboa, and Yuval Ishai · 2018
Later among the works it cites.
A cryptographic test of quantumness and certifiable randomness from a single quantum device
Zvika Brakerski, Paul Christiano, Urmila Mahadev, Umesh V. Vazirani, and Thomas Vidick · 2018
Later among the works it cites.
Anonymous IBE, leakage resilience and circular security from new assumptions
Zvika Brakerski, Alex Lombardi, Gil Segev, and Vinod Vaikuntanathan · 2018
Later among the works it cites.
Quantum FHE (almost) as secure as classical
Zvika Brakerski · 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.
CSIDH: An efficient post-quantum commutative group action
Wouter Castryck, Tanja Lange, Chloe Martindale, Lorenz Panny, and Joost Renes · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Leaky pseudo-entropy functions
Mark Braverman, Avinatan Hassidim, and Yael Tauman Kalai · 2011
Cited alongside, same era.
Wild McEliece incognito
Daniel J. Bernstein, Tanja Lange, and Christiane Peters · 2011
Cited alongside, same era.
Efficient fully homomorphic encryption from (standard) LWE
Zvika Brakerski and Vinod Vaikuntanathan · 2011
Cited alongside, same era.
Candidate one-way functions based on expander graphs
Oded Goldreich · 2011
Cited alongside, same era.
Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security
Brett Hemenway, Benoît Libert, Rafail Ostrovsky, and Damien Vergnaud · 2011
Cited alongside, same era.
A dichotomy for local small-bias generators
Benny Applebaum, Andrej Bogdanov, and Alon Rosen · 2012
Cited alongside, same era.
Later among the works it cites.
Collusion resistant traitor tracing from learning with errors
Rishab Goyal, Venkata Koppula, and Brent Waters · 2018
Later among the works it cites.
Classical homomorphic encryption for quantum circuits
Urmila Mahadev · 2018
Later among the works it cites.
Classical verification of quantum computations
Urmila Mahadev · 2018
Later among the works it cites.
Sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error
Benny Applebaum and Eliran Kachlon · 2019
Later among the works it cites.
Efficient pseudorandom correlation generators: Silent OT extension and more
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl · 2019
Later among the works it cites.
CSI-FiSh: Efficient isogeny based signatures through class group computations
Ward Beullens, Thorsten Kleinjung, and Frederik Vercauteren · 2019
Later among the works it cites.
Worst-case hardness for LPN and cryptographic hashing via code smoothing
Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, and Daniel Wichs · 2019
Later among the works it cites.
Noninteractive zero knowledge for NP from (plain) learning with errors
Chris Peikert and Sina Shiehian · 2019
Later among the works it cites.
Collision resistant hashing from sub-exponential learning parity with noise
Yu Yu, Jiang Zhang, Jian Weng, Chun Guo, and Xiangxue Li · 2019
Later among the works it cites.
Cryptographic group actions and applications
Navid Alamati, Luca De Feo, Hart Montgomery, and Sikhar Patranabis · 2020
Later among the works it cites.
Correlated pseudorandom functions from variable-density LPN
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl · 2020
Later among the works it cites.
Efficient pseudorandom correlation generators from ring-LPN
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl · 2020
Later among the works it cites.
Witness maps and applications
Suvradip Chakraborty, Manoj Prabhakaran, and Daniel Wichs · 2020
Later among the works it cites.
Two-round oblivious transfer from CDH or LPN
Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny, and Daniel Wichs · 2020
Later among the works it cites.
Extracting randomness from extractor-dependent sources
Yevgeniy Dodis, Vinod Vaikuntanathan, and Daniel Wichs · 2020
Later among the works it cites.
Low error efficient computational extractors in the CRS model
Ankit Garg, Yael Tauman Kalai, and Dakshita Khurana · 2020
Later among the works it cites.
Incompressible encodings
Tal Moran and Daniel Wichs · 2020
Later among the works it cites.
Silver: Silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
Geoffroy Couteau, Peter Rindal, and Srinivasan Raghuraman · 2021
Later among the works it cites.
Indistinguishability obfuscation from well-founded assumptions
Aayush Jain, Huijia Lin, and Amit Sahai · 2021
Later among the works it cites.
Correlated pseudorandomness from expand-accumulate codes
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, and Peter Scholl · 2022
Later among the works it cites.
Statistically sender-private OT from LPN and derandomization
Nir Bitansky and Sapir Freizeit · 2022
Later among the works it cites.
SNARGs for
Arka Rai Choudhuri, Abhishek Jain, and Zhengzhong Jin · 2022
Later among the works it cites.
Introduction to algorithms
Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein · 2022
Later among the works it cites.
Algorithms and certificates for boolean csp refutation: smoothed is no harder than random
Venkatesan Guruswami, Pravesh K Kothari, and Peter Manohar · 2022
Later among the works it cites.
Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
Benoît Libert, Ky Nguyen, and Alain Passelègue · 2022
Later among the works it cites.
New constructions of collapsing hashes
Mark Zhandry · 2022
Later among the works it cites.
Actively secure arithmetic computation and VOLE with constant computational overhead
Benny Applebaum and Niv Konstantini · 2023
Later among the works it cites.
Correlated pseudorandomness from the hardness of quasi-abelian decoding
Maxime Bombar, Geoffroy Couteau, Alain Couvreur, and Clément Ducros · 2023
Later among the works it cites.
Oblivious transfer with constant computational overhead
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, and Peter Scholl · 2023
Later among the works it cites.
An efficient key recovery attack on SIDH
Wouter Castryck and Thomas Decru · 2023
Later among the works it cites.
Pseudorandom correlation functions from variable-density LPN, revisited
Geoffroy Couteau and Clément Ducros · 2023
Later among the works it cites.
Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
Quang Dao, Yuval Ishai, Aayush Jain, and Huijia Lin · 2023
Later among the works it cites.
Searching for elfs in the cryptographic forest
Marc Fischlin and Felix Rohrbach · 2023
Later among the works it cites.
A simple and sharper proof of the hypergraph moore bound
Jun-Ting Hsieh, Pravesh K Kothari, and Sidhanth Mohanty · 2023
Later among the works it cites.
Doubly efficient private information retrieval and fully homomorphic ram computation from ring lwe
Wei-Kai Lin, Ethan Mook, and Daniel Wichs · 2023
Later among the works it cites.
A direct key recovery attack on SIDH
Luciano Maino, Chloe Martindale, Lorenz Panny, Giacomo Pope, and Benjamin Wesolowski · 2023
Later among the works it cites.
Breaking SIDH in polynomial time
Damien Robert · 2023
Later among the works it cites.
Expand-convolute codes for pseudorandom correlation generators from LPN
Srinivasan Raghuraman, Peter Rindal, and Titouan Tanguy · 2023
Later among the works it cites.