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

DOI10.1016/J.TCS.2008.10.027MaRDI QIDQ1007253zbMATH OpenOpenAlexFDO

Authors 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

proof of knowledgecryptographic protocolszero-knowledgeuniversal composabilitycommon reference string

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 4037759 (Why is no real title available?)
• scientific article; zbMATH DE number 4101089 (Why is no real title available?)
• scientific article; zbMATH DE number 708820 (Why is no real title available?)
• scientific article; zbMATH DE number 1162684 (Why is no real title available?)
• scientific article; zbMATH DE number 2009949 (Why is no real title available?)
• scientific article; zbMATH DE number 2009957 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• A Note on the Feasibility of Generalized Universal Composability
• A Pseudorandom Generator from any One-way Function
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - CRYPTO 2003
• Bit commitment using pseudorandomness
• Composition of secure multi-party protocols. A comprehensive study.
• Efficient concurrent zero-knowledge in the auxiliary string model
• Efficient signature generation by smart cards
• Foundations of Cryptography
• Nonmalleable Cryptography
• Parallel coin-tossing and constant-round secure two-party computation
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Strengthening zero-knowledge protocols using signatures
• The knowledge complexity of interactive proof-systems
• Theory of Cryptography
• Universally Composable Security with Global Setup
• Universally composable two-party and multi-party secure computation

Cited in

(5)

• 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 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

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)