The algebraic group model and its applications
From MaRDI portal
(Redirected from Publication:1784081)
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)- Pairing-free blind signatures from CDH assumptions
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- On the classification of knowledge-of-exponent assumptions in cyclic groups
- On pairing-free blind signature schemes in the algebraic group model
- An analysis of the algebraic group model
- Accountability for misbehavior in threshold decryption via threshold traitor tracing
- Adaptively secure 5 round threshold signatures from \textsf{MLWE}/\textsf{MSIS} and \textsf{DL} with rewinding
- Generic and algebraic computation models: when AGM proofs transfer to the GGM
- FRIDA: data availability sampling from FRI
- Limits on the power of prime-order groups: separating Q-type from static assumptions
- Oblivious issuance of proofs
- Two-round threshold signature from algebraic one-more learning with errors
- Fiat-Shamir bulletproofs are non-malleable (in the Random Oracle Model)
- Fine-grained secure attribute-based encryption
- Fine-grained secure attribute-based encryption
- On time-lock cryptographic assumptions in abelian hidden-order groups
- Polymath: Groth16 is not the limit
- Efficient universally-verifiable electronic voting with everlasting privacy
- 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
- Half-aggregation of Schnorr signatures with tight reductions
- Revisiting the Uber assumption in the algebraic group model: fine-grained bounds in hidden-order groups and improved reductions in bilinear groups
- One-more unforgeability of blind ECDSA
- Non-malleable time-lock puzzles and applications
- A tightly secure ID-based signature scheme under DL assumption in AGM
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Automated analysis of cryptographic assumptions in generic group models
- An algebraic framework for Diffie-Hellman assumptions
- A classification of computational assumptions in the algebraic group model
- On instantiating the algebraic group model from falsifiable assumptions
- Generic models for group actions
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
- To label, or not to label (in generic groups)
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
- 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
- MuSig2: simple two-round Schnorr multi-signatures
- NIWI and new notions of extraction for algebraic languages
- Non-interactive Mimblewimble transactions, revisited
- A unified framework for non-universal SNARKs
- 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
- 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
- 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
- scientific article; zbMATH DE number 1263606 (Why is no real title available?)
- Snarky ceremonies
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
- From polynomial IOP and commitments to non-malleable zkSNARKs
- Non-malleable codes for bounded parallel-time tampering
- Tight state-restoration soundness in the algebraic group model
- 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
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- Pointcheval-Sanders signature-based synchronized aggregate signature
- Smooth zero-knowledge hash functions
- Practical and efficient FHE-based MPC
- CRS-updatable asymmetric quasi-adaptive NIZK arguments
- Beyond Uber: instantiating generic groups via PGGs
- 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?
- PointProofs, revisited
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- Spartan and bulletproofs are simulation-extractable (for free!)
- Witness-succinct universally-composable SNARKs
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
- \(\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
- On QA-NIZK in the BPK model
- On subversion-resistant SNARKs
- Linear-map vector commitments and their practical applications
- \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
- 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
- Tracing a linear subspace: application to linearly-homomorphic group signatures
- Algebraic reductions of knowledge
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
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)
