The following pages link to One-Time Programs (Q3600212):
Displaying 32 items.
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- Pattern matching on encrypted streams (Q1633445) (← links)
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- Short paper: Terrorist fraud in distance bounding: getting around the models (Q2145398) (← links)
- Adaptive security of practical garbling schemes (Q2152063) (← links)
- Unclonable polymers and their cryptographic applications (Q2170032) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Disappearing cryptography in the bounded storage model (Q2697865) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
- Universally Composable Firewall Architectures Using Trusted Hardware (Q2947101) (← links)
- Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens (Q2947531) (← links)
- Reactive Garbling: Foundation, Instantiation, Application (Q2953804) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Secure Set Intersection with Untrusted Hardware Tokens (Q3073691) (← links)
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database (Q3181022) (← links)
- Founding Cryptography on Tamper-Proof Hardware Tokens (Q3408202) (← links)
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens (Q3408203) (← links)
- Leakage-Resilient Signatures (Q3408204) (← links)
- Public-Key Encryption Schemes with Auxiliary Inputs (Q3408205) (← links)
- How to Compute in the Presence of Leakage (Q3449567) (← links)
- One-Time Programs with Limited Memory (Q3454868) (← links)
- Cryptography without (Hardly Any) Secrets ? (Q3627445) (← links)
- A Leakage-Resilient Mode of Operation (Q3627451) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Storing and Retrieving Secrets on a Blockchain (Q5087260) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Formal Abstractions for Attested Execution Secure Processors (Q5738880) (← links)
