1995年的图灵奖获得者-Manuel Blum

最新推荐文章于 2021-01-28 16:26:27 发布

转载最新推荐文章于 2021-01-28 16:26:27 发布 · 3.1k 阅读

文章标签：

#cryptography #transactions #protocols #authentication #generator #report

计算机名人堂专栏收录该内容

51 篇文章

订阅专栏

ManuelBlum因在计算复杂性理论及密码系统领域的贡献荣获1995年度图灵奖。Blum在多项关键技术如伪随机数生成、非交互式零知识证明等方面有开创性工作。

Manuel Blum (04/26/1938--)

图灵奖获得时间：

1995年。第三十位图灵奖 (1995年 ) 获得者。

图灵奖引用 (Turing Award Citation) ：

Citation

In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking.

中文翻译：

( 授予Manuel Blum 图灵奖以表彰其在 )计算复杂性理论的基础性研究以及在密码系统和程序检查验证方面的应用的卓越贡献。

编者注：

关于密码系统：

http://en.wikipedia.org/wiki/Cryptography

International Association for Cryptologic Research:

http://www.iacr.org/

RSA Laboratories' Frequently Asked Questions About Today's Cryptography, Version 4.1:

http://www.rsasecurity.com/rsalabs/node.asp?id=2152

关于计算复杂性理论，可参见：

www.xtrj.org/ssm4/complexity_theory.htm

Computational Complexity of Games and Puzzles

IEEE Conference on Computational Complexity

Lecture Notes on Computational Complexity

Manuel Blum发表的代表性的研究文章：

Peekaboom: A Game for Locating Objects in Images Luis von Ahn, Ruoran Liu and Manuel Blum. To Appear in ACM CHI 2006 (pdf)

Improving Accessibility of the Web with a Computer Game Luis von Ahn, S. Ginosar , M. Kedia, R. Liu and M. Blum. To Appear in ACM CHI Notes 2006 (pdf)

Verbosity: A Game for Collecting Common-Sense Facts Luis von Ahn, Mihir Kedia and Manuel Blum. To Appear in ACM CHI Notes 2006 (pdf)

Toward a High-level Definition of Consciousness Manuel Blum, Ryan Williams Brendan Juba, Matt Humphrey. Invited Talk to the Annual IEEE Computational Complexity Conference , San Jose CA, (June 2005) (ppt)

Mathematical Foundations for Understanding and Designing Conceptualizing Strategizing Control Systems (NSF ITR proposal) (pdf)

Telling Humans and Computers Apart Automatically: How Lazy Cryptographers do AI Luis von Ahn, Manuel Blum and John Langford. In Communications of the ACM, Feb. 2004. PDF

CAPTCHA: Using Hard AI Problems for Security Luis von Ahn, Manuel Blum, Nicholas J. Hopper, John Langford. In Eurocrypt 2003 PDF / PS

On the complexity of MAX / MIN / AVRG Circuits (with Rachel Rue, Ke Yang). 2002. CMU SCS Technical Report, CMU-CS-02-110 PDF / abs

Telling Humans and Computers Apart (Automatically) (with Luis von Ahn, John Langford ). 2002. CMU Tech Report PDF

Secure Human Identification Protocols (with Nicholas J. Hopper). Advances in Crypotology, Proceedings of Asiacrypt 2001, December 2001: 52-66 PDF / abs

A Secure Human-Computer Authentication Scheme (with Nicholas J. Hopper).2000. CMU-CS-00-139 May 2000 PDF / abs

Software Reliability via Run-Time Result-Checking (with H. Wasserman). Journal of the ACM.
Preliminary version: Program Result-Checking: A Theory of Testing Meets a Test of Theory, Proc. 35th IEEE FOCS, 1994, pp. 382-392. PDF / PS

Reflections on the Pentium Division Bug (with H. Wasserman). IEEE Transactions on Computers, vol. 45, no. 4, April 1996, pp. 385-393.
Preliminary version: Proc. 8th Int'l Software Quality Week, 1995. PDF / PS

Self-testing/correcting with applications to numerical problems (with Michael Luby, Ronitt Rubinfeld). In Proceedings of the TwentySecond Annual ACM Symposium on Theory of Computing, pages 73-83, Baltimore , Maryland , 14-16 May 1990.

Self-Testing/Correcting with Applications to Numerical Problems (with M. Luby and R. Rubinfeld), STOC, 1990, p. 10.

Designing programs that check their work (with Sampath Kannan) In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 86-97, Seattle, Washington, 15-17 May 1989.

Non-interactive zero-knowledge and its applications (extended abstract).(with Paul Feldman, and Silvio Micali) In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 103-112, Chicago, Illinois, 2-4 May 1988.

A Simple Unpredictable Pseudo-Random Number Generator (with Lenore Blum, Mike Shub). SIAM J. Comput. 15(2): 364-383 (1986)

How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. (with Silvio Micali). SIAM J. Comput. 13(4): 850-864 (1984)

How to exchange (secret) keys (extended abstract). In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pages 440-447, Boston, Massachusetts, 25-27 April 1983.

Coin Flipping by Telephone. CRYPTO 1981: 11-15 HTML

On the Power of the Compass (or, Why Mazes are Easier to Search Than Graphs) (with D. Kozen), Proc. IEEE FOCS Conf., 1978, pp. 132-142.

Toward a Mathematical Theory of Inductive Inference (with L. Blum), Information and Control, Vol. 28, No. 2, 1975, pp. 125-155.

Linear time bounds for median computations (with Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, Robert E. Tarjan). In Conference Record, Fourth Annual ACM Symposium on Theory of Computing, pages 119-124, Denver, Colorado, 1-3 May 1972.

Linear Time Bounds for Median Computations (with Floyd, Pratt, Rivest, and Tarjan). Proc. 4th Annual ACM Symposium on Theory of Computing, 1972, pp. 119-124.

On effective procedures for speeding up algorithms In Conference Record of ACM Symposium on Theory of Computing, pages 43-53, Marina del Rey, California, 5-7 May 1969.

A Machine-Independent Theory of the Complexity of Recursive Functions. J. ACM, XIV, No. 2, 1967, pp. 322-336.

Blum在计算复杂性与密码系统领域的一些杰出贡献：