Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge

DOI10.1007/978-3-030-92068-5_21MaRDI QIDQ6045075zbMATH OpenOpenAlexFDO

Authors Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac

Publication date 26 May 2023

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

Full work available at URL https://doi.org/10.1007/978-3-030-92068-5_21

zbMATH Keywords

extractable one-way functionpublic image verification algorithm

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the existence of extractable one-way functions
• Weakly extractable one-way functions
• On subversion-resistant SNARKs
• Extractable Perfectly One-Way Functions

Cites work

• scientific article; zbMATH DE number 1670844 (Why is no real title available?)
• scientific article; zbMATH DE number 1722682 (Why is no real title available?)
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 176566 (Why is no real title available?)
• scientific article; zbMATH DE number 708820 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• A non-interactive shuffle argument with low trust assumptions
• A subversion-resistant SNARK
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - EUROCRYPT 2004
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Cliptography: clipping the power of kleptographic attacks
• Computationally Sound Proofs
• Definitions and properties of zero-knowledge proof systems
• Exploring constructions of compact NIZKs from various assumptions
• Extractable Perfectly One-Way Functions
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• How to delegate computations
• How to delegate computations publicly
• Limits of extractability assumptions with distributional auxiliary input
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• Non-interactive Zaps and New Techniques for NIZK
• Non-interactive zaps of knowledge
• On QA-NIZK in the BPK model
• On Robust Combiners for Oblivious Transfer and Other Primitives
• On Signatures of Knowledge
• On the existence of extractable one-way functions
• On the size of pairing-based non-interactive arguments
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Quadratic span programs and succinct NIZKs without PCPs
• Resettable zero-knowledge (extended abstract)
• Robust Multi-property Combiners for Hash Functions Revisited
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Short pairing-based non-interactive zero-knowledge arguments
• Short signatures from the Weil pairing
• Shorter quasi-adaptive NIZK proofs for linear subspaces
• Square span programs with applications to succinct NIZK arguments
• Statistical ZAP arguments
• Statistical ZAPR arguments from bilinear maps
• Statistical Zaps and new oblivious transfer protocols
• Subversion-zero-knowledge SNARKs
• The hunting of the SNARK
• The knowledge complexity of interactive proof-systems
• Trapdoors for hard lattices and new cryptographic constructions
• Updatable and universal common reference strings with applications to zk-SNARKs
• ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation

This page was built for publication: Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge

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