RIVEST, RONALD L. / المعلوماتية / الباحثون

المركز الدولي للبحث العلمي


المعلوماتية / RIVEST, RONALD L.



Viterbi Professor of Computer Science in MIT's Department of Electrical Engineering and Computer Science. He is a member of MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL), a member of the lab's Theory of Computation Group and he is a leader of its Cryptography and Information Security Group. He is also a founder of RSA Data Security.

مواضيع البحث

Professor Rivest has research interests in cryptography, computer and network security, and algorithms.

Professor Rivest is an inventor of the RSA public-key cryptosystem. He has extensive experience in cryptographic design and cryptanalysis, and has published numerous papers in these areas. He has served as a Director of the International Association for Cryptologic Research, the organizing body for the Eurocrypt and Crypto conferences, and as a Director of the Financial Cryptography Association.

He has also worked extensively in the areas of computer algorithms, machine learning, and VLSI design.


Professor Rivest is a member of the National Academy of Engineering, the National Academy of Sciences, and is a Fellow of the Association for Computing Machinery, the International Association for Cryptographic Research, and the American Academy of Arts and Sciences.

Together with Adi Shamir and Len Adleman, he has been awarded the 2000 IEEE Koji Kobayashi Computers and Communications Award and the Secure Computing Lifetime Achievement Award. He has also received, together with Shamir and Adleman, the 2002 ACM Turing Award.

Professor Rivest has received an honorary degree (the "laurea honoris causa") from the University of Rome. He is a Fellow of the World Technology Network and a Finalist for the 2002 World Technology Award for Communications Technology. In 2005, he received the MITX Lifetime Achievement Award.


Cryptography and Security :

R.L. Rivest, ''Perspectives on Financial Cryptography (Revisited)''
Financial Cryptography '06 Conference Keynote. (Update of talk given for Financial Cryptography '97)

R.L. Rivest, ''Preliminary Voting -- Prevoting''
(Draft, to appear in larger report by CalTech/MIT Voting Technology Project.) August 6, 2005.

R.L. Rivest, ''Abelian square-free dithering for iterated hash functions''
(draft; to appear). August 2005.

B. Adida, S. Hohenberger, and R.L. Rivest, ''Lightweight Encryption for Email''
USENIX Steps to Reducing Unwanted Traffic on the Internet Workshop (SRUTI), July 2005.

B. Adida, D. Chau, S. Hohenberger, and R.L. Rivest, ''Lightweight Email Signatures''
(Revised; a preliminary version was presented at the DIMACS Workshop on Theft in E-Commerce, April 2005.)

B. Adida, S. Hohenberger, and R.L. Rivest, ''Ad-Hoc-Group Signatures from Hijacked Keypairs''
(Revised; a preliminary version was presented at the DIMACS Workshop on Theft in E-Commerce, April 2005.)

R.L. Rivest, ''Electronic Voting''
Talk given at NSA, June 3, 2004.

R.L. Rivest, ''Remarks on Electronic Voting''
Text of remarks at the Harvard Kennedy School of Governmment Digital Voting Symposium, June 1, 2004.

R.L. Rivest, ''Some Thoughts on Electronic Voting''
Talk given May 26, 2004 at DIMACS Workshop on Electronic Voting.

R.L. Rivest, ''Peppercoin Micropayments''
February 9, 2004. Proceedings Financial Cryptography '04. (ed. Ari Juels)
Lecture Notes in Computer Science, Vol. 3110. (Springer, 2004), 2--8.

R.B. Lee, Z. J. Shi, Y. L. Yin, R.L. Rivest, and M. J. B. Robshaw, ''On Permutation Operations in Cipher Design''
January 24, 2004. To appear in Proceedings ITCC 2004.
A version has appeared under the title ''Permutation Operations in Block Ciphers''

R.L. Rivest, ''On The Notion of Pseudo-Free Groups''
Proceedings TCC 2004 (Copyright IACR.) (Ed. Moni Naor) Springer-Verlag Lecture Notes in Computer Science No. 2951. Pages 505--521.

Algorithms :

Cormen, Leiserson, Rivest, and Stein, ''Introduction to Algorithms (Second Edition)'', (MIT Press and McGraw-Hill, 2001).

Ronald L. Rivest, ''Optimal Arrangements of Keys in a Hash Table'', Journal of the ACM 25,2 April 1978, 200--209.

Ronald L. Rivest, ''Partial-Match Retrieval Algorithms'', Siam J. Computing 5,1 March 1976, 19--50.

Machine Learning :

Baruch Awerbuch, Margrit Betke, Ronald L. Rivest, and Mona Singh, ''Piecemeal Graph Exploration by a Mobile Robot'', Information and Computation 152,2 (August 1999), 155--172.

Margrit Betke, Ronald L. Rivest, and Mona Singh, ''Piecemeal Learning of an Unknown Environment'', Machine Learning 18:2-3 (February 1995), 231--254.

Ronald L. Rivest and Yiqun Lisa Yin, ''Being Taught Can be Faster than Asking Questions'', Proceedings 1995 COLT Conference (ACM, 1995), 144-151.

Ruth Bergman and Ronald L. Rivest, ''Picking the Best Expert from a Sequence'', Proceedings of the Fifth International Workshop on Artificial Intelligence and Statistics, (Fort Lauerdale FL, January 1995). 219--228.

Sally A. Goldman, Ronald L. Rivest, and Robert E. Schapire, ''Learning Binary Relations and Total Orders'', SIAM J. Computing 22,5 (October 1993), 1006-1034.

Diversity-Based Inference of Finite Automata
by Ronald L. Rivest and Robert E. Schapire.
Journal of the ACM 41, 3 (May 1994), 555--589.

Ronald L. Rivest and Robert E. Schapire, ''Inference of Finite Automata Using Homing Sequences'', Information and Computation 103,2 (April 1993), 299--347.

Sally Goldman and Ronald L. Rivest, ''Making Maximum Entropy Constraints Easier By Adding Extra Constraints (Extended Abstract)'', in Maximum--Entropy and Bayesian Methods in Science and Engineering (Vol. 2), (Edited by G.J. Erickson and C.R. Smith) (Kluwer Academic Publishers, 1988), 323--340.

Ronald L. Rivest, ''Learning Decision Lists'', Machine Learning 2,3 (1987), 229--246.

Miscellaneous :

Recollections of Stanford CS 1969--1973
by Ronald L. Rivest.
Talk given March 21, 2006 at Stanford Computer Science Forum meeting celebrating the 40th anniverssary of the Stanford CS Department.

Complete Variable-Length `FixFree' Codes
by David Gillman and Ronald L. Rivest.
Designs, Codes, and Cryptography 5,2 (March 1995), 109--114.

Game Tree Searching by Min/Max Approximation
by Ronald L. Rivest.
Artificial Intelligence 34,1 (Dec. 1987), 77-96.

Constructing Optimal Binary Decision Trees is NP-Complete
by Laurent Hyafil and Ronald L. Rivest.
Information Processing Letters 5,1 (May 1976), 15--17.

ملاحظات قانونية - إتصال

Copyright © 2013 - www.cirs.info - كل الحقوق محفوظة