Cryptographic Primitives Enforcing Communication and Storage Complexity

DOI10.1007/3-540-36504-4_9zbMATH Open1275.94029OpenAlexW2106747585MaRDI QIDQ2995366FDOQ2995366

Ilya Mironov, Stanislaw Jarecki, Philippe Golle

Publication date: 20 April 2011

Published in: Financial Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-36504-4_9

zbMATH Keywords

cryptographycommunication complexitypeer-to-peer networksstorage complexity

Mathematics Subject Classification ID

Cryptography (94A60) Internet topics (68M11) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)

Cited In (3)

• Another step towards realizing random oracles: non-malleable point obfuscation
• Proofs of Space
• A storage complexity based analogue of Maurer key establishment using public channels

This page was built for publication: Cryptographic Primitives Enforcing Communication and Storage Complexity

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