Ronald L. Rivest

According to our database1, Ronald L. Rivest authored at least 208 papers between 1972 and 2018.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Awards

Turing Prize recipient

Turing Prize 2002, "For RSA (algorithm)|their ingenious contribution for making public-key cryptography useful in practice." awarded to Ronald L. Rivest and Adi Shamir and Leonard M. Adleman.

ACM Fellow

ACM Fellow 1994, "For contributions to the field of cryptography.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
k-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-Election Audits.
CoRR, 2018

Consistent Sampling with Replacement.
CoRR, 2018

Bayesian Tabulation Audits: Explained and Extended.
CoRR, 2018

From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
When Is an Election Verifiable?
IEEE Security & Privacy, 2017

ClipAudit: A Simple Risk-Limiting Post-Election Audit.
CoRR, 2017

Public Evidence from Secret Ballots.
CoRR, 2017

Public Evidence from Secret Ballots.
Proceedings of the Electronic Voting - Second International Joint Conference, 2017

Time-Space Trade-offs in Population Protocols.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

BatchVote: Voting Rules Designed for Auditability.
Proceedings of the Financial Cryptography and Data Security, 2017

Marked Mix-Nets.
Proceedings of the Financial Cryptography and Data Security, 2017

2016
Spritz - a spongy RC4-like stream cipher and hash function.
IACR Cryptology ePrint Archive, 2016

Towards Secure Quadratic Voting.
IACR Cryptology ePrint Archive, 2016

The Optimality of Correlated Sampling.
Electronic Colloquium on Computational Complexity (ECCC), 2016

An IBE-based Signcryption Scheme for Group Key Management.
CoRR, 2016

Auditing Australian Senate Ballots.
CoRR, 2016

The Optimality of Correlated Sampling.
CoRR, 2016

Time-Space Trade-offs in Population Protocols.
CoRR, 2016

2015
Keys under doormats: mandating insecurity by requiring government access to all data and communications.
J. Cybersecurity, 2015

DiffSum - A Simple Post-Election Risk-Limiting Audit.
CoRR, 2015

End-to-end verifiability.
CoRR, 2015

Keys under doormats.
Commun. ACM, 2015

2014
Picture-Hanging Puzzles.
Theory Comput. Syst., 2014

2013
FlipIt: The Game of "Stealthy Takeover".
J. Cryptology, 2013

Drifting Keys: Impersonation detection for constrained devices.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Honeywords: making password-cracking detectable.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2012
FlipIt: The Game of "Stealthy Takeover".
IACR Cryptology ePrint Archive, 2012

Defending Against the Unknown Enemy: Applying FlipIt to System Security.
IACR Cryptology ePrint Archive, 2012

Picture-Hanging Puzzles
CoRR, 2012

A Bayesian Method for Auditing Elections.
Proceedings of the 2012 Electronic Voting Technology Workshop / Workshop on Trustworthy Elections, 2012

Defending against the Unknown Enemy: Applying FlipIt to System Security.
Proceedings of the Decision and Game Theory for Security - Third International Conference, 2012

Picture-Hanging Puzzles.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Hourglass schemes: how to prove that cloud files are encrypted.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

Information, Data, Security in a Networked Future.
Proceedings of the ACM Turing Centenary Celebration, 2012

2011
RSA Problem.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Tweakable Block Ciphers.
J. Cryptology, 2011

The invertibility of the XOR of rotations of a binary word.
Int. J. Comput. Math., 2011

Computing the Margin of Victory in IRV Elections.
Proceedings of the 2011 Electronic Voting Technology Workshop / Workshop on Trustworthy Elections, 2011

How to tell if your cloud files are vulnerable to drive crashes.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

2010
Corrections to scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes.
IEEE Trans. Information Forensics and Security, 2010

How to Tell if Your Cloud Files Are Vulnerable to Drive Crashes.
IACR Cryptology ePrint Archive, 2010

A Modular Voting Architecture ("Frog Voting").
Proceedings of the Towards Trustworthy Elections, New Directions in Electronic Voting, 2010

Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy.
Proceedings of the 19th USENIX Security Symposium, 2010


2009
Guest editorial: special issue on electronic voting.
IEEE Trans. Information Forensics and Security, 2009

Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes.
IEEE Trans. Information Forensics and Security, 2009

Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6.
Proceedings of the Fast Software Encryption, 16th International Workshop, 2009

Introduction to Algorithms, 3rd Edition.
MIT Press, ISBN: 9780262533058, 2009

2008
Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes.
Proceedings of the 2008 USENIX/ACCURATE Electronic Voting Workshop, 2008

On Auditing Elections When Precincts Have Different Sizes.
Proceedings of the 2008 USENIX/ACCURATE Electronic Voting Workshop, 2008

2007
On Estimating the Size and Confidence of a Statistical Audit.
Proceedings of the 2007 USENIX/ACCURATE Electronic Voting Technology Workshop, 2007

Robbing the Bank with a Theorem Prover - (Abstract).
Proceedings of the Security Protocols, 2007

On the Security of the EMV Secure Messaging API (Extended Abstract).
Proceedings of the Security Protocols, 2007

Security of Voting Systems.
Proceedings of the 4th Symposium on Networked Systems Design and Implementation (NSDI 2007), 2007

07311 Abstracts Collection -- Frontiers of Electronic Voting.
Proceedings of the Frontiers of Electronic Voting, 29.07. - 03.08.2007, 2007

07311 Executive Summary -- Frontiers of Electronic Voting.
Proceedings of the Frontiers of Electronic Voting, 29.07. - 03.08.2007, 2007

Amplifying Collision Resistance: A Complexity-Theoretic Treatment.
Proceedings of the Advances in Cryptology, 2007

2006
Scratch & vote: self-contained paper-based cryptographic voting.
Proceedings of the 2006 ACM Workshop on Privacy in the Electronic Society, 2006

Phish and Chips.
Proceedings of the Security Protocols, 2006

Lightweight Email Signatures (Extended Abstract).
Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006

Fourth-factor authentication: somebody you know.
Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, Ioctober 30, 2006

How to Leak a Secret: Theory and Applications of Ring Signatures.
Proceedings of the Theoretical Computer Science, 2006

2005
RSA Problem.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Lightweight Encryption for Email.
Proceedings of the Steps to Reducing Unwanted Traffic on the Internet Workshop, 2005

2004
Access-controlled resource discovery in pervasive networks.
Concurrency - Practice and Experience, 2004

On the Notion of Pseudo-Free Groups.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

On Permutation Operations in Cipher Design.
Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04), 2004

Peppercoin Micropayments.
Proceedings of the Financial Cryptography, 2004

2003
Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems.
Proceedings of the Security in Pervasive Computing, 2003

Access-Controlled Resource Discovery for Pervasive Networks.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

Does Anyone Really Need MicroPayments?
Proceedings of the Financial Cryptography, 2003

The blocker tag: selective blocking of RFID tags for consumer privacy.
Proceedings of the 10th ACM Conference on Computer and Communications Security, 2003

2002
Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking.
IACR Cryptology ePrint Archive, 2002

Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking.
Proceedings of the 11th USENIX Security Symposium, 2002

Proxy-based security protocols in networked mobile devices.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

The Untrusted Computer Problem and Camera-Based Authentication.
Proceedings of the Pervasive Computing, 2002

Privacy Tradeoffs: Myth or Reality? Panel.
Proceedings of the Financial Cryptography, 6th International Conference, 2002

Transitive Signature Schemes.
Proceedings of the Topics in Cryptology, 2002

Micropayments Revisited.
Proceedings of the Topics in Cryptology, 2002

Tweakable Block Ciphers.
Proceedings of the Advances in Cryptology, 2002

2001
Certificate Chain Discovery in SPKI/SDSI.
Journal of Computer Security, 2001

Are 'Strong' Primes Needed for RSA.
IACR Cryptology ePrint Archive, 2001

The Business of Electronic Voting.
Proceedings of the Financial Cryptography, 2001

How to Leak a Secret.
Proceedings of the Advances in Cryptology, 2001

Introduction to Algorithms, Second Edition
The MIT Press and McGraw-Hill Book Company, ISBN: 0-07-013151-1, 2001

2000
RC6 as the AES.
Proceedings of the Third Advanced Encryption Standard Candidate Conference, 2000

1999
SPKI Certificate Theory.
RFC, September, 1999

Translucent Cryptography - An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer.
J. Cryptology, 1999

Piecemeal Graph Exploration by a Mobile Robot.
Inf. Comput., 1999

Pseudonym Systems.
Proceedings of the Selected Areas in Cryptography, 6th Annual International Workshop, 1999

Improved Analysis of Some Simplified Variants of RC6.
Proceedings of the Fast Software Encryption, 6th International Workshop, 1999

1998
A Description of the RC2(r) Encryption Algorithm.
RFC, March, 1998

On the Design and Security of RC2.
Proceedings of the Fast Software Encryption, 5th International Workshop, 1998

Can We Eliminate Certificate Revocations Lists?
Proceedings of the Financial Cryptography, 1998

Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop.
Proceedings of the Advances in Cryptology, 1998

1997
The risks of key recovery, key escrow, and trusted third-party encryption.
World Wide Web Journal, 1997

Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop.
IACR Cryptology ePrint Archive, 1997

All-or-Nothing Encryption and the Package Transform.
Proceedings of the Fast Software Encryption, 4th International Workshop, 1997

Electronic Lottery Tickets as Micropayments.
Proceedings of the Financial Cryptography, 1997

Perspectives on Financial Cryptography.
Proceedings of the Financial Cryptography, 1997

1996
The RC5, RC5-CBC, RC5-CBC-Pad, and RC5-CTS Algorithms.
RFC, October, 1996

On breaking a Huffman code.
IEEE Trans. Information Theory, 1996

PayWord and MicroMint: Two Simple Micropayment Schemes.
Proceedings of the Security Protocols, 1996

1995
Piecemeal Learning of an Unknown Environment.
Machine Learning, 1995

Complete Variable-Length "Fix-Free" Codes.
Des. Codes Cryptogr., 1995

Being Taught can be Faster than Asking Questions.
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

Piecemeal Graph Exploration by a Mobile Robot (Extended Abstract).
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

Picking the Best Expert from a Sequence.
Proceedings of the Learning from Data, 1995

1994
A Formal Model of Hierarchical Concept Learning
Inf. Comput., October, 1994

Diversity-Based Inference of Finite Automata.
J. ACM, 1994

The RC5 Encryption Algorithm.
Proceedings of the Fast Software Encryption: Second International Workshop. Leuven, 1994

1993
On Choosing between Experimenting and Thinking when Learning
Inf. Comput., September, 1993

Inference of Finite Automata Using Homing Sequences
Inf. Comput., April, 1993

Learning Binary Relations and Total Orders.
SIAM J. Comput., 1993

To Tap or not to Tap.
Commun. ACM, 1993

Scapegoat Trees.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Inference of Finite Automata Using Homing Sequences.
Proceedings of the Machine Learning: From Theory to Applications, 1993

Introduction.
Proceedings of the Machine Learning: From Theory to Applications, 1993

Strategic Directions in Machine Learning.
Proceedings of the Machine Learning: From Theory to Applications, 1993

Piecemeal Learning of an Unknown Environment.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992
The MD5 Message-Digest Algorithm.
RFC, April, 1992

The MD4 Message-Digest Algorithm.
RFC, April, 1992

Training a 3-node neural network is NP-complete.
Neural Networks, 1992

Responses to NIST's Proposal.
Commun. ACM, 1992

1991
Results on Learnability and the Vapnik-Chervonenkis Dimension
Inf. Comput., January, 1991

Incrementally Learning Time-Varying Half Planes.
Proceedings of the Advances in Neural Information Processing Systems 4, 1991

On NIST's Proposed Digital Signature Standard.
Proceedings of the Advances in Cryptology, 1991

Cryptography and Machine Learning.
Proceedings of the Advances in Cryptology, 1991

1990
MD4 Message Digest Algorithm.
RFC, October, 1990

A fair protocol for signing contracts.
IEEE Trans. Information Theory, 1990

Learning Time-Varying Concepts.
Proceedings of the Advances in Neural Information Processing Systems 3, 1990

Finding Four Million Large Random Primes.
Proceedings of the Advances in Cryptology, 1990

The MD4 Message Digest Algorithm.
Proceedings of the Advances in Cryptology, 1990

On the Sample Complexity of PAC-Learning Using Random and Chosen Examples.
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

Inferring Graphs from Walks.
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

Cryptography.
Proceedings of the Handbook of Theoretical Computer Science, 1990

1989
Inferring Decision Trees Using the Minimum Description Length Principle
Inf. Comput., March, 1989

Inference of Finite Automata Using Homing Sequences (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Learning Binary Relations and Total Orders (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Introduction to Algorithms
The MIT Press and McGraw-Hill Book Company, ISBN: 0-07-013143-0, 1989

1988
A knapsack-type public key cryptosystem based on arithmetic in finite fields.
IEEE Trans. Information Theory, 1988

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks.
SIAM J. Comput., 1988

Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES).
J. Cryptology, 1988

A New Model for Inductive Inference.
Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge, 1988

Results on learnability and the Vapnik-Chervonenkis dimension (Extended Abstract)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Learning Complicated Concepts Reliably and Usefully.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

Results on Learnability and the Vapnick-Chervonenkis Dimension.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

Training a 3-Node Neural Network is NP-Complete.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

1987
Network control by Bayesian broadcast.
IEEE Trans. Information Theory, 1987

Learning Decision Lists.
Machine Learning, 1987

Global Wire Routing in Two-Dimensional Arrays.
Algorithmica, 1987

Game Tree Searching by Min/Max Approximation.
Artif. Intell., 1987

Diversity-Based Inference of Finite Automata (Extended Abstract)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
Estimating a probability using finite memory.
IEEE Trans. Information Theory, 1986

An application of number theory to the organization of raster-graphics memory.
J. ACM, 1986

A non-iterative maximum entropy algorithm.
Proceedings of the UAI '86: Proceedings of the Second Annual Conference on Uncertainty in Artificial Intelligence, 1986

1985
A Fair Protocol for Signing Contracts (Extended Abstract).
Proceedings of the Automata, 1985

Efficient Factoring Based on Partial Information.
Proceedings of the Advances in Cryptology, 1985

Is the Data Encryption Standard a Group? (Preliminary Abstract).
Proceedings of the Advances in Cryptology, 1985

Is DES a Pure Cipher? (Results of More Cycling Experiments on DES).
Proceedings of the Advances in Cryptology, 1985

1984
How to Expose an Eavesdropper.
Commun. ACM, 1984

A "Paradoxical" Solution to the Signature Problem (Extended Abstract)
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

RSA Chips (Past/Present/Future).
Proceedings of the Advances in Cryptology: Proceedings of EUROCRYPT 84, 1984

A "Paradoxical'"Solution to the Signature Problem (Abstract).
Proceedings of the Advances in Cryptology, 1984

A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields.
Proceedings of the Advances in Cryptology, 1984

1983
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint).
Commun. ACM, 1983

Global Wire Routing in Two-Dimensional Arrays (Extended Abstract)
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

Estimating a Probability Using Finite Memory (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 1983

1982
How to Reuse a "Write-Once" Memory
Information and Control, 1982

How to Reuse a "Write-Once" Memory (Preliminary Version).
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract)
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

A "greedy" channel router.
Proceedings of the 19th Design Automation Conference, 1982

The "PI" (placement and interconnect) system.
Proceedings of the 19th Design Automation Conference, 1982

Randomized Encryption Techniques.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

A Short Report on the RSA Chip.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1981
Statistical Analysis of the Hagelin Cryptograph.
Cryptologia, 1981

1980
On the Polyhedral Decision Problem.
SIAM J. Comput., 1980

Orthogonal Packings in Two Dimensions.
SIAM J. Comput., 1980

Coping with Errors in Binary Search Procedures.
J. Comput. Syst. Sci., 1980

The Subgraph Homeomorphism Problem.
J. Comput. Syst. Sci., 1980

"Forwards and Backwards" Encryption.
Cryptologia, 1980

1979
An Omega(n/lg n)1/2 Lower Bound on the Number of Additions Necessary to Compute 0-1 Polynomials over the Ring of Integer Polynomials.
Inf. Process. Lett., 1979

1978
k+1 Heads Are Better than k.
J. ACM, 1978

Optimal Arrangement of Keys in a Hash Table.
J. ACM, 1978

Remarks on a Proposed Cryptanalytic Attack on the M.I.T. Public-Key Cryptosystem.
Cryptologia, 1978

A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.
Commun. ACM, 1978

Coping with Errors in Binary Search Procedures (Preliminary Report)
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

The Subgraph Homeomorphism Problem
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

1977
The Necessity of Feedback in Minimal Monotone Combinational Circuits.
IEEE Trans. Computers, 1977

On the Worst-Case Behavior of String-Searching Algorithms.
SIAM J. Comput., 1977

The game of "N questions" on a tree.
Discrete Mathematics, 1977

An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

1976
On Recognizing Graph Properties from Adjacency Matrices.
Theor. Comput. Sci., 1976

Partial-Match Retrieval Algorithms.
SIAM J. Comput., 1976

Constructing Optimal Binary Decision Trees is NP-Complete.
Inf. Process. Lett., 1976

Linear Expected Time of a Simple Union-Find Algorithm.
Inf. Process. Lett., 1976

On Self-Organizing Sequential Search Heuristics.
Commun. ACM, 1976

k+1 Heads Are Better than k
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

The Mutual Exclusion Problem for Unreliable Processes: Preliminary Report
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975
The Algorithm SELECT - for Finding the ith Smallest of n Elements [M1] (Algorithm 489).
Commun. ACM, 1975

Expected Time Bounds for Selection.
Commun. ACM, 1975

A Generalization and Proof of the Aanderaa-Rosenberg Conjecture
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

1974
Asymptotic bounds for the number of convex n-ominoes.
Discrete Mathematics, 1974

On the Optimality of Elia's Algorithm for Performing Best-Match Searches.
Proceedings of the Information Processing, 1974

On Self-Organizing Sequential Search Heuristics
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

On Hash-Coding Algorithms for Partial-Match Retrieval (Extended Abstract)
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

1973
Time Bounds for Selection.
J. Comput. Syst. Sci., 1973

1972
Linear Time Bounds for Median Computations
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972


  Loading...