Rivest, Ronald L. - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

Advanced Search

Rivest, Ronald L. - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

A Modular Voting Architecture ("Frogs")
Electronic Lottery Tickets as Micropayments Ronald L. Rivest
Making Maximum Entropy Computations Easier By Adding Extra Constraints
Can We Eliminate Certificate Revocation Lists? Ronald L. Rivest
Learning Binary Relations and Total Orders Sally A. Goldman
Electronic Voting Ronald L. Rivest
The New York Times > Opinion > Editorial Observer | Making Votes Count: Where the Action's at for Poll Watchers: Ohio as the New Florida October 31, 2004
Technical Report Computer Laboratory
The New York Times > Opinion > Making Votes Count: The Shame of New York August 10, 2004
The Security of the RC6 Block Cipher
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks* (Revision March 23, 1995)
On the Notion of PseudoFree Groups Ronald L. Rivest
The New York Times > Opinion > Making Votes Count: Barriers to Student Voting September 28, 2004
A Modular Voting Architecture ("Frogs") Shuki Bruck (CalTech, bruck@paradise.caltech.edu)
Are `Strong' Primes Needed for RSA? Ronald L. Rivest \Lambda
Geometric Cryptography: Identi cation by Angle Trisection Mike Burmester
ON DATA BANKS AND PRIVACY HOMOMORPHISMS Ronald L. Rivest
The New York Times > Opinion > Making Votes Count: Voter ID Problems in Florida September 7, 2004
DIMACS Technical Report 9933 Millimix: Mixing in Small Batches
Multigrade cryptography Ronald L. Rivest
RSA Problem Ronald L. Rivest, MIT Laboratory for Computer Science
Making Votes Count: Florida as the Next Florida March 14, 2004
AccessControlled Resource Discovery for Pervasive Networks Sanjay Raman, Dwaine Clarke, Matt Burnside, Srinivas Devadas, Ronald Rivest
Three Voting Protocols: ThreeBallot, VAV, and Twin Ronald L. Rivest
Making Votes Count: The Perils of Online Voting January 23, 2004
The RC5 Encryption Algorithm? Ronald L. Rivest
Prof. Ronald L. Rivest MIT Laboratory for Computer Science
Permutation Polynomials Modulo 2 w Ronald L. Rivest
On Estimating the Size of a Statistical Audit Ronald L. Rivest
The New York Times > Opinion > Making Votes Count: The Poll Tax, Updated October 7, 2004
Picking the Best Expert from a Sequence Ruth Bergman
Peppercoin Micropayments Ronald L. Rivest
A Universally Composable Mix-Net Douglas Wikstrom 1;2
Self-Delegation with Controlled Propagation or What If You Lose Your Laptop
How America Doesn't Vote February 15, 2004
The New York Times > Opinion > Felons and the Right to Vote July 11, 2004
The New York Times > Opinion > Making Votes Count: About Those Election Results November 14, 2004
Finding Four Million Large Random Primes Ronald L. Rivest
Learning Decision Lists Ronald L. Rivest
An Optimal Single-Winner Preferential Voting System Based on Game Theory
What Could Be What Could Be
Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy
Pseudonym Systems (Extended Abstract)
Translucent Cryptography ---An Alternative to Key Escrow, and its Implementation via Fractional Oblivious Transfer \Lambda
Abelian square-free dithering for iterated hash Ronald L. Rivest
The New York Times > Opinion > Making Votes Count: Improving Provisional Ballots November 21, 2004
RESEARCHCONTRIBUTIONS Programming
Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a
www.sciencemag.org SCIENCE VOL 328 7 MAY 2010 689 edited by Jennifer Sills
Being Taught can be Faster than Asking Questions
Transitive Signature Schemes Silvio Micali and Ronald L. Rivest
The New York Times > Opinion > Insurance for Electronic Votes July 23, 2004
Small Journal Name, ??, 1--29 (??) fl ?? Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
Complete VariableLength ``FixFree'' Codes David Gillman \Lambda
ProxyBased Security Protocols in Networked Mobile Devices
The New York Times > Opinion > They Said It Couldn't Be Done September 18, 2004
Game Tree Searching by Min/Max Approximation Ronald L. Rivest
Geometric Cryptography: Identification by Angle Trisection Mike Burmester \Lambda
SRUTI '05: Steps to Reducing Unwanted Traffic on the Internet WorkshopUSENIX Association 83 Lightweight Encryption for Email
Multi-grade cryptography Ronald L. Rivest
The RC5 Encryption Algorithm? Ronald L. Rivest
Peppercoin Micropayments Ronald L. Rivest
Piecemeal Graph Exploration by a Mobile Robot \Lambda Baruch Awerbuch Margrit Betke
Making Maximum Entropy Computations Easier By Adding Extra Constraints
An Optimal Single-Winner Preferential Voting System Based on Game Theory
The New York Times > Opinion > Making Votes Count: Playing With the Election Rules September 30, 2004
Timelock puzzles and timedrelease Crypto Ronald L. Rivest \Lambda , Adi Shamir \Lambda\Lambda , and David A. Wagner \Lambda\Lambda\Lambda
COMMUNICATIONS OF THE ACM October 2004/Vol. 47, No. 10 65 A former proponent of requiring the availability of
A Generalization of Paillier's Public-Key System with Applications to Electronic Voting
The New York Times > Opinion > The New Hanging Chads August 19, 2004
Improved Analysis of Some Simplified Variants of RC6
Preliminary Voting --Prevoting Ronald L. Rivest
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
Independent qualification testing is a prerequisite in over 40 U.S. states for seeking
The New York Times > Opinion > Bad New Days for Voting Rights April 18, 2004
COMMUNICATIONS OF THE ACM October 2004/Vol. 47, No. 10 43 Considering the effects and implications of changing only
To appear in the Journal of the Association for Computing Machinery. Diversity-Based Inference of Finite Automata
How to Leak a Secret Ronald L. Rivest
A Secure and Optimally Efficient MultiAuthority Election Scheme
Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a
Tweakable Block Ciphers Moses Liskov 1 , Ronald L. Rivest 1 , and David Wagner 2
The New York Times > Opinion > Making Votes Count: A Compromised Voting System April 24, 2004
The New York Times > Opinion > Editorial: The Return of the 'Butterfly Ballot' October 29, 2004
Making Votes Count: How to Hack an Election January 31, 2004
To appear in the Journal of the Association for Computing Machinery. DiversityBased Inference of Finite Automata
An Optimal Single-Winner Preferential Voting System Based on Game Theory
The New York Times > Opinion > Denying the Troops a Secret Ballot September 3, 2004
COMMUNICATIONS OF THE ACM October 2004/Vol. 47, No. 10 29 By Peter G. Neumann, GUEST EDITOR
Congressional Research Service ~ The Library of Congress CRS Report for Congress
The New York Times > Opinion > The Return of Katherine Harris September 16, 2004
Block Cipher Ronald L. Rivest1, M.J.B. Robshaw2, R. Sidney2, and Y.L. Yin2
The New York Times > Opinion > Making Votes Count: Who Tests Voting Machines? May 30, 2004
On the Design and Security of RC2 Lars R. Knudsen1, Vincent Rijmen2, Ronald L. Rivest3,
urrent electronic voting machines at polling places don't give receipts. Rather, they require
Volume 5, number 5 INFORMATION PROCESSING LETTERS November 1976 This paper presents an analysis of a simple tree-
Access-Controlled Resource Discovery for Pervasive Networks Sanjay Raman, Dwaine Clarke, Matt Burnside, Srinivas Devadas, Ronald Rivest
Time-lock puzzles and timed-release Crypto Ronald L. Rivest , Adi Shamir , and David A. Wagner
The New York Times > Opinion > The Pentagon's Troubling Role August 31, 2004
How to Tell if Your Cloud Files Are Vulnerable to Drive Crashes
The MD6 hash function A proposal to NIST for SHA-3
A "Sum of Square Roots" (SSR) Pseudorandom Sampling Method For Election Audits
A Simple Rule of Thumb for Election Audit Size Determination Ronald L. Rivest
On the Security of the EMV Secure Messaging API Ben Adida Mike Bond Jolyon Clulow Amerson Lin Ross Anderson
On Auditing Elections When Precincts Have Different Sizes Ronald L. Rivest
Fourth-Factor Authentication: Somebody You Know John Brainard
Scratch & Vote Self-Contained Paper-Based Cryptographic Voting
Lightweight Signatures for Email Susan Hohenberger,
Lightweight Email Signatures Susan Hohenberger,
On the Notion of Pseudo-Free Groups Ronald L. Rivest
RSA Problem Ronald L. Rivest, MIT Laboratory for Computer Science
The Untrusted Computer Problem and Camera-Based Authentication
Proxy-Based Security Protocols in Networked Mobile Devices
Electronic Voting Ronald L. Rivest
Electronic Voting Ronald L. Rivest
Pseudonym Systems (Extended Abstract)
Are `Strong' Primes Needed for RSA? Ronald L. Rivest
Permutation Polynomials Modulo 2w Ronald L. Rivest
Improved Analysis of Some Simplified Variants of RC6
Translucent Cryptography | An Alternative to Key Escrow, and its Implementation via Fractional Oblivious Transfer
Translucent Cryptography | An Alternative to Key Escrow, and its Implementation via Fractional
Small Journal Name, ??, 1{29 (??) c ?? Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
Inference of Finite Automata Using Homing Sequences (Extended Abstract)
Game Tree Searching by Min/Max Approximation Ronald L. Rivest
Programming S.L. Graham, R.L. Rivest*
Voting Systems Performance and Test Standards: An Overview
For nearly a year, the national election reform debate has become dominated by a single issue: can voters trust that their ballots will be
Making Each Vote Count
The Vector-Ballot E-Voting Approach Aggelos Kiayias1
Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking
Rapid Mixing and Security of Chaum's Visual Electronic Voting
Witness Indistinguishable and Witness Hiding Protocols Uriel Feige, Adi Shamir
An Optimal Single-Winner Preferential Voting System Based on Game Theory
COMMUNICATIONS OF THE ACM October 2004/Vol. 47, No. 10 31 Surveying the effort to create a new implementation-independent
COMMUNICATIONS OF THE ACM October 2004/Vol. 47, No. 10 39 Sharing the experiences of the first statewide adoption of
Elections are conceptually trivial: After everyone has voted, the votes in each ballot
COMMUNICATIONS OF THE ACM October 2004/Vol. 47, No. 10 53 The disparity between the code of election law and the
COMMUNICATIONS OF THE ACM October 2004/Vol. 47, No. 10 69 eeking to bolster the security, accessi-
The New York Times > Opinion > Making Votes Count: Setting Standards for Fair Elections December 27, 2004
The New York Times > Opinion > Making Votes Count: New York's Electoral Mess December 8, 2004
The New York Times > Opinion > Editorial: New Standards for Elections November 7, 2004
The New York Times > Opinion > Making Votes Count: The Three-Hour Poll Tax October 27, 2004
The New York Times > Opinion > Making Votes Count: Election Day Misdeeds October 26, 2004
The New York Times > Opinion > Editorial: What Congress Should Do October 24, 2004
The New York Times > Opinion > On the Voting Machine Makers' Tab September 12, 2004
The New York Times > Opinion > Abolish the Electoral College August 29, 2004
The New York Times > Opinion > Editorial Observer: Indians Face Obstacles Between the Reservation and the Ballot Box June 21, 2004
The New York Times > Opinion > Making Votes Count: Gambling on Voting June 13, 2004
The New York Times > Opinion > Making Votes Count: Voting Machines for New York May 18, 2004
The New York Times > Opinion > Making Votes Count: Voting Reform Could Backfire May 9, 2004
The Confusion Over Voter ID April 4, 2004
Making Votes Count: When the Umpires Take Sides March 29, 2004
Making Votes Count: Elections With No Meaning February 21, 2004
Complete Variable-Length \Fix-Free" Codes David Gillman
Diversity-Based Inference of Finite Automata RONALD L. RIVEST AND ROBERT E. SCHAPIRE
Trusted Agent Report Diebold AccuVote-TS Voting System
Micropayments Revisited Silvio Micali and Ronald L. Rivest
Electronic Voting Ronald L. Rivest
The New York Times > Opinion > An Umpire Taking Sides July 9, 2004
Universal Re-encryption for Mixnets Philippe Golle1
Cryptography and Machine Learning Ronald L. Rivest
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields
An Ecient Signature Scheme for Route Aggregation
Making Votes Count: Fixing Democracy January 18, 2004
PayWord and MicroMint: Two simple micropayment schemes
Thoughts on UOCAVA Voting Ronald L. Rivest
The New York Times > Opinion > Making Votes Count: Count Every Vote December 20, 2004
Learning Binary Relations and Total Orders Sally A. Goldman
Picking the Best Expert from a Sequence Ruth Bergman \Lambda
Issues in Cryptography Ronald L. Rivest
The New York Times > Opinion > Making Votes Count: The Disability Lobby and Voting June 11, 2004
The ThreeBallot Voting System Ronald L. Rivest
Programming G. Manacher Techniques Editor
Making Votes Count: Editorial Observer: The Results Are in and the Winner Is . . . or Maybe Not February 29, 2004
I. Electronic Voting Systems--Is Brazil Ahead of its Time?
Ad-Hoc-Group Signatures from Hijacked Keypairs Susan Hohenberger,
Piecemeal Graph Exploration by a Mobile Robot Baruch Awerbuch Margrit Betke
Early Appraisals of Electronic Voting Paul S. Herrnson, Owen G. Abbe, Peter L. Francia
The growth of cryptography Ronald L. Rivest
COMMUNICATIONS OF THE ACM October 2004/Vol. 47, No. 10 59 An extensive assessment of a proposed
Perspectives on Financial Cryptography Ronald L. Rivest
A Verifiable Secret Shuffle and its Application to C. Andrew Neff
The New York Times > Opinion > Editorial: Lessons of the Ballot Box November 4, 2004
Making Maximum Entropy Computations Easier By Adding Extra Constraints
Illegitimi non carborundum Ronald L. Rivest
Computing the Margin of Victory in IRV Elections Thomas R. Magrino
Sharper p-Values For Stratified Election Audits Michael J. Higgins
J. Cryptol. (2011) 24: 588613 DOI: 10.1007/s00145-010-9073-y
Being Taught can be Faster than Asking Questions
The RC5 Encryption Algorithm? Ronald L. Rivest
Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking
USENIX Association Proceedings of the
Picture-Hanging Puzzles Erik D. Demaine
Journal of Computer Security 9 (2001) 285322 285 Certificate chain discovery in SPKI/SDSI
Transitive Signature Schemes Silvio Micali and Ronald L. Rivest
All-or-Nothing Encryption and the Package Transform Ronald L. Rivest
Who Holds t:he Keys? NIST'sProposal
Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes
k + 1 Heads Are Better than k ANDREW C. YAO AND RONALD L. RIVEST
Privacy Tradeoffs: Myth or Reality? (Panel Summary)
SIAM J. COMPUT. Vol. 9, No. 4, November 1980
IEEE TRANSACTIONS ON COMPUTERS, JUNE 1977 space methods ofpattern recognition which combine the role of
ON SELF-ORGANIZING SEQUENTIAL SEARCH HEURISTICS Ronald L. RIVEST.*
592 PROBLEMS (Problem 84-2) by J. L. Bentley (Bell Laboratories), C. E. Leiserson (MIT),
Optimal Arrangement of Keys in a Hash Table RONALD L. RIVEST
R e c o m m e n d a t i o n s t o t h e E A C
Block Cipher Ronald L. Rivest1, M.J.B. Robshaw2, R. Sidney2, and Y.L. Yin2
An Application of Number Theory to the Organization of Raster-GraphicsMemory
Is the Data Encryption Standard a Group?' (Preliminary Abstract)*'
Lightweight Email Signatures (Extended Abstract)
An ~(n 2 log n) Lower Bound to the Shortest Paths Problem %~ Andrew C. Yao
On Permutation Operations in Cipher Design Ruby B. Lee, Z. J. Shi and Y. L. Yin
Preliminary Voting --Prevoting Ronald L. Rivest
CLIMATE CHANGE AND THE INTEGRITY OF SCIENCE Lead Letter Published in Science magazine, May 7, 2010
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-32, NO. 6, NOVEMBER1986 Estimating a Probability Using
The Blocker Tag: Selective Blocking of RFID Tags for Consumer Privacy
Machine Learning 2:229 246, 1987 @ 1987 Kluwer Academic Publishers, Boston Manufactured in The Netherlands
The Untrusted Computer Problem and Camera-Based Authentication
Computing the Margin of Victory in IRV Elections Thomas R. Magrino
K + 1 HEADS ARE BETTER THAN Kt * **Andrew C. Yao and Ronald L. Rivest
On Auditing Elections When Precincts Have Different Sizes Ronald L. Rivest
INFORMATION AND CONTROL 55, 1--19 (1982) How to Reuse a "Write-Once" Memory*
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
Information and Computation 152, 155 172 (1999) Piecemeal Graph Exploration by a Mobile Robot*
A NEW MODEL FOR INDUCTIVE INFERENCE (Extended Abstract)
Inference of Finite Automata Using Homing Sequences (Extended Abstract)
On the Security of the EMV Secure Messaging API Ben Adida Mike Bond Jolyon Clulow Amerson Lin Ross Anderson
On the notion of "software independence" in voting systems
Scantegrity Mock Election at Takoma Park Alan T. Sherman (UMBC)1
Pseudonym Systems (Extended Abstract)
Improved Analysis of Some Simplified Variants of RC6
EFFICIENT FACTORING BASED ON PARTIAL INFORMATION
Learning Binary Relations and Total Orders (Extended Abstract)
Time-lock puzzles and timed-release Crypto Ronald L. Rivest , Adi Shamir , and David A. Wagner
Communications The Use of Public Key Cryptography
Scratch & Vote Self-Contained Paper-Based Cryptographic Voting
Ad-Hoc-Group Signatures from Hijacked Keypairs Susan Hohenberger,
Learning Complicated Concepts eliably and Usefully (Extended Abst
Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security
Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy
Volume 5, number 5 INFORMATION PROCESSING LETTERS November 1976 This paper presents an analysis of a simple tree-
Geometric Cryptography: Identi cation by Angle Trisection Mike Burmester
Diversity-Based Inference of Finite Automata RONALD L. RIVEST AND ROBERT E. SCHAPIRE
C R Y P T O B Y T E ST H E T E C H N I C A L N E W S L E T T E R O F R S A L A B O R A T O R I E S --S P R I N G 1 9 9 6 7 PayWord and MicroMint (extended abstract)
Electronic Voting Ronald L. Rivest
On Auditing Elections When Precincts Have Different Sizes Javed A. Aslam
A 'greedy' channel router Ronald L Rivest and Charles M Fiduccia
On the Security of the EMV Secure Messaging API (Extended Abstract)
An Optimal Single-Winner Preferential Voting System Based on Game Theory
THE SUBGRAPH HOMEOMORPHISM PROBLEM Andrea 5. LaPaugh and Ronald L. Rivest'~
A Knapsack Type Public Key Ctyptosystern Based On Arithmetic in Finite Fields
40 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 36. NO. 1.JANUARY 1990 A Fair Protocol for Signing Contracts
www.sciencemag.org SCIENCE VOL 328 7 MAY 2010 689 edited by Jennifer Sills
SIAM J. COMPUT. Vol. 6, No. 4, December 1977
Is DES a Pure Cipher? (Results of More Cycling Experiments on DES)l
An Optimal Single-Winner Preferential Voting System Based on Game Theory
PayWord and MicroMint: Two Simple Micropayment Schemes
Programming G. Manacher Techniques Editor
Training a 3-Node Neural Network is NP-Complete
The Blocker Tag: Selective Blocking of RFID Tags for Consumer Privacy
Multi-grade cryptography Ronald L. Rivest
ARTIFICIAL INTELLIGENCE 77 Game Tree Searching by
Can We Eliminate Certificate Revocation Lists? RonMd L. Rivest
Robbing the Bank with a Theorem Prover , Ben Adida2
Can. J. Math., Vol. XXV, No. 3, 1973, pp. 585-602 A PROCEDURE FOR IMPROVING THE UPPER BOUND
A "PARADOXICAL" SOLUTION To THE SIGNATURE PROBLEM* Shafi Goldwasser**
The RC5 Encryption Algorithm* Ronald L. Rivest
The Business of Electronic Voting , C. Andrew Neff2
Robbing the Bank with a Theorem Prover (Transcript of Discussion)
Fourth-Factor Authentication: Somebody You Know John Brainard
Self-Delegation with Controlled Propagation -or -What If You Lose Your Laptop
J. Cryptol. (2011) 24: 588613 DOI: 10.1007/s00145-010-9073-y
COPING W!TH ERRORS 1N BINARY SEARCH PROCEDURES (Preliminary Report)
ON DATA BANKS AND PRIVACY HOMOMORPHISMS Ronald L. Rivest
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 7, 448-461 (1973) Time Boundsfor Selection*
Inferring Graphs from Walks (Extended Abstract)
Sharper p-Values For Stratified Election Audits Michael J. Higgins
972 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 42, NO. 3, MAY 1996 correspondence
BIT 19 (1979k 27~275 CRITICAL REMARKS ON
Can We Eliminate Certificate Revocation Lists? Ronald L. Rivest
12C R Y P T O B Y T E S S U M M E R 1 9 9 8 --T H E T E C H N I C A L N E W S L E T T E R O F R S A L A B O R A T O R I E S Chaffing and Winnowing
Scapegoat Trees Igal Galperin* Ronald L. Rive&*
A "Sum of Square Roots" (SSR) Pseudorandom Sampling Method For Election Audits
Algorithmica (1987) 2:113-129 Algorithmica9 1987 Spdnger-Verlag New York Inc.
Frontiers of Electronic Voting -Dagstuhl Seminar 07311
Access-Controlled Resource Discovery for Pervasive Networks Sanjay Raman, Dwaine Clarke, Matt Burnside, Srinivas Devadas, Ronald Rivest
INFORMATION AND COMPUTATION 90, 3349 (1991) Results on Learnability and the
L.D. Fosdick and A.K. Cline, Editors
Piecemeal Graph Exploration by a Mobile Robot (Extended Abstract) *
Translucent Cryptography | An Alternative to Key Escrow, and its Implementation via Fractional Oblivious Transfer
Peppercoin Micropayments Ronald L. Rivest
INFORMATION AND COMPUTATION 80, 227-248 (1989) Inferring Decision Trees Using the Minimum
doi: 10.1098/rsta.2008.0149 , 3759-37673662008Phil. Trans. R. Soc. A
How to Tell if Your Cloud Files Are Vulnerable to Drive Crashes
Self-Delegation with Controlled Propagation or What If You Lose Your Laptop
ON HASH-CODING ALGORITHMS FOR PARTIAL-MATCH RETRIEVAL (Extended Abstract)
Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes
Global Wiire Routing in Two-Dimensional Arrayst (Extended Abstract)
What Could Be What Could Be
Diversity-Based Inference of Finite Automata (Extended Abstract)
Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 4, NO. 4, DECEMBER 2009 593 Guest Editorial
RSA Chips (Past/Present/Future)' (&tended abstract)
SIAM J. COMPUT. Vol. 17, No. 2, April 1988
J. Cryptology (1999) 12: 117139 1999 International Association for
An Application of Number Theory Organization of Raster..Graphics Memory
On the Design and Security of RC2 Lars R. Knudsen1
Abelian Square-Free Dithering for Iterated Hash Functions
Proxy-Based Security Protocols in Networked Mobile Devices"
SIAM J. COMPUT. Vol. 22, No. 5, pp. 1006-1034, October 1993
A Fair Protocol for Signing Contracts (Extended Abstrac0
TRAINING A 3-NODE NEURAL NETWORK IS NP-COMPLETE
On the Notion of Pseudo-Free Groups Ronald L. Rivest
Piecemeal Learning of an Unknown Environment (Extended Abstract ) *
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 20, 133-149 (1980) The Subgraph Homeomorphism Problem
Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a
CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE Concurrency Computat.: Pract. Exper. 2004; 16:10991120 (DOI: 10.1002/cpe.806)
A Modular Voting Architecture ("Frogs") Shuki Bruck (CalTech, bruck@paradise.caltech.edu)
PayWord and MicroMint: Two simple micropayment schemes
Volume 8, number 4 INFORMATION PROCESSING LETTERS AN n(@/lg n)`/*) LOWER BOUND ON THE NUMBER OF ADDITIONS NECESSARY TO
How to Leak a Secret Ronald L. Rivest1
I4ow i:o Reuse a "Wri :e -Once" Memoryt (Preliminary ~~rsion)
SIAM J. COMPUT. Vol. 9, No. 2, May 1980
The RC5 Encryption Algorithm? Ronald L. Rivest
194 IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 5, NO. 1, MARCH 2010 Corrections
1/17/12 The Risks Of "Key Recovery," "Key Escrow," And "Trusted Third-Party" Encryption | 1998 1/24www.cdt.org/crypto/risks98/
J. Cryptology (1988) 1:3-36 Journal of Cryptology
Programming S.L. Graham, R.L. Rivest*
From: "mrobshaw" To:
A "GREEDY" CHANNEL ROUTER * by Rouald L. I&vest aud Charles M. Fiduccia
Tweakable Block Ciphers Moses Liskov1
Micropayments Revisited Silvio Micali and Ronald L. Rivest
On Estimating the Size of a Statistical Audit Ronald L. Rivest
Lightweight Email Signatures Susan Hohenberger,
Designs, Codes and Cryptography, 5, 109-114 (1995) 9 1995 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
The Case against Regulating Encryption Technology116 SCIENTIFIC AMERICAN October 1998 he widespread use of cryptography is a necessary
Pseudonym Systems (Extended Abstract)
RESEARCHCONTRIBUTIONS Programming
A GENERALIZATIONAND PROOFOF THE AANDERAA-ROSENBERGCONJECTURE~ Ronald L. Rivest
Finite Fields and Their Applications 7, 287}292 (2001) doi.10.1006/!ta.2000.0282, available online at http://www.idealibrary.com on
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 4, NO. 4, DECEMBER 2009 611 Scantegrity II: End-to-End Verifiability by Voters of
The Mutual Exclusion Problem for Unreliable Processes: Preliminary Rt~port Ronald L. Rivest 'and Vaughan R. Pratt
Being Taught can be Faster than Asking Questions
Perspectives on Financial Cryptography Ronald L. Rivest
Lightweight Encryption for Email ben@mit.edu
Phish and Chips Traditional and New Recipes for Attacking EMV
The Security of the RC6 Block Cipher
RSA Problem Ronald L. Rivest, MIT Laboratory for Computer Science
Programming G. Manacher, S. Graham
The ThreeBallot Voting System Ronald L. Rivest
SIAM J. COMPUT. Vol. 5, No. 1, March 1976
A "PARADOXICAL" SOl.LJTiOI\I TO THE SIGNATURE: PROBLEM' (Ex~cntleciabstract)
Three Voting Protocols: ThreeBallot, VAV, and Twin Ronald L. Rivest
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 34,NO. 5,SEPTEMBER 1988 901 A Knapsack-Type Public Key Cryptosystem
On the Notion of Pseudo-Free Groups Ronald L. Rivest
A Simple Rule of Thumb for Election Audit Size Determination Ronald L. Rivest
JOURNAL OF COMPUTER ANU SYSTEM SCIBNCPS 20, 396404 (1980) Coping with Errors in Binary Search Procedukes*
Picking the Best Expert from a Sequence Ruth Bergman
Technical Report Computer Laboratory
MachineLearning,18,231-254 (1995) 1995KluwerAcademicPublishers,Boston. Manufacturedin TheNetherlands.
LINEAR TIME BOUNDS FOR MEDIAN COMPUTATIONS by Manuel Blum, Robert W. Floyd Vaughan Pratt
Some Comments on the First Round AES Evaluation of RC6
MIKE GODWIN Staff Counsel
On Estimating the Size and Confidence of a Statistical Audit Javed A. Aslam
Estimating a Probability Using Finite Memory * Extended Abstract
Electronic Lottery Tickets as Micropayments Ronald L. Rivest
Making Maximum Entropy Computations Easier By Adding Extra Constraints
The MD6 hash function A proposal to NIST for SHA-3
The BLIZZARD Computer Architecture Ronald L. Rivest
Are `Strong' Primes Needed for RSA? Ronald L. Rivest
November 10, 2009 23:20 International Journal of Computer Mathematics xorrot International Journal of Computer Mathematics
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-33, NO. 3, MAY 1987 323 Network Control by BayesianBroadcast
Proxy-Based Security Protocols in Networked Mobile Devices Matthew Burnside, Dwaine Clarke, Todd Mills, Srinivas Devadas, and Ronald Rivest
Cryptography and Machine Learning Ronald L. Rivest*