Ronald Linn Rivest
Ronald Linn Rivest

Author's MIT Homepage
rivestatmit.edu

  Affiliation history
Bibliometrics: publication history
Average citations per article95.95
Citation Count15,352
Publication count160
Publication years1972-2015
Available for download44
Average downloads per article1,095.95
Downloads (cumulative)48,222
Downloads (12 Months)4,420
Downloads (6 Weeks)715
A. M. Turing Award Winner ACM Fellow
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Advisor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


161 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 161
Result page: 1 2 3 4 5 6 7 8 9

Sort by:

1
Time-space trade-offs in population protocols
Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest
January 2017 SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 7,   Downloads (12 Months): 17,   Downloads (Overall): 17

Full text available: PDFPDF
Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental tasks in the ...

2 published by ACM
Keys under doormats
Harold Abelson, Ross Anderson, Steven M. Bellovin, Josh Benaloh, Matt Blaze, Whitfield "Whit" Diffie, John Gilmore, Matthew Green, Susan Landau, Peter G. Neumann, Ronald L. Rivest, Jeffrey I. Schiller, Bruce Schneier, Michael A. Specter, Daniel J. Weitzner
September 2015 Communications of the ACM: Volume 58 Issue 10, October 2015
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 15,   Downloads (12 Months): 202,   Downloads (Overall): 731

Full text available: HtmlHtml  PDFPDF
Mandating insecurity by requiring government access to all data and communications.

3
Picture-Hanging Puzzles
Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. Mitchell, Ronald L. Rivest, Mihai Pătraşcu
May 2014 Theory of Computing Systems: Volume 54 Issue 4, May 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We show how to hang a picture by wrapping rope around n nails, making a polynomial number of twists, such that the picture falls whenever any k out of the n nails get removed, and the picture remains hanging when fewer than k nails get removed. This construction makes for ...
Keywords: Algorithms, Monotone functions, Topology, Free group, Magic

4 published by ACM
November 2013 CCS '13: Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Publisher: ACM
Bibliometrics:
Citation Count: 13
Downloads (6 Weeks): 33,   Downloads (12 Months): 271,   Downloads (Overall): 1,588

Full text available: PDFPDF
We propose a simple method for improving the security of hashed passwords: the maintenance of additional ``honeywords'' (false passwords) associated with each user's account. An adversary who steals a file of hashed passwords and inverts the hash function cannot tell if he has found the password or a honeyword. The ...
Keywords: honeywords, password hashes, passwords, chaffing, login, authentication, password cracking

5
FlipIt: The Game of "Stealthy Takeover"
Marten Dijk, Ari Juels, Alina Oprea, Ronald L. Rivest
October 2013 Journal of Cryptology: Volume 26 Issue 4, October 2013
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 7

Recent targeted attacks have increased significantly in sophistication, undermining the fundamental assumptions on which most cryptographic primitives rely for security. For instance, attackers launching an Advanced Persistent Threat (APT) can steal full cryptographic keys, violating the very secrecy of "secret" keys that cryptographers assume in designing secure protocols. In this ...
Keywords: Repeated stealthy takeovers, Game theory, Advanced persistent threats, FlipIt, Security modeling

6 published by ACM
October 2012 CCS '12: Proceedings of the 2012 ACM conference on Computer and communications security
Publisher: ACM
Bibliometrics:
Citation Count: 12
Downloads (6 Weeks): 3,   Downloads (12 Months): 46,   Downloads (Overall): 1,009

Full text available: PDFPDF
We consider the following challenge: How can a cloud storage provider prove to a tenant that it's encrypting files at rest, when the provider itself holds the corresponding encryption keys? Such proofs demonstrate sound encryption policies and file confidentiality. (Cheating, cost-cutting, or misconfigured providers may bypass the computation/management burdens of ...
Keywords: challenge-response protocol, cloud auditing, economic security model, cloud storage security

7 published by ACM
October 2011 CCS '11: Proceedings of the 18th ACM conference on Computer and communications security
Publisher: ACM
Bibliometrics:
Citation Count: 25
Downloads (6 Weeks): 7,   Downloads (12 Months): 43,   Downloads (Overall): 756

Full text available: PDFPDF
This paper presents a new challenge--verifying that a remote server is storing a file in a fault-tolerant manner, i.e., such that it can survive hard-drive failures. We describe an approach called the Remote Assessment of Fault Tolerance (RAFT). The key technique in a RAFT is to measure the time taken ...
Keywords: fault tolerance, auditing, cloud storage, erasure codes

8
Computing the margin of victory in IRV elections
Thomas R. Magrino, Ronald L. Rivest, Emily Shen, David Wagner
August 2011 EVT/WOTE'11: Proceedings of the 2011 conference on Electronic voting technology/workshop on trustworthy elections
Publisher: USENIX Association
Bibliometrics:
Citation Count: 19

Efficient post-election audits select the number of machines or precincts to audit based in part on the margin of victory (the number of ballots that must be changed in order to change the outcome); a close election needs more auditing than a landslide victory. For a simple "first-pastthe-post" election, the ...

9
Tweakable Block Ciphers
July 2011 Journal of Cryptology: Volume 24 Issue 3, July 2011
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 7

A common trend in applications of block ciphers over the past decades has been to employ block ciphers as one piece of a “mode of operation”—possibly, a way to make a secure symmetric-key cryptosystem, but more generally, any cryptographic application. Most of the time, these modes of operation use a wide ...
Keywords: Modes of operation, Initialization vector, Pseudorandomness, Tweakable block ciphers

10 published by ACM
March 2011 ACM Turing award lectures
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 412,   Downloads (12 Months): 1,755,   Downloads (Overall): 1,835

Full text available: Mp4Mp4

11
The invertibility of the XOR of rotations of a binary word
January 2011 International Journal of Computer Mathematics: Volume 88 Issue 2, January 2011
Publisher: Taylor & Francis, Inc.
Bibliometrics:
Citation Count: 0

We prove the following result regarding operations on a binary word whose length is a power of two: computing the exclusive-or of a number of rotated versions of the word is an invertible (one-to-one) operation if and only if the number of versions combined is odd. (This result is not ...
Keywords: binary words, circulant matrix, exclusive-or, invertibility, rotation

12
The invertibility of the XOR of rotations of a binary word
January 2011 International Journal of Computer Mathematics: Volume 88 Issue 2, January 2011
Publisher: Taylor & Francis, Inc.
Bibliometrics:
Citation Count: 3

We prove the following result regarding operations on a binary word whose length is a power of two: computing the exclusive-or of a number of rotated versions of the word is an invertible (one-to-one) operation if and only if the number of versions combined is odd. (This result is not ...
Keywords: exclusive-or, invertibility, rotation, binary words, circulant matrix

13
Scantegrity II municipal election at Takoma Park: the first E2E binding governmental election with ballot privacy
Richard Carback, David Chaum, Jeremy Clark, John Conway, Aleksander Essex, Paul S. Herrnson, Travis Mayberry, Stefan Popoveniuc, Ronald L. Rivest, Emily Shen, Alan T. Sherman, Poorvi L. Vora
August 2010 USENIX Security'10: Proceedings of the 19th USENIX conference on Security
Publisher: USENIX Association
Bibliometrics:
Citation Count: 17

On November 3, 2009, voters in Takoma Park, Maryland, cast ballots for the mayor and city council members using the Scantegrity II voting system--the first time any end-to-end (E2E) voting system with ballot privacy has been used in a binding governmental election. This case study describes the various efforts that ...

14
Corrections to scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes
David Chaum, Richard T. Carback, Jeremy Clark, Aleksander Essex, Stefan Popoveniuc, Ronald L. Rivest, Peter Y. A. Ryan, Emily Shen, Alan T. Sherman, Poorvi L. Vora
March 2010 IEEE Transactions on Information Forensics and Security: Volume 5 Issue 1, March 2010
Publisher: IEEE Press
Bibliometrics:
Citation Count: 1

In the above titled paper (ibid., vol. 4, no. 4, pp. 611-627, Dec. 09), due to a production error, the affiliations of two of the authors were listed incorrectly. The correct affiliations are presented here. Also, the name of the last author in the affiliations footnote was printed incorrectly. The ...

15
A modular voting architecture (“frog voting”)
January 2010 Towards Trustworthy Elections: new Directions in Electronic Voting
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

This paper presents a new framework-a reference architecture-for voting that we feel has many attractive features. It is not a machine design, but rather a framework that will stimulate innovation and design. It is potentially the standard architecture for all future voting equipment. The ideas expressed here are subject to ...

16
Guest editorial: special issue on electronic voting
Ronald L. Rivest, David Chaum, Bart Preneel, Aviel D. Rubin, Donald G. Saari, Poorvi L. Vora
December 2009 IEEE Transactions on Information Forensics and Security - Special issue on electronic voting: Volume 4 Issue 4, December 2009
Publisher: IEEE Press
Bibliometrics:
Citation Count: 0

The 13 papers in this special issue focus on electronic voting.

17
Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes
David Chaum, Richard T. Carback, Jeremy Clark, Aleksander Essex, Stefan Popoveniuc, Ronald L. Rivest, Peter Y. A. Ryan, Emily Shen, Alan T. Sherman, Poorvi L. Vora
December 2009 IEEE Transactions on Information Forensics and Security - Special issue on electronic voting: Volume 4 Issue 4, December 2009
Publisher: IEEE Press
Bibliometrics:
Citation Count: 13

Scantegrity II is an enhancement for existing paper ballot systems. It allows voters to verify election integrity--from their selections on the ballot all the way to the final tally--by noting codes and checking for them online. Voters mark Scantegrity II ballots just as with conventional optical scan, but using a ...
Keywords: electronic voting, privacy, Cryptography, end-to-end verifiability, cryptography

18
Phish and Chips
Ben Adida, Mike Bond, Jolyon Clulow, Amerson Lin, Steven Murdoch, Ross Anderson, Ron Rivest
October 2009 Security Protocols: 14th International Workshop, Cambridge, UK, March 27-29, 2006, Revised Selected Papers
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

This paper surveys existing and new security issues affecting the EMV electronic payments protocol. We first introduce a new price/effort point for the cost of deploying eavesdropping and relay attacks --- a microcontroller-based interceptor costing less than $100. We look next at EMV protocol failures in the back-end security API, ...

19
Introduction to Algorithms, Third Edition
September 2009
Bibliometrics:
Citation Count: 810

If you had to buy just one text on algorithms, Introduction to Algorithms is a magnificent choice. The book begins by considering the mathematical foundations of the analysis of algorithms and maintains this mathematical rigor throughout the work. The tools developed in these opening sections are then applied to sorting, ...

20
Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
Yevgeniy Dodis, Leonid Reyzin, Ronald L. Rivest, Emily Shen
July 2009 Fast Software Encryption: 16th International Workshop, FSE 2009 Leuven, Belgium, February 22-25, 2009 Revised Selected Papers
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 10

MD6 [17] is one of the earliest announced SHA-3 candidates, presented by Rivest at CRYPTO'08 [16]. Since then, MD6 has received a fair share of attention and has resisted several initial cryptanalytic attempts [1,11]. Given the interest in MD6, it is important to formally verify the soundness of its design ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2017 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us