Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More

DOI10.1007/978-3-030-90567-5_3MaRDI QIDQ6488375zbMATH OpenFDO

Authors Behzad Abdolmaleki, Daniel Slamanig

Publication date 13 April 2023

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Updatable Lossy Trapdoor Functions and Its Application in Continuous Leakage
• Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: the state of the art
• Zero-knowledge proofs from spLWE-based commitments
• Security of Keyed Sponge Constructions Using a Modular Proof Approach
• Advances in Cryptology – CRYPTO 2004
• Automata, Languages and Programming
• Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
• Updatable Zero-Knowledge Databases
• On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
• Updatable public key encryption in the standard model

Cites work

• A subversion-resistant SNARK
• An algebraic framework for Diffie-Hellman assumptions
• Compactly hiding linear spans. Tightly secure constant-size simulation-sound QA-NIZK proofs and applications
• Disjunctions for Hash Proof Systems: New Constructions and Applications
• Efficient Identity-Based Encryption Without Random Oracles
• Efficient Non-interactive Proof Systems for Bilinear Groups
• scientific article; zbMATH DE number 176566 (Why is no real title available?)
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
• Key-and-argument-updatable QA-NIZKs
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• New techniques for SPHFs and efficient one-round PAKE protocols
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• Non-malleability from malleability: simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures
• On QA-NIZK in the BPK model
• On the size of pairing-based non-interactive arguments
• Perfect Non-interactive Zero Knowledge for NP
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Quadratic span programs and succinct NIZKs without PCPs
• Quasi-adaptive NIZK for linear subspaces revisited
• Short pairing-based non-interactive zero-knowledge arguments
• Shorter quasi-adaptive NIZK proofs for linear subspaces
• Smooth Projective Hashing for Conditionally Extractable Commitments
• Square span programs with applications to succinct NIZK arguments
• Subversion-zero-knowledge SNARKs
• Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces
• The algebraic group model and its applications
• The Knowledge Complexity of Interactive Proof Systems
• UC-secure CRS generation for SNARKs
• Updatable and universal common reference strings with applications to zk-SNARKs
• Updateable Inner Product Argument with Logarithmic Verifier and Applications

Cited in

(3)

• Key-and-argument-updatable QA-NIZKs
• Updatable NIZKs from non-interactive zaps
• Updatable and universal common reference strings with applications to zk-SNARKs

This page was built for publication: Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More

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