One-time programs with limited memory
From MaRDI portal
Publication:3454868
Recommendations
Cites work
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
- A proof of security of Yao's protocol for two-party computation
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Conditionally-perfect secrecy and a provably-secure randomized cipher
- Hiding Circuit Topology from Unbounded Reverse Engineers
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Key-evolution schemes resilient to space-bounded leakage
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
- Non-malleable codes
- One-time computable self-erasing functions
- One-Time Programs
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Universal circuits (Preliminary Report)
Cited in
(9)- Identifier length and limited programmer memory
- Efficient and scalable universal circuits
- Quantum one-time programs. (Extended abstract)
- One-time computable self-erasing functions
- One-Time Programs
- scientific article; zbMATH DE number 493095 (Why is no real title available?)
- Storing and retrieving secrets on a blockchain
- Program Obfuscation and One-Time Programs
- One-time programs from commodity hardware
This page was built for publication: One-time programs with limited memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454868)