Follow blockchain research across journals, conferences, and preprint repositories.
4,228 results · page 175 of 177
Tony L Eng
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.
Joan Boyar, Carsten Lund, René Peralta
No abstract is available for this record.
Oded Goldreich
No abstract is available for this record.
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.
Kaoru Kurosawa
No abstract is available for this record.
Serge Vaudenay
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
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)<sup>-x</sup> + 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.
Joan Boyar, Faith E. Fich, Kim S. Larsen
<p>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&lt;= i &lt;= m, the term a_i b_i is an element of the product matrix C = A € B. What is the maximum value that <em> m </em> can have as a function of <em> n </em>? This question arises from a recent technique for improving the communication complexity of zero-knowledge proofs.</p><p>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.</p>
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}~.
Joe Kilian
In this note, we present new zero-knowledge interactive proofs and arguments for languages in NP. To show that x ε L, with an error probability of at most 2-k, our zero-knowledge proof system requires O(|x|c1)+O(lgc2|x|)k ideal bit commitments, where c1 and c2 depend only on L. This construction is the first in the ideal bit commitment model that achieves large values of k more efficiently than by running k independent iterations of the base interactive proof system. Under suitable complexity assumptions, we exhibit zero knowledge arguments that require O(lgc|x|kl bits of communication, where c depends only on L, and l is the security parameter for the prover. This is the first construction in which the total amount of communication can be less than that needed to transmit the NP witness. Our protocols are based on efficiently checkable proofs for NP[4].
Alfredo De Santis, Moti Yung
No abstract is available for this record.
Neal Koblitz
No abstract is available for this record.
Joan Boyar, Katalin Friedl, Carsten Lund
No abstract is available for this record.
Kazuo Ohta, Tatsuaki Okamoto
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.
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.