One-time programs from commodity hardware

DOI10.1007/978-3-031-22368-6_5MaRDI QIDQ6169553zbMATH OpenOpenAlexFDO

Authors

Publication date 14 August 2023

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22368-6_5

Mathematics Subject Classification ID

Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• One-Time Programs
• One-time programs with limited memory
• Program Obfuscation and One-Time Programs
• Quantum one-time programs. (Extended abstract)
• Founding Cryptography on Tamper-Proof Hardware Tokens

Cites work

• scientific article; zbMATH DE number 5485522 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• A fuzzy vault scheme
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• Adaptively secure garbling with near optimal online complexity
• Class of constructive asymptotically good algebraic codes
• Computationally Sound Proofs
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Hartree-Fock on a superconducting qubit quantum computer
• Laconic oblivious transfer and its applications
• Laconic private set intersection and applications
• New constructions of hinting PRGs, OWFs with encryption, and more
• On Robust Combiners for Oblivious Transfer and Other Primitives
• On a class of error correcting binary group codes
• One-Time Programs
• Overcoming cryptographic impossibility results using blockchains
• Quantum one-time programs. (Extended abstract)
• Robust non-interactive multiparty computation against constant-size collusion
• Robuster Combiners for Oblivious Transfer
• Software protection and simulation on oblivious RAMs
• The hunting of the SNARK
• Theory of Cryptography
• Three halves make a whole? Beating the half-gates lower bound for garbled circuits
• Webtrust -- a comprehensive authenticity and integrity framework for HTTP

Cited in

(2)

• One-time memories secure against depth-bounded quantum circuits
• One-Time Programs

This page was built for publication: One-time programs from commodity hardware

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169553)