Fetching the paper…
Reading the bibliography…
Quantum cryptography leverages many unique features of quantum information in order to construct cryptographic primitives that are oftentimes impossible classically.
“Communication by EPR devices”
DGBJ Dieks · 1982
Earlier work this paper cites.
“A single quantum cannot be cloned”
William Wootters and Wojciech Zurek · 1982
Earlier work this paper cites.
“Conjugate Coding”
Stephen Wiesner · 1983
Earlier work this paper cites.
“Quantum cryptography: Public key distribution and coin tossing”
C.. Bennett and G. Brassard · 1984
Earlier work this paper cites.
“How to construct random functions”
Oded Goldreich, Shafi Goldwasser and Silvio Micali · 1986
Earlier work this paper cites.
“A Hard-Core Predicate for All One-Way Functions”
O. Goldreich and L.. Levin · 1989
Earlier work this paper cites.
“New bounds in some transference theorems in the geometry of numbers.”
W. Banaszczyk · 1993
Earlier work this paper cites.
“Recent-secure authentication: enforcing revocation in distributed systems”
S. Stubblebine · 1995
Earlier work this paper cites.
“Generating Hard Instances of Lattice Problems (Extended Abstract)”
Miklós Ajtai · 1996
Earlier work this paper cites.
“Adaptively Secure Multi-Party Computation”
Ran Canetti, Uri Feige, Oded Goldreich and Moni Naor · 1996
Earlier work this paper cites.
“Can We Eliminate Certificate Revocation Lists?”
Ronald. Rivest · 1998
Earlier work this paper cites.
“An improved quantum Fourier transform algorithm and applications”
L. Hales and S. Hallgren · 2000
Earlier work this paper cites.
“Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures”
Stanisław Jarecki and Anna Lysyanskaya · 2000
Earlier work this paper cites.
“A quantum Goldreich-Levin theorem with cryptographic applications”
Mark Adcock and Richard Cleve · 2002
Earlier work this paper cites.
“Uncloneable encryption”
Daniel Gottesman · 2002
Earlier work this paper cites.
“Creating superpositions that correspond to efficiently integrable probability distributions”
Lov. Grover and Terry Rudolph · 2002
Earlier work this paper cites.
“Worst-case to average-case reductions based on Gaussian measures”
D. Micciancio and O. Regev · 2004
Earlier work this paper cites.
“Quantum Arthur-Merlin Games”, 2005
Chris Marriott and John Watrous · 2005
Earlier work this paper cites.
“On lattices, learning with errors, random linear codes, and cryptography”
Oded Regev · 2005
Earlier work this paper cites.
“Zero-knowledge against quantum attacks”
John Watrous · 2005
Earlier work this paper cites.
“Foundations of Cryptography: Volume 1, Basic Tools”
Oded Goldreich · 2006
Earlier work this paper cites.
“Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices”
Chris Peikert and Alon Rosen · 2006
Earlier work this paper cites.
“Trapdoors for Hard Lattices and New Cryptographic Constructions” https://eprint.iacr.org/2007/432 , Cryptology ePrint Archive, Report 2007/432, 2007
Craig Gentry, Chris Peikert and Vinod Vaikuntanathan · 2007
Earlier work this paper cites.
“Worst-Case to Average-Case Reductions Based on Gaussian Measures”
Daniele Micciancio and Oded Regev · 2007
Earlier work this paper cites.
“Generating Shorter Bases for Hard Random Lattices” https://eprint.iacr.org/2008/521 , Cryptology ePrint Archive, Paper 2008/521, 2008
Joel Alwen and Chris Peikert · 2008
Earlier work this paper cites.
“Quantum copy-protection and quantum money”
Scott Aaronson · 2009
Earlier work this paper cites.
“Quantum copy-protection of compute-and-compare programs in the quantum random oracle model”, 2020
Andrea Coladangelo, Christian Majenz and Alexander Poremba · 2009
Earlier work this paper cites.
“Fully homomorphic encryption using ideal lattices”
Craig Gentry · 2009
Earlier work this paper cites.
“Efficient Public Key Encryption Based on Ideal Lattices” https://eprint.iacr.org/2009/285 , Cryptology ePrint Archive, Paper 2009/285, 2009
Damien Stehlé, Ron Steinfeld, Keisuke Tanaka and Keita Xagawa · 2009
Cited alongside, same era.
“Public-Key Encryption Schemes with Auxiliary Inputs”
Yevgeniy Dodis et al · 2010
Cited alongside, same era.
“Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller” https://eprint.iacr.org/2011/501 , Cryptology ePrint Archive, Report 2011/501, 2011
Daniele Micciancio and Chris Peikert · 2011
Cited alongside, same era.
“Quantum Computation and Quantum Information: 10th Anniversary Edition”
Michael. Nielsen and Isaac. Chuang · 2011
Cited alongside, same era.
“Pseudorandom functions and lattices”
Abhishek Banerjee, Chris Peikert and Alon Rosen · 2012
Cited alongside, same era.
“Unclonable encryption, revisited”
Prabhanjan Ananth and Fatih Kaleoglu · 2021
Later among the works it cites.
“Secure Software Leasing”
Prabhanjan Ananth and Rolando La · 2021
Later among the works it cites.
“New approaches for quantum copy-protection”
Scott Aaronson et al · 2021
Later among the works it cites.
“A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device”, 2021
Zvika Brakerski et al · 2021
Later among the works it cites.
“Secure software leasing without assumptions”
Anne Broadbent et al · 2021
Later among the works it cites.
“Hidden cosets and applications to unclonable cryptography”
Andrea Coladangelo, Jiahui Liu, Qipeng Liu and Mark Zhandry · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based” https://ia.cr/2013/340 , Cryptology ePrint Archive, Report 2013/340, 2013
Craig Gentry, Amit Sahai and Brent Waters · 2013
Cited alongside, same era.
“Revocable quantum timed-release encryption” https://ia.cr/2013/606 , Cryptology ePrint Archive, Report 2013/606, 2013
Dominique Unruh · 2013
Cited alongside, same era.
“Quantum Information Theory”
Mark. Wilde · 2013
Cited alongside, same era.
“Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE, and Compact Garbled Circuits” https://eprint.iacr.org/2014/356 , Cryptology ePrint Archive, Paper 2014/356, 2014
Dan Boneh et al · 2014
Cited alongside, same era.
“Efficient fully homomorphic encryption from (standard) 𝖫𝖶𝖤 \mathsf{LWE} ”
Zvika Brakerski and Vinod Vaikuntanathan · 2014
Cited alongside, same era.
“Efficient fully homomorphic encryption from (standard) LWE”
Zvika Brakerski and Vinod Vaikuntanathan · 2014
Cited alongside, same era.
“Quantum union bounds for sequential projective measurements”
Jingliang Gao · 2015
Cited alongside, same era.
“Succinct LWE sampling, random polynomials, and obfuscation”
Lalita Devadas et al · 2021
Later among the works it cites.
“Indistinguishability obfuscation from circular security”
Romain Gay and Rafael Pass · 2021
Later among the works it cites.
“Certified Everlasting Zero-Knowledge Proof for QMA”, 2021
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki and Takashi Yamakawa · 2021
Later among the works it cites.
“Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication”
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki and Takashi Yamakawa · 2021
Later among the works it cites.
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki and Takashi Yamakawa · 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.
“Secure Software Leasing from Standard Assumptions”
Fuyuki Kitagawa, Ryo Nishimaki and Takashi Yamakawa · 2021
Later among the works it cites.
“Secure software leasing from standard assumptions”
Fuyuki Kitagawa, Ryo Nishimaki and Takashi Yamakawa · 2021
Later among the works it cites.
“Candidate obfuscation via oblivious LWE sampling”
Hoeteck Wee and Daniel Wichs · 2021
Later among the works it cites.
“Quantum Lightning Never Strikes the Same State Twice. Or: Quantum Money from Cryptographic Assumptions”
Mark Zhandry · 2021
Later among the works it cites.
“A Note on Copy-Protection from Random Oracles”
Prabhanjan Ananth and Fatih Kaleoglu · 2022
Later among the works it cites.
“On the Feasibility of Unclonable Encryption, and More” https://eprint.iacr.org/2022/884 , Cryptology ePrint Archive, Paper 2022/884, 2022
Prabhanjan Ananth et al · 2022
Later among the works it cites.
“Constructive Post-Quantum Reductions”
Nir Bitansky, Zvika Brakerski and Yael Kalai · 2022
Later among the works it cites.
“Cryptography with Certified Deletion”
James Bartusek and Dakshita Khurana · 2022
Later among the works it cites.
“Snargs for P from LWE”
Arka Choudhuri, Abhihsek Jain and Zhengzhong Jin · 2022
Later among the works it cites.
“Functional Encryption with Secure Key Leasing”
Fuyuki Kitagawa and Ryo Nishimaki · 2022
Later among the works it cites.
“Collusion Resistant Copy-Protection for Watermarkable Functionalities” https://eprint.iacr.org/2022/1429 , Cryptology ePrint Archive, Paper 2022/1429, 2022
Jiahui Liu, Qipeng Liu, Luowen Qian and Mark Zhandry · 2022
Later among the works it cites.
“Quantum Proofs of Deletion for Learning with Errors”
Alexander Poremba · 2022
Later among the works it cites.
“Cloning Games: A General Framework for Unclonable Primitives”
Prabhanjan Ananth, Fatih Kaleoglu and Qipeng Liu · 2023
Closest in time.
“Public Key Encryption with Secure Key Leasing”
Shweta Agrawal et al · 2023
Closest in time.
“Publicly-Verifiable Deletion via Target-Collapsing Functions”, 2023
James Bartusek, Dakshita Khurana and Alexander Poremba · 2023
Closest in time.