The following pages link to Resettably Secure Computation (Q3627427):
Displaying 7 items.
- Continuously non-malleable codes in the split-state model (Q2210446) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- Founding Cryptography on Tamper-Proof Hardware Tokens (Q3408202) (← links)
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens (Q3408203) (← links)
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation (Q3449562) (← links)
- Concurrent Secure Computation via Non-Black Box Simulation (Q3457058) (← links)
- Robust additive randomized encodings from IO and pseudo-non-linear codes (Q6653025) (← links)
