Obfuscation-based non-black-box extraction and constant-round zero-knowledge arguments of knowledge

DOI10.1007/978-3-319-13257-0_8MaRDI QIDQ3449181zbMATH OpenOpenAlexFDO

Authors Ning Ding

Publication date 3 November 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13257-0_8

zbMATH Keywords

cryptographic protocolszero-knowledgeproofs of knowledgediffering-input obfuscation

Mathematics Subject Classification ID

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

Recommendations

• On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
• Four-round zero-knowledge arguments of knowledge with strict polynomial-time simulation from differing-input obfuscation for circuits
• Strict Polynomial-Time in Simulation and Extraction
• Three-round public-coin bounded-auxiliary-input zero-knowledge arguments of knowledge
• Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP

Cited in

(7)

• Strict Polynomial-Time in Simulation and Extraction
• Point obfuscation and 3-round zero-knowledge
• Efficient NIZK arguments with straight-line simulation and extraction
• On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
• Three-round public-coin bounded-auxiliary-input zero-knowledge arguments of knowledge
• Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
• Four-round zero-knowledge arguments of knowledge with strict polynomial-time simulation from differing-input obfuscation for circuits

This page was built for publication: Obfuscation-based non-black-box extraction and constant-round zero-knowledge arguments of knowledge

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