Manuel Blum

Publication Activity (10 Years)

Years Active: 1967-2024
Publications (10 Years): 11

Top Topics

Password Authentication

General Intelligence

Theoretical Computer Science

Top Venues

IACR Cryptol. ePrint Arch.

J. Artif. Intell. Conscious.

Publications

Lenore Blum, Manuel Blum
AI Consciousness is Inevitable: A Theoretical Computer Science Perspective. CoRR (2024)
Lenore Blum, Manuel Blum
Viewpoint: A Theoretical Computer Science Perspective on Consciousness and Artificial General Intelligence. CoRR (2023)
Lenore Blum, Manuel Blum
A Theoretical Computer Science Perspective on Free Will. CoRR (2022)
Lenore Blum, Manuel Blum
A Theory of Consciousness from a Theoretical Computer Science Perspective: Insights from the Conscious Turing Machine. CoRR (2021)
Manuel Blum, Lenore Blum
A Theoretical Computer Science Perspective on Consciousness. J. Artif. Intell. Conscious. 8 (1) (2021)
Manuel Blum, Santosh S. Vempala
The complexity of human computation via a concrete model with an application to passwords. Proc. Natl. Acad. Sci. USA 117 (17) (2020)
Manuel Blum, Lenore Blum
A Theoretical Computer Science Perspective on Consciousness. CoRR (2020)
Elan Rosenfeld, Santosh S. Vempala, Manuel Blum
Human-Usable Password Schemas: Beyond Information-Theoretic Security. CoRR (2019)
Jeremiah Blocki, Manuel Blum, Anupam Datta, Santosh S. Vempala
Towards Human Computable Passwords. ITCS (2017)
Manuel Blum, Santosh S. Vempala
The Complexity of Human Computation: A Concrete Model with an Application to Passwords. CoRR (2017)
Manuel Blum
Cybernetics: A mathematician of mind. Nat. 538 (7623) (2016)
Jeremiah Blocki, Manuel Blum, Anupam Datta
Naturally Rehearsing Passwords. IACR Cryptol. ePrint Arch. 2015 (2015)
Manuel Blum, Santosh Srinivas Vempala
Publishable Humanly Usable Secure Password Creation Schemas. HCOMP (2015)
Jeremiah Blocki, Manuel Blum, Anupam Datta
Human Computable Passwords. CoRR (2014)
Jeremiah Blocki, Manuel Blum, Anupam Datta
Naturally Rehearsing Passwords. ASIACRYPT (2) (2013)
Jeremiah Blocki, Manuel Blum, Anupam Datta
Naturally Rehearsing Passwords CoRR (2013)
Jeremiah Blocki, Manuel Blum, Anupam Datta
GOTCHA password hackers! AISec (2013)
Jeremiah Blocki, Manuel Blum, Anupam Datta
GOTCHA Password Hackers! CoRR (2013)
Manuel Blum
Understanding and Inductive Inference. COCOON (2010)
Luis von Ahn, Shiry Ginosar, Mihir Kedia, Manuel Blum
Improving Image Search with PHETCH. ICASSP (4) (2007)
Luis von Ahn, Mihir Kedia, Manuel Blum
Verbosity: a game for collecting common-sense facts. CHI (2006)
Luis von Ahn, Ruoran Liu, Manuel Blum
Peekaboom: a game for locating objects in images. CHI (2006)
Luis von Ahn, Shiry Ginosar, Mihir Kedia, Ruoran Liu, Manuel Blum
Improving accessibility of the web with a computer game. CHI (2006)
Luis von Ahn, Manuel Blum, John Langford
Telling humans and computers apart automatically. Commun. ACM 47 (2) (2004)
Luis von Ahn, Manuel Blum, Nicholas J. Hopper, John Langford
CAPTCHA: Using Hard AI Problems for Security. EUROCRYPT (2003)
Nicholas J. Hopper, Manuel Blum
Secure Human Identification Protocols. ASIACRYPT (2001)
Manuel Blum
Program Error Detection/Correction: Turning PAC Learning into PERFECT Learning (Abstract). ALT (1997)
Hal Wasserman, Manuel Blum
Software reliability via run-time result-checking. J. ACM 44 (6) (1997)
Manuel Blum, Hal Wasserman
Reflections on the Pentium Bug. IEEE Trans. Computers 45 (4) (1996)
Manuel Blum, Sampath Kannan
Designing Programs that Check Their Work. J. ACM 42 (1) (1995)
Manuel Blum, Bruno Codenotti, Peter Gemmell, Troy Shahoumian
Self-Correcting for Function Fields Transcendental Degree. ICALP (1995)
David S. Cohen, Manuel Blum
on the Problem of Sorting Burnt Pancakes. Discret. Appl. Math. 61 (2) (1995)
Amihood Amir, Manuel Blum, Michael C. Loui, John E. Savage, Carl Smith
Contributions of theoretical computer science. SIGACT News 26 (4) (1995)
Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor
Checking the Correctness of Memories. Algorithmica 12 (2/3) (1994)
Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky
Matching Nuts and Bolts. SODA (1994)
Manuel Blum, Hal Wasserman
Program Result-Checking: A Theory of Testing Meets a Test of Theory FOCS (1994)
Manuel Blum
Designing Programs to Check Their Work (Abstract). ISSTA (1993)
Manuel Blum
Program Result Checking: A New Approach to Making Programs More Reliable. ICALP (1993)
Manuel Blum, Michael Luby, Ronitt Rubinfeld
Self-Testing/Correcting with Applications to Numerical Problems. J. Comput. Syst. Sci. 47 (3) (1993)
Sigal Ar, Manuel Blum, Bruno Codenotti, Peter Gemmell
Checking approximate computations over the reals. STOC (1993)
Manuel Blum
Universal Statistical Tests. LATIN (1992)
Manuel Blum, Oded Goldreich
Towards a Computational Theory of Statistical Tests (Extended Abstract) FOCS (1992)
Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor
Checking the Correctness of Memories FOCS (1991)
Manuel Blum, Alfredo De Santis, Silvio Micali, Giuseppe Persiano
Noninteractive Zero-Knowledge. SIAM J. Comput. 20 (6) (1991)
Leonard M. Adleman, Manuel Blum
Inductive Inference and Unsolvability. J. Symb. Log. 56 (3) (1991)
Manuel Blum
Program Checking. FSTTCS (1991)
Manuel Blum, Michael Luby, Ronitt Rubinfeld
Self-Testing/Correcting with Applications to Numerical Problems STOC (1990)
Nancy M. Amato, Manuel Blum, Sandy Irani, Ronitt Rubinfeld
Reversing Trains: A Turn of the Century Sorting Problem. J. Algorithms 10 (3) (1989)
Manuel Blum, Prabhakar Raghavan
Program Correctness: Can One Test For It? IFIP Congress (1989)
Manuel Blum, Sampath Kannan
Designing Programs That Check Their Work STOC (1989)
Manuel Blum, Michael Luby, Ronitt Rubinfeld
Program Result Checking against Adaptive Programs and in Cryptographic Settings. Distributed Computing And Cryptography (1989)
Manuel Blum, Paul Feldman, Silvio Micali
Proving Security Against Chosen Cyphertext Attacks. CRYPTO (1988)
Manuel Blum, Paul Feldman, Silvio Micali
Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract) STOC (1988)
Manuel Blum, Russell Impagliazzo
Generic Oracles and Oracle Classes (Extended Abstract) FOCS (1987)
Lenore Blum, Manuel Blum, Mike Shub
A Simple Unpredictable Pseudo-Random Number Generator. SIAM J. Comput. 15 (2) (1986)
Manuel Blum
Independent unbiased coin flips from a correlated biased source-a finite stae Markov chain. Comb. 6 (2) (1986)
Manuel Blum
Independent Unbiased Coin Flips From a Correlated Biased Source: a Finite State Markov Chain FOCS (1984)
Manuel Blum, Silvio Micali
How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. Comput. 13 (4) (1984)
Manuel Blum, Shafi Goldwasser
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information. CRYPTO (1984)
Manuel Blum
How to Exchange (Secret) Keys ACM Trans. Comput. Syst. 1 (2) (1983)
Manuel Blum
Coin flipping by telephone a protocol for solving impossible problems. SIGACT News 15 (1) (1983)
Manuel Blum
How to Exchange (Secret) Keys (Extended Abstract) STOC (1983)
Manuel Blum, Umesh V. Vazirani, Vijay V. Vazirani
Reducibility Among Protocols. CRYPTO (1983)
Lenore Blum, Manuel Blum, Mike Shub
Comparison of Two Pseudo-Random Number Generators. CRYPTO (1982)
Manuel Blum, Silvio Micali
How to Generate Cryptographically Strong Sequences of Pseudo Random Bits FOCS (1982)
Manuel Blum
Coin Flipping by Telephone - A Protocol for Solving Impossible Problems. COMPCON (1982)
Manuel Blum
Coin Flipping by Telephone. CRYPTO (1981)
Manuel Blum, Richard M. Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis
The Complexity of Testing Whether a Graph is a Superconcentrator. Inf. Process. Lett. 13 (4/5) (1981)
Manuel Blum, Ashok K. Chandra, Mark N. Wegman
Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time. Inf. Process. Lett. 10 (2) (1980)
Manuel Blum, Dexter Kozen
On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs) FOCS (1978)
Manuel Blum, William J. Sakoda
On the Capability of Finite Automata in 2 and 3 Dimensional Space FOCS (1977)
Lenore Blum, Manuel Blum
Toward a Mathematical Theory of Inductive Inference Inf. Control. 28 (2) (1975)
John Gill, Manuel Blum
On Almost Everywhere Complex Recursive Functions. J. ACM 21 (3) (1974)
Manuel Blum, Ivan Marques
On Complexity Properties of Recursively Enumerable Sets. J. Symb. Log. 38 (4) (1973)
Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan
Time Bounds for Selection. J. Comput. Syst. Sci. 7 (4) (1973)
Lenore Blum, Manuel Blum
Inductive Inference: A Recursion Theoretic Approach SWAT (1973)
Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan
Linear Time Bounds for Median Computations STOC (1972)
Manuel Blum
On Effective Procedures for Speeding Up Algorithms. J. ACM 18 (2) (1971)
Manuel Blum
On Effective Procedures for Speeding Up Algorithms STOC (1969)
Patrick C. Fischer, Juris Hartmanis, Manuel Blum
Tape Reversal Complexity Hierarchies SWAT (1968)
Manuel Blum, Carl Hewitt
Automata on a 2-Dimensional Tape SWAT (1967)
Manuel Blum
On the Size of Machines Inf. Control. 11 (3) (1967)
Manuel Blum
A Machine-Independent Theory of the Complexity of Recursive Functions. J. ACM 14 (2) (1967)