One-time programs from commodity hardware
From MaRDI portal
Publication:6169553
DOI10.1007/978-3-031-22368-6_5OpenAlexW4312637093MaRDI QIDQ6169553
No author found.
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)
Cites Work
- Unnamed Item
- Unnamed Item
- Adaptively secure garbling with near optimal online complexity
- Robust non-interactive multiparty computation against constant-size collusion
- Laconic oblivious transfer and its applications
- Overcoming cryptographic impossibility results using blockchains
- The hunting of the SNARK
- New constructions of hinting PRGs, OWFs with encryption, and more
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- A fuzzy vault scheme
- Laconic private set intersection and applications
- Quantum One-Time Programs
- On a class of error correcting binary group codes
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Robuster Combiners for Oblivious Transfer
- One-Time Programs
- Software protection and simulation on oblivious RAMs
- Computationally Sound Proofs
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Hartree-Fock on a superconducting qubit quantum computer
- WebTrust – A Comprehensive Authenticity and Integrity Framework for HTTP
- On Robust Combiners for Oblivious Transfer and Other Primitives
- Class of constructive asymptotically good algebraic codes
- Theory of Cryptography
This page was built for publication: One-time programs from commodity hardware
