Cryptographic primitives enforcing communication and storage complexity

DOI10.1007/3-540-36504-4_9MaRDI QIDQ2995366zbMATH OpenOpenAlexFDO

Authors Philippe Golle, Stanislaw Jarecki, Ilya Mironov

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

communication complexitycryptographypeer-to-peer networksstorage complexity

Mathematics Subject Classification ID

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

Recommendations

• Pebbling and Proofs of Work
• Simple proofs of space-time and rational proofs of storage
• Proofs of space: when space is of the essence
• Cryptography with constant computational overhead
• Proofs of space

Cited in

(7)

• Another step towards realizing random oracles: non-malleable point obfuscation
• Proofs of space
• Complexity-style resources in cryptography
• A storage complexity based analogue of Maurer key establishment using public channels
• (1/ )-rate Boolean garbling scheme from generic groups
• A unified framework for succinct garbling from homomorphic secret sharing
• Breaking the 1/ -rate barrier for arithmetic garbling

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)