Novel -protocols for NP

DOI10.1007/S11432-008-0004-6zbMATH Open1142.68030OpenAlexW2074624500MaRDI QIDQ2480118FDOQ2480118

Authors: Yi Deng, Dongdai 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

Recommendations

• A one-round, two-prover, zero-knowledge protocol for NP
• Relativistic (or 2-prover 1-round) zero-knowledge protocol for \(\mathsf {NP}\) secure against quantum adversaries
• Round-optimal zero-knowledge proofs of knowledge for NP
• scientific article; zbMATH DE number 94166
• Improved OR-composition of sigma-protocols

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

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

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