Blockchain Papers

M. Bellare, S. Micali, R. Ostrovsky

No abstract is available for this record.

馨 黒澤, Kaoru Kurosawa, わかは 尾形, Wakaha Ogata · 8 authors

No abstract is available for this record.

Cynthia Dwork, Larry Stockmeyer

We initiate an investigation of interactive proof systems (IPS'S) and zero knowledge interactive proof systems where the verifier is a %way probabilistic finite state automaton (2pfa). Among other results, we show: 1. There is a class of 2pfa verifiers and a language L such that L has a zero knowledge IPS with respect to this class of verifiers, and L cannot be recognized by any verifier in the class on its own; 2. There is a language L such that L has an IPS with 2pfa verifiers but L has no zero knowledge IPS with 2pfa verifiers.

Kazuo Ohta, Tatsuaki Okamoto

No abstract is available for this record.

Manuel Blum, Paul Feldman, Silvio Micali

No abstract is available for this record.

Wellner, Ingrid

No abstract is available for this record.

Cynthia Dwork, Larry Stockmeyer

No abstract is available for this record.

Jørgen Brandt, Ivan Damgård, Peter Landrock, Torben Pedersen

No abstract is available for this record.

Joan Boyar, Stuart A. Kurtz, Mark W. Krentel

No abstract is available for this record.

Alfredo De Santis, Silvio Micali, Giuseppe Persiano

No abstract is available for this record.

Mike Burmester

No abstract is available for this record.

Mihir Bellare, Silvio Micali, Rafail Ostrovsky

Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research effort, all previous zero-knowledge proofs for them required either unproven complexity assumptions or an unbounded number of rounds of message exchange.

Moni Naor, Moti Yung

We show how to construct a public-key cryptosystem (as originally defined by DiNe and Hellman) secure against chosen ciphertezt attacks, given a public-key cryptosystern secure against passive eavesdropping and a noninteractive zero-knowledge proof system in the shared string model. No such secure cryptosystems were known before. A concrete implementation can be based on quadratic residuosity intractability.

Michael Ben-Or, Oded Goldreich, Shafi Goldwasser, Johan Håstad · 7 authors

No abstract is available for this record.

Alfredo De Santis, Silvio Micali, Giuseppe Persiano

No abstract is available for this record.

Oded Goldreich, Eyal Kushilevitz

No abstract is available for this record.

Uriel Feige, Dror Lapidot, Adi Shamir

In the present study, we investigated how the symmetry/asymmetry of cell division in mitotic CD34(+) cells can be evaluated by determining the plane of cell division and the potential distribution of proteins between daughter cells. The orientation of the mitotic spindle is dependent upon the positioning of the centrosomes, which determine the plane of cell division and the sharing of proteins. If the functions of unequally shared proteins are relevant to the kinetics of cell division, they could determine whether the daughter cells undergo self-renewal or differentiation. The kinetic function of the proteins of interest was investigated using a colony-replating assay and carboxyfluorescein succinimidyl ester (CFSE) staining. We used Notch/Numb as a model system, since they have a role in balancing symmetric/asymmetric divisions. Mitotic cells were examined microscopically and centrosomal markers γ-tubulin/pericentrin were used with activated Notch-1 and Numb. We monitored the first crucial divisions by CFSE staining and found an inverse relationship between activated Notch and Numb expression, suggesting a reciprocal regulation. We suggest that the subpopulations expressing activated Notch or Numb have different cell fates. To determine the influence of Notch signaling on progenitor cell self-renewal, we used the γ-secretase inhibitor N-[N-(3,5-Difluorophenacetyl-L-alanyl)]-S-phenylglycine t-Butyl ester (DAPT). DAPT influences self-renewal/differentiation outcome by affecting the frequency of symmetric renewal divisions without affecting the rate of divisions. Overall, the purpose of this study was to establish a cellular system for predicting the symmetry/asymmetry of hematopoietic progenitor divisions at the level of centrosomes and protein distribution and to investigate the influence of these proteins on progenitor cell kinetics.

Mike Burmester, Yvo Desmedt

The proof of soundness for many zero-knowledge schemes has been given in an incomplete way. We discuss the consequences.

Joe Kilian, Silvio Micali, Rafail Ostrovsky

No abstract is available for this record.

Roméo Ortega, Gustavo Sanchez Galindo

A complete proof is given of global convergence to zero of the prediction error and asymptotic optimality for a direct adaptive controller is established based on multistep quadratic cost minimization with a receding horizon philosophy. The only substantial assumptions are that the controller designed when the parameters are known, stabilizes the plant and the exact knowledge of the first N y (N y -optimization horizon) impulse response coefficients of the plant. The technical hurdles for the development of a comprehensive convergence theory of this type of controller are also highlighted.

Gilles Brassard, Claude Crépeau, Moti Yung

No abstract is available for this record.

Lance Fortnow

In 1985, Goldwasser, Micali and Rackoff formulated interactive proof systems as a tool for developing cryptographic protocols. Indeed, many exciting cryptographic results followed from studying interactive proof systems and the related concept of zero-knowledge. Interactive proof systems also have an important part in complexity theory merging the well established concepts of probabilistic and nondeterministic computation. This thesis will study the complexity of various models of interactive proof systems. A perfect zero-knowledge interactive protocol convinces a verifier that a string is in a language without revealing any additional knowledge in an information theoretic sense. This thesis will show that for any language that has a perfect zero-knowledge proof system, its complement has a short interactive protocol. This result implies that there are not any perfect zero-knowledge protocols for NP-complete languages unless the polynomial-time hierarchy collapses. Thus knowledge comp...

Joe Kilian, Silvio Micali, Rafail Ostrovsky

No abstract is available for this record.

Joe Kilian, Silvio Micali, Rafail Ostrovsky

Several resources relating to zero-knowledge protocols are considered. They are the number of envelopes used in the protocol, the number of oblivious transfer protocols executed during the protocol, and the total amount of communication required by the protocol. It is shown that after a preprocessing stage consisting of O(k) executions of oblivious transfer, any polynomial number of NP-theorems of any polysize can be proved noninteractively and in zero knowledge, on the basis of the existence of any one-way function, so that the probability of accepting a false theorem is less than 1/2/sup k/.>