The algebraic group model and its applications
From MaRDI portal
Publication:1784081
DOI10.1007/978-3-319-96881-0_2zbMATH Open1430.94068OpenAlexW2884510571MaRDI QIDQ1784081FDOQ1784081
Authors: Georg Fuchsbauer, Eike Kiltz, Julian Loss 
Publication date: 26 September 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-96881-0_2
Recommendations
- On instantiating the algebraic group model from falsifiable assumptions
- An analysis of the algebraic group model
- The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
- Tight reductions for Diffie-Hellman variants in the algebraic group model
- On the Equivalence of Generic Group Models
Cited In (only showing first 100 items - show all)
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- A unified framework for non-universal SNARKs
- MuSig2: simple two-round Schnorr multi-signatures
- The price of verifiability: lower bounds for verifiable random functions
- Memory-tight multi-challenge security of public-key encryption
- Algebraic distinguishers: from discrete logarithms to decisional Uber assumptions
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- An algebraic framework for universal and updatable SNARKs
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- Two-round trip Schnorr multi-signatures via delinearized witnesses
- Title not available (Why is that?)
- Snarky ceremonies
- Non-malleable codes for bounded parallel-time tampering
- Tight state-restoration soundness in the algebraic group model
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Smooth zero-knowledge hash functions
- Pointcheval-Sanders signature-based synchronized aggregate signature
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- Proofs for inner pairing products and applications
- Composition with knowledge assumptions
- Another look at extraction and randomization of Groth's zk-SNARK
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- On QA-NIZK in the BPK model
- Linear-map vector commitments and their practical applications
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
- On subversion-resistant SNARKs
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
- The algebra of marriage: an episode in applied group theory
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Optimal tightness for chain-based unique signatures
- Short pairing-free blind signatures with exponential security
- Everybody's a target: scalability in public-key encryption
- On the memory-tightness of hashed ElGamal
- A fast and simple partially oblivious PRF, with applications
- Tight reductions for Diffie-Hellman variants in the algebraic group model
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- An analysis of the algebraic group model
- Fine-grained secure attribute-based encryption
- Fine-grained secure attribute-based encryption
- Automated analysis of cryptographic assumptions in generic group models
- Succinct functional commitment for a large class of arithmetic circuits
- Practical dynamic group signatures without knowledge extractors
- One-more unforgeability of blind ECDSA
- Non-malleable time-lock puzzles and applications
- Automated analysis of cryptographic assumptions in generic group models
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- An algebraic framework for Diffie-Hellman assumptions
- Generic models for group actions
- A classification of computational assumptions in the algebraic group model
- On instantiating the algebraic group model from falsifiable assumptions
- To label, or not to label (in generic groups)
- NIWI and new notions of extraction for algebraic languages
- Non-interactive Mimblewimble transactions, revisited
- Fine-grained non-interactive key-exchange: constructions and lower bounds
- An efficient strong asymmetric PAKE compiler instantiable from group actions
- On black-box knowledge-sound commit-and-prove SNARKs
- Predicate aggregate signatures and applications
- Threshold structure-preserving signatures
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \(\Sigma\)-protocols
- Bicorn: an optimistically efficient distributed randomness beacon
- Rogue-instance security for batch knowledge proofs
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
- From polynomial IOP and commitments to non-malleable zkSNARKs
- Algebraic group model with oblivious sampling
- Limits in the provable security of ECDSA signatures
- The One-More Discrete Logarithm Assumption in the Generic Group Model
- Plumo: an ultralight blockchain client
- Practical and efficient FHE-based MPC
- CRS-updatable asymmetric quasi-adaptive NIZK arguments
- Beyond Uber: instantiating generic groups via PGGs
- PointProofs, revisited
- Spartan and bulletproofs are simulation-extractable (for free!)
- Witness-succinct universally-composable SNARKs
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Algebraic adversaries in the universal composability framework
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- Fully adaptive Schnorr threshold signatures
- Practical Schnorr threshold signatures without the algebraic group model
- Snowblind: a threshold blind signature in pairing-free groups
- Towards zero knowledge argument for double discrete logarithm with constant cost
- Algebraic reductions of knowledge
- Tracing a linear subspace: application to linearly-homomorphic group signatures
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
- Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Vector commitments with proofs of smallness: short range proofs and more
- Witness encryption for succinct functional commitments and applications
- Rai-Choo! Evolving blind signatures to the next level
- Revisiting BBS signatures
- Threshold and multi-signature schemes from linear hash functions
- Chain Reductions for Multi-signatures and the HBMS Scheme
- PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more
- Concurrently secure blind Schnorr signatures
This page was built for publication: The algebraic group model and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784081)
