#344

Most Influential Person

American cryptographer

Ron Rivestcomputer-science Degrees

Computer Science

#32

World Rank

#35

Historical Rank

#18

USA Rank

Software Engineering

#32

World Rank

#32

Historical Rank

#19

USA Rank

Database

#78

World Rank

#80

Historical Rank

#45

USA Rank

Computer Science

- PhD Computer Science Stanford University
- Masters Computer Science Stanford University

According to Wikipedia, Ronald Linn Rivest is a cryptographer and computer scientist whose work has spanned the fields of algorithms and combinatorics, cryptography, machine learning, and election integrity. He is an Institute Professor at the Massachusetts Institute of Technology , and a member of MIT's Department of Electrical Engineering and Computer Science and its Computer Science and Artificial Intelligence Laboratory.

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

This paper list is powered by the following services:

Ron Rivest is affiliated with the following schools:

This website uses cookies to enhance the user experience. Read the Privacy Policy for more.