Results 1  10
of
3,702
Cryptanalysis of a ZeroKnowledge Identification Protocol of Eurocrypt '95
"... We present a cryptanalysis of a zeroknowledge identification protocol introduced by Naccache et al. at Eurocrypt '95. Our cryptanalysis enables a polynomialtime attacker to pass the identification protocol with probability one, without knowing the private key. ..."
Abstract
 Add to MetaCart
We present a cryptanalysis of a zeroknowledge identification protocol introduced by Naccache et al. at Eurocrypt '95. Our cryptanalysis enables a polynomialtime attacker to pass the identification protocol with probability one, without knowing the private key.
Cryptanalysis of a ZeroKnowledge Identification Protocol of Eurocrypt ’95
"... Abstract. We present a cryptanalysis of a zeroknowledge identification protocol introduced by Naccache et al. at Eurocrypt ’95. Our cryptanalysis enables a polynomialtime attacker to pass the identification protocol with probability one, without knowing the private key. Key Words: Zeroknowledge, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We present a cryptanalysis of a zeroknowledge identification protocol introduced by Naccache et al. at Eurocrypt ’95. Our cryptanalysis enables a polynomialtime attacker to pass the identification protocol with probability one, without knowing the private key. Key Words: Zeroknowledge
Sorting out zeroknowledge
"... Iu their 1985 paper, Goldwasser, Micah and Rackoff set forth the notion of zeroknowledge interactive proofs [GMRl]. This seminal paper generated considerable activity around the world. In the span of a few years, a substantial number of results were obtained by different groups of researchers. Amon ..."
Abstract
 Add to MetaCart
Iu their 1985 paper, Goldwasser, Micah and Rackoff set forth the notion of zeroknowledge interactive proofs [GMRl]. This seminal paper generated considerable activity around the world. In the span of a few years, a substantial number of results were obtained by different groups of researchers
On the design and implementation of efficient zeroknowledge proofs of knowledge
 In Software Performance Enhancements for Encryption and Decryption and Cryptographic Compilers – SPEEDCC 09
"... Abstract. Zeroknowledge proofs of knowledge (ZKPoK) play an important role in many cryptographic applications. Direct anonymous attestation (DAA) and the identity mixer anonymous authentication system are first real world applications using ZKPoK as building blocks. But although being used for ma ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. Zeroknowledge proofs of knowledge (ZKPoK) play an important role in many cryptographic applications. Direct anonymous attestation (DAA) and the identity mixer anonymous authentication system are first real world applications using ZKPoK as building blocks. But although being used
Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001
"... In 1996, a new cryptosystem called NTRU was introduced, related to the hardness of finding short vectors in specific lattices. At Eurocrypt 2001, the NTRU Signature Scheme (NSS), a signature scheme apparently related to the same hard problem, was proposed. In this paper, we show that the problem on ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
In 1996, a new cryptosystem called NTRU was introduced, related to the hardness of finding short vectors in specific lattices. At Eurocrypt 2001, the NTRU Signature Scheme (NSS), a signature scheme apparently related to the same hard problem, was proposed. In this paper, we show that the problem
H.: Resettable ZeroKnowledge in the Weak PublicKey Model
 In: Advances in Cryptology { Eurocrypt '03. Volume 2045 of Lecture
, 2003
"... Abstract. A new publickey model for resettable zeroknowledge (rZK) protocols, which is an extension and generalization of the upperbounded publickey (UPK) model introduced by Micali and Reyzin [EuroCrypt’01, pp. 373–393], is introduced and is named weak publickey (WPK) model. The motivations and ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. A new publickey model for resettable zeroknowledge (rZK) protocols, which is an extension and generalization of the upperbounded publickey (UPK) model introduced by Micali and Reyzin [EuroCrypt’01, pp. 373–393], is introduced and is named weak publickey (WPK) model. The motivations
Cryptanalysis of Ciphers and Protocols
"... The research thesis was done under the supervision of Prof. Eli Biham in the Faculty of Computer Science. It is my privilege to thank Eli Biham for his insightful support that made this work possible, and for bringing me up as a scientist and researcher. I especially acknowledge Eli for his respect ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The research thesis was done under the supervision of Prof. Eli Biham in the Faculty of Computer Science. It is my privilege to thank Eli Biham for his insightful support that made this work possible, and for bringing me up as a scientist and researcher. I especially acknowledge Eli for his respect
Cryptanalysis with COPACOBANA
 IEEE TRANSACTIONS ON COMPUTERS
, 2008
"... Cryptanalysis of ciphers usually involves massive computations. The security parameters of cryptographic algorithms are commonly chosen so that attacks are infeasible with available computing resources. Thus, in the absence of mathematical breakthroughs to a cryptanalytical problem, a promising way ..."
Abstract

Cited by 27 (8 self)
 Add to MetaCart
Cryptanalysis of ciphers usually involves massive computations. The security parameters of cryptographic algorithms are commonly chosen so that attacks are infeasible with available computing resources. Thus, in the absence of mathematical breakthroughs to a cryptanalytical problem, a promising way
Efficient Zeroknowledge Authentication Based on a Linear Algebra Problem MinRank
"... A Zeroknowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on factoring and discrete log, but still they are practical schemes based on NPhard problems. Among them, the problem SD o ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
A Zeroknowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on factoring and discrete log, but still they are practical schemes based on NPhard problems. Among them, the problem SD
Pseudo Trust: ZeroKnowledge Based Authentication in Anonymous PeertoPeer Protocols
"... Most of the current trust models in peertopeer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer’s identity. Hence, there exists an inherent tradeoff between trust and anonymity. To the best of our knowledge, there is current ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
way hash function. A novel authentication scheme based on ZeroKnowledge Proof is designed so peers can be authenticated without leaking any sensitive information. With the help of PT, most existing identitybased trust management schemes become applicable in mutual anonymous P2P systems. We analyze
Results 1  10
of
3,702