One-Time Programs
From MaRDI portal
Recommendations
Cites work
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Automata, Languages and Programming
- Blind Signature System
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- How to construct constant-round zero-knowledge proof systems for NP
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Lower bounds for non-black-box zero knowledge
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Software protection and simulation on oblivious RAMs
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
- Theory of Cryptography
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Virtual leashing: creating a computational foundation for software protection
Cited in
(50)- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Pattern matching on encrypted streams
- Non-interactive secure computation from one-way functions
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Short paper: Terrorist fraud in distance bounding: getting around the models
- Adaptive security of practical garbling schemes
- Unclonable polymers and their cryptographic applications
- On the power of secure two-party computation
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- Disappearing cryptography in the bounded storage model
- On the Power of Secure Two-Party Computation
- Adaptively secure garbled circuits from one-way functions
- Quantum one-time programs. (Extended abstract)
- Universally composable firewall architectures using trusted hardware
- Weakening the isolation assumption of tamper-proof hardware tokens
- Reactive garbling: foundation, instantiation, application
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- One-time computable self-erasing functions
- Efficient reductions for non-signaling cryptographic primitives
- Secure set intersection with untrusted hardware tokens
- Adaptive succinct garbled RAM or: how to delegate your database
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Truly efficient string oblivious transfer using resettable tamper-proof tokens
- Leakage-resilient signatures
- Public-key encryption schemes with auxiliary inputs
- How to Compute in the Presence of Leakage
- One-time programs with limited memory
- Cryptography without (Hardly Any) Secrets ?
- A Leakage-Resilient Mode of Operation
- Garbled circuits as randomized encodings of functions: a primer
- Storing and retrieving secrets on a blockchain
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Program Obfuscation and One-Time Programs
- Constant round adaptively secure protocols in the tamper-proof hardware model
- Formal abstractions for attested execution secure processors
- KDM security for the Fujisaki-Okamoto transformations in the QROM
- Lifting standard model reductions to common setup assumptions
- One-time programs from commodity hardware
- \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments
- One-time memories secure against depth-bounded quantum circuits
- Lattice-based post-quantum iO from circular security with random opening assumption
- Towards building scalable constant-round MPC from minimal assumptions via round collapsing
- Quantum one-time protection of any randomized algorithm
- Indistinguishability obfuscation from well-founded assumptions
- \textsf{FREPack}: improved SNARK frontend for highly repetitive computations
- Powerful primitives in the bounded quantum storage model
- Consumable data via quantum communication
- Consumable data via quantum communication
This page was built for publication: One-Time Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600212)
