Pages that link to "Item:Q3650716"
From MaRDI portal
The following pages link to Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures (Q3650716):
Displaying 50 items.
- Policy-based signature scheme from lattices (Q306050) (← links)
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device (Q742507) (← links)
- Lattice-based proof of shuffle and applications to electronic voting (Q826259) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
- Efficient lattice-based polynomial evaluation and batch ZK arguments (Q832321) (← links)
- LWE without modular reduction and improved side-channel attacks against BLISS (Q1633471) (← links)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures (Q1698622) (← links)
- Public key compression for constrained linear signature schemes (Q1726681) (← links)
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices (Q2009415) (← links)
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes (Q2055644) (← links)
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices (Q2055645) (← links)
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes (Q2055652) (← links)
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes (Q2055683) (← links)
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512 (Q2055690) (← links)
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme (Q2056805) (← links)
- Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
- A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
- Practical product proofs for lattice commitments (Q2096537) (← links)
- Lattice-based blind signatures, revisited (Q2096538) (← links)
- Verifying post-quantum signatures in 8 kB of RAM (Q2118545) (← links)
- On removing rejection conditions in practical lattice-based signatures (Q2118558) (← links)
- DualRing: generic construction of ring signatures with efficient instantiations (Q2120078) (← links)
- A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs (Q2128576) (← links)
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions (Q2128577) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- Practical post-quantum few-time verifiable random function with applications to Algorand (Q2147263) (← links)
- Cryptanalysis of the rank preserving signature (Q2149784) (← links)
- BlindOR: an efficient lattice-based blind signature scheme from OR-proofs (Q2149816) (← links)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme (Q2168799) (← links)
- Practical non-interactive publicly verifiable secret sharing with thousands of parties (Q2170010) (← links)
- A signature scheme from the finite field isomorphism problem (Q2191202) (← links)
- The lattice-based digital signature scheme qTESLA (Q2229291) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Modular lattice signatures, revisited (Q2302153) (← links)
- Lattice-based revocable certificateless signature (Q2333434) (← links)
- Naor-Yung paradigm with shared randomness and applications (Q2401764) (← links)
- Asymptotically efficient lattice-based digital signatures (Q2413615) (← links)
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings (Q2692384) (← links)
- Cryptographic group actions and applications (Q2692390) (← links)
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices (Q2692392) (← links)
- Identification scheme and forward-secure signature in identity-based setting from isogenies (Q2697929) (← links)
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature (Q2698345) (← links)
- Secret handshakes: full dynamicity, deniability and lattice-based design (Q2699945) (← links)
- How to Prove Knowledge of Small Secrets (Q2829957) (← links)
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings (Q2953777) (← links)
