Blockchain Papers

Toshiya Itoh, Atsushi Kawakubo

No abstract is available for this record.

Giovanni Di Crescenzo

No abstract is available for this record.

Jacques Stern

No abstract is available for this record.

Tony L Eng

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.

Hyungong Shin

In cryptography, the notion of zero-knowledge is important. It is also related to complexity theory. In this paper we briefly survey the zero-knowledge proofs in the literature. 1987 Maathematics Subject Classification: 69D56, 69E30, 69F21, Keywords and phrases: interactive proofs, zero-kniwledge, cryptography, complexity theiry.

Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano

No abstract is available for this record.

Jacques Stern

No abstract is available for this record.

Joan Boyar, René Peralta

We show how to construct a "zero-knowledge proof" that a circuit of size m is satisfiable. The proof is a string of length O(m lg m) which is constructed (and can be verified) using a trusted random string of length O(m lg m). The probability of failure or of cheating is exponentially small in a security parameter which is defined independently Supported in part by NSF Grant CCR-9207204. of the circuit size. Our methods assume that a Quadratic Residuosity Bit Commitment Scheme is available as a primitive and does not consider the cost of establishing this scheme, only the cost of using it. Thus, these "proofs" are essentially non-interactive zero-knowledge proofs, with a couple of changes to the standard definition, though they can easily be modified to fit the standard definition. The techniques used yield more efficient "proofs" than those previously known. 1 Introduction A non-interactive zero-knowledge proof system is a protocol that allows a prover to convince a verifier tha...

JL de Lima Filho, WM Ledingham

No abstract is available for this record.

Joan Boyar, Carsten Lund, René Peralta

No abstract is available for this record.

Oded Goldreich, Eyal Kushilevitz

No abstract is available for this record.

Kouichi Sakurai

No abstract is available for this record.

Kouichi Sakurai

No abstract is available for this record.

Oded Goldreich

No abstract is available for this record.

S. M. Ageev

It is shown that any free action of a zero-dimensional compact group on the -dimensional Menger compactum is -universal for free actions, and that the orbit space is -classifying. Nonexistence of equivariant mappings between and implies that the orbit space has infinite dimension, where is any compact ANR-space with free action of the group of -adic integers. Knowledge of such nonexistence would then permit proof of the Hilbert-Smith conjecture under the assumption of finite dimensionality for the orbit space.

S. M. Ageev

T. It is shown that any free action of a zero-dimensional compact group G on the О·-dimensional Menger compactum Mn is О·-universal for free actions, and that the orbit space MnjG is В«-classifying. Nonexistence of equivariant mappings between Mn+m and Mn implies that the orbit space R/Ap has infinite dimension, where R is any compact ANR-space with free action of the group Ap of p-adic integers. Knowledge of such nonexistence would then permit proof of the Hilbert-Smith conjecture under the assumption of finite dimensionality for the orbit space.

Dominique de Waleffe, Jean-Jacques Quisquater

No abstract is available for this record.

G.E. Mailloux, Rita Noumeir, R. Lemieux

It is shown that the MART (multiplicative algebraic reconstruction technique) algorithm can be derived by POCS. This gives MART a new theoretical interpretation and a proof of convergence to a stable solution even when other convex constraints are introduced. However, MART, as a multiplicative algorithm, depends on the initial solution. It is noted that, far from being a flaw, this property can be used to introduce further a priori knowledge about the image to be reconstructed, to maximize the entropy, to keep the ratio between the regions of the original image constant, or to set to zero the area outside the reconstruction volume. MART should be preferred to MENT (a maximum entropy algorithm) for entropy maximization, for it performs as well but is much faster. ART is much less influenced by the initial solution than MART.>

Kaoru Kurosawa

No abstract is available for this record.

Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung

No abstract is available for this record.

Serge Vaudenay

No abstract is available for this record.

Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya

No abstract is available for this record.

William A. Wulf, Alec Yasinsac, Katie S. Oliver, Ramesh Peri

Distributed systems have long relied on shared secrets to ensure the authenticity of principals. Public key systems and zero knowledge proofs of identity have reduced this reliance. We offer a method of remote authentication that can be used with no advance shared knowledge by parties, and that allows parties to increase their confidence in the authenticity of a suspicious party to an arbitrary level. Note: Abstract extracted from PDF text

Donald Beaver, Joan Feigenbaum, Rafail Ostrovsky, Victor Shoup

We define the notion of an instance-hiding proof system (ihps) for a function f ; informally, an ihps is a protocol in which a polynomial-time verifier interacts with one or more all-powerful provers and is convinced of the value of f(x) but does not reveal the input x to the provers. We show here that a function f has a multiprover ihps if and only if it is computable in FNEXP. We formalize the notion of zero-knowledge for ihps's and show that any function that has a multiprover ihps in fact has one that is perfect zero-knowledge. Under the assumption that one-way permutations exist, we show that f has a one-prover, zero-knowledge ihps if and only if it is in FPSPACE and has a one-oracle instance-hiding scheme (ihs). 1 Introduction In this paper, we show that every function that has a multiprover interactive proof system in fact has one in which the verifier does not learn the proof, and the provers do not learn what they are proving. Consider interactive protocols involving a proba...