Results 1  10
of
895,650
ConstantRound NonMalleable Commitments from Any OneWay Function
, 2011
"... We show unconditionally that the existence of commitment schemes implies the existence of constantround nonmalleable commitments; earlier protocols required additional assumptions such as collision resistant hash functions or subexponential oneway functions. Our protocol also satisfies the strong ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We show unconditionally that the existence of commitment schemes implies the existence of constantround nonmalleable commitments; earlier protocols required additional assumptions such as collision resistant hash functions or subexponential oneway functions. Our protocol also satisfies
Constantround NonMalleable Commitment from Strong OneWay Functions
 In Crypto08, Springer LNCS 5157
, 2008
"... Abstract. We present a constantround nonmalleable commitment scheme based on the existence of subexponential oneway functions and using a blackbox proof of security. As far as we know, this is the first construction of a constantround nonmalleable protocol based on only onewayness, or to admi ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
Abstract. We present a constantround nonmalleable commitment scheme based on the existence of subexponential oneway functions and using a blackbox proof of security. As far as we know, this is the first construction of a constantround nonmalleable protocol based on only onewayness
NonMalleable Cryptography
 SIAM Journal on Computing
, 2000
"... The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related. ..."
Abstract

Cited by 490 (21 self)
 Add to MetaCart
. The same concept makes sense in the contexts of string commitment and zeroknowledge proofs of possession of knowledge. Nonmalleable schemes for each of these three problems are presented. The schemes do not assume a trusted center; a user need not know anything about the number or identity of other
PseudoRandom Generation from OneWay Functions
 PROC. 20TH STOC
, 1988
"... Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom gene ..."
Abstract

Cited by 887 (22 self)
 Add to MetaCart
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom
Concurrent NonMalleable Commitments from Oneway Functions
, 2007
"... We show the existence of concurrent nonmalleable commitments based on the existence oneway functions. Our proof of security only requires the use of blackbox techniques, and additionally provides an arguably simplified proof of the existence of even standalone secure nonmalleable commitments. ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
We show the existence of concurrent nonmalleable commitments based on the existence oneway functions. Our proof of security only requires the use of blackbox techniques, and additionally provides an arguably simplified proof of the existence of even standalone secure nonmalleable commitments.
Foundations of nonmalleable hash and oneway functions
 In ASIACRYPT
, 2009
"... Nonmalleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryption E(m) of some unknown message m, it should be hard to transform this ciphertext into some encryption E(m ∗ ) of a rel ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
related message m ∗. This notion has been studied extensively for primitives like encryption, commitments and zeroknowledge. Nonmalleability of oneway functions and hash functions has surfaced as a crucial property in several recent results, but it has not undergone a comprehensive treatment so far
ConstantRound Concurrent Zeroknowledge from
, 2014
"... We present a constantround concurrent zeroknowledge protocol for NP. Our protocol relies on the existence of families of collisionresistant hash functions, oneway permutations, and indistinguishability obfuscators for P/poly (with slightly superpolynomial security). ..."
Abstract
 Add to MetaCart
We present a constantround concurrent zeroknowledge protocol for NP. Our protocol relies on the existence of families of collisionresistant hash functions, oneway permutations, and indistinguishability obfuscators for P/poly (with slightly superpolynomial security).
Universal OneWay Hash Functions and their Cryptographic Applications
, 1989
"... We define a Universal OneWay Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x in the domain, it is computationally hard to find a different domain element which collides with x. We ..."
Abstract

Cited by 357 (15 self)
 Add to MetaCart
prove constructively that universal oneway hash functions exist if any 11 oneway functions exist. Among the various applications of the primitive is a OneWay based Secure Digital Signature Scheme which is existentially secure against adoptive attacks. Previously, all provably secure signature
Constant Round NonMalleable Protocols using One Way Functions
"... We provide the first constant round constructions of nonmalleable commitment and zeroknowledge protocols based only one oneway functions. This improves upon several previous (incomparable) works which required either: (a) superconstant number of rounds, or, (b) nonstandard or subexponential ha ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We provide the first constant round constructions of nonmalleable commitment and zeroknowledge protocols based only one oneway functions. This improves upon several previous (incomparable) works which required either: (a) superconstant number of rounds, or, (b) nonstandard or sub
Concurrent nonmalleable commitments
 In FOCS
, 2005
"... We present a nonmalleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a maninthemiddle adversary who is simultaneously participating in multiple concurrent commitment phases of our scheme, both as a sender and as a ..."
Abstract

Cited by 42 (14 self)
 Add to MetaCart
We present a nonmalleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a maninthemiddle adversary who is simultaneously participating in multiple concurrent commitment phases of our scheme, both as a sender
Results 1  10
of
895,650