BLISS

swMATH2301MaRDI QIDQ14842

No author found.

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

Related Items (42)

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

This page was built for software: BLISS