Novel \(\Omega\)-protocols for NP

DOI10.1007/S11432-008-0004-6zbMath1142.68030OpenAlexW2074624500MaRDI QIDQ2480118

Yi Deng, Dong-Dai Lin

Publication date: 31 March 2008

Published in: Science in China. Series F (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11432-008-0004-6

zbMATH Keywords

Hamiltonian cycleconcurrent zero knowledge\(\Omega\)-protocols\(\Sigma\)-protocols

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• New and improved constructions of non-malleable cryptographic protocols
• The Notion of Security for Probabilistic Cryptosystems
• The Knowledge Complexity of Interactive Proof Systems
• Foundations of Cryptography
• Nonmalleable Cryptography
• Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
• Advances in Cryptology – CRYPTO 2004
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors

This page was built for publication: Novel \(\Omega\)-protocols for NP