Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

DOI10.1007/978-3-642-00457-5_12zbMath1213.68249OpenAlexW2161008709MaRDI QIDQ3611766

Hila Zarosim, Yehuda Lindell

Publication date: 3 March 2009

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_12

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (7)

How to build an ideal cipher: the indifferentiability of the Feistel construction ⋮ Doubly adaptive zero-knowledge proofs ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ Adaptively Secure Two-Party Computation with Erasures ⋮ On the power of secure two-party computation ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Efficient constant-round MPC with identifiable abort and public verifiability

This page was built for publication: Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer