BLISS

swMATH2301MaRDI QIDQ14842FDOQ14842

Author name not available (Why is that?)

Source code repository: https://github.com/SRI-CSL/Bliss

Cited In (42)

• Finding shortest lattice vectors faster using quantum search
• An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice
• Efficient Nyberg-Rueppel type of NTRU digital signature algorithm
• Isochronous Gaussian Sampling: From Inception to Implementation
• On removing rejection conditions in practical lattice-based signatures
• Quantum key search for ternary LWE
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
• Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography
• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
• A constant-time sampling algorithm for binary Gaussian distribution over the integers
• Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment
• Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography
• How to meet ternary LWE keys
• Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite
• A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
• Policy-based signature scheme from lattices
• One bit is all it takes: a devastating timing attack on BLISS's non-constant time sign flips
• How to find ternary LWE keys using locality sensitive hashing
• Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
• From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures
• Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
• Post-Quantum Cryptography: State of the Art
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Learning strikes again: the case of the DRS signature scheme
• Computational quantum key distribution (CQKD) on decentralized ledger and blockchain
• \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
• An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems
• Modular lattice signatures, revisited
• Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security
• Naor-Yung paradigm with shared randomness and applications
• Duplication free public keys based on SIS-type problems
• Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
• A signature scheme from the finite field isomorphism problem
• Analyzing the Shuffling Side-Channel Countermeasure for Lattice-Based Signatures
• COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
• Asymptotically efficient lattice-based digital signatures
• Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
• Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
• The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs
• Lattice Signatures and Bimodal Gaussians
• On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers

This page was built for software: BLISS