Fetching the paper…
Reading the bibliography…
We build quantum cryptosystems that support publicly-verifiable deletion from standard cryptographic assumptions.
“A new algorithm for factoring polynomials over finite fields”
David Cantor and Hans Zassenhaus · 1981
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.
“On the Power of Two-Point Based Sampling”
B. Chor and O. Goldreich · 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.
“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.
“Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?”
Daniel. Simon · 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.
“Creating superpositions that correspond to efficiently integrable probability distributions”
Lov. Grover and Terry Rudolph · 2002
Earlier work this paper cites.
“On lattices, learning with errors, random linear codes, and cryptography”
Oded Regev · 2005
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.
“Long-Term Security and Universal Composability”
Jörn Müller-Quade and Dominique Unruh · 2007
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.
“Quantum copy-protection and quantum money”
Scott Aaronson · 2009
Earlier work this paper cites.
“Reducing Complexity Assumptions for Statistically-Hiding Commitment”
Iftach Haitner et al · 2009
Cited alongside, same era.
“Efficient Public Key Encryption Based on Ideal Lattices”
Damien Stehlé, Ron Steinfeld, Keisuke Tanaka and Keita Xagawa · 2009
Cited alongside, same era.
“Quantum Computation and Quantum Information: 10th Anniversary Edition”
Michael. Nielsen and Isaac. Chuang · 2011
Cited alongside, same era.
“Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based”
Craig Gentry, Amit Sahai and Brent Waters · 2013
Cited alongside, same era.
“Quantum Information Theory”
Mark. Wilde · 2013
Cited alongside, same era.
“Revocable Quantum Timed-Release Encryption”
Dominique Unruh · 2015
Cited alongside, same era.
“A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device”
Zvika Brakerski et al · 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.
“Constructive Post-Quantum Reductions”
Nir Bitansky, Zvika Brakerski and Yael Kalai · 2022
Later among the works it cites.
“Cryptography with Certified Deletion” https://eprint.iacr.org/2022/1178 , Cryptology ePrint Archive, Paper 2022/1178, 2022
James Bartusek and Dakshita Khurana · 2022
Later among the works it cites.
“The Gap Is Sensitive to Size of Preimages: Collapsing Property Doesn’t Go Beyond Quantum Collision-Resistance for Preimages Bounded Hash Functions”
Shujiao Cao and Rui Xue · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Collapse-Binding Quantum Commitments Without Random Oracles”
Dominique Unruh · 2016
Cited alongside, same era.
“Computationally Binding Quantum Commitments”
Dominique Unruh · 2016
Cited alongside, same era.
“Pseudorandomness of Ring-LWE for Any Ring and Modulus” https://eprint.iacr.org/2017/258 , Cryptology ePrint Archive, Paper 2017/258, 2017
Chris Peikert, Oded Regev and Noah Stephens-Davidowitz · 2017
Cited alongside, same era.
“A largely self-contained and complete security proof for quantum key distribution”
Marco Tomamichel and Anthony Leverrier · 2017
Cited alongside, same era.
“Quantum FHE (Almost) As Secure As Classical”
Zvika Brakerski · 2018
Cited alongside, same era.
“Classical Verification of Quantum Computations”
Urmila Mahadev · 2018
Cited alongside, same era.
“On the necessity of collapsing” https://eprint.iacr.org/2022/786 , Cryptology ePrint Archive, Paper 2022/786, 2022
Marcel Dall’Agnol and Nicholas Spooner · 2022
Later among the works it cites.
“Certified Everlasting Functional Encryption” https://eprint.iacr.org/2022/969 , Cryptology ePrint Archive, Paper 2022/969, 2022
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki and Takashi Yamakawa · 2022
Later among the works it cites.
“Certified Everlasting Zero-Knowledge Proof for QMA”
Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki and Takashi Yamakawa · 2022
Later among the works it cites.
“General Properties of Quantum Bit Commitments (Extended Abstract)”
Jun Yan · 2022
Later among the works it cites.
“New Constructions of Collapsing Hashes”
Mark Zhandry · 2022
Later among the works it cites.
“Public Key Encryption with Secure Key Leasing”
Shweta Agarwal et al · 2023
Closest in time.
“Revocable Cryptography from Learning with Errors” https://eprint.iacr.org/2023/325 , Cryptology ePrint Archive, Paper 2023/325, 2023
Prabhanjan Ananth, Alexander Poremba and Vinod Vaikuntanathan · 2023
Closest in time.
“Obfuscation and Outsourced Computation with Certified Deletion”, Cryptology ePrint Archive, Paper 2023/265, 2023
James Bartusek et al · 2023
Closest in time.
“From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments”
Minki Hhan, Tomoyuki Morimae and Takashi Yamakawa · 2023
Closest in time.
“Quantum Proofs of Deletion for Learning with Errors”
Alexander Poremba · 2023
Closest in time.