Results 1  10
of
969,008
Anonymitypreserving PublicKey Encryption: A Constructive Approach
"... Abstract. A receiveranonymous channel allows a sender to send a message to a receiver without an adversary learning for whom the message is intended. Wireless broadcast channels naturally provide receiver anonymity, as does multicasting one message to a receiver population containing the intended ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
security properties have been proposed. We investigate constructions as well as limitations for preserving receiver anonymity when using publickey encryption (PKE). We use the constructive cryptography approach by Maurer and Renner and interpret cryptographic schemes as constructions of a certain ideal
Breaking and Fixing the NeedhamSchroeder PublicKey Protocol using FDR
, 1996
"... In this paper we analyse the well known NeedhamSchroeder PublicKey Protocol using FDR, a refinement checker for CSP. We use FDR to discover an attack upon the protocol, which allows an intruder to impersonate another agent. We adapt the protocol, and then use FDR to show that the new protocol is s ..."
Abstract

Cited by 716 (13 self)
 Add to MetaCart
In this paper we analyse the well known NeedhamSchroeder PublicKey Protocol using FDR, a refinement checker for CSP. We use FDR to discover an attack upon the protocol, which allows an intruder to impersonate another agent. We adapt the protocol, and then use FDR to show that the new protocol
A ForwardSecure PublicKey Encryption Scheme
, 2003
"... Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious and realistic concern. In an e#ort to mitigate the damage caused by exposure of secret data (e.g., keys) stored on such devices, the paradigm of forward security was int ..."
Abstract

Cited by 251 (14 self)
 Add to MetaCart
Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious and realistic concern. In an e#ort to mitigate the damage caused by exposure of secret data (e.g., keys) stored on such devices, the paradigm of forward security
AnonymityPreserving Data Collection \Lambda
"... ABSTRACT Protection of privacy has become an important problem in data mining. In particular, individuals have become increasingly unwilling to share their data, frequently resulting in individuals either refusing to share their data or providing incorrect data. In turn, such problems in data collec ..."
Abstract
 Add to MetaCart
in which data from a large number of respondents is collected anonymously, without the help of a trusted third party. That is, our solution allows the miner to collect the original data from each respondent, but in such a way that the miner cannot link a respondent's data to the respondent
IdentityBased Encryption from the Weil Pairing
, 2001
"... We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic ..."
Abstract

Cited by 1699 (29 self)
 Add to MetaCart
We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing
Fully homomorphic encryption using ideal lattices
 In Proc. STOC
, 2009
"... We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in three steps. First, we provide a general result – that, to construct an encryption scheme that permits evaluation of arbitra ..."
Abstract

Cited by 642 (17 self)
 Add to MetaCart
of arbitrary circuits, it suffices to construct an encryption scheme that can evaluate (slightly augmented versions of) its own decryption circuit; we call a scheme that can evaluate its (augmented) decryption circuit bootstrappable. Next, we describe a public key encryption scheme using ideal lattices
Receiverdeniable PublicKey Encryption
"... Incoercible (or deniable) encryption is an important notion that allows a user (a sender and/or a receiver) to escape a coercion attempted by a coercive adversary. Such an adversary approaches the coerced user after transmission forcing him to reveal all his random inputs used during encryption or d ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
step toward achieving incoercibility in public key encryption, since, a coercer cannot ask the user to reveal such unknown information. In this paper we present a scheme for receiverdeniable publickey encryption, by which, the receiver is able to lie about the decrypted message to a coercer and hence
The inductive approach to verifying cryptographic protocols
 Journal of Computer Security
, 1998
"... Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinitestate systems. Proofs are generated using Isabelle/HOL. The human effort required to analyze a protocol can be as ..."
Abstract

Cited by 476 (29 self)
 Add to MetaCart
spy knows some private keys and can forge messages using components decrypted from previous traffic. Three protocols are analyzed below: OtwayRees (which uses sharedkey encryption), NeedhamSchroeder (which uses publickey encryption), and a recursive protocol [9] (which is of variable length). One
Results 1  10
of
969,008