Results 1 - 10 of 186

Fair Encryption of RSA Keys

by Guillaume Poupard, Jacques Stern - IN PROCEEDINGS OF EUROCRYPT 2000, VOLUME 1807 OF LNCS , 2000
"... Cryptography is more and more concerned with elaborate protocols involving many participants. In some cases, it is crucial to be sure that players behave fairly especially when they use public key encryption. Accordingly, mechanisms are needed to check the correctness of encrypted data, without comp ..."
Abstract - Cited by 21 (2 self) - Add to MetaCart
Cryptography is more and more concerned with elaborate protocols involving many participants. In some cases, it is crucial to be sure that players behave fairly especially when they use public key encryption. Accordingly, mechanisms are needed to check the correctness of encrypted data, without

Optimistic fair exchange of digital signatures

by N. Asokan, Victor Shoup, Michael Waidner - IEEE Journal on Selected Areas in Communications , 1998
"... Abstract. We present a new protocol that allows two players to ex-change digital signatures over the Internet in a fair way, so that either each player gets the other’s signature, or neither player does. The ob-vious application is where the signatures represent items of value, for example, an elect ..."
Abstract - Cited by 290 (10 self) - Add to MetaCart
Abstract. We present a new protocol that allows two players to ex-change digital signatures over the Internet in a fair way, so that either each player gets the other’s signature, or neither player does. The ob-vious application is where the signatures represent items of value, for example

A survey of peer-to-peer content distribution technologies

by Stephanos Androutsellis-theotokis, Diomidis Spinellis - ACM Computing Surveys , 2004
"... Distributed computer architectures labeled “peer-to-peer ” are designed for the sharing of computer resources (content, storage, CPU cycles) by direct exchange, rather than requiring the intermediation or support of a centralized server or authority. Peer-to-peer architectures are characterized by t ..."
Abstract - Cited by 378 (7 self) - Add to MetaCart
characteristics such as security, scalability, performance, fairness, and resource management potential, and examines the way in which these characteristics are reflected in—and affected by—the architectural design decisions adopted by current peer-to-peer systems. We study current peer-to-peer systems

A Fair Non-repudiation Protocol

by Jianying Zhou, Dieter Gollmann
"... A fair non-repudiation protocol should not give the sender of a message an advantage over the receiver, or vice versa. We will present a fair non-repudiation protocol that requires a Trusted Third Party but attempts to minimize its involvement in the execution of the protocol. We will draw particula ..."
Abstract - Cited by 175 (16 self) - Add to MetaCart
A fair non-repudiation protocol should not give the sender of a message an advantage over the receiver, or vice versa. We will present a fair non-repudiation protocol that requires a Trusted Third Party but attempts to minimize its involvement in the execution of the protocol. We will draw

Practical Verifiable Encryption and Decryption of Discrete Logarithms

by Jan Camenisch, Victor Shoup , 2003
"... This paper addresses the problem of designing practical protocols for proving properties about encrypted data. To this end, it presents a variant of the new public key encryption of Cramer and Shoup based on Paillier’s decision composite residuosity assumption, along with efficient protocols for ve ..."
Abstract - Cited by 169 (24 self) - Add to MetaCart
This paper addresses the problem of designing practical protocols for proving properties about encrypted data. To this end, it presents a variant of the new public key encryption of Cramer and Shoup based on Paillier’s decision composite residuosity assumption, along with efficient protocols

Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

by Ronald Cramer, Victor Shoup , 2001
"... We present several new and fairly practical public-key encryption schemes and prove them secure against adaptive chosen ciphertext attack. One scheme is based on Paillier's Decision Composite Residuosity (DCR) assumption [7], while another is based in the classical Quadratic Residuosity (QR) ..."
Abstract - Cited by 189 (7 self) - Add to MetaCart
We present several new and fairly practical public-key encryption schemes and prove them secure against adaptive chosen ciphertext attack. One scheme is based on Paillier's Decision Composite Residuosity (DCR) assumption [7], while another is based in the classical Quadratic Residuosity (QR

Fair Cryptosystems

by Fair Cryptosystems, Silvio Micali , 1993
"... There is a growing concern that the wide use of encryption may be more dangerous than helpful to society. In particular, good encryption schemes make court-authorized line-tapping, an effective tool for law enforcement, impossible. ..."
Abstract - Add to MetaCart
There is a growing concern that the wide use of encryption may be more dangerous than helpful to society. In particular, good encryption schemes make court-authorized line-tapping, an effective tool for law enforcement, impossible.

Fast implementation and fair comparison of the final candidates for Advanced Encryption Standard using Field Programmable Gate Arrays

by Kris Gaj, Pawel Chodowiec , 2001
"... . The results of fast implementations of all five AES final candidates using Virtex Xilinx Field Programmable Gate Arrays are presented and analyzed. Performance of several alternative hardware architectures is discussed and compared. One architecture optimum from the point of view of the throug ..."
Abstract - Cited by 50 (9 self) - Add to MetaCart
modes, four AES candidates have been implemented using a high-throughput architecture with pipelining inside and outside of cipher rounds, and achieved speeds ranging from 12.2 Gbit/s for Rijndael to 16.8 Gbit/s for Serpent. A new methodology for a fair comparison of the hardware performance

Verifiable encryption of digital signatures and applications

by Giuseppe Ateniese - ACM Trans. Inf. Syst. Secur , 2004
"... This paper presents a new simple schemes for verifiable encryption of digital signatures. We make use of a trusted third party (TTP) but in an optimistic sense, that is, the TTP takes part in the protocol only if one user cheats or simply crashes. Our schemes can be used as primitives to build effic ..."
Abstract - Cited by 17 (0 self) - Add to MetaCart
This paper presents a new simple schemes for verifiable encryption of digital signatures. We make use of a trusted third party (TTP) but in an optimistic sense, that is, the TTP takes part in the protocol only if one user cheats or simply crashes. Our schemes can be used as primitives to build

Mediated Traceable Anonymous Encryption

by Malika Izabachène, David Pointcheval, Damien Vergnaud - Progress in Cryptology - LATINCRYPT 2010, Springer LNCS 6212 , 2010
"... Abstract. The notion of key privacy for asymmetric encryption schemes was formally de ned by Bellare, Boldyreva, Desai and Pointcheval in 2001: it states that an eavesdropper in possession of a ciphertext is not able to tell which speci c key, out of a set of known public keys, is the one under whic ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. The notion of key privacy for asymmetric encryption schemes was formally de ned by Bellare, Boldyreva, Desai and Pointcheval in 2001: it states that an eavesdropper in possession of a ciphertext is not able to tell which speci c key, out of a set of known public keys, is the one under
Results 1 - 10 of 186