Theory of Cryptography

DOI10.1007/11681878MaRDI QIDQ5898367zbMATH OpenOpenAlexFDO

Authors Hoeteck Wee

Publication date 12 February 2007

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

Full work available at URL https://doi.org/10.1007/11681878

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Automata, Languages and Programming
• Succinct NP Proofs from an Extractability Assumption
• Polylogarithmic two-round argument systems
• Universal Arguments and their Applications
• Are PCPs inherent in efficient arguments?

Cited in

(11)

• On building fine-grained one-way functions from strong average-case hardness
• How to find a battleship
• The Complexity of Zero Knowledge
• Composition Implies Adaptive Security in Minicrypt
• On building fine-grained one-way functions from strong average-case hardness
• On witness encryption and laconic zero-knowledge arguments
• Succinct NP Proofs from an Extractability Assumption
• Capturing one-way functions via NP-hardness of meta-complexity
• Constant-round arguments for batch-verification and bounded-space computations from one-way functions
• NIZK from SNARGs
• Polylogarithmic two-round argument systems

This page was built for publication: Theory of Cryptography

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