Symbolic encryption with pseudorandom keys

DOI10.1007/978-3-030-17659-4_3MaRDI QIDQ2292686zbMATH OpenOpenAlexFDO

Authors Daniele Micciancio

Publication date 4 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17659-4_3

zbMATH Keywords

completenesscomputational soundnessgreatest fixed pointsinformation leakagepseudorandom generatorssymbolic security

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On pseudorandom encodings
• Explicit randomness is not necessary when modeling probabilistic encryption
• A note on computational indistinguishability
• Linicrypt: a model for practical cryptography
• scientific article; zbMATH DE number 2086702

Cited in

(3)

• Linicrypt: a model for practical cryptography
• Explicit randomness is not necessary when modeling probabilistic encryption
• Circular insecure encryption: from long cycles to short cycles

This page was built for publication: Symbolic encryption with pseudorandom keys

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