This foundational paper traces the historical development of cryptography from Caesar ciphers to modern encryption techniques, establishing symmetric-key encryption as a core design principle where a shared key enables both encryption and decryption of messages. The authors situate cryptographic methods as essential infrastructure for secure communication protocols, with examples ranging from wartime military applications to contemporary computational systems.
This paper explains cryptographic hashing as a fundamental building block of digital infrastructure, defining hash functions as one-way operations that deterministically map arbitrary-sized inputs to fixed-sized outputs while revealing no information about the input. The authors emphasize key properties including collision resistance and the practical irreversibility of hashing, distinguishing it from encryption.
Mario Havel, Tim Beiko
This explainer introduces zero-knowledge proofs as a cryptographic domain that enables proving knowledge of data without fully revealing it, using the analogy of a dimmer switch to illustrate how ZK protocols control information visibility. The piece demonstrates the concept through the Alice-and-Bob probability example, showing how repeated correct guesses establish proof of knowledge while keeping the underlying information hidden from the verifier.
Summer of Protocols
This paper explains how hashes and hash-based data structures, particularly hash tables and Merkle trees, enable efficient data integrity verification and lookup in large-scale information systems. The authors build on foundational cryptographic concepts to demonstrate how these structures form the basis for secure data proofs in modern digital infrastructure.
Mario Havel, Tim Beiko