One-Time Programs with Limited Memory

DOI10.1007/978-3-319-12087-4_24zbMath1347.94031OpenAlexW2146099871MaRDI QIDQ3454868

Konrad Durnoga, Tomasz Kazana, Stefan Dziembowski, Michał Zając

Publication date: 2 December 2015

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12087-4_24

zbMATH Keywords

pseudorandom functionscircuit garblingone-time deviceone-time program

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Fault detection; testing in circuits and networks (94C12) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Storing and Retrieving Secrets on a Blockchain ⋮ Efficient and scalable universal circuits

Cites Work

• Unnamed Item
• A proof of security of Yao's protocol for two-party computation
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• One-Time Computable Self-erasing Functions
• Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
• One-Time Programs
• A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Universal circuits (Preliminary Report)
• Non-Malleable Codes
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• Key-Evolution Schemes Resilient to Space-Bounded Leakage
• Hiding Circuit Topology from Unbounded Reverse Engineers
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography

This page was built for publication: One-Time Programs with Limited Memory