scientific article; zbMATH DE number 1559561

MaRDI QIDQ4527013zbMATH OpenFDO

Authors Daniele Micciancio

Publication date 28 February 2001

zbMATH Keywords

cryptographyoblivious data structure

Mathematics Subject Classification ID

Data structures (68P05) Data encryption (aspects in computer science) (68P25)

Recommendations

• Data-oblivious data structures
• Lower bounds for oblivious data structures
• Oblivious RAM Revisited
• Anti-persistence
• Oblivious signatures

Cited in

(17)

• Analysis and improvement of an authentication scheme in incremental cryptography
• Incremental deterministic public-key encryption
• Formalizing data deletion in the context of the right to be forgotten
• Incremental cryptography revisited: PRFs, nonces and modular design
• Efficient sampling of non-strict turnstile data streams
• Lower and upper bounds on obtaining history independence
• Oblivious PRF on committed vector inputs and application to deduplication of encrypted data
• Data-oblivious data structures
• scientific article; zbMATH DE number 2085442 (Why is no real title available?)
• A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
• Lower bounds for oblivious data structures
• Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
• Cryptography with updates
• IQRA: Incremental Quadratic Re-keying friendly Authentication scheme
• Online list labeling: breaking the ^2n barrier
• History-independent concurrent objects
• ProxCode: efficient proximity searchable encryption from error correcting codes

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 Q4527013)