WorldCat Identities

Blum, Manuel

Overview
Works: 30 works in 41 publications in 1 language and 60 library holdings
Genres: Conference proceedings 
Roles: Honoree
Classifications: QA76.M41,
Publication Timeline
Key
Publications about  Manuel Blum Publications about Manuel Blum
Publications by  Manuel Blum Publications by Manuel Blum
Most widely held works about Manuel Blum
 
Most widely held works by Manuel Blum
Non-interactive zero knowledge ( Book )
5 editions published in 1990 in English and held by 10 WorldCat member libraries worldwide
We investigate the possibility of disposing of interaction between Prover and Verifier in a zero-knowledge proof if they share beforehand a short random string. Without any assumption, we prove that non-interactive zero-knowledge proofs exist for some number theoretic languages for which no efficient algorithm is known. If deciding quadratic residuosity (modulo composite integers whose factorization is not known) is computationally hard, we show that the NP-complete language of satisfiability also possesses non-interactive zero-knowledge proofs
Proceedings of 1999 International Workshop on Cryptographic Techniuqes and E-Commerce : 5-8 July 1999, City University of Hong Kong by International Workshop on Cryptographic Techniques & E-Commerce ( Book )
2 editions published in 1999 in English and held by 7 WorldCat member libraries worldwide
A stability test for configurations of blocks by Manuel Blum ( Book )
4 editions published in 1970 in English and held by 6 WorldCat member libraries worldwide
Program correctness : can one test for it? by Manuel Blum ( Book )
1 edition published in 1988 in English and held by 3 WorldCat member libraries worldwide
Software reliability via run-time result-checking by Manuel Blum ( Book )
2 editions published in 1994 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We review the field of result-checking, discussing simple checkers and self-correctors. We argue that such checkers could profitably be incorporated in software as an aid to efficient debugging and reliable functionality. We consider how to modify traditional checking methodologies to make them more appropriate for use in real-time, real- number computer systems. In particular, we suggest that checkers should be allowed to use stored randomness: i.e., that they should be allowed to generate, pre-process, and store random bits prior to run-time, and then to use this information repeatedly in a series of run-time checks. In a case study of checking a general real-number linear transformation (for example, a Fourier Transform), we present a simple checker which uses stored randomness, and a self-corrector which is particularly efficient if stored randomness is allowed."
33rd annual symposium on foundations of computer science, October 24-27, 1992, Pittsburgh, Pa : proceedings ( Book )
1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide
Efficient algorithms & intractable problems by Manuel Blum ( Visual )
1 edition published in 1988 in English and held by 2 WorldCat member libraries worldwide
Shows how to solve and analyse "intractable problems" such as computational, decision and search problems using algorithms
On the power of the compass : (or, why mazes are easier to search than graphs) / by M. Blum and W. [sic] Kozen by Manuel Blum ( Book )
1 edition published in 1978 in English and held by 2 WorldCat member libraries worldwide
A Secure Human-Computer Authentication Scheme by Nicholas J Hopper ( Book )
2 editions published in 2000 in English and held by 2 WorldCat member libraries worldwide
We introduce a protocol for authentication between a human and a computer, where the human is able to use no special hardware other than a dumb terminal. Authentication is based on a shared secret which can be reused polynomially often with no danger of exposure, assuming the conjectured uniform hardness of learning parity functions in the presence of noise. Under this conjecture, the protocol is secure against a polynomially-bounded passive adversary and also some forms of active adversary, although it is not secure against arbitrary active adversaries
Towards a computational theory of statistical tests by Manuel Blum ( Book )
1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide
Designing programs to check their work by Manuel Blum ( Book )
1 edition published in 1988 in English and held by 2 WorldCat member libraries worldwide
On the capability of finite automata in 2 and 3 dimensional space by Manuel Blum ( Book )
1 edition published in 1978 in English and held by 2 WorldCat member libraries worldwide
Time bounds for selection ( Book )
1 edition published in 1973 in English and held by 1 WorldCat member library worldwide
A machine-independent theory of the complexity of recursive functions by Manuel Blum ( Book )
1 edition published in 1964 in English and held by 1 WorldCat member library worldwide
Designing programs that check their work by Manuel Blum ( Book )
1 edition published in 1995 in English and held by 1 WorldCat member library worldwide
Reliability of biological computers by Manuel Blum ( Book )
1 edition published in 1961 in English and held by 1 WorldCat member library worldwide
Self-testing/correcting with applications to numerical problems by Manuel Blum ( Book )
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
Abstract: "Suppose someone gives us an extremely fast program P that we can call as a black box to compute a function f. Should we trust that P works correctly? A self-testing/correcting pair for f allows us to: (1) estimate the probability that P(x) [not equal to] f(x) when x is randomly chosen; (2) on any input x, compute f(x) correctly as long as P is not too faulty on average. Furthermore, both (1) and (2) take time only slightly more than the original running time of P. We present general techniques for constructing simple to program self-testing/correcting pairs for a variety of numerical functions, including integer multiplication, modular multiplication, matrix multiplication, inverting matrices, computing the determinant of a matrix, computing the rank of a matrix, integer division, modular exponentiation and polynomial multiplication."
Selected papers in honor of Manuel Blum ( Book )
1 edition published in 2000 in English and held by 1 WorldCat member library worldwide
Theoretical computer science : selected papers in honor of Manuel Blum ( Book )
1 edition published in 2000 in English and held by 1 WorldCat member library worldwide
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.63 (from 0.00 for Selected p ... to 1.00 for On the pow ...)
Languages
English (32)