Resettably Secure Computation

DOI10.1007/978-3-642-01001-9_3zbMath1239.94050OpenAlexW1526379157MaRDI QIDQ3627427

Amit Sahai, Vipul Goyal

Publication date: 12 May 2009

Published in: Advances in Cryptology - EUROCRYPT 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-01001-9_3

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ Concurrent Secure Computation via Non-Black Box Simulation ⋮ Additive randomized encodings and their applications ⋮ Post-quantum resettably-sound zero knowledge ⋮ Continuously non-malleable codes in the split-state model ⋮ Founding Cryptography on Tamper-Proof Hardware Tokens ⋮ Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens

Cites Work

• Unnamed Item
• Unnamed Item
• Security and composition of multiparty cryptographic protocols
• On the limitations of universally composable two-party computation without set-up assumptions
• Local zero knowledge
• How to share a secret
• Resettable zero-knowledge (extended abstract)
• Differential Privacy: A Survey of Results
• Bounded-concurrent secure two-party computation without setup assumptions
• Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
• Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
• Zaps and Their Applications
• New Constructions for UC Secure Computation Using Tamper-Proof Hardware
• Theory of Cryptography

This page was built for publication: Resettably Secure Computation