Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRonald L. Rivest
Ron Rivest
Person information
- affiliation: MIT, Internet Policy Research Initiative, USA
- award (2002): Turing Award
- award (2017): BBVA Foundation Frontiers of Knowledge Award
- award (2007): Marconi Prize
- award (1996): Paris Kanellakis Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2009
[b4]Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein:
Introduction to Algorithms, 3rd Edition. MIT Press 2009, ISBN 978-0-262-03384-8, pp. I-XIX, 1-1292- 2001
- [b3]Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein:
Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company 2001, ISBN 0-262-03293-7 - 1989
- [b2]Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest:
Introduction to Algorithms. The MIT Press and McGraw-Hill Book Company 1989, ISBN 0-262-03141-8 - 1974
- [b1]Ronald L. Rivest:
Analysis of associative retrieval algorithms. Stanford University, USA, 1974
Journal Articles
- 2024
- [j68]Harold Abelson, Ross J. Anderson, Steven M. Bellovin
, Josh Benaloh, Matt Blaze, Jon Callas, Whitfield Diffie, Susan Landau, Peter G. Neumann, Ronald L. Rivest, Jeffrey I. Schiller, Bruce Schneier, Vanessa Teague, Carmela Troncoso:
Bugs in our pockets: the risks of client-side scanning. J. Cybersecur. 10(1) (2024) - 2021
- [j67]Sunoo Park, Michael A. Specter, Neha Narula, Ronald L. Rivest:
Going from bad to worse: from Internet voting to blockchain voting. J. Cybersecur. 7(1) (2021) - 2020
- [j66]Mohammad Bavarian, Badih Ghazi, Elad Haramaty, Pritish Kamath, Ronald L. Rivest, Madhu Sudan:
Optimality of Correlated Sampling Strategies. Theory Comput. 16: 1-18 (2020) - 2017
- [j65]Ronald L. Rivest, Philip B. Stark:
When Is an Election Verifiable? IEEE Secur. Priv. 15(3): 48-50 (2017) - 2015
- [j64]Harold Abelson, Ross J. Anderson, Steven M. Bellovin, Josh Benaloh, Matt Blaze, Whitfield Diffie, John Gilmore, Matthew Green, Susan Landau, Peter G. Neumann, Ronald L. Rivest, Jeffrey I. Schiller, Bruce Schneier, Michael A. Specter, Daniel J. Weitzner:
Keys under doormats. Commun. ACM 58(10): 24-26 (2015) - [j63]Harold Abelson, Ross J. Anderson, Steven M. Bellovin, Josh Benaloh, Matt Blaze, Whitfield Diffie, John Gilmore, Matthew Green, Susan Landau, Peter G. Neumann, Ronald L. Rivest, Jeffrey I. Schiller, Bruce Schneier, Michael A. Specter, Daniel J. Weitzner:
Keys under doormats: mandating insecurity by requiring government access to all data and communications. J. Cybersecur. 1(1): 69-79 (2015) - 2014
- [j62]Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu:
Picture-Hanging Puzzles. Theory Comput. Syst. 54(4): 531-550 (2014) - 2013
- [j61]Marten van Dijk, Ari Juels, Alina Oprea, Ronald L. Rivest:
FlipIt: The Game of "Stealthy Takeover". J. Cryptol. 26(4): 655-713 (2013) - 2011
- [j60]Ronald L. Rivest:
The invertibility of the XOR of rotations of a binary word. Int. J. Comput. Math. 88(2): 281-284 (2011) - [j59]Moses D. Liskov, Ronald L. Rivest, David A. Wagner:
Tweakable Block Ciphers. J. Cryptol. 24(3): 588-613 (2011) - 2010
- [j58]David Chaum, Richard Carback, Jeremy Clark, Aleksander Essex, Stefan Popoveniuc, Ronald L. Rivest, Peter Y. A. Ryan, Emily Shen, Alan T. Sherman, Poorvi L. Vora:
Corrections to scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes. IEEE Trans. Inf. Forensics Secur. 5(1): 194 (2010) - 2009
- [j57]Ronald L. Rivest, David Chaum, Bart Preneel, Aviel D. Rubin, Donald G. Saari, Poorvi L. Vora:
Guest editorial: special issue on electronic voting. IEEE Trans. Inf. Forensics Secur. 4(4): 593-596 (2009) - [j56]David Chaum, Richard Carback, Jeremy Clark, Aleksander Essex, Stefan Popoveniuc, Ronald L. Rivest, Peter Y. A. Ryan, Emily Shen, Alan T. Sherman, Poorvi L. Vora:
Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes. IEEE Trans. Inf. Forensics Secur. 4(4): 611-627 (2009) - 2004
- [j55]Sanjay Raman, Dwaine E. Clarke, Matt Burnside, Srinivas Devadas, Ronald L. Rivest:
Access-controlled resource discovery in pervasive networks. Concurr. Pract. Exp. 16(11): 1099-1120 (2004) - 2001
- [j54]Dwaine E. Clarke, Jean-Emile Elien, Carl M. Ellison, Matt Fredette, Alexander Morcos, Ronald L. Rivest:
Certificate Chain Discovery in SPKI/SDSI. J. Comput. Secur. 9(4): 285-322 (2001) - 1999
- [j53]Baruch Awerbuch, Margrit Betke, Ronald L. Rivest, Mona Singh:
Piecemeal Graph Exploration by a Mobile Robot. Inf. Comput. 152(2): 155-172 (1999) - [j52]Mihir Bellare, Ronald L. Rivest:
Translucent Cryptography - An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer. J. Cryptol. 12(2): 117-139 (1999) - 1997
- [j51]Hal Abelson, Ross J. Anderson, Steven M. Bellovin, Josh Benaloh, Matt Blaze, Whitfield Diffie, John Gilmore, Peter G. Neumann, Ronald L. Rivest, Jeffrey I. Schiller, Bruce Schneier:
The risks of key recovery, key escrow, and trusted third-party encryption. World Wide Web J. 2: 241-257 (1997) - 1996
- [j50]David W. Gillman, Mojdeh Mohtashemi, Ronald L. Rivest:
On breaking a Huffman code. IEEE Trans. Inf. Theory 42(3): 972-976 (1996) - 1995
- [j49]David Gillman, Ronald L. Rivest:
Complete Variable-Length "Fix-Free" Codes. Des. Codes Cryptogr. 5(2): 109-114 (1995) - [j48]Margrit Betke, Ronald L. Rivest, Mona Singh:
Piecemeal Learning of an Unknown Environment. Mach. Learn. 18(2-3): 231-254 (1995) - 1994
- [j47]Ronald L. Rivest, Robert H. Sloan:
A Formal Model of Hierarchical Concept Learning. Inf. Comput. 114(1): 88-114 (1994) - [j46]Ronald L. Rivest, Robert E. Schapire:
Diversity-Based Inference of Finite Automata. J. ACM 41(3): 555-589 (1994) - 1993
- [j45]Dorothy E. Denning, Mike Godwin, William A. Bayse, Marc Rotenberg, Lewis M. Branscomb, Anne M. Branscomb, Ronald L. Rivest, Andrew Grosso, Gary T. Marx:
To Tap or not to Tap. Commun. ACM 36(3): 24-44 (1993) - [j44]Ronald L. Rivest, Robert E. Schapire:
Inference of Finite Automata Using Homing Sequences. Inf. Comput. 103(2): 299-347 (1993) - [j43]Ronald L. Rivest, Robert H. Sloan:
On Choosing between Experimenting and Thinking when Learning. Inf. Comput. 106(1): 1-25 (1993) - [j42]Sally A. Goldman, Ronald L. Rivest, Robert E. Schapire:
Learning Binary Relations and Total Orders. SIAM J. Comput. 22(5): 1006-1034 (1993) - 1992
- [j41]Ronald L. Rivest, Martin E. Hellman, John C. Anderson, John W. Lyons:
Responses to NIST's Proposal. Commun. ACM 35(7): 41-54 (1992) - [j40]Avrim Blum, Ronald L. Rivest:
Training a 3-node neural network is NP-complete. Neural Networks 5(1): 117-127 (1992) - 1991
- [j39]Nathan Linial, Yishay Mansour, Ronald L. Rivest:
Results on Learnability and the Vapnik-Chervonenkis Dimension. Inf. Comput. 90(1): 33-49 (1991) - 1990
- [j38]Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest:
A fair protocol for signing contracts. IEEE Trans. Inf. Theory 36(1): 40-46 (1990) - 1989
- [j37]J. Ross Quinlan, Ronald L. Rivest:
Inferring Decision Trees Using the Minimum Description Length Principle. Inf. Comput. 80(3): 227-248 (1989) - 1988
- [j36]Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman:
Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES). J. Cryptol. 1(1): 3-36 (1988) - [j35]Shafi Goldwasser, Silvio Micali, Ronald L. Rivest:
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput. 17(2): 281-308 (1988) - [j34]Benny Chor, Ronald L. Rivest:
A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inf. Theory 34(5): 901-909 (1988) - 1987
- [j33]Ronald L. Rivest:
Game Tree Searching by Min/Max Approximation. Artif. Intell. 34(1): 77-96 (1987) - [j32]Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani:
Global Wire Routing in Two-Dimensional Arrays. Algorithmica 2: 113-129 (1987) - [j31]Ronald L. Rivest:
Learning Decision Lists. Mach. Learn. 2(3): 229-246 (1987) - [j30]Ronald L. Rivest:
Network control by Bayesian broadcast. IEEE Trans. Inf. Theory 33(3): 323-328 (1987) - 1986
- [j29]Benny Chor, Charles E. Leiserson, Ronald L. Rivest, James B. Shearer:
An application of number theory to the organization of raster-graphics memory. J. ACM 33(1): 86-104 (1986) - [j28]Frank Thomson Leighton, Ronald L. Rivest:
Estimating a probability using finite memory. IEEE Trans. Inf. Theory 32(6): 733-742 (1986) - 1984
- [j27]Ronald L. Rivest, Adi Shamir:
How to Expose an Eavesdropper. Commun. ACM 27(4): 393-395 (1984) - 1983
- [j26]Ronald L. Rivest, Adi Shamir, Leonard M. Adleman:
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint). Commun. ACM 26(1): 96-99 (1983) - 1982
- [j25]Ronald L. Rivest, Adi Shamir:
How to Reuse a "Write-Once" Memory. Inf. Control. 55(1-3): 1-19 (1982) - 1981
- [j24]Ronald L. Rivest:
Statistical Analysis of the Hagelin Cryptograph. Cryptologia 5(1): 27-32 (1981) - 1980
- [j23]Ronald L. Rivest:
"Forwards and Backwards" Encryption. Cryptologia 4(1): 30-33 (1980) - [j22]Andrea S. LaPaugh, Ronald L. Rivest:
The Subgraph Homeomorphism Problem. J. Comput. Syst. Sci. 20(2): 133-149 (1980) - [j21]Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer:
Coping with Errors in Binary Search Procedures. J. Comput. Syst. Sci. 20(3): 396-404 (1980) - [j20]Andrew Chi-Chih Yao, Ronald L. Rivest:
On the Polyhedral Decision Problem. SIAM J. Comput. 9(2): 343-347 (1980) - [j19]Brenda S. Baker, Edward G. Coffman Jr., Ronald L. Rivest:
Orthogonal Packings in Two Dimensions. SIAM J. Comput. 9(4): 846-855 (1980) - 1979
- [j18]Ronald L. Rivest, Jean-Paul Van de Wiele:
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. Inf. Process. Lett. 8(4): 178-180 (1979) - [j17]Ronald L. Rivest:
The BLIZZARD computer architecture. SIGARCH Comput. Archit. News 7(9): 2-10 (1979) - 1978
- [j16]Ronald L. Rivest, Adi Shamir, Leonard M. Adleman:
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Commun. ACM 21(2): 120-126 (1978) - [j15]Ronald L. Rivest:
Remarks on a Proposed Cryptanalytic Attack on the M.I.T. Public-Key Cryptosystem. Cryptologia 2(1): 62-65 (1978) - [j14]Ronald L. Rivest:
Optimal Arrangement of Keys in a Hash Table. J. ACM 25(2): 200-209 (1978) - [j13]Andrew Chi-Chih Yao, Ronald L. Rivest:
k+1 Heads Are Better than k. J. ACM 25(2): 337-340 (1978) - 1977
- [j12]Ronald L. Rivest:
The game of "N questions" on a tree. Discret. Math. 17(2): 181-186 (1977) - [j11]Ronald L. Rivest:
On the Worst-Case Behavior of String-Searching Algorithms. SIAM J. Comput. 6(4): 669-674 (1977) - [j10]Ronald L. Rivest:
The Necessity of Feedback in Minimal Monotone Combinational Circuits. IEEE Trans. Computers 26(6): 606-607 (1977) - 1976
- [j9]Ronald L. Rivest:
On Self-Organizing Sequential Search Heuristics. Commun. ACM 19(2): 63-67 (1976) - [j8]Laurent Hyafil, Ronald L. Rivest:
Constructing Optimal Binary Decision Trees is NP-Complete. Inf. Process. Lett. 5(1): 15-17 (1976) - [j7]Jon Doyle, Ronald L. Rivest:
Linear Expected Time of a Simple Union-Find Algorithm. Inf. Process. Lett. 5(5): 146-148 (1976) - [j6]Ronald L. Rivest:
Partial-Match Retrieval Algorithms. SIAM J. Comput. 5(1): 19-50 (1976) - [j5]Ronald L. Rivest, Jean Vuillemin:
On Recognizing Graph Properties from Adjacency Matrices. Theor. Comput. Sci. 3(3): 371-384 (1976) - 1975
- [j4]Robert W. Floyd, Ronald L. Rivest:
Expected Time Bounds for Selection. Commun. ACM 18(3): 165-172 (1975) - [j3]Robert W. Floyd, Ronald L. Rivest:
The Algorithm SELECT - for Finding the ith Smallest of n Elements [M1] (Algorithm 489). Commun. ACM 18(3): 173 (1975) - 1974
- [j2]David A. Klarner, Ronald L. Rivest:
Asymptotic bounds for the number of convex n-ominoes. Discret. Math. 8(1): 31-40 (1974) - 1973
- [j1]Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan:
Time Bounds for Selection. J. Comput. Syst. Sci. 7(4): 448-461 (1973)
Conference and Workshop Papers
- 2021
- [c116]Michelle L. Blom, Jurlind Budurushi, Ronald L. Rivest, Philip B. Stark, Peter J. Stuckey, Vanessa Teague, Damjan Vukcevic:
Assertion-Based Approaches to Auditing Complex Elections, with Application to Party-List Proportional Elections. E-VOTE-ID 2021: 47-62 - 2020
- [c115]Zhuoqun Huang, Ronald L. Rivest, Philip B. Stark, Vanessa J. Teague, Damjan Vukcevic:
A Unified Evaluation of Two-Candidate Ballot-Polling Election Auditing Methods. E-VOTE-ID 2020: 112-128 - 2019
- [c114]Kellie Ottoboni, Matthew Bernhard, J. Alex Halderman, Ronald L. Rivest, Philip B. Stark:
Bernoulli Ballot Polling: A Manifest Improvement for Risk-Limiting Audits. Financial Cryptography Workshops 2019: 226-241 - [c113]Mayuri Sridhar, Ronald L. Rivest:
k-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-election Audits. Financial Cryptography Workshops 2019: 242-256 - 2018
- [c112]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Christos H. Papadimitriou, Ronald L. Rivest, Saeed Seddighin, Philip B. Stark:
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games. SODA 2018: 2291-2310 - 2017
- [c111]Ronald L. Rivest, Philip B. Stark, Zara Perumal:
BatchVote: Voting Rules Designed for Auditability. Financial Cryptography Workshops 2017: 317-333 - [c110]Olivier Pereira, Ronald L. Rivest:
Marked Mix-Nets. Financial Cryptography Workshops 2017: 353-369 - [c109]Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest:
Time-Space Trade-offs in Population Protocols. SODA 2017: 2560-2579 - [c108]Matthew Bernhard, Josh Benaloh, J. Alex Halderman, Ronald L. Rivest, Peter Y. A. Ryan, Philip B. Stark, Vanessa Teague, Poorvi L. Vora, Dan S. Wallach:
Public Evidence from Secret Ballots. E-VOTE-ID 2017: 84-109 - 2013
- [c107]Ari Juels, Ronald L. Rivest:
Honeywords: making password-cracking detectable. CCS 2013: 145-160 - [c106]Kevin D. Bowers, Ari Juels, Ronald L. Rivest, Emily Shen:
Drifting Keys: Impersonation detection for constrained devices. INFOCOM 2013: 1025-1033 - 2012
- [c105]Vint Cerf, John E. Hopcroft, Robert E. Kahn, Ronald L. Rivest, Adi Shamir:
Information, Data, Security in a Networked Future. ACM-TURING 2012: 14:1 - [c104]Marten van Dijk, Ari Juels, Alina Oprea, Ronald L. Rivest, Emil Stefanov, Nikos Triandopoulos:
Hourglass schemes: how to prove that cloud files are encrypted. CCS 2012: 265-280 - [c103]Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu:
Picture-Hanging Puzzles. FUN 2012: 81-93 - [c102]Kevin D. Bowers, Marten van Dijk, Robert Griffin, Ari Juels, Alina Oprea, Ronald L. Rivest, Nikos Triandopoulos:
Defending against the Unknown Enemy: Applying FlipIt to System Security. GameSec 2012: 248-263 - [c101]Ronald L. Rivest, Emily Shen:
A Bayesian Method for Auditing Elections. EVT/WOTE 2012 - 2011
- [c100]Kevin D. Bowers, Marten van Dijk, Ari Juels, Alina Oprea, Ronald L. Rivest:
How to tell if your cloud files are vulnerable to drive crashes. CCS 2011: 501-514 - [c99]Thomas R. Magrino, Ronald L. Rivest, Emily Shen:
Computing the Margin of Victory in IRV Elections. EVT/WOTE 2011 - 2010
- [c98]Alan T. Sherman, Richard Carback, David Chaum, Jeremy Clark, Aleksander Essex, Paul S. Herrnson, Travis Mayberry, Stefan Popoveniuc, Ronald L. Rivest, Emily Shen, Bimal Sinha, Poorvi L. Vora:
Scantegrity Mock Election at Takoma Park. Electronic Voting 2010: 45-61 - [c97]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:
Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy. USENIX Security Symposium 2010: 291-306 - [c96]Shuki Bruck, David R. Jefferson, Ronald L. Rivest:
A Modular Voting Architecture ("Frog Voting"). Towards Trustworthy Elections 2010: 97-106 - 2009
- [c95]Yevgeniy Dodis, Leonid Reyzin, Ronald L. Rivest, Emily Shen:
Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6. FSE 2009: 104-121 - 2008
- [c94]Javed A. Aslam, Raluca A. Popa, Ronald L. Rivest:
On Auditing Elections When Precincts Have Different Sizes. EVT 2008 - [c93]David Chaum, Richard Carback, Jeremy Clark, Aleksander Essex, Stefan Popoveniuc, Ronald L. Rivest, Peter Y. A. Ryan, Emily Shen, Alan T. Sherman:
Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes. EVT 2008 - 2007
- [c92]Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee:
Amplifying Collision Resistance: A Complexity-Theoretic Treatment. CRYPTO 2007: 264-283 - [c91]Ronald L. Rivest:
Security of Voting Systems. NSDI 2007 - [c90]Ben Adida, Mike Bond, Jolyon Clulow, Amerson Lin, Ross J. Anderson, Ronald L. Rivest:
On the Security of the EMV Secure Messaging API (Extended Abstract). Security Protocols Workshop 2007: 147-149 - [c89]Paul Youn, Ben Adida, Mike Bond, Jolyon Clulow, Jonathan Herzog, Amerson Lin, Ronald L. Rivest, Ross J. Anderson:
Robbing the Bank with a Theorem Prover - (Abstract). Security Protocols Workshop 2007: 171 - [c88]Javed A. Aslam, Raluca A. Popa, Ronald L. Rivest:
On Estimating the Size and Confidence of a Statistical Audit. EVT 2007 - 2006
- [c87]Ronald L. Rivest, Adi Shamir, Yael Tauman:
How to Leak a Secret: Theory and Applications of Ring Signatures. Essays in Memory of Shimon Even 2006: 164-186 - [c86]John G. Brainard, Ari Juels, Ronald L. Rivest, Michael Szydlo, Moti Yung:
Fourth-factor authentication: somebody you know. CCS 2006: 168-178 - [c85]Ben Adida, David Chau, Susan Hohenberger, Ronald L. Rivest:
Lightweight Email Signatures (Extended Abstract). SCN 2006: 288-302 - [c84]Ben Adida, Mike Bond, Jolyon Clulow, Amerson Lin, Steven J. Murdoch, Ross J. Anderson, Ronald L. Rivest:
Phish and Chips. Security Protocols Workshop 2006: 40-48 - [c83]Ben Adida, Ronald L. Rivest:
Scratch & vote: self-contained paper-based cryptographic voting. WPES 2006: 29-40 - 2005
- [c82]Ben Adida, Susan Hohenberger, Ronald L. Rivest:
Lightweight Encryption for Email. SRUTI 2005 - 2004
- [c81]Ronald L. Rivest:
Peppercoin Micropayments. Financial Cryptography 2004: 2-8 - [c80]Ruby B. Lee, Zhijie Shi, Yiqun Lisa Yin, Ronald L. Rivest, Matthew J. B. Robshaw:
On Permutation Operations in Cipher Design. ITCC (2) 2004: 569-577 - [c79]Ronald L. Rivest:
On the Notion of Pseudo-Free Groups. TCC 2004: 505-521 - 2003
- [c78]Ari Juels, Ronald L. Rivest, Michael Szydlo:
The blocker tag: selective blocking of RFID tags for consumer privacy. CCS 2003: 103-111 - [c77]Nicko van Someren, Andrew M. Odlyzko, Ronald L. Rivest, Tim Jones, Duncan Goldie-Scot:
Does Anyone Really Need MicroPayments? Financial Cryptography 2003: 69-76 - [c76]Sanjay Raman, Dwaine E. Clarke, Matt Burnside, Srinivas Devadas, Ronald L. Rivest:
Access-Controlled Resource Discovery for Pervasive Networks. SAC 2003: 338-345 - [c75]Stephen A. Weis, Sanjay E. Sarma, Ronald L. Rivest, Daniel W. Engels:
Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems. SPC 2003: 201-212 - 2002
- [c74]Moses D. Liskov, Ronald L. Rivest, David A. Wagner:
Tweakable Block Ciphers. CRYPTO 2002: 31-46 - [c73]Silvio Micali, Ronald L. Rivest:
Micropayments Revisited. CT-RSA 2002: 149-163 - [c72]Silvio Micali, Ronald L. Rivest:
Transitive Signature Schemes. CT-RSA 2002: 236-243 - [c71]Rebecca N. Wright, L. Jean Camp, Ian Goldberg, Ronald L. Rivest, Graham Wood:
Privacy Tradeoffs: Myth or Reality? Panel. Financial Cryptography 2002: 147-151 - [c70]Dwaine E. Clarke, Blaise Gassend, Thomas Kotwal, Matt Burnside, Marten van Dijk, Srinivas Devadas, Ronald L. Rivest:
The Untrusted Computer Problem and Camera-Based Authentication. Pervasive 2002: 114-124 - [c69]Matt Burnside, Dwaine E. Clarke, Todd Mills, Andrew Maywah, Srinivas Devadas, Ronald L. Rivest:
Proxy-based security protocols in networked mobile devices. SAC 2002: 265-272 - [c68]Markus Jakobsson, Ari Juels, Ronald L. Rivest:
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking. USENIX Security Symposium 2002: 339-353 - 2001
- [c67]Ronald L. Rivest, Adi Shamir, Yael Tauman:
How to Leak a Secret. ASIACRYPT 2001: 552-565 - [c66]Ed Gerck, C. Andrew Neff, Ronald L. Rivest, Aviel D. Rubin, Moti Yung:
The Business of Electronic Voting. Financial Cryptography 2001: 234-259 - 2000
- [c65]Ronald L. Rivest, Matthew J. B. Robshaw, Yiqun Lisa Yin:
RC6 as the AES. AES Candidate Conference 2000: 337-342 - 1999
- [c64]Scott Contini, Ronald L. Rivest, Matthew J. B. Robshaw, Yiqun Lisa Yin:
Improved Analysis of Some Simplified Variants of RC6. FSE 1999: 1-15 - [c63]Anna Lysyanskaya, Ronald L. Rivest, Amit Sahai, Stefan Wolf:
Pseudonym Systems. Selected Areas in Cryptography 1999: 184-199 - 1998
- [c62]Oded Goldreich, Birgit Pfitzmann, Ronald L. Rivest:
Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop. CRYPTO 1998: 153-168 - [c61]Ronald L. Rivest:
Can We Eliminate Certificate Revocations Lists? Financial Cryptography 1998: 178-183 - [c60]Lars R. Knudsen, Vincent Rijmen, Ronald L. Rivest, Matthew J. B. Robshaw:
On the Design and Security of RC2. FSE 1998: 206-221 - 1997
- [c59]Ronald L. Rivest:
Perspectives on Financial Cryptography. Financial Cryptography 1997: 145-150 - [c58]Ronald L. Rivest:
Electronic Lottery Tickets as Micropayments. Financial Cryptography 1997: 307-314 - [c57]Ronald L. Rivest:
All-or-Nothing Encryption and the Package Transform. FSE 1997: 210-218 - 1996
- [c56]Ronald L. Rivest, Adi Shamir:
PayWord and MicroMint: Two Simple Micropayment Schemes. Security Protocols Workshop 1996: 69-87 - 1995
- [c55]Ruth Bergman, Ronald L. Rivest:
Picking the Best Expert from a Sequence. AISTATS 1995: 219-227 - [c54]Ronald L. Rivest, Yiqun Lisa Yin:
Being Taught can be Faster than Asking Questions. COLT 1995: 144-151 - [c53]Baruch Awerbuch, Margrit Betke, Ronald L. Rivest, Mona Singh:
Piecemeal Graph Exploration by a Mobile Robot (Extended Abstract). COLT 1995: 321-328 - 1994
- [c52]Ronald L. Rivest:
The RC5 Encryption Algorithm. FSE 1994: 86-96 - 1993
- [c51]Margrit Betke, Ronald L. Rivest, Mona Singh:
Piecemeal Learning of an Unknown Environment. COLT 1993: 277-286 - [c50]Stephen Jose Hanson, Werner Remmele, Ronald L. Rivest:
Strategic Directions in Machine Learning. Machine Learning: From Theory to Applications 1993: 1-4 - [c49]Ronald L. Rivest:
Introduction. Machine Learning: From Theory to Applications 1993: 7-7 - [c48]Avrim Blum, Ronald L. Rivest:
Training a 3-Node Neural Network is NP-Complete. Machine Learning: From Theory to Applications 1993: 9-28 - [c47]Ronald L. Rivest, Robert E. Schapire:
Inference of Finite Automata Using Homing Sequences. Machine Learning: From Theory to Applications 1993: 51-73 - [c46]Igal Galperin, Ronald L. Rivest:
Scapegoat Trees. SODA 1993: 165-174 - 1991
- [c45]Ronald L. Rivest:
Cryptography and Machine Learning. ASIACRYPT 1991: 427-439 - [c44]Ronald L. Rivest:
On NIST's Proposed Digital Signature Standard. ASIACRYPT 1991: 481-484 - [c43]Anthony Kuh, Thomas Petsche, Ronald L. Rivest:
Incrementally Learning Time-Varying Half Planes. NIPS 1991: 920-927 - 1990
- [c42]Bonnie Eisenberg, Ronald L. Rivest:
On the Sample Complexity of PAC-Learning Using Random and Chosen Examples. COLT 1990: 154-162 - [c41]Javed A. Aslam, Ronald L. Rivest:
Inferring Graphs from Walks. COLT 1990: 359-370 - [c40]Ronald L. Rivest:
The MD4 Message Digest Algorithm. CRYPTO 1990: 303-311 - [c39]Ronald L. Rivest:
Finding Four Million Large Random Primes. CRYPTO 1990: 625-626 - [c38]Anthony Kuh, Thomas Petsche, Ronald L. Rivest:
Learning Time-Varying Concepts. NIPS 1990: 183-189 - 1989
- [c37]Sally A. Goldman, Ronald L. Rivest, Robert E. Schapire:
Learning Binary Relations and Total Orders (Extended Abstract). FOCS 1989: 46-51 - [c36]Ronald L. Rivest, Robert E. Schapire:
Inference of Finite Automata Using Homing Sequences (Extended Abstract). STOC 1989: 411-420 - 1988
- [c35]Ronald L. Rivest, Robert H. Sloan:
Learning Complicated Concepts Reliably and Usefully. AAAI 1988: 635-640 - [c34]Avrim Blum, Ronald L. Rivest:
Training a 3-Node Neural Network is NP-Complete. COLT 1988: 9-18 - [c33]Nathan Linial, Yishay Mansour, Ronald L. Rivest:
Results on Learnability and the Vapnick-Chervonenkis Dimension. COLT 1988: 56-68 - [c32]Ronald L. Rivest, Robert H. Sloan:
Learning Complicated Concepts Reliably and Usefully. COLT 1988: 69-79 - [c31]Nathan Linial, Yishay Mansour, Ronald L. Rivest:
Results on learnability and the Vapnik-Chervonenkis dimension (Extended Abstract). FOCS 1988: 120-129 - [c30]Avrim Blum, Ronald L. Rivest:
Training a 3-Node Neural Network is NP-Complete. NIPS 1988: 494-501 - [c29]Ronald L. Rivest, Robert H. Sloan:
A New Model for Inductive Inference. TARK 1988: 13-28 - 1987
- [c28]Ronald L. Rivest, Robert E. Schapire:
Diversity-Based Inference of Finite Automata (Extended Abstract). FOCS 1987: 78-87 - 1986
- [c27]Sally A. Goldman, Ronald L. Rivest:
A non-iterative maximum entropy algorithm. UAI 1986: 133-148 - 1985
- [c26]Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman:
Is DES a Pure Cipher? (Results of More Cycling Experiments on DES). CRYPTO 1985: 212-226 - [c25]Ronald L. Rivest, Adi Shamir:
Efficient Factoring Based on Partial Information. EUROCRYPT 1985: 31-34 - [c24]Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman:
Is the Data Encryption Standard a Group? (Preliminary Abstract). EUROCRYPT 1985: 81-95 - [c23]Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest:
A Fair Protocol for Signing Contracts (Extended Abstract). ICALP 1985: 43-52 - 1984
- [c22]Benny Chor, Ronald L. Rivest:
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields. CRYPTO 1984: 54-65 - [c21]Shafi Goldwasser, Silvio Micali, Ronald L. Rivest:
A "Paradoxical'"Solution to the Signature Problem (Abstract). CRYPTO 1984: 467 - [c20]Ronald L. Rivest:
RSA Chips (Past/Present/Future). EUROCRYPT 1984: 159-165 - [c19]Shafi Goldwasser, Silvio Micali, Ronald L. Rivest:
A "Paradoxical" Solution to the Signature Problem (Extended Abstract). FOCS 1984: 441-448 - 1983
- [c18]Frank Thomson Leighton, Ronald L. Rivest:
Estimating a Probability Using Finite Memory (Extended Abstract). FCT 1983: 255-269 - [c17]Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani:
Global Wire Routing in Two-Dimensional Arrays (Extended Abstract). FOCS 1983: 453-459 - 1982
- [c16]Ronald L. Rivest, Alan T. Sherman:
Randomized Encryption Techniques. CRYPTO 1982: 145-163 - [c15]Ronald L. Rivest:
A Short Report on the RSA Chip. CRYPTO 1982: 327 - [c14]Ronald L. Rivest, Charles M. Fiduccia:
A "greedy" channel router. DAC 1982: 418-424 - [c13]Ronald L. Rivest:
The "PI" (placement and interconnect) system. DAC 1982: 475-481 - [c12]Benny Chor, Charles E. Leiserson, Ronald L. Rivest:
An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract). FOCS 1982: 92-99 - [c11]Ronald L. Rivest, Adi Shamir:
How to Reuse a "Write-Once" Memory (Preliminary Version). STOC 1982: 105-113 - 1978
- [c10]Andrea S. LaPaugh, Ronald L. Rivest:
The Subgraph Homeomorphism Problem. STOC 1978: 40-50 - [c9]Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer:
Coping with Errors in Binary Search Procedures (Preliminary Report). STOC 1978: 227-232 - 1977
- [c8]Andrew Chi-Chih Yao, David Avis, Ronald L. Rivest:
An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem. STOC 1977: 11-17 - 1976
- [c7]Ronald L. Rivest, Vaughan R. Pratt:
The Mutual Exclusion Problem for Unreliable Processes: Preliminary Report. FOCS 1976: 1-8 - [c6]Andrew Chi-Chih Yao, Ronald L. Rivest:
k+1 Heads Are Better than k. FOCS 1976: 67-70 - 1975
- [c5]Ronald L. Rivest, Jean Vuillemin:
A Generalization and Proof of the Aanderaa-Rosenberg Conjecture. STOC 1975: 6-11 - 1974
- [c4]Ronald L. Rivest:
On Hash-Coding Algorithms for Partial-Match Retrieval (Extended Abstract). SWAT 1974: 95-103 - [c3]Ronald L. Rivest:
On Self-Organizing Sequential Search Heuristics. SWAT 1974: 122-126 - [c2]Ronald L. Rivest:
On the Optimality of Elia's Algorithm for Performing Best-Match Searches. IFIP Congress 1974: 678-681 - 1972
- [c1]Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan:
Linear Time Bounds for Median Computations. STOC 1972: 119-124
Parts in Books or Collections
- 2019
- [p2]Shafi Goldwasser, Silvio Micali, Ronald L. Rivest:
A "paradoxical" solution to the signature problem. Providing Sound Foundations for Cryptography 2019: 265-284 - 1990
- [p1]Ronald L. Rivest:
Cryptography. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 717-755
Editorship
- 2010
- [e8]David Chaum, Markus Jakobsson, Ronald L. Rivest, Peter Y. A. Ryan, Josh Benaloh, Miroslaw Kutylowski, Ben Adida:
Towards Trustworthy Elections, New Directions in Electronic Voting. Lecture Notes in Computer Science 6000, Springer 2010, ISBN 978-3-642-12979-7 [contents] - 2008
- [e7]David Chaum, Miroslaw Kutylowski, Ronald L. Rivest, Peter Y. A. Ryan:
Frontiers of Electronic Voting, 29.07. - 03.08.2007. Dagstuhl Seminar Proceedings 07311, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - 2006
- [e6]Dan S. Wallach, Ronald L. Rivest:
2006 USENIX/ACCURATE Electronic Voting Technology Workshop, EVT'06, Vancouver, BC, Canada, August 1, 2006. USENIX Association 2006 [contents] - 1993
- [e5]Hideki Imai, Ronald L. Rivest, Tsutomu Matsumoto:
Advances in Cryptology - ASIACRYPT '91, International Conference on the Theory and Applications of Cryptology, Fujiyoshida, Japan, November 11-14, 1991, Proceedings. Lecture Notes in Computer Science 739, Springer 1993, ISBN 3-540-57332-1 [contents] - [e4]Stephen Jose Hanson, Werner Remmele, Ronald L. Rivest:
Machine Learning: From Theory to Applications - Cooperative Research at Siemens and MIT. Lecture Notes in Computer Science 661, Springer 1993, ISBN 3-540-56483-7 [contents] - 1989
- [e3]Ronald L. Rivest, David Haussler, Manfred K. Warmuth:
Proceedings of the Second Annual Workshop on Computational Learning Theory, COLT 1989, Santa Cruz, CA, USA, July 31 - August 2, 1989. Morgan Kaufmann 1989, ISBN 1-55860-086-8 [contents] - 1983
- [e2]David Chaum, Ronald L. Rivest, Alan T. Sherman:
Advances in Cryptology: Proceedings of CRYPTO '82, Santa Barbara, California, USA, August 23-25, 1982. Plenum Press, New York 1983 [contents] - [e1]David S. Johnson, Ronald Fagin, Michael L. Fredman, David Harel, Richard M. Karp, Nancy A. Lynch, Christos H. Papadimitriou, Ronald L. Rivest, Walter L. Ruzzo, Joel I. Seiferas:
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA. ACM 1983 [contents]
Reference Works
- 2011
- [r2]Ronald L. Rivest, Burt Kaliski:
RSA Problem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1065-1069 - 2005
- [r1]Ronald L. Rivest, Burton S. Kaliski Jr.:
RSA Problem. Encyclopedia of Cryptography and Security 2005
Informal and Other Publications
- 2024
- [i36]Carsten Baum, Jens Berlips, Walther Chen, Hongrui Cui, Ivan Damgård, Jiangbin Dong, Kevin M. Esvelt, Mingyu Gao, Dana Gretton, Leonard Foner, Martin Kysel, Kaiyi Zhang, Juanru Li, Xiang Li, Omer Paneth, Ronald L. Rivest, Francesca Sage-Ling, Adi Shamir, Yue Shen, Meicen Sun, Vinod Vaikuntanathan, Lynn Van Hauwe, Theia Vogel, Benjamin Weinstein-Raun, Yun Wang, Daniel Wichs, Stephen Wooster, Andrew C. Yao, Yu Yu, Haoling Zhang:
A system capable of verifiably and privately screening global DNA synthesis. CoRR abs/2403.14023 (2024) - 2022
- [i35]Douglas W. Jones, Sunoo Park, Ronald L. Rivest, Adam Sealfon:
Scan, Shuffle, Rescan: Machine-Assisted Election Audits With Untrusted Scanners. IACR Cryptol. ePrint Arch. 2022: 960 (2022) - 2021
- [i34]Michelle L. Blom, Jurlind Budurushi, Ronald L. Rivest, Philip B. Stark, Peter J. Stuckey, Vanessa Teague, Damjan Vukcevic:
Assertion-based Approaches to Auditing Complex Elections, with application to party-list proportional elections. CoRR abs/2107.11903 (2021) - [i33]Hal Abelson, Ross J. Anderson, Steven M. Bellovin, Josh Benaloh, Matt Blaze, Jon Callas, Whitfield Diffie, Susan Landau, Peter G. Neumann, Ronald L. Rivest, Jeffrey I. Schiller, Bruce Schneier, Vanessa Teague, Carmela Troncoso:
Bugs in our Pockets: The Risks of Client-Side Scanning. CoRR abs/2110.07450 (2021) - 2020
- [i32]Zhuoqun Huang, Ronald L. Rivest, Philip B. Stark, Vanessa Teague, Damjan Vukcevic:
A Unified Evaluation of Two-Candidate Ballot-Polling Election Auditing Methods. CoRR abs/2008.08536 (2020) - [i31]John Meklenburg, Michael A. Specter, Michael Wentz, Hari Balakrishnan, Anantha P. Chandrakasan, John Cohn, Gary Hatke, Louise Ivers, Ronald L. Rivest, Gerald Jay Sussman, Daniel J. Weitzner:
SonicPACT: An Ultrasonic Ranging Method for the Private Automated Contact Tracing (PACT) Protocol. CoRR abs/2012.04770 (2020) - [i30]Ran Canetti, Yael Tauman Kalai, Anna Lysyanskaya, Ronald L. Rivest, Adi Shamir, Emily Shen, Ari Trachtenberg, Mayank Varia, Daniel J. Weitzner:
Privacy-Preserving Automated Exposure Notification. IACR Cryptol. ePrint Arch. 2020: 863 (2020) - 2018
- [i29]Ronald L. Rivest:
Bayesian Tabulation Audits: Explained and Extended. CoRR abs/1801.00528 (2018) - [i28]Ronald L. Rivest:
Consistent Sampling with Replacement. CoRR abs/1808.10016 (2018) - [i27]Mayuri Sridhar, Ronald L. Rivest:
k-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-Election Audits. CoRR abs/1811.08811 (2018) - 2017
- [i26]Ronald L. Rivest:
ClipAudit: A Simple Risk-Limiting Post-Election Audit. CoRR abs/1701.08312 (2017) - [i25]Josh Benaloh, Matthew Bernhard, J. Alex Halderman, Ronald L. Rivest, Peter Y. A. Ryan, Philip B. Stark, Vanessa Teague, Poorvi L. Vora, Dan S. Wallach:
Public Evidence from Secret Ballots. CoRR abs/1707.08619 (2017) - 2016
- [i24]Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest:
Time-Space Trade-offs in Population Protocols. CoRR abs/1602.08032 (2016) - [i23]Peter Gutmann, Steven M. Bellovin, Matt Blaze, Ronald L. Rivest, Nigel P. Smart:
An IBE-based Signcryption Scheme for Group Key Management. CoRR abs/1603.09526 (2016) - [i22]Berj Chilingirian, Zara Perumal, Ronald L. Rivest, Grahame Bowland, Andrew Conway, Philip B. Stark, Michelle L. Blom, Chris Culnane, Vanessa Teague:
Auditing Australian Senate Ballots. CoRR abs/1610.00127 (2016) - [i21]Mohammad Bavarian, Badih Ghazi, Elad Haramaty, Pritish Kamath, Ronald L. Rivest, Madhu Sudan:
The Optimality of Correlated Sampling. CoRR abs/1612.01041 (2016) - [i20]Mohammad Bavarian, Badih Ghazi, Elad Haramaty, Pritish Kamath, Ronald L. Rivest, Madhu Sudan:
The Optimality of Correlated Sampling. Electron. Colloquium Comput. Complex. TR16 (2016) - [i19]Sunoo Park, Ronald L. Rivest:
Towards Secure Quadratic Voting. IACR Cryptol. ePrint Arch. 2016: 400 (2016) - [i18]Ronald L. Rivest, Jacob C. N. Schuldt:
Spritz - a spongy RC4-like stream cipher and hash function. IACR Cryptol. ePrint Arch. 2016: 856 (2016) - 2015
- [i17]Josh Benaloh, Ronald L. Rivest, Peter Y. A. Ryan, Philip B. Stark, Vanessa Teague, Poorvi L. Vora:
End-to-end verifiability. CoRR abs/1504.03778 (2015) - [i16]Ronald L. Rivest:
DiffSum - A Simple Post-Election Risk-Limiting Audit. CoRR abs/1509.00127 (2015) - 2012
- [i15]Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu:
Picture-Hanging Puzzles. CoRR abs/1203.3602 (2012) - [i14]Marten van Dijk, Ari Juels, Alina Oprea, Ronald L. Rivest:
FlipIt: The Game of "Stealthy Takeover". IACR Cryptol. ePrint Arch. 2012: 103 (2012) - [i13]Kevin D. Bowers, Marten van Dijk, Robert Griffin, Ari Juels, Alina Oprea, Ronald L. Rivest, Nikos Triandopoulos:
Defending Against the Unknown Enemy: Applying FlipIt to System Security. IACR Cryptol. ePrint Arch. 2012: 579 (2012) - 2010
- [i12]Kevin D. Bowers, Marten van Dijk, Ari Juels, Alina Oprea, Ronald L. Rivest:
How to Tell if Your Cloud Files Are Vulnerable to Drive Crashes. IACR Cryptol. ePrint Arch. 2010: 214 (2010) - 2007
- [i11]David Chaum, Miroslaw Kutylowski, Ronald L. Rivest, Peter Y. A. Ryan:
07311 Executive Summary -- Frontiers of Electronic Voting. Frontiers of Electronic Voting 2007 - [i10]David Chaum, Miroslaw Kutylowski, Ronald L. Rivest, Peter Y. A. Ryan:
07311 Abstracts Collection -- Frontiers of Electronic Voting. Frontiers of Electronic Voting 2007 - 2002
- [i9]Markus Jakobsson, Ari Juels, Ronald L. Rivest:
Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking. IACR Cryptol. ePrint Arch. 2002: 25 (2002) - 2001
- [i8]Ronald L. Rivest, Robert Silverman:
Are 'Strong' Primes Needed for RSA. IACR Cryptol. ePrint Arch. 2001: 7 (2001) - 1999
- [i7]Carl M. Ellison, Bill Frantz, Butler W. Lampson, Ron Rivest, Brian Thomas, Tatu Ylönen:
SPKI Certificate Theory. RFC 2693: 1-43 (1999) - 1998
- [i6]Ron Rivest:
A Description of the RC2(r) Encryption Algorithm. RFC 2268: 1-11 (1998) - 1997
- [i5]Oded Goldreich, Birgit Pfitzmann, Ronald L. Rivest:
Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop. IACR Cryptol. ePrint Arch. 1997: 12 (1997) - 1996
- [i4]Robert W. Baldwin, Ronald L. Rivest:
The RC5, RC5-CBC, RC5-CBC-Pad, and RC5-CTS Algorithms. RFC 2040: 1-29 (1996) - 1992
- [i3]Ronald L. Rivest:
The MD4 Message-Digest Algorithm. RFC 1320: 1-20 (1992) - [i2]Ronald L. Rivest:
The MD5 Message-Digest Algorithm. RFC 1321: 1-21 (1992) - 1990
- [i1]Ronald L. Rivest:
MD4 Message Digest Algorithm. RFC 1186: 1-18 (1990)
Coauthor Index
Vanessa Teague
aka: Vanessa J. Teague
aka: Vanessa J. Teague
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 17:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
