scientific article; zbMATH DE number 1361466

MaRDI QIDQ4699284zbMATH OpenFDO

Authors Cynthia Dwork

Publication date 10 November 1999

zbMATH Keywords

cryptographydigital signatureshash functionslatticespseudo-random bit generatorspublic key cryptosystems

Mathematics Subject Classification ID

Relations with coding theory (11H71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• New lattice based cryptographic constructions
• scientific article; zbMATH DE number 1852142
• Computational aspects of lattices and their cryptographic applications
• Cryptographic functions from worst-case complexity assumptions
• New lattice-based cryptographic constructions

Cited in

(14)

• Segment LLL reduction of lattice bases using modular arithmetic
• A pseudorandom number generator based on worst-case lattice problems
• Circuit complexity of linear functions: gate elimination and feeble security
• Magnifying computing gaps. Establishing encrypted communication over unidirectional channels
• Gate elimination for linear functions and new feebly secure constructions
• Algebraic cryptography: new constructions and their security against provable break
• The geometry of lattice cryptography
• Cryptographic protocols from lattices (abstract)
• Computational aspects of lattices and their cryptographic applications
• The geometry of provable security: some proofs of security in which lattices make a surprise appearance
• Cryptographic functions from worst-case complexity assumptions
• Expressive Cryptography: Lattice Perspectives
• Public-key cryptosystems and signature schemes from \(p\)-adic lattices
• On the properties of reduced basis related to lattice-reduced algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4699284)