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

DOI10.1016/J.TCS.2008.10.027zbMATH Open1169.94011OpenAlexW2147584576MaRDI QIDQ1007253FDOQ1007253

Andrew Chi-Chih Yao, Yunlei Zhao, 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

proof of knowledgecryptographic protocolszero-knowledgeuniversal composabilitycommon reference string

Mathematics Subject Classification ID

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

Cites Work

• 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
• Bit commitment using pseudorandomness
• Efficient signature generation by smart cards
• Parallel coin-tossing and constant-round secure two-party computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Foundations of Cryptography
• The knowledge complexity of interactive proof-systems
• Title not available (Why is that?)
• Nonmalleable Cryptography
• Title not available (Why is that?)
• Advances in Cryptology - CRYPTO 2003
• Composition of secure multi-party protocols. A comprehensive study.
• Universally composable two-party and multi-party secure computation
• Universally Composable Security with Global Setup
• Title not available (Why is that?)
• Theory of Cryptography
• Strengthening zero-knowledge protocols using signatures
• Title not available (Why is that?)
• Advances in Cryptology - CRYPTO 2003
• Title not available (Why is that?)
• A Note on the Feasibility of Generalized Universal Composability

Cited In (3)

• On black-box complexity of universally composable security in the CRS model
• On Black-Box Complexity of Universally Composable Security in the CRS Model
• A second note on the feasibility of generalized universal composability

   Recommendations

• A Note on Universal Composable Zero Knowledge in Common Reference String Model 👍 👎
• Advances in Cryptology - CRYPTO 2003 👍 👎
• A second note on the feasibility of generalized universal composability 👍 👎
• Universally Composable Multi-party Computation with an Unreliable Common Reference String 👍 👎
• On black-box complexity of universally composable security in the CRS model 👍 👎

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

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