Efficient laconic cryptography from learning with errors (Q6063527): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laconic private set intersection and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular and KDM Security for Identity-Based Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards classical hardness of module-LWE: the linear rank case / rank
 
Normal rank
Property / cites work
 
Property / cites work: FHE Circuit Privacy Almost for Free / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Tightly Secure Lattice Short Signature and Id-Based Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of LWE on general entropic distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymous IBE, leakage resilience and circular security from new assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bonsai Trees, or How to Delegate a Lattice Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laconic oblivious transfer and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: From selective IBE to full IBE and selective HIBE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identity-based encryption from the Diffie-Hellman assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: New constructions of identity-based and key-dependent message secure encryption schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoor hash functions and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoor functions from the computational Diffie-Hellman assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Registration-based encryption: removing private-key generator from IBE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Registration-based encryption from standard assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively secure garbling with near optimal online complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-round multiparty secure computation from minimal assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collision-Free Hashing from Lattice Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifiable registration-based encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-Deniable Public-Key Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient and Parallel Gaussian Sampler for Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank

Latest revision as of 11:53, 21 August 2024

scientific article; zbMATH DE number 7776109
Language Label Description Also known as
English
Efficient laconic cryptography from learning with errors
scientific article; zbMATH DE number 7776109

    Statements

    Efficient laconic cryptography from learning with errors (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 December 2023
    0 references
    learning with errors
    0 references
    laconic cryptography primitives
    0 references
    0 references
    0 references

    Identifiers