Pages that link to "Item:Q2845659"
From MaRDI portal
The following pages link to Lattice Signatures and Bimodal Gaussians (Q2845659):
Displaying 39 items.
- Analyzing the Shuffling Side-Channel Countermeasure for Lattice-Based Signatures (Q3179483) (← links)
- Computational quantum key distribution (CQKD) on decentralized ledger and blockchain (Q5034980) (← links)
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (Q5041172) (← links)
- Isochronous Gaussian Sampling: From Inception to Implementation (Q5041213) (← links)
- Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment (Q5041225) (← links)
- COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers (Q5041226) (← links)
- Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security (Q5048972) (← links)
- Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite (Q5056039) (← links)
- Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography (Q5086199) (← links)
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm (Q5101024) (← links)
- Revisiting Lattice Attacks on Overstretched NTRU Parameters (Q5738868) (← links)
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies (Q5854432) (← links)
- Learning strikes again: the case of the DRS signature scheme (Q5918281) (← links)
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918439) (← links)
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918662) (← links)
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations (Q6041285) (← links)
- A lightweight identification protocol based on lattices (Q6091129) (← links)
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general (Q6104329) (← links)
- Shorter hash-and-sign lattice-based signatures (Q6104336) (← links)
- SETLA: Signature and Encryption from Lattices (Q6104628) (← links)
- A polynomial time algorithm for breaking NTRU encryption with multiple keys (Q6109713) (← links)
- Lattice-based signatures with tight adaptive corruptions and more (Q6113962) (← links)
- On rejection sampling in Lyubashevsky's signature scheme (Q6133962) (← links)
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple (Q6133964) (← links)
- BLOOM: bimodal lattice one-out-of-many proofs and applications (Q6133965) (← links)
- A new lattice-based online/offline signatures framework for low-power devices (Q6159029) (← links)
- Lattice-based inner product argument (Q6160829) (← links)
- Lattice-based programmable hash functions and applications (Q6182001) (← links)
- Masking the GLP lattice-based signature scheme at any order (Q6182002) (← links)
- Quantum-Resistant 1-out-of-N Oblivious Signatures from Lattices (Q6487417) (← links)
- An identity-based blind signature scheme using lattice with provable security (Q6534733) (← links)
- Security evaluation on KpqC round 1 lattice-based algorithms using lattice estimator (Q6547909) (← links)
- G+G: a Fiat-Shamir lattice signature based on convolved Gaussians (Q6595915) (← links)
- Memory-efficient attacks on small LWE keys (Q6604868) (← links)
- Memory-efficient attacks on small LWE keys (Q6617636) (← links)
- Profiling side-channel attacks on Dilithium. A small bit-fiddling leak breaks it all (Q6619833) (← links)
- Lattice-based threshold, accountable, and private signature (Q6636114) (← links)
- Polytopes in the Fiat-Shamir with aborts paradigm (Q6648197) (← links)
- A new R-LWE based digital signature scheme (Q6665869) (← links)
