Results 11  20
of
118,582
A New Family of Practical NonMalleable Protocols
, 2011
"... Nowadays, achieving cryptosystems secure in an asynchronous network like the Internet is demanded to be necessary, where concurrent nonmalleable proofofknowledge and universal composability are among the most powerful and fundamental security properties. But, when achieving more and more complex ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Nowadays, achieving cryptosystems secure in an asynchronous network like the Internet is demanded to be necessary, where concurrent nonmalleable proofofknowledge and universal composability are among the most powerful and fundamental security properties. But, when achieving more and more complex
Concurrent NonMalleable Witness Indistinguishability and Its Applications
, 2006
"... One of the central questions in Cryptography today is proving security of the protocols "on the Internet", i.e., in a concurrent setting where there are multiple interactions between players, and where the adversary can play so called "maninthemiddle" attacks, forwarding an ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
and modifying messages between two or more unsuspecting players. Indeed, the main challenge in this setting is to provide security with respect to adaptive concurrent composition of protocols and also the nonmalleability property, where the "maninthemiddle" attacks are prevented. Despite much
Statistical Concurrent NonMalleable Zero Knowledge
"... The notion of Zero Knowledge introduced by Goldwasser, Micali and Rackoff in STOC 1985 is fundamental in Cryptography. Motivated by conceptual and practical reasons, this notion has been explored under stronger definitions. We will consider the following two main strengthened notions. Statistical Ze ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Zero Knowledge: here the zeroknowledge property will last forever, even in case in future the adversary will have unlimited power. Concurrent NonMalleable Zero Knowledge: here the zeroknowledge property is combined with nontransferability and the adversary fails in mounting a concurrent man
Adaptive Security of Concurrent NonMalleable ZeroKnowledge
"... A zeroknowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool and widely used in many other cryptographic applications. However, when standalone zeroknowledge protocols are used in com ..."
Abstract
 Add to MetaCart
assumptions. In this paper, we study adaptive security of zeroknowledge protocols under both concurrent self composition and maninthemiddle attacks in the plain model (i.e., without any setup assumptions). We provide a construction of adaptively secure concurrent nonmalleable zeroknowledge proof
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Completely nonmalleable encryption revisited
 PKC 2008, LNCS
, 2008
"... Abstract. Several security notions for publickey encryption schemes have been proposed so far, in particular considering the powerful adversary that can play a so called “maninthemiddle ” attack. In this paper we extend the notion of completely nonmalleable encryption introduced in [Fischlin, ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
, ICALP 05]. This notion immunizes a scheme from adversaries that can generate related ciphertexts under new public keys. This notion is motivated by its powerful features when encryption schemes are used as subprotocols. While in [Fischlin, ICALP 05] the only notion of simulationbased completely nonmalleable
Concurrently NonMalleable ZeroKnowledge in the Authenticated PublicKey Model
, 2006
"... We consider a type of zeroknowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zeroknowledge arguments of knowledge that remain secure against concurrent maninthemiddle attacks. As negative results in the area of concurrent nonm ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider a type of zeroknowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zeroknowledge arguments of knowledge that remain secure against concurrent maninthemiddle attacks. As negative results in the area of concurrent nonmalleable
Noninteractive and Reusable NonMalleable Commitment Schemes
 In proceedings of STOC ’03
, 2003
"... We consider nonmalleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. ..."
Abstract

Cited by 52 (6 self)
 Add to MetaCart
We consider nonmalleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model.
Capacity of nonmalleable codes
, 2013
"... Nonmalleable codes, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), encode messages s in a manner so that tampering the codeword causes the decoder to either output s or a message that is independent of s. While this is an impossible goal to achieve against unrestricted tampering function ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
, ” and establish optimal bounds on the achievable rate as a function of the family size, answering an open problem from Dziembowski et al. (ICS 2010). Specifically, • We prove that for every family F with F  � 22αn, there exist nonmalleable codes against F with rate arbitrarily close to 1 − α (this is achieved
NonMalleable NonInteractive Zero Knowledge and Adaptive ChosenCiphertext Security
, 1999
"... We introduce the notion of nonmalleable noninteractive zeroknowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong nonmalleability properties. We then show that the elegant encryption scheme of Naor and Yung [NY] can be made secure against ..."
Abstract

Cited by 190 (19 self)
 Add to MetaCart
We introduce the notion of nonmalleable noninteractive zeroknowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong nonmalleability properties. We then show that the elegant encryption scheme of Naor and Yung [NY] can be made secure against
Results 11  20
of
118,582