A note on the feasibility of generalised universal composability

DOI10.1017/S0960129508007330zbMath1156.94401MaRDI QIDQ3616225

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

Publication date: 24 March 2009

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

A second note on the feasibility of generalized universal composability

Cites Work

• Bit commitment using pseudorandomness
• 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
• A Note on Universal Composable Zero Knowledge in Common Reference String Model

This page was built for publication: A note on the feasibility of generalised universal composability