Resettably Secure Computation

DOI10.1007/978-3-642-01001-9_3MaRDI QIDQ3627427zbMATH OpenOpenAlexFDO

Authors Vipul Goyal, Amit Sahai

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)

Recommendations

• Resettable zero-knowledge (extended abstract)
• Resettable cryptography in constant rounds -- the case of zero knowledge
• Resettable statistical zero knowledge
• scientific article; zbMATH DE number 2009952
• Nearly simultaneously resettable black-box zero knowledge

Cites work

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

Cited in

(15)

• Continuously non-malleable codes in the split-state model
• Reusable non-interactive secure computation
• Post-quantum resettably-sound zero knowledge
• Nearly simultaneously resettable black-box zero knowledge
• scientific article; zbMATH DE number 1808214 (Why is no real title available?)
• Resettable zero-knowledge (extended abstract)
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Truly efficient string oblivious transfer using resettable tamper-proof tokens
• On non-black-box simulation and the impossibility of approximate obfuscation
• Concurrent secure computation via non-black box simulation
• Resettable public-key encryption: how to encrypt on a virtual machine
• General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
• Efficient perfectly secure computation with optimal resilience
• Additive randomized encodings and their applications
• Robust additive randomized encodings from IO and pseudo-non-linear codes

This page was built for publication: Resettably Secure Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3627427)