A note on universal composable zero-knowledge in the common reference string model

DOI10.1016/j.tcs.2008.10.027zbMath1169.94011OpenAlexW2147584576MaRDI QIDQ1007253

Yunlei Zhao, Andrew Chi-Chih Yao, Frances F. Yao

Publication date: 20 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.027

zbMATH Keywords

cryptographic protocolsproof of knowledgezero-knowledgeuniversal composabilitycommon reference string

Mathematics Subject Classification ID

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

Related Items (1)

A second note on the feasibility of generalized universal composability

Cites Work

• Bit commitment using pseudorandomness
• Efficient signature generation by smart cards
• Parallel coin-tossing and constant-round secure two-party computation
• Composition of secure multi-party protocols. A comprehensive study.
• Strengthening zero-knowledge protocols using signatures
• Universally composable two-party and multi-party secure computation
• Universally Composable Security with Global Setup
• A Pseudorandom Generator from any One-way Function
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• The knowledge complexity of interactive proof-systems
• Nonmalleable Cryptography
• A Note on the Feasibility of Generalized Universal Composability
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on universal composable zero-knowledge in the common reference string model