Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
From MaRDI portal
Recommendations
Cited in
(83)- Fiat-Shamir for highly sound protocols is instantiable
- 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
- 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
- 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)
- Cryptographic reverse firewalls for interactive proof systems
- Efficient fully structure-preserving signatures and shrinking commitments
- Naor-Yung paradigm with shared randomness and applications
- Novel \(\Omega\)-protocols for NP
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Practical dynamic group signatures without knowledge extractors
- Naor-Yung Paradigm with Shared Randomness and Applications
- Fiat-Shamir for highly sound protocols is instantiable
- Interactive oracle proofs
- 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
- Group signatures with decentralized tracing
- An efficient and secure two-flow zero-knowledge identification protocol
- Sublinear zero-knowledge arguments for RAM programs
- Fast secure two-party ECDSA signing
- Extended security arguments for signature schemes
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- 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 -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
- Adaptive proofs have straightline extractors (in the random oracle model)
- Practical round-optimal blind signatures in the ROM from standard assumptions
- A generic construction of an anonymous reputation system and instantiations from lattices
- McFly: verifiable encryption to the future made practical
- From polynomial IOP and commitments to non-malleable zkSNARKs
- 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 -protocols
- An improved threshold homomorphic cryptosystem based on class groups
- Cryptographic reverse firewalls for interactive proof systems
- Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
- Adaptive UC NIZK for practical applications
- Universally composable SNARKs with transparent setup without programmable random oracle
- Straight-line knowledge extraction for multi-round protocols
- On the adaptive security of FROST
- Multi-Holder anonymous credentials from BBS signatures
- Server-aided anonymous credentials
- Towards a white-box secure Fiat-Shamir transformation
- How to construct public timeline for RSA-formed time-lock cryptography
- An improved threshold homomorphic cryptosystem based on class groups
- Arctic: lightweight and stateless threshold Schnorr signatures
- OCash: fully anonymous payments between blockchain light clients
- Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
- zkSNARKs in the ROM with unconditional UC-security
- Practical blind signatures in pairing-free groups
- Updatable privacy-preserving blueprints
- Interactive threshold mercurial signatures and applications
- Enhancing threshold group action signature schemes: adaptive security and scalability improvements
- Fully dynamic group signatures from subset difference methods under simple assumptions
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
- Adaptively-secure three-round threshold Schnorr from DL
- Putting multi into multi-signatures: tight security for multiple signers
- Two-factor authentication can harden servers against offline password search
- OneTwoPAKE: two-round strong asymmetric PAKE with ideal security
- Malicious private set union with two-sided output
- Feldman's verifiable secret sharing for a dishonest majority
- Simple three-round multiparty Schnorr signing with full simulatability
- EPID with malicious revocation
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
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)
