Blockchain Papers

Yvo Desmedt, Mike Burmester

No abstract is available for this record.

Toshiya Itoh, Kouichi Sakurai

No abstract is available for this record.

Tatsuaki Okamoto

No abstract is available for this record.

Joan Feigenbaum, Rafail Ostrovsky

No abstract is available for this record.

Mihir Bellare, Phillip Rogaway

We argue that the random oracle model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol PR for the random oracle model, and then replacing oracle accesses by the computation of an “appropriately chosen” function h. This paradigm yields protocols much more efficient than standard ones while retaining many of the advantages of provable security. We illustrate these gains for problems including encryption, signatures, and zero-knowledge proofs.

Cynthia Dwork, Larry Stockmeyer

The zero knowledge properties of interactive proof systems (IPSs) are studied in the case that the verifier is a 2-way probabilistic finite state automaton (2pfa). The following results are proved: A new definition of zero knowledge is introduced. This definition captures a concept of “zero knowledge” for IPSs that are used for language recognition.

Cynthia Dwork, Larry Stockmeyer

An investigation of interactive proof systems (IPSs) where the verifier is a 2-way probabilistic finite state automaton (2pfa) is initiated. In this model, it is shown: Additional results concern two other classes of verifiers: 2pfa's that halt in polynomial expected time, and 2-way probabilistic pushdown automata that halt in polynomial time. In particular, IPSs with verifiers in the latter class are as powerful as IPSs where verifiers are polynomial-time probabilistic Turing machines. In a companion paper [7], zero knowledge IPSs with 2pfa verifiers are investigated.

Scott Eugene Inch

Energy dissipation in systems with linear viscoelastic damping is examined. It is shown that in such viscoelastically damped systems the use of additional dissipation mechanisms (such as boundary velocity feedback or thermal coupling) may not improve the rate of energy decay. The situation where the viscoelastic stress relaxation modulus decreases to its (positive) equilibrium modulus at a subexponential rate, e.g., like (1 + t)^-x + E, where α > 0, E > 0 is examined. In this case, the nonoscillatory modes (the so-called creep modes) dominate the energy decay rate. The results are in two parts. In the first part, a linear viscoelastic wave equation with infinite memory is examined. It is shown that under appropriate conditions on the kernel and initial history, the total energy is integrable against a particular weight if the kinetic energy component of the total energy is integrable against the same weight. The proof uses energy methods in an induction argument. Precise energy decay rates have recently been obtained using boundary velocity feedback. It is shown that the same decay rates hold for history value problems with conservative boundary conditions provided that an <i>a priori</i> knowledge of the decay rate of the kinetic energy term is assumed. In the second part, a simple linear thermo-viscoelastic system, namely, a viscoelastic wave equation coupled to a heat equation, is examined. Using Laplace transform methods, an integral representation formula for <i>W(x,s</i>), the transform of the displacement <i>w(x, t)</i>, is obtained. After analyzing the location of the zeros of the appropriate characteristic equation, an asymptotic expansion for the displacement <i>w(O,t)</i> is obtained which is valid for large <i>t</i> and the specific kernel <i>g(t) = g</i>(–) + δtη-1 [over]Î (η), 0 < η < 1. With this expansion it is shown that the coupled system tends to its equilibrium at a slower rate than that of the uncoupled system.

Mike Burmester, Yvo Desmedt

No abstract is available for this record.

Shafi Goldwasser, Rafail Ostrovsky

The standard definition of digital signatures allows a document to have many valid signatures. In this paper, we consider a subclass of digital signatures, called invariant signatures, in which all legal signatures of a document must be identical according to some polynomialtime computable function (of a signature) which is hard to predict given an unsigned document. We formalize this notion and show its equivalence to non-interactive zero-knowledge proofs. Appeared in Springer-Verlag Lecture Notes in Computer Sciene, proceedings of CRYPTO-92, August 1992, Santa-Barbara, California. y MIT. This research was supported in part by NSF-FAW CCR-9023313, NSF-PYI CCR-865727, Darpa N0014-89-J-1988, BSF 89-00312. z International Computer Science Institute at Berkeley and University of California at Berkeley. Supported by NSF Postdoctoral Fellowship. Parts of this work were done at MIT, Bellcore and IBM T.J. Watson Research Center. 1 Introduction Currently, due to the lack of proven non...

Joan Boyar, Faith E. Fich, Kim S. Larsen

&lt;p&gt;Let A and B be n x n matrices the entries of which are affine combinations of the variables a_1,... ,a_m,b_1,. .. ,b_m over GF(2). Suppose that, for each i, 1&amp;lt;= i &amp;lt;= m, the term a_i b_i is an element of the product matrix C = A € B. What is the maximum value that &lt;em&gt; m &lt;/em&gt; can have as a function of &lt;em&gt; n &lt;/em&gt;? This question arises from a recent technique for improving the communication complexity of zero-knowledge proofs.&lt;/p&gt;&lt;p&gt;The obvious upper bound of n^2 is improved to n^2 sqrt[3] 3 + O(n). Tighter bounds are obtained for smaller values of n. The bounds for n = 2, n = 3, and n = 4 are tight.&lt;/p&gt;

Werner Kuich

No abstract is available for this record.

Mike Burmester

No abstract is available for this record.

Maria Eugênia Leite Duarte, Roberta Andrade Lauria, Vinícius Schott Gameiro

No abstract is available for this record.

Akihiro Fukui, Masami Maeda, Susumu Tamai, Yuji Inada

No abstract is available for this record.

Toshiya Itoh, Tomomi Hosokawa

Abstract In modern cryptologic theory, the design of cryptographic protocols is often based on the assumed difficulty of number theoretic problems. Especially, in order to prove the security of a cryptographic protocol based upon the assumed difficulty of a problem, a very important role is played by the legitimacy (as concerns the security of the cryptographic protocol) of that cryptographic assumption. Recently, Kurosawa, Ogata, and Tsujii proposed a new cryptographic assumption, the Chosen Discrete Logarithm Assumption (CDLA), and showed that any language in NP has a four‐move, zero‐knowledge interactive proof (ZKIP) under the CDLA. In this paper, we define the modified CDLA and consider its legitimacy. Our principal result (that the modified CDLA is not a legitimate cryptographic assumption) follows from a theoretical analysis of expected polynomial‐time algorithms and the concrete construction of an algorithm based on the Artin conjecture.

Kaoru Kurosawa, K. Takai

The paper presents a more efficient noninteractive zero knowledge proof system (NIZK) for 3 colorability. The length of the proof is 1/3 and the length of the reference string is 1/4 of those of Blum et al. (1988) respectively. The proposed NIZK is based on the quadratic residuosity assumption.&gt;

A. Razvan

The final tensile fracture of any composite structure is primarily due to the failure of its constituents, namely fibers and matrix in the present case. To date, no experimental data exists, to the author’s knowledge, to define the behavior of constitutive fibers of a composite structure throughout its life span. The prime candidate for a fiber-based investigation is unidirectional zero-degree composite coupons. But unidirectional coupons do not demonstrate any significant loss of stiffness during fatigue cycling compared to other lay-ups. Even if stiffness degradation was significant, due to the nature of damage in this material system it would be impossible, practically, to monitor that change using conventional techniques (e.g. an extensometer) because the damage and failure process destroys the integrity of the contact between those devices and the material, under cyclic conditions. This investigation presents the findings of a fiber-based investigation of unidirectional composite material systems. In particular, a unidirectional graphite/epoxy system was studied, and the influence of applied load level on fiber fractures, and their influence on damage growth documented. A damage monitoring technique (patent pending) was developed to accurately record the state of damage in this material system without the usage of extensometers or strain gages. Following this method, two new damage norms were introduced, namely, “percent phase damage” and “percent gain damage”. Fiber fracture, strength degradation, and the life of unidirectional specimens were investigated and recorded as a function of various load levels. Fiber fracture, in general, showed no definitive growth pattern during fatigue cycling. It appears that the majority of the broken fibers that occur over nearly 90% of the life are due to the initial applied load cycle. This is one of the key findings of this investigation. “Proof testing” which is a common practice in industry for “verifying” the integrity of a structure, could very well be causing significant subsequent reductions in life. With these findings as a base, it is now possible to postulate the first well-founded mechanistic model of fiber-dominated fatigue degradation under tensile loading.

David Chaum, Eugène van Heijst, Birgit Pfitzmann

No abstract is available for this record.

Mihir Bellare, Erez Petrank

We look at the question of how powerful a prover must be to give a zero-knowledge proof.We present the first unconditional bounds on the complexity of a statistical ZK prover.The result is that if a language possesses a statistical zero-knowledge then it also possesses a statistical zero-knowledge proof in which the prover runs in probabilistic, polynomial time with an NP oracle.Previously this was only known given the existence of one-way permutations. Extendingthese techniques to protocols of knowledge complexity k(n) >0, we derive bounds on the time complexity of languages of "small" knowledge complexity.Underlying these results is a technique for efficiently generating an "almost" random element of a set S E P.Namely, we construct a probabilistic machine with an NP oracle which, on input 1" and 6 > 0 runs in time polynomial in n and lg 6-1, and outputs a random string from a distribution within distance 6 of the uniform distribution on S n {O, l}~.

Alfredo De Santis, Giuseppe Persiano, Moti Yung

No abstract is available for this record.

Alfredo De Santis, Giuseppe Persiano

No abstract is available for this record.

Alfredo De Santis, Giuseppe Persiano

A zero-knowledge proof system of knowledge is a protocol between two parties called the prover and the verifier. The prover wants to convince the verifier that he “knows” the proof of a given theorem without revealing any additional information. This is different from a zero-knowledge proof system of membership where the prover convinces the verifier only of the veridicity of the statement. Zero-knowledge proofs of knowledge are very useful tools in the design of secure protocols. Though, the concept of a proof of knowledge is a very subtle one and great care is needed to obtain a satisfying formalization. In this paper, we investigate the concept of a zero-knowledge proof of knowledge in the noninteractive model of [5, 61. Here, the prover and the verifier share a short random string and the only communication allowed is from the prover to the verifier. Although this is a simpler model than the interactive one, still formalizing zeroknowledge proofs of knowledge is a delicate task. The main results of the paper are the following e We present formal definitions for the concept of non-interactive zero-knowledge proofs

Alfredo De Santis, Giuseppe Persiano

A zero-knowledge proof system of knowledge is a protocol between two parties called the prover and the verifier. The prover wants to convince the verifier that he 'knows' the proof of a given theorem without revealing any additional information. This is different from a zero-knowledge proof system of membership where the prover convinces the verifier only of the veridicity of the statement. Zero-knowledge proofs of knowledge are very useful tools in the design of secure protocols. Though, the concept of a proof of knowledge is a very subtle one and great care is needed to obtain a satisfying formalization. The authors investigate the concept of a zero-knowledge proof of knowledge with a non-interactive model. Here, the prover and the verifier share a short random string and the only communication allowed is from the prover to the verifier. Although this is a simpler model than the interactive one, still formalizing zero-knowledge proofs of knowledge is a delicate task.&gt;