?? ronald l_ rivest publications.htm
字號:
?<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<!-- saved from url=(0051)http://theory.lcs.mit.edu/~rivest/publications.html -->
<HTML><HEAD><TITLE>Ronald L. Rivest: Publications</TITLE>
<META http-equiv=Content-Type content="text/html; charset=utf-8">
<META content="MSHTML 6.00.2900.2802" name=GENERATOR></HEAD>
<BODY bgColor=#ffffff>
<H1>Ronald L. Rivest: Publications and Talks</H1>This page under continual
construction...
<H2>List of Publications and Talks</H2>
<UL>
<LI><A href="http://theory.lcs.mit.edu/~rivest/publications.tex">Publications
list.</A> A more-or-less complete list of my publications. Selected
publications, many available on-line, are listed below.
<P></P></LI></UL>
<H2>Cryptography and Security</H2>
<UL>
<LI><EM>On Estimating the Size and Confidence of a Statistical
Audit</EM><BR>by Javed A. Aslam, Raluca A. Popa, and Ronald L.
Rivest.<BR>Unpublished draft. Version 4/22/2007.
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/AslamPopaRivest-OnEstimatingTheSizeAndConfidenceOfAStatisticalAudit.pdf">pdf</A>
</LI></UL>
<P></P>
<LI><EM>On Auditing Elections When Precincts Have Different Sizes</EM><BR>by
Ronald L. Rivest.<BR>Unpublished draft. Version 3/18/2007. Comments
appreciated.
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/Rivest-OnAuditingElectionsWhenPrecinctsHaveDifferentSizes.pdf">pdf</A>
<!-- <li><a href="pps/pps.py">(Corresponding Python code)</a>-->
<LI><A
href="http://theory.lcs.mit.edu/~rivest/pps/oh5votesonly.txt">(Dataset used
in experiment)</A> </LI></UL>
<P></P>
<LI><EM>The ThreeBallot Voting System.</EM><BR>by Ronald L.
Rivest.<BR>Unpublished draft. Version 10/1/06. Comments appreciated.
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/Rivest-TheThreeBallotVotingSystem.pdf">pdf</A>
</LI></UL>
<P></P>
<LI><EM>On Estimating the Size of a Statistical Audit</EM><BR>by Ronald L.
Rivest.<BR>Unpublished draft. Version 11/14/06.<BR>(Superseded by
Aslam/Popa/Rivest paper, above.)
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/Rivest-OnEstimatingTheSizeOfAStatisticalAudit.pdf">pdf</A>
</LI></UL>
<P></P>
<LI><EM>Scratch & Vote---Self-contained Paper-based Cryptographic
Voting</EM><BR>by Ben Adida and Ronald L. Rivest.<BR><EM>Proceedings WPES
'06</EM> (Workshop on Privacy in the Electronic Society 2006).
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/AdidaRivest-ScratchAndVote.pdf">pdf</A>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/AdidaRivest-ScratchAndVote-slides.pdf">pdf
for Ben's slides</A> </LI></UL>
<P></P>
<LI><EM>Perspectives on Financial Cryptography (Revisited)</EM><BR>by Ronald
L. Rivest.<BR>Financial Cryptography '06 Conference Keynote. (Update of talk
given for Financial Cryptography '97)
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/Rivest-PerspectivesOnFinancialCryptographyRevisited.ppt">PowerPoint
slides</A> </LI></UL>
<P></P>
<LI><EM>Preliminary Voting -- Prevoting</EM><BR>by Ronald L. Rivest<BR>(Draft,
to appear in larger report by CalTech/MIT Voting Technology Project.) August
6, 2005.
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/Rivest-PreliminaryVotingPrevoting.pdf">pdf</A>
</LI></UL>
<P></P>
<LI><EM>Abelian square-free dithering for iterated hash functions</EM><BR>by
Ronald L. Rivest<BR>(draft; to appear). August 2005.
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/Rivest-AbelianSquareFreeDitheringForIteratedHashFunctions.pdf">pdf</A>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/Rivest-AbelianSquareFreeDitheringForIteratedHashFunctions.ppt">ppt</A>
(Presented at ECrypt Hash Function Workshop, June 21, 2005, Cracow).
<LI><A
href="http://theory.lcs.mit.edu/~rivest/Rivest-AbelianSquareFreeDithering.c">Freeware
C code for generating dither sequence.</A> </LI></UL>
<P></P>
<LI><EM>Lightweight Encryption for Email</EM><BR>by Ben Adida, Susan
Hohenberger, and Ronald L. Rivest<BR>USENIX Steps to Reducing Unwanted Traffic
on the Internet Workshop (SRUTI), July 2005.
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/AdidaHohenbergerRivest-LightweightEncryptionForEmail.pdf">pdf</A>
</LI></UL>
<P></P>
<LI><EM>Lightweight Email Signatures</EM><BR>by Ben Adida, David Chau, Susan
Hohenberger, and Ronald L. Rivest<BR>(Revised; a preliminary version was
presented at the DIMACS Workshop on Theft in E-Commerce, April 2005.)
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/AdidaChauHohenbergerRivest-LightweightSignaturesForEmail.pdf">pdf</A>
(early version)
<LI><A
href="http://theory.lcs.mit.edu/~rivest/AdidaChauHohenbergerRivest-LightweightEmailSignatures.pdf">pdf</A>
(latest version 2/1/2006) </LI></UL>
<P></P>
<LI><EM>Ad-Hoc-Group Signatures from Hijacked Keypairs</EM><BR>by Ben Adida,
Susan Hohenberger, and Ronald L. Rivest<BR>(Revised; a preliminary version was
presented at the DIMACS Workshop on Theft in E-Commerce, April 2005.)
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/AdidaHohenbergerRivest-AdHocGroupSignaturesFromHijackedKeypairs.pdf">pdf</A>
</LI></UL>
<P></P>
<LI><EM>Electronic Voting</EM><BR>by Ronald L. Rivest<BR>Talk given at NSA,
June 3, 2004.<BR>
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/2004-06-03%20NSA%20talk%20electronic%20voting.ppt">Powerpoint</A>
</LI></UL>
<P></P>
<LI><EM>Remarks on Electronic Voting</EM><BR>by Ronald L. Rivest<BR>Text of
remarks at the Harvard Kennedy School of Governmment Digital Voting Symposium,
June 1, 2004.<BR>
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/2004-06-01%20Harvard%20KSG%20Symposium%20Evoting%20remarks.txt">text
</A></LI></UL>
<P></P>
<LI><EM>Some Thoughts on Electronic Voting</EM><BR>by Ronald L. Rivest<BR>Talk
given May 26, 2004 at DIMACS Workshop on Electronic Voting.<BR>
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/2004-05-26%20DIMACS%20voting%20talk.ppt">Powerpoint</A>
</LI></UL>
<P></P>
<LI><EM>Peppercoin Micropayments</EM><BR>by Ronald L. Rivest<BR>February 9,
2004. Proceedings Financial Cryptography '04. (ed. Ari Juels)<BR>Lecture Notes
in Computer Science, Vol. 3110. (Springer, 2004), 2--8.
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/Rivest-PeppercoinMicropayments.ps">postscript</A>
or <A
href="http://theory.lcs.mit.edu/~rivest/Rivest-PeppercoinMicropayments.pdf">pdf</A>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/Rivest-PeppercoinMicropayments.ppt">Powerpoint
slides from FC'04</A> </LI></UL>
<P></P>
<LI><EM>On Permutation Operations in Cipher Design</EM><BR>by Ruby B. Lee, Z.
J. Shi, Y. L. Yin, Ronald L. Rivest, and M. J. B. Robshaw.<BR>January 24,
2004. To appear in Proceedings ITCC 2004.<BR>A version has appeared under the
title <EM>Permutation Operations in Block Ciphers</EM><BR>in: EMBEDDED
CRYPTOGRAPHIC HARDWARE: - 2004 DESIGN AND SECURITY. (Nova, 2004).
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/LeeShiYinRivestRobshaw-OnPermutationOperationsInCipherDesign.pdf">pdf</A>
</LI></UL>
<P></P>
<LI><EM>On The Notion of Pseudo-Free Groups</EM><BR>by Ronald L.
Rivest.<BR>Proceedings TCC 2004 (Copyright IACR.) (Ed. Moni Naor)
Springer-Verlag Lecture Notes in Computer Science No. 2951. Pages 505--521.
<BR>
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/Rivest-OnTheNotionOfPseudo-FreeGroups.ps">postscript</A>
or <A
href="http://theory.lcs.mit.edu/~rivest/Rivest-OnTheNotionOfPseudo-FreeGroups.pdf">pdf</A>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/Rivest-TCC04-PseudoFreeGroups.ppt">Powerpoint
slides from TCC 2004</A> </LI></UL>
<P></P>
<LI><EM>RSA Problem</EM><BR>by Ronald L. Rivest and Burt Kaliski.<BR>December
10, 2003. (To appear in Encyclopedia of Cryptography and Security
(Kluwer).)<BR>
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/RivestKaliski-RSAProblem.ps">postscript</A>
or <A
href="http://theory.lcs.mit.edu/~rivest/RivestKaliski-RSAProblem.pdf">pdf</A>
</LI></UL>
<P></P>
<LI><EM>2002 ACM A. M. Turing Award Lectures</EM><BR>by Leonard Adleman,
Ronald L. Rivest, and Adi Shamir.<BR>Given June 8, 2003 at FCRC in San Diego,
California.<BR>
<UL>
<LI><A
href="http://www.acm.org/awards/turing_citations/rivest-shamir-adleman.html">ACM
posting of videos of lectures</A> </LI></UL>
<P></P>
<LI><EM>The Blocker Tag: Selective Blocking of RFID Tags for Consumer
Privacy</EM><BR>by Ari Juels, Ronald L. Rivest, and Michael Szydlo.<BR>May 16,
2003. (To appear in Proceedings 10th Annual ACM CCS 2003.)<BR>
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/JuelsRivestSzydlo-TheBlockerTag.pdf">pdf</A>
</LI></UL>
<P></P>
<LI><EM>Does Anyone Really Need Micropayments?</EM><BR>by Nicko van Someren,
Andrew Odlyzko, Ronald L. Rivest, Tim Jones, and Duncan Goldie-Scot.<BR>in
<EM>Proceedings Financial Cryptography 2003</EM> (ed. Rebecca
Wright)<BR>Lecture Notes in Computer Science, Vol. 2742 (Springer 2003),
69--76.<BR>
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/VanSomerenOdlyzkoRivestJonesGoldieScot-DoesAnyoneReallyNeedMicropayments.pdf">pdf</A>
</LI></UL>
<P></P>
<LI><EM>Micropayments Revisited</EM><BR>by Silvio Micali and Ronald L.
Rivest.<BR>(Proceedings of the Cryptographer's Track at the RSA Conference
2002, Bart Preneel (ed.), Springer Verlag CT-RSA 2002, LNCS 2271, pages
149--163.) <BR>
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/MicaliRivest-MicropaymentsRevisited.ps">postscript</A>
or <A
href="http://theory.lcs.mit.edu/~rivest/MicaliRivest-MicropaymentsRevisited.pdf">pdf</A>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/MicaliRivest-MicropaymentsRevisited.ppt">RSA
'02 powerpoint slides</A>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/MicaliRivest-PeppercornMicropaymentsViaBetterLotteryTickets.ppt">FC
'02 powerpoint slides ("Peppercorn Micropayments via Better Lottery
Tickets", rump session talk)</A> </LI></UL>
<P></P>
<LI><EM>The Untrusted Computer Problem and Camera-Based
Authentication,</EM><BR>by D. Clarke, B. Gassend, T. Kotwal, M. Burnside, M.
van Dijk, S. Devadas, and R. L. Rivest.<BR><EM>Lecture Notes in Computer
Science 2414, Proceedings of the International Conference on Pervasive
Computing (Pervasive2002)</EM>, pages 114-124, August 2002.<BR>
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/ClarkeGassendKotwalBurnsideVanDijkDevadasRivest-TheUntrustedComputerProblemAndCameraBasedAuthentication.pdf">pdf</A>
</LI></UL>
<P></P>
<LI><EM>Access-Controlled Resource Discovery for Pervasive
Networks,</EM><BR>by S. Raman, D. Clarke, M. Burnside, S. Devadas and R. L.
Rivest.<BR><EM>Proceedings of the 18th ACM Symposium on Applied Computing
(Security Track)</EM>, March 2003.<BR>(Also appeared in <EM>Concurrency and
Computation: Practice and Experience</EM> 2004: 16: pages 1099--1120.)
<UL>
<LI><A
href="http://theory.lcs.mit.edu/~rivest/RamanClarkeBurnsideDevadasRivest-AccessControlledResourceDiscoveryForPervasiveNetworks.ps">ps</A>
or <A
href="http://theory.lcs.mit.edu/~rivest/RamanClarkeBurnsideDevadasRivest-AccessControlledResourceDiscoveryForPervasiveNetworks.pdf">pdf</A>
</LI></UL>
?? 快捷鍵說明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -