Pages that link to "Item:Q1784081"
From MaRDI portal
The following pages link to The algebraic group model and its applications (Q1784081):
Displaying 50 items.
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures (Q826296) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
- Everybody's a target: scalability in public-key encryption (Q2055664) (← links)
- A classification of computational assumptions in the algebraic group model (Q2096519) (← links)
- A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions (Q2102077) (← links)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
- On the memory-tightness of hashed ElGamal (Q2119004) (← links)
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model (Q2119006) (← links)
- On instantiating the algebraic group model from falsifiable assumptions (Q2119007) (← links)
- Two-round trip Schnorr multi-signatures via delinearized witnesses (Q2120071) (← links)
- MuSig2: simple two-round Schnorr multi-signatures (Q2120074) (← links)
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols (Q2120075) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- An algebraic framework for universal and updatable SNARKs (Q2120103) (← links)
- Tight state-restoration soundness in the algebraic group model (Q2128989) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- Fine-grained secure attribute-based encryption (Q2139633) (← links)
- Composition with knowledge assumptions (Q2139641) (← links)
- Another look at extraction and randomization of Groth's zk-SNARK (Q2145409) (← links)
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) (Q2148748) (← links)
- One-more unforgeability of blind ECDSA (Q2148761) (← links)
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs (Q2149845) (← links)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) (Q2170055) (← links)
- Optimal tightness for chain-based unique signatures (Q2170062) (← links)
- A fast and simple partially oblivious PRF, with applications (Q2170066) (← links)
- Short pairing-free blind signatures with exponential security (Q2170071) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- Practical dynamic group signatures without knowledge extractors (Q2692957) (← links)
- Non-malleable time-lock puzzles and applications (Q2697901) (← links)
- Updateable Inner Product Argument with Logarithmic Verifier and Applications (Q5041169) (← links)
- On QA-NIZK in the BPK Model (Q5041171) (← links)
- A Unified Framework for Non-universal SNARKs (Q5087272) (← links)
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
- Fine-grained secure attribute-based encryption (Q6176273) (← links)
- A tightly secure ID-based signature scheme under DL assumption in AGM (Q6535485) (← links)
- On black-box knowledge-sound commit-and-prove SNARKs (Q6562559) (← links)
- Predicate aggregate signatures and applications (Q6562570) (← links)
- Threshold structure-preserving signatures (Q6562572) (← links)
- An efficient strong asymmetric PAKE compiler instantiable from group actions (Q6562584) (← links)
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \(\Sigma\)-protocols (Q6570528) (← links)
- Bicorn: an optimistically efficient distributed randomness beacon (Q6573968) (← links)
- Rogue-instance security for batch knowledge proofs (Q6581786) (← links)
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing (Q6582221) (← links)
- From polynomial IOP and commitments to non-malleable zkSNARKs (Q6582227) (← links)
- Limits in the provable security of ECDSA signatures (Q6587956) (← links)
- Algebraic group model with oblivious sampling (Q6587960) (← links)
