Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
From MaRDI portal
Publication:5451024
DOI10.1007/11535218_10zbMATH Open1145.94467OpenAlexW1505345253MaRDI QIDQ5451024FDOQ5451024
Authors: Marc Fischlin 
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
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)
Cited In (55)
- Foundations of adaptor signatures
- Approximate lower bound arguments
- Sometimes you can't distribute random-oracle-based proofs
- Secure multiparty computation with identifiable abort via vindicating release
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
- An improved threshold homomorphic cryptosystem based on class groups
- EPID with malicious revocation
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
- A generic construction of an anonymous reputation system and instantiations from lattices
- Practical round-optimal blind signatures in the ROM from standard assumptions
- Efficient NIZKs and signatures from commit-and-open protocols in the QROM
- McFly: verifiable encryption to the future made practical
- From polynomial IOP and commitments to non-malleable zkSNARKs
- Group Signatures with Decentralized Tracing
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- Fiat–Shamir for Highly Sound Protocols Is Instantiable
- Efficient NIZK arguments with straight-line simulation and extraction
- An efficient and secure two-flow zero-knowledge identification protocol
- Fiat-Shamir for highly sound protocols is instantiable
- An efficient and generic construction for signal's handshake (X3DH): post-quantum, state leakage secure, and deniable
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
- Composition with knowledge assumptions
- Endemic oblivious transfer via random oracles, revisited
- Privacy-preserving blueprints
- Witness-succinct universally-composable SNARKs
- Cryptographic reverse firewalls for interactive proof systems
- Improved straight-line extraction in the random oracle model with applications to signature aggregation
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Novel \(\Omega\)-protocols for NP
- Fully adaptive Schnorr threshold signatures
- Secure multiparty computation from threshold encryption based on class groups
- Threshold ring signatures: new definitions and post-quantum security
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Unclonable Group Identification
- Fast secure two-party ECDSA signing
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Revisiting BBS signatures
- Non-interactive composition of sigma-protocols via Share-then-Hash
- An efficient and generic construction for Signal's handshake (X3DH): post-quantum, state leakage secure, and deniable
- Two-party adaptor signatures from identification schemes
- Extended security arguments for signature schemes
- Naor-Yung paradigm with shared randomness and applications
- Universally composable \(\varSigma \)-protocols in the global random-oracle model
- Interactive Oracle Proofs
- Generalized channels from limited blockchain scripts and adaptor signatures
- Practical dynamic group signatures without knowledge extractors
- Sublinear Zero-Knowledge Arguments for RAM Programs
- Naor-Yung Paradigm with Shared Randomness and Applications
- Efficient fully structure-preserving signatures and shrinking commitments
- A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor
- Efficient ECDSA-based adaptor signature for batched atomic swaps
- Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model)
- Unlinkable Randomizable Signature and Its Application in Group Signature
This page was built for publication: Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451024)
