Results 1  10
of
8,015
Secret Key Agreement by Public Discussion From Common Information
 IEEE Transactions on Information Theory
, 1993
"... . The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y , respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution PX ..."
Abstract

Cited by 434 (18 self)
 Add to MetaCart
. The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y , respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution
Differential Fault Analysis of Secret Key Cryptosystems
, 1997
"... In September 1996 Boneh, Demillo, and Lipton from Bellcore announced a new type of cryptanalytic attack which exploits computational errors to find cryptographic keys. Their attack is based on algebraic properties of modular arithmetic, and thus it is applicable only to public key cryptosystems suc ..."
Abstract

Cited by 315 (3 self)
 Add to MetaCart
such as RSA, and not to secret key algorithms such as the Data Encryption Standard (DES). In this paper, we describe a related attack, which we call Differential Fault Analysis, or DFA, and show that it is applicable to almost any secret key cryptosystem proposed so far in the open literature. Our DFA attack
SecretKey Reconciliation by Public Discussion
, 1994
"... . Assuming that Alice and Bob use a secret noisy channel (modelled by a binary symmetric channel) to send a key, reconciliation is the process of correcting errors between Alice's and Bob's version of the key. This is done by public discussion, which leaks some information about the secret ..."
Abstract

Cited by 157 (3 self)
 Add to MetaCart
. Assuming that Alice and Bob use a secret noisy channel (modelled by a binary symmetric channel) to send a key, reconciliation is the process of correcting errors between Alice's and Bob's version of the key. This is done by public discussion, which leaks some information about
SecretKey Certificates
, 1995
"... The notion of secretkey certificate schemes is introduced and formalized. As with publickey certificates, triples consisting of a secret key, a corresponding public key, and a secretkey certificate on the public key can only be retrieved by engaging in an issuing protocol with the issuer. The d ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The notion of secretkey certificate schemes is introduced and formalized. As with publickey certificates, triples consisting of a secret key, a corresponding public key, and a secretkey certificate on the public key can only be retrieved by engaging in an issuing protocol with the issuer
SecretKey Certificates (Continued)
, 1995
"... A new construction is described for designing secretkey certificate schemes based on signature schemes other than of the FiatShamir type. Also described are practical secretkey certificate issuing protocols that enable the Certification Authority to certify public keys, without being able to co ..."
Abstract
 Add to MetaCart
A new construction is described for designing secretkey certificate schemes based on signature schemes other than of the FiatShamir type. Also described are practical secretkey certificate issuing protocols that enable the Certification Authority to certify public keys, without being able
Unshared Secret Key Cryptography
"... Abstract—Current security techniques can be implemented with either secret key exchange or physicallayer wiretap codes. In this paper, we investigate an alternative solution for MIMO wiretap channels. Inspired by the artificial noise (AN) technique, we propose the unshared secret key (USK) cryptosy ..."
Abstract
 Add to MetaCart
Abstract—Current security techniques can be implemented with either secret key exchange or physicallayer wiretap codes. In this paper, we investigate an alternative solution for MIMO wiretap channels. Inspired by the artificial noise (AN) technique, we propose the unshared secret key (USK
Eulerian secret key exchange
 Proc. COCOON '98, Lecture Notes in Compom  Science,Spnce,v8 vol.1449,p.1449,v9F
, 1998
"... Abstract. Designing a protocol to exchange a secret key is one of the most fundamental subjects in cryptography. Using a random deal of cards, pairs of card players (agents) can share informationtheoretically secure keys that are secret from an eavesdropper. In this paper we first introduce the no ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. Designing a protocol to exchange a secret key is one of the most fundamental subjects in cryptography. Using a random deal of cards, pairs of card players (agents) can share informationtheoretically secure keys that are secret from an eavesdropper. In this paper we first introduce
Protecting Secret Keys with Personal Entropy
 Future Generation Computer Systems
, 1999
"... Conventional encryption technology often requires users to protect a secret key by selecting a password or passphrase. While a good passphrase will only be known to the user, it also has the flaw that it must be remembered exactly in order to recover the secret key. As time passes, the ability to re ..."
Abstract

Cited by 40 (0 self)
 Add to MetaCart
Conventional encryption technology often requires users to protect a secret key by selecting a password or passphrase. While a good passphrase will only be known to the user, it also has the flaw that it must be remembered exactly in order to recover the secret key. As time passes, the ability
IDbased SecretKey Cryptography
 ACM SIGOPS Operating Systems Review
, 1998
"... This paper introduces IDbased secretkey cryptography, in which secret keys are privately and uniquely binded to an identity. This enables to extend publickey cryptography features at the high throughput rate of secretkey cryptography. As applications, e#cient login protocols, an enhanced ver ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper introduces IDbased secretkey cryptography, in which secret keys are privately and uniquely binded to an identity. This enables to extend publickey cryptography features at the high throughput rate of secretkey cryptography. As applications, e#cient login protocols, an enhanced
How to leak a secret
 PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON THE THEORY AND APPLICATION OF CRYPTOLOGY AND INFORMATION SECURITY: ADVANCES IN CRYPTOLOGY
, 2001
"... In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signature. Unlike group signatures, ring signatures have no group managers, no setup procedures, no revocation procedures, and ..."
Abstract

Cited by 2580 (4 self)
 Add to MetaCart
, and no coordination: any user can choose any set of possible signers that includes himself, and sign any message by using his secret key and the others ’ public keys, without getting their approval or assistance. Ring signatures provide an elegant way to leak authoritative secrets in an anonymous way, to sign casual
Results 1  10
of
8,015