Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
From MaRDI portal
Publication:5451024
DOI10.1007/11535218_10zbMath1145.94467OpenAlexW1505345253MaRDI QIDQ5451024
Publication date: 17 March 2008
Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11535218_10
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)
Related Items (44)
EPID with malicious revocation ⋮ Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures ⋮ Group Signatures with Decentralized Tracing ⋮ A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs ⋮ An efficient and generic construction for signal's handshake (X3DH): post-quantum, state leakage secure, and deniable ⋮ Composition with knowledge assumptions ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Interactive Oracle Proofs ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) ⋮ Witness-succinct universally-composable SNARKs ⋮ Privacy-preserving blueprints ⋮ Revisiting BBS signatures ⋮ Efficient NIZKs and signatures from commit-and-open protocols in the QROM ⋮ Efficient ECDSA-based adaptor signature for batched atomic swaps ⋮ Improved straight-line extraction in the random oracle model with applications to signature aggregation ⋮ What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? ⋮ Generalized channels from limited blockchain scripts and adaptor signatures ⋮ Efficient NIZK arguments with straight-line simulation and extraction ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ Endemic oblivious transfer via random oracles, revisited ⋮ Secure multiparty computation from threshold encryption based on class groups ⋮ Fully adaptive Schnorr threshold signatures ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Practical dynamic group signatures without knowledge extractors ⋮ Cryptographic reverse firewalls for interactive proof systems ⋮ Novel \(\Omega\)-protocols for NP ⋮ Sublinear Zero-Knowledge Arguments for RAM Programs ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Unclonable Group Identification ⋮ A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor ⋮ Unlinkable Randomizable Signature and Its Application in Group Signature ⋮ An efficient and secure two-flow zero-knowledge identification protocol ⋮ Fast secure two-party ECDSA signing ⋮ Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model ⋮ Extended security arguments for signature schemes ⋮ Threshold ring signatures: new definitions and post-quantum security ⋮ Two-party adaptor signatures from identification schemes ⋮ An efficient and generic construction for Signal's handshake (X3DH): post-quantum, state leakage secure, and deniable ⋮ Naor-Yung Paradigm with Shared Randomness and Applications ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ Efficient fully structure-preserving signatures and shrinking commitments
This page was built for publication: Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
