What Schools Are Affiliated With Ron Rivest

Ron Rivest is affiliated with the following schools: Massachusetts Institute of Technology, Yale University, Stanford University

Ron Rivest | Academic Influence

Ron Rivest's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Papers

Introduction to Algorithms (1990) (12993)
A method for obtaining digital signatures and public-key cryptosystems (1983) (9754)
A method for obtaining digital signatures and public-key cryptosystems (1978) (8792)
The MD5 Message-Digest Algorithm (1992) (4018)
Introduction to Algorithms, 2nd edition. (2001) (3867)
Introduction to Algorithms, Second Edition (2001) (2952)
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks (1988) (2865)
Introduction to Algorithms, third edition (2009) (2762)
Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems (2003) (1506)
How to Leak a Secret (2001) (1487)
Time Bounds for Selection (1973) (1310)
Constructing Optimal Binary Decision Trees is NP-Complete (1976) (985)
The RC5 Encryption Algorithm (1994) (962)
The blocker tag: selective blocking of RFID tags for consumer privacy (2003) (950)
Introduction to Algorithms, 3rd Edition (2009) (875)
Training a 3-node neural network is NP-complete (1992) (821)
Inferring Decision Trees Using the Minimum Description Length Principle (1989) (807)
SPKI Certificate Theory (1999) (734)
PayWord and MicroMint: Two Simple Micropayment Schemes (1996) (733)
Time-lock Puzzles and Timed-release Crypto (1996) (635)
Orthogonal Packings in Two Dimensions (1980) (632)
Pseudonym Systems (1999) (519)
Learning decision lists (2004) (485)
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking (2002) (444)
Inference of finite automata using homing sequences (1989) (415)
All-or-Nothing Encryption and the Package Transform (1997) (404)
The MD4 Message Digest Algorithm (1990) (389)
Certificate Chain Discovery in SPKI/SDSI (2001) (383)
Expected time bounds for selection (1975) (326)
List Processing in Real Time on a Serial Computer (1978) (323)
Learning Decision Lists (2005) (319)
The MD4 Message-Digest Algorithm (1992) (314)
Tweakable Block Ciphers (2002) (299)
A fair protocol for signing contracts (1990) (290)
How to Reuse a "Write-Once" Memory (1982) (270)
Partial-Match Retrieval Algorithms (1976) (266)
Fourth-factor authentication: somebody you know (2006) (265)
Can We Eliminate Certificate Revocations Lists? (1998) (242)
On self-organizing sequential search heuristics (1976) (236)
On Digital Signatures and Public-Key Cryptosystems. (1977) (233)
Network control by Bayesian broadcast (1987) (233)
Tweakable Block Ciphers (2010) (226)
Honeywords: making password-cracking detectable (2013) (222)
A "Greedy" Channel Router (1982) (220)
The Design and Analysis of Computer Algorithms (1990) (213)
FlipIt: The Game of “Stealthy Takeover” (2012) (207)
Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes (2008) (195)
A knapsack-type public key cryptosystem based on arithmetic in finite fields (1988) (192)
On Recognizing Graph Properties from Adjacency Matrices (1976) (192)
Inference of Finite Automata Using Homing Sequences (1993) (190)
Coping with Errors in Binary Search Procedures (1980) (188)
The RC4 encryption algorithm (1992) (181)
Simple Public Key Certificate (1998) (172)
The risks of key recovery, key escrow, and trusted third-party encryption (1997) (171)
Responses to NIST's proposal (1992) (163)
Micropayments Revisited (2002) (162)
How to expose an eavesdropper (1984) (159)
Scratch & vote: self-contained paper-based cryptographic voting (2006) (159)
Diversity-based inference of finite automata (1987) (135)
On the notion of ‘software independence’ in voting systems (2008) (132)
Climate change and the integrity of science. (2010) (130)
Transitive Signature Schemes (2002) (129)
Training a 3-node neural network is NP-complete (1988) (124)
Electronic Lottery Tickets as Micropayments (1997) (119)
Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy (2010) (117)
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (1984) (109)
Piecemeal Graph Exploration by a Mobile Robot (1999) (108)
K + 1 heads are better than K (1976) (106)
Keys under doormats: mandating insecurity by requiring government access to all data and communications (2015) (105)
Time-Space Trade-offs in Population Protocols (2017) (103)
Game Tree Searching by Min/Max Approximation (1987) (101)
How to Leak a Secret: Theory and Applications of Ring Signatures (2006) (101)
How to tell if your cloud files are vulnerable to drive crashes (2011) (95)
Learning Time-Varying Concepts (1990) (90)
The Subgraph Homeomorphism Problem (1980) (89)
Introduction to algorithms. Chapter 16. 2nd Edition (2001) (88)
Results on learnability and the Vapnik-Chervonenkis dimension (1988) (88)
A procedure for improving the upper bound for the number of n-ominoes. (1972) (86)
Efficient Factoring Based on Partial Information (1985) (85)
The Untrusted Computer Problem and Camera-Based Authentication (2002) (84)
Spritz - a spongy RC4-like stream cipher and hash function (2016) (84)
Permutation Polynomials Modulo 2w (2001) (83)
Advances in Cryptology — ASIACRYPT '91 (1991) (83)
The ThreeBallot Voting System (2006) (82)
The "PI" (Placement And Interconnect) System (1982) (81)
Cryptography and Machine Learning (1991) (80)
Scantegrity II: End-to-End Verifiability by Voters of Optical Scan Elections Through Confirmation Codes (2009) (79)
Hourglass schemes: how to prove that cloud files are encrypted (2012) (78)
On Estimating the Size and Confidence of a Statistical Audit (2007) (74)
Computing the Margin of Victory in IRV Elections (2011) (74)
Proxy-based security protocols in networked mobile devices (2002) (70)
On the Worst-Case Behavior of String-Searching Algorithms (1977) (70)
Are 'Strong' Primes Needed for RSA (2001) (68)
Chaffing and Winnowing: Confidentiality without Encryption (2012) (67)
Scapegoat trees (1993) (65)
Asymptotic bounds for the number of convex n-ominoes (1974) (63)
Estimating a probability using finite memory (1986) (61)
On breaking a Huffman code (1996) (60)
Introduction to Algorithms -3/Ed. (2012) (59)
A Description of the RC2(r) Encryption Algorithm (1998) (58)
Learning complicated concepts reliably and usefully (1988) (58)
Remarks on a Proposed Cryptanalytic Attack on the M.I.T. Public-Key Cryptosystem (1978) (57)
Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6 (2009) (57)
Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop (1998) (56)
Towards Trustworthy Elections, New Directions in Electronic Voting (2010) (56)
Defending against the Unknown Enemy: Applying FlipIt to System Security (2012) (56)
On the sample complexity of pac-learning using random and chosen examples (1990) (55)
Peppercoin Micropayments (2004) (55)
The RC5, RC5-CBC, RC5-CBC-Pad, and RC5-CTS Algorithms (1996) (53)
Learning Binary Relations and Total Orders (1993) (52)
Piecemeal Learning of an Unknown Environment (1993) (52)
Linear time bounds for median computations (1972) (52)
Analysis of associative retrieval algorithms. (1974) (51)
Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) (1983) (50)
Public Evidence from Secret Ballots (2017) (50)
Piecemeal Learning of an Unknown Environment (1993) (50)
The Necessity of Feedback in Minimal Monotone Combinational Circuits (1977) (50)
Piecemeal learning of an unknown environment (1995) (50)
A "Paradoxical'"Solution to the Signature Problem (Abstract) (1984) (49)
A "Paradoxical" Solution to the Signature Problem (Extended Abstract) (1984) (48)
On Auditing Elections When Precincts Have Different Sizes (2008) (48)
An Optimal Single-Winner Preferential Voting System Based on Game Theory (2010) (48)
A generalization and proof of the Aanderaa-Rosenberg conjecture (1975) (48)
A Formal Model of Hierarchical Concept Learning (1994) (47)
Amplifying Collision Resistance: A Complexity-Theoretic Treatment (2007) (46)
Abelian square-free dithering for iterated hash functions (2005) (46)
Randomized Encryption Techniques (1982) (46)
On the Design and Security of RC2 (1998) (45)
On the Polyhedral Decision Problem (1980) (45)
New Lower Bounds for Channel Width (1981) (44)
Optimal Arrangement of Keys in a Hash Table (1978) (43)
Lightweight Encryption for Email (2005) (42)
Learning Binary Relations and Total Orders (1989) (42)
On the Notion of Pseudo-Free Groups (2004) (41)
To tap or not to tap (1993) (39)
On the Optimality of Elia's Algorithm for Performing Best-Match Searches (1974) (39)
Residual Votes Attributable to Technology: An Assessment of the Reliability of Existing Voting Equipment (2001) (39)
Is the Data Encryption Standard a group? (Results of cycling experiments on DES) (2004) (39)
An application of number theory to the organization of raster-graphics memory (1982) (36)
Improved Analysis of Some Simplified Variants of RC6 (1999) (36)
The Mutual Exclusion Problem for Unreliable Processes: Preliminary Report (1976) (35)
RC6 as the AES (2000) (35)
RSA Chips (Past/Present/Future) (1984) (34)
Piecemeal graph exploration by a mobile robot (extended abstract) (1995) (34)
THE CASE AGAINST REGULATING ENCRYPTION TECHNOLOGY (1998) (33)
Linear Expected Time of a Simple Union-Find Algorithm (1976) (32)
The RC 6 TM Block Cipher (1998) (31)
Diversity-Based Inference of Finite Automata (Extended Abstract) (1987) (30)
Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes (2009) (30)
The Business of Electronic Voting (2001) (30)
How to reuse a "write - once " memory (Preliminary Version) (1982) (29)
On permutation operations in cipher design (2004) (28)
SDSI, A Simple Distributed Security Infrastructure Version 1. 1 (1996) (28)
End-to-end verifiability (2015) (27)
CHAPTER 13 – Cryptography (1990) (27)
A Bayesian Method for Auditing Elections (2012) (27)
Fighting Phishing Attacks: A Lightweight Trust Architecture for Detecting Spoofed Emails (2005) (27)
Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983) (27)
Results on learnability and the Vapnick-Chervonenkis dimension (1988) (26)
Phish and Chips (2006) (26)
A Modular Voting Architecture ("Frogs") (2001) (25)
A Fair Protocol for Signing Contracts (Extended Abstract) (1985) (25)
Being taught can be faster than asking questions (1995) (25)
Going from bad to worse: from Internet voting to blockchain voting (2021) (24)
The subgraph homeomorphism problem (1978) (22)
Is DES a Pure Cipher? (Results of More Cycling Experiments on DES) (1985) (22)
Translucent Cryptography—An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer (1999) (22)
An application of number theory to the organization of raster-graphics memory (1982) (22)
The "PI" (Placement And Interconnect) System (1982) (22)
Scantegrity Mock Election at Takoma Park (2010) (21)
k+1 Heads Are Better than k (1976) (20)
A non-iterative maximum entropy algorithm (1986) (20)
Critical remarks on “Critical Remarks on Some Public-Key Cryptosystems” by T. Herlestam (1979) (20)
Does Anyone Really Need MicroPayments? (2003) (20)
The Story Of Non-Secret Encryption (1997) (19)
Complete variable-length “fix-free” codes (1995) (18)
Privacy-Preserving Automated Exposure Notification (2020) (18)
Marked Mix-Nets (2017) (17)
Perspectives on Financial Cryptography (1997) (17)
Lightweight Email Signatures (Extended Abstract) (2006) (17)
Inferring graphs from walks (1990) (16)
Research directions in computer science: an MIT perspective (1991) (16)
Separable Identity-Based Ring Signatures : Theoretical Foundations For Fighting Phishing Attacks (2005) (15)
Advances in Cryptology (1983) (15)
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games (2018) (15)
Finding Four Million Large Random Primes (1990) (15)
The use of public key cryptography in communication system design (1978) (15)
Max-flow Min-cut Theorem (1998) (14)
Towards secure quadratic voting (2016) (14)
Robbing the Bank with a Theorem Prover - (Abstract) (2007) (14)
The invertibility of the XOR of rotations of a binary word (2011) (14)
Is the Data Encryption Standard a Group? (Preliminary Abstract) (1985) (14)
Bernoulli Ballot Polling: A Manifest Improvement for Risk-Limiting Audits (2019) (14)
Advances in Cryptology - ASIACRYPT '91: International Conference on the Theory and Application of Cryptology, Fujiyoshida, Japan, November 11-14, 1991. Proceedings (1993) (13)
On Hash-Coding Algorithms for Partial-Match Retrieval (Extended Abstract) (1974) (13)
Two papers on the selection problem: Time Bounds for Selection [by Manual Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, and Robert E. Tarjan] and Expected Time Bounds for Selection [by Robert W. Floyd and Ronald L. Rivest]. (1973) (13)
Permutation Polynomials Modulo (2001) (13)
Learning binary relations and total orders (1989) (13)
The Optimality of Correlated Sampling (2016) (13)
Lightweight email signatures (2006) (12)
The Algorithm SELECT - for Finding the ith Smallest of n Elements [M1] (Algorithm 489) (1975) (12)
Simulation results for a new two-armed bandit heuristic (1994) (12)
A Modular Voting Architecture ("Frog Voting") (2010) (12)
A ‘greedy’ channel router (1983) (12)
Incrementally Learning Time-Varying Half Planes (1991) (12)
RSA Problem (2011) (11)
Ad-Hoc-Group Signatures from Hijacked Keypairs (2005) (11)
MD4 Message Digest Algorithm (1990) (10)
The mutual exclusion problem for unreliable processes (1976) (10)
A "paradoxical" solution to the signature problem (2019) (10)
Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Truste (1999) (10)
Access-controlled resource discovery for pervasive networks (2003) (10)
Bayesian Tabulation Audits: Explained and Extended (2018) (9)
Coping with errors in binary search procedures (Preliminary Report) (1978) (9)
"Forwards and Backwards" Encryption (1980) (9)
Learning complicated concepts reliably and usefully (Extended abstract) (1988) (9)
RSA Problem (2005) (9)
Butler Lampson Microsoft (1999) (9)
ClipAudit: A Simple Risk-Limiting Post-Election Audit (2017) (9)
An Ω(n2 log n) lower bound to the shortest paths problem (1977) (8)
Auditing Australian Senate Ballots (2016) (8)
Sharper p-Values for Stratified Election Audits (2011) (8)
A New Model for Inductive Inference (1988) (8)
Statistical Analysis of the Hagelin Cryptograph (1981) (7)
A “ Sum of Square Roots ” ( SSR ) Pseudorandom Sampling Method For Election Audits (2008) (7)
Constraints and prospects (1994) (6)
ThreeBallot in the Field (2006) (6)
Picture-Hanging Puzzles (2013) (6)
On Self-Organizing Sequential Search Heuristics (1974) (6)
A Unified Evaluation of Two-Candidate Ballot-Polling Election Auditing Methods (2020) (6)
Drifting Keys: Impersonation detection for constrained devices (2013) (6)
Machine Learning: From Theory to Applications (1993) (5)
A Simple Rule of Thumb for Election Audit Size Determination (2007) (4)
Privacy Tradeoffs: Myth or Reality? Panel (2002) (4)
DiffSum - A Simple Post-Election Risk-Limiting Audit (2015) (4)
Selected Areas in Cryptography (2011) (4)
On the Security of the EMV Secure Messaging API (Extended Abstract) (2007) (4)
A Short Report on the RSA Chip (1982) (4)
Proceedings of a workshop on Computational learning theory and natural learning systems (vol. 1) : constraints and prospects: constraints and prospects (1994) (4)
The Eary Days of RSA: History and Lessons (2007) (4)
Assertion-based Approaches to Auditing Complex Elections, with application to party-list proportional elections (2021) (3)
Proceedings of the Second Annual Workshop on Computational Learning Theory : University of California, Santa Cruz, July 31-August 2, 1989 (1989) (3)
Learning Binary Relations and Total Orders (Extended Abstract) (1989) (3)
THE FUTURE OF VOTING End-To-End Verifiable Internet Voting Expert Statements (2015) (3)
The game of "N questions" on a tree (1977) (3)
Statistics , Politics , and Policy Sharper p-Values for Stratified Election Audits (2011) (3)
Electronic Voting (2017) (3)
When Is an Election Verifiable? (2017) (3)
An Optimal Real- Time Algorithm for Planar Convex Hulls (1979) (3)
On NIST's Proposed Digital Signature Standard (1991) (3)
The Scantegrity Voting System and its Use in the Takoma Park Elections (2017) (3)
Guest editorial: special issue on electronic voting (2009) (2)
An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract) (1982) (2)
A Data Structure for Manipulating Priority Queues (1978) (2)
k-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-Election Audits (2019) (2)
Vortex air rings (1992) (2)
To tap or not to tap. Comment (1993) (2)
Machine Learning: From Theory to Applications : Cooperative Research at Siemens and Mit (1993) (2)
The Security of the Rc6 Tm Block Cipher (1998) (2)
On the time required to recognize properties of graphs from their adjacency matrices (2019) (2)
On the time required to recognize properties of graphs from their adjacency matrices (2019) (2)
Tweakable block ciphers - eScholarship (2002) (2)
Scantegrity Responds to Rice Study on Usability of the Scantegrity II Voting System (2014) (2)
Estimating a Probability Using Finite Memory (Extended Abstract) (1983) (2)
Some Comments on the First Round AES Evaluation of RC 6 (1999) (2)
A PROCEDURE FOR IMPROVING THE UPPER BOUND FOR THE NUMBER OF ̂OMINOES OF ̂OMINOES OF ̂OMINOES (1973) (2)
Preliminary Voting -- Prevoting (2005) (1)
Information, Data, Security in a Networked Future (2012) (1)
The Case for RC 6 as the AES (2000) (1)
A Tribute to David Kahn (2009) (1)
Optimality of Correlated Sampling Strategies (2020) (1)
Leading the field: Fortune favors the bold in Thurstonian choice models (2019) (1)
Picture-Hanging Puzzles (2012) (1)
BatchVote: Voting Rules Designed for Auditability (2017) (1)
Consistent Sampling with Replacement (2018) (1)
On Choosing between Experimenting and Thinking when Learning (1993) (1)
Inference of Finite Automata Using Homing Sequences (1993) (1)
Multi-grade cryptography (1995) (1)
LAB Mode for Iterated Hash Functions (2010) (0)
CALL FOR PAPERS IEEE Transactions on Information Forensics and Security: Special Issue on Electronic Voting (2009) (0)
Cryptography and Cybersecurity (2017) (0)
5. an Eecient Algorithm for the Opening and Closing Filters (2000) (0)
Research in Cryptography , Information Security and Algorithm Development 9807-12 & 26 Progress Report : July 1 , 2000 — December 31 , 2000 (1999) (0)
Frontiers of Electronic Voting, 29.07. - 03.08.2007 (2008) (0)
The remotely controllable access system. (1991) (0)
Can Simple Electronic Voting Be Voter-Veri able ? (2008) (0)
A Report by an Ad Hoc Group of Cryptographers and Computer Scientists & Trusted Third Party Encryption (1998) (0)
Access-controlled resource discovery in pervasive networks: Research Articles (2004) (0)
End-to-end verifiablity (2016) (0)
RSA ENCRYPTION AND DIFFIE HELLMAN KEY EXCHANGE (2009) (0)
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 (1979) (0)
An Open Letter to the Members of the Massachusetts Legislature Regarding the Adoption of Actuarial Risk Assessment Tools in the Criminal Justice System (2017) (0)
9807-12 & 26 Research in Cryptography , Information Security and Algorithm Development (2000) (0)
Problem Set 4 Solutions Problem (2003) (0)
6.045J / 18.400J Automata, Computability, and Complexity, Spring 2002 (2002) (0)
Ist 230 Team 7 Project 2 Zenotech Cryptography Analysis Explanation of Des Cryptography (0)
Review of ElGamal DSS RSA Elliptic Curves (1997) (0)
A New Model for Inductive Inference (extended Abstract) (1988) (0)
An Analyzer for Message Sequence Charts 15 Lemma 4.1 the Timed M S C M Is Timing Inconsistent I the Graph G M 5 an Msc Analysis Tool 4 Mscs with Timing Constraints (0)
07311 Executive Summary -- Frontiers of Electronic Voting (2007) (0)
Global Wire Routing in Two-Dimensional Arrays 1 (1987) (0)
Geometric Cryptography Identi cation by Angle Trisection (1997) (0)
Voting: What Has Changed, What Hasn't, & Why: Research Bibliography (2013) (0)
A Proposal for Research With the Goal of Formulating A Computational Theory of Rational Action (2008) (0)
A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack**This research was supported by NSF grant MCS-80-06938, an IBM/MIT Faculty Development Award, and DARPA contract N00014-85-K-0125. (1987) (0)
Comments on NIST Draft Requirements and Criteria for Hash Algorithm (2007) (0)
6 Related Work Pbe from Computation Traces 7 Concluding Remarks (1995) (0)
Cognitive Sorting (2019) (0)
Lecture 22: Voter Veriflcation in Mix-net Voting Systems (2004) (0)
Factoring and Cryptography (1988) (0)
DNA Screening Technical Note Cryptographic Aspects of DNA Screening (2020) (0)
Comparison Results on Fu and Register Counts Accurately Handle Don't-care Conditions in High-level Designs and Application for Reducing Initialized Registers Chou Et Al.: Accurately Handle Don't-care Conditions in High-level Designs and Application for Reducing Initialized Registers 647 (0)
Papers on the Selection Problem Time Bounds for Selection Expected Time Bounds for Selection Time Bounds for Selection By (1998) (0)
Lepinski 1 Two-By-Two Verifiable Mixes (2004) (0)
Readings for Lecture 23 (1997) (0)
Report on “ Honeywords : Making Password-Cracking Detectable ” (2015) (0)
Preliminary Voting — (2005) (0)
LTCC Course on Graph Theory 2013 / 14 Notes 3 Complexity and Algorithms (2013) (0)
Geometric Cryptography : Identi cation by Angle Trisection ( Draft 2 ) (1997) (0)
Coalition Petition to the U.S. Department of Education to Amend 34 CFR Part 99 to Establish a Data Security Rule (2016) (0)
An IBE-based Signcryption Scheme for Group Key Management (2016) (0)
2 Scapegoat and Splay Trees 2 . 1 Definitions (0)
Research in Cryptography , Information Security and Algorithm Development 9807-12 & 26 Progress Report : January 1 , 2001 – June 30 , 2001 (2000) (0)
RSA Attacks By Abdulaziz Alrasheed and Fatima 1 Introduction Invented (2014) (0)
07311 Abstracts Collection -- Frontiers of Electronic Voting (2007) (0)
A COMPARISION STUDY OF RSA AND DSA ALGORITHM IN MOBILE CLOUD COMPUTING K.Sivaraman (2017) (0)
The BLIZZARD computer architecture (1979) (0)
Statistical Robustness of Voting Rules (2012) (0)
Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology (1991) (0)
16. Greedy-Algorithmen (2017) (0)
Access‐controlled resource discovery in pervasive networks (2004) (0)
A simple model for assessing climate control trade-offs and responding to unanticipated climate outcomes (2021) (0)
A multi-control climate policy process for a trusted decision maker (2020) (0)
Security of Voting Systems (2007) (0)
Strategic Directions in Machine Learning (1993) (0)
Proceedings of the workshop on Computational learning theory and natural learning systems (vol. 2) : intersections between theory and experiment: intersections between theory and experiment (1994) (0)
PayWord and MicroMint ( extended abstract ) (2012) (0)
US 6 , 282 , 546 B 1 Page 3 “ A Unix Network Protocol Security Study : Network Infor mation Service ' (2017) (0)
2006 USENIX/ACCURATE Electronic Voting Technology Workshop (EVT '06) Sponsored by USENIX, The Advanced Computing Systems Association, and ACCURATE, A Center for Correct, Usable, Reliable, Auditable, and Transparent Elections (2006) (0)
Binary GCD Algorithm (2011) (0)
Picking the Best Expert from a Sequence (1995) (0)
Reflections on the VTP's contributions to science, policymaking and education (2010) (0)
6.857 Network and Computer Security, Fall 2003 (2003) (0)
Problem Set 2 Solutions Problem 1-1 . One-Time Pads (2002) (0)
Privacy Tradeoffs: Myth or Reality? (Panel Summary) (2003) (0)
Problem Set 3 Solutions Problem 3-1 . All your PRIMES (0)
7 Conclusion and Open Problems (1994) (0)
Research in Cryptography , Information Security and Algorithm Development 9807-12 & 26 Progress Report : July 1 , 1999 — December 31 , 1999 (2000) (0)
Caltech/MIT Voting Technology Project (2004) (0)
Intersections between theory and experiment (1994) (0)
Implementing Quicksort Programs (1978) (0)

This paper list is powered by the following services:

Ron Rivest

Why Is Ron Rivest Influential?

Ron Rivest's Published Works

Published Papers

Other Resources About Ron Rivest

What Schools Are Affiliated With Ron Rivest?

Ron Rivest's AcademicInfluence.com Rankings

Image Attributions

Ron Rivest

Why Is Ron Rivest Influential?

Ron Rivest's Published Works

Published Papers

Other Resources About Ron Rivest

What Schools Are Affiliated With Ron Rivest?

Ron Rivest's Academic­Influence.com Rankings

Image Attributions

Ron Rivest's AcademicInfluence.com Rankings