Home
/
News
/
The most important cryptography papers

The most important cryptography papers

https://evervault.com/papers

Crypto means cryptography

The most important cryptography papers spanning the past, present, and future of cryptosystems & cryptology.

Non-Malleable Cryptography
Non-Malleable Cryptography

Danny Dolev, Cynthia Dwork, & Moni Naor

On the (Im)possibility of Obfuscating Programs
On the (Im)possibility of Obfuscating Programs

Boaz Barak, Oded Goldreich, Rusell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, & Ke Yang

Computer Systems Established, Maintained and Trusted by Mutually Suspicious Groups
Computer Systems Established, Maintained and Trusted by Mutually Suspicious Groups

David L. Chaum

A Digital Signature Based on a Conventional Encryption Function
A Digital Signature Based on a Conventional Encryption Function

Ralph C. Merkle

The Knowledge Complexity of Interactive Proof-Systems
The Knowledge Complexity of Interactive Proof-Systems

Shafi Goldwasser, Silvio Micali, & Charles Rackoffero

Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security
Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security

Matt Blaze, Whit eld Diffie, Ronald L. Rivest, Bruce Schneier, Tsutomu Shimomura, Eric Thompson, & Michael Wiener

CryptDB: Protecting Confidentiality with Encrypted Query Processing
CryptDB: Protecting Confidentiality with Encrypted Query Processing

Raluca Ada Popa, Catherine M. S. Redfield, Nickolai Zeldovich, & Hari Balakrishnan

Protocols for Secure Computations
Protocols for Secure Computations

Andrew C. Yao

Bitcoin: A Peer-to-Peer Electronic Cash System
Bitcoin: A Peer-to-Peer Electronic Cash System

Satoshi Nakamoto

A fully homomorphic encryption scheme
A fully homomorphic encryption scheme

Craig Gentry

On Data Banks and Privacy Homomorphisms
On Data Banks and Privacy Homomorphisms

Ronald L. Rivest, Len Adleman, & Michael L. Dertouzos

A fast quantum mechanical algorithm for database search
A fast quantum mechanical algorithm for database search

Lov K. Grover

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Peter Shor

Use of Elliptic Curves in Cryptography
Use of Elliptic Curves in Cryptography

Victor Miller

Elliptic Curve Cryptosystems
Elliptic Curve Cryptosystems

Neal Koblitz

A Method for Obtaining Digital Signatures and Public Key Cryptosystems
A Method for Obtaining Digital Signatures and Public Key Cryptosystems

Ronald L. Rivest, Adi Shamir, & Len Adleman

New Directions in Cryptography
New Directions in Cryptography

Whitfield Diffie & Martin E. Hellman

Cramming more components onto integrated circuits
Cramming more components onto integrated circuits

Gordon Moore

A Mathematical Theory of Cryptography
A Mathematical Theory of Cryptography

Claude E. Shannon

La Cryptographie Militaire
La Cryptographie Militaire

Auguste Kerckhoffs

{
  "by": "gits1225",
  "descendants": 16,
  "id": 40247254,
  "kids": [
    40250366,
    40249468,
    40247299,
    40249318,
    40250521,
    40248875,
    40248566,
    40250517,
    40248497,
    40248490
  ],
  "score": 67,
  "time": 1714741579,
  "title": "The most important cryptography papers",
  "type": "story",
  "url": "https://evervault.com/papers"
}
{
  "author": "Danny Dolev, Cynthia Dwork, & Moni Naor",
  "date": null,
  "description": "The most important cryptography papers spanning the past, present, and future of cryptosystems & cryptology.",
  "image": "https://evervault.com/social/papers.png",
  "logo": "https://evervault.com/logo.png",
  "publisher": "Evervault",
  "title": "Papers — Evervault",
  "url": "https://evervault.com/papers"
}
{
  "url": "https://evervault.com/papers",
  "title": "Papers — Evervault",
  "description": "Crypto means cryptographyThe most important cryptography papers spanning the past, present, and future of cryptosystems & cryptology.Non-Malleable CryptographyDanny Dolev, Cynthia Dwork, & Moni NaorOn...",
  "links": [
    "https://evervault.com/papers"
  ],
  "image": "https://evervault.com/social/papers.png",
  "content": "<div><div><h3>Crypto means cryptography</h3><div><p>The most important cryptography papers spanning the past, present, and future of cryptosystems &amp; cryptology.</p></div></div><div><div><article><figure><img alt=\"Non-Malleable Cryptography\" src=\"https://cdn.sanity.io/images/r000fwn3/production/51dcbd35ac09859bccd556034dd4fa8cbb0682af-256x374.svg\" /><figcaption></figcaption></figure><h6>Non-Malleable Cryptography</h6><p>Danny Dolev, Cynthia Dwork, &amp; Moni Naor</p></article></div><div><article><figure><img alt=\"On the (Im)possibility of Obfuscating Programs\" src=\"https://cdn.sanity.io/images/r000fwn3/production/aca3c638bfc6c79789b311453dcb03a66c615a16-256x374.svg\" /><figcaption></figcaption></figure><h6>On the (Im)possibility of Obfuscating Programs</h6><p>Boaz Barak, Oded Goldreich, Rusell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, &amp; Ke Yang</p></article></div><div><article><figure><img alt=\"Computer Systems Established, Maintained and Trusted by Mutually Suspicious Groups \" src=\"https://cdn.sanity.io/images/r000fwn3/production/af2b7e4bacd21b5cbbeb7d5bebd642646f1bda32-256x374.svg\" /><figcaption></figcaption></figure><h6>Computer Systems Established, Maintained and Trusted by Mutually Suspicious Groups </h6><p>David L. Chaum</p></article></div><div><article><figure><img alt=\"A Digital Signature Based on a Conventional Encryption Function\" src=\"https://cdn.sanity.io/images/r000fwn3/production/7c31b74787e67ecee4fe3d71bf1e08cc16fa89e0-256x374.svg\" /><figcaption></figcaption></figure><h6>A Digital Signature Based on a Conventional Encryption Function</h6><p>Ralph C. Merkle</p></article></div><div><article><figure><img alt=\"The Knowledge Complexity of Interactive Proof-Systems\" src=\"https://cdn.sanity.io/images/r000fwn3/production/17c78099976dfc60beb5d8ceb4d65ab3830da19a-256x374.svg\" /><figcaption></figcaption></figure><h6>The Knowledge Complexity of Interactive Proof-Systems</h6><p>Shafi Goldwasser, Silvio Micali, &amp; Charles Rackoffero</p></article></div><div><article><figure><img alt=\"Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security\" src=\"https://cdn.sanity.io/images/r000fwn3/production/32c8e6f476a0903377b30a40fd3beca3254ae986-256x374.svg\" /><figcaption></figcaption></figure><h6>Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security</h6><p>Matt Blaze, Whit\feld Diffie, Ronald L. Rivest, Bruce Schneier, Tsutomu Shimomura, Eric Thompson, &amp; Michael Wiener</p></article></div><div><article><figure><img alt=\"CryptDB: Protecting Confidentiality with Encrypted Query Processing\" src=\"https://cdn.sanity.io/images/r000fwn3/production/80e3d4e796dc6f71c0b0929334174844c1b49a24-256x374.svg\" /><figcaption></figcaption></figure><h6>CryptDB: Protecting Confidentiality with Encrypted Query Processing</h6><p>Raluca Ada Popa, Catherine M. S. Redfield, Nickolai Zeldovich, &amp; Hari Balakrishnan</p></article></div><div><article><figure><img alt=\"Protocols for Secure Computations\" src=\"https://cdn.sanity.io/images/r000fwn3/production/009805b6116f0db671fd4d8e421ed527762c9e83-256x374.svg\" /><figcaption></figcaption></figure><h6>Protocols for Secure Computations</h6><p>Andrew C. Yao</p></article></div><div><article><figure><img alt=\"Bitcoin: A Peer-to-Peer Electronic Cash System\" src=\"https://cdn.sanity.io/images/r000fwn3/production/179e60a21f3ff5df20f41b42de4a03a257ec6640-256x374.svg\" /><figcaption></figcaption></figure><h6>Bitcoin: A Peer-to-Peer Electronic Cash System</h6><p>Satoshi Nakamoto</p></article></div><div><article><figure><img alt=\"A fully homomorphic encryption scheme\" src=\"https://cdn.sanity.io/images/r000fwn3/production/653ba557156062840c225f0cc88062dc0f5a73b3-256x374.svg\" /><figcaption></figcaption></figure><h6>A fully homomorphic encryption scheme</h6><p>Craig Gentry</p></article></div><div><article><figure><img alt=\"On Data Banks and Privacy Homomorphisms\" src=\"https://cdn.sanity.io/images/r000fwn3/production/b516f98a68ce80b0ead5d9c2475e1b521d577395-256x374.svg\" /><figcaption></figcaption></figure><h6>On Data Banks and Privacy Homomorphisms</h6><p>Ronald L. Rivest, Len Adleman, &amp; Michael L. Dertouzos</p></article></div><div><article><figure><img alt=\"A fast quantum mechanical algorithm for database search\" src=\"https://cdn.sanity.io/images/r000fwn3/production/06f7882d53c9e66c14c8b36d41530ec5103e0375-256x374.svg\" /><figcaption></figcaption></figure><h6>A fast quantum mechanical algorithm for database search</h6><p>Lov K. Grover</p></article></div><div><article><figure><img alt=\"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer\" src=\"https://cdn.sanity.io/images/r000fwn3/production/c2a1fee832dd6a663ffa49af6d57e16f60713d93-256x374.svg\" /><figcaption></figcaption></figure><h6>Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer</h6><p>Peter Shor</p></article></div><div><article><figure><img alt=\"Use of Elliptic Curves in Cryptography\" src=\"https://cdn.sanity.io/images/r000fwn3/production/c7af363178ae629e3d56ddf9566853ed5a8f7cbe-256x374.svg\" /><figcaption></figcaption></figure><h6>Use of Elliptic Curves in Cryptography</h6><p>Victor Miller</p></article></div><div><article><figure><img alt=\"Elliptic Curve Cryptosystems\" src=\"https://cdn.sanity.io/images/r000fwn3/production/57936a16d9b5aa391ed11d03dd9a0a9484c2610d-256x374.svg\" /><figcaption></figcaption></figure><h6>Elliptic Curve Cryptosystems</h6><p>Neal Koblitz</p></article></div><div><article><figure><img alt=\"A Method for Obtaining Digital Signatures and Public Key Cryptosystems\" src=\"https://cdn.sanity.io/images/r000fwn3/production/6f2be04cc58b1138d6660338ee7e50ae2755c95a-256x374.svg\" /><figcaption></figcaption></figure><h6>A Method for Obtaining Digital Signatures and Public Key Cryptosystems</h6><p>Ronald L. Rivest, Adi Shamir, &amp; Len Adleman</p></article></div><div><article><figure><img alt=\"New Directions in Cryptography\" src=\"https://cdn.sanity.io/images/r000fwn3/production/cc31418f5b68823afb48045564eb2d1d9b174f7c-256x374.svg\" /><figcaption></figcaption></figure><h6>New Directions in Cryptography</h6><p>Whitfield Diffie &amp; Martin E. Hellman</p></article></div><div><article><figure><img alt=\"Cramming more components onto integrated circuits\" src=\"https://cdn.sanity.io/images/r000fwn3/production/50d8d7e9007fcc181074ded5e5e95a3d08d69b03-256x374.svg\" /><figcaption></figcaption></figure><h6>Cramming more components onto integrated circuits</h6><p>Gordon Moore</p></article></div><div><article><figure><img alt=\"A Mathematical Theory of Cryptography\" src=\"https://cdn.sanity.io/images/r000fwn3/production/6b3e14569400e91f8e3b8964864df0b446446657-256x374.svg\" /><figcaption></figcaption></figure><h6>A Mathematical Theory of Cryptography</h6><p>Claude E. Shannon</p></article></div><div><article><figure><img alt=\"La Cryptographie Militaire\" src=\"https://cdn.sanity.io/images/r000fwn3/production/ca0bb57a57981211ab822a6e874088219f4b1a10-256x374.svg\" /><figcaption></figcaption></figure><h6>La Cryptographie Militaire</h6><p>Auguste Kerckhoffs</p></article></div></div></div>",
  "author": "@Evervault",
  "favicon": "https://evervault.com/favicon.png",
  "source": "evervault.com",
  "published": "",
  "ttr": 44,
  "type": ""
}