Results 1  10
of
2,866
Fuzzy identitybased encryption
 In EUROCRYPT
, 2005
"... We introduce a new type of IdentityBased Encryption (IBE) scheme that we call Fuzzy IdentityBased Encryption. In Fuzzy IBE we view an identity as set of descriptive attributes. A Fuzzy IBE scheme allows for a private key for an identity, ω, to decrypt a ciphertext encrypted with an identity, ω ′ , ..."
Abstract

Cited by 377 (20 self)
 Add to MetaCart
Based Encryption of a message under several attributes that compose a (fuzzy) identity. Our IBE schemes are both errortolerant and secure against collusion attacks. Additionally, our basic construction does not use random oracles. We prove the security of our schemes under the SelectiveID security model. 1
Hierarchical IDBased Cryptography
, 2002
"... We present hierarchical identitybased encryption schemes and signature schemes that have total collusion resistance on an arbitrary number of levels and that have chosen ciphertext security in the random oracle model assuming the difficulty of the Bilinear DiffieHellman problem. ..."
Abstract

Cited by 257 (3 self)
 Add to MetaCart
We present hierarchical identitybased encryption schemes and signature schemes that have total collusion resistance on an arbitrary number of levels and that have chosen ciphertext security in the random oracle model assuming the difficulty of the Bilinear DiffieHellman problem.
Distributing Identity
, 1999
"... This paper considers distributed protocols for assigning IDs. ..."
Abstract

Cited by 209 (0 self)
 Add to MetaCart
This paper considers distributed protocols for assigning IDs.
Efficient SelectiveID Secure IdentityBased Encryption Without Random Oracles
 6. , SECURE IDENTITY BASED ENCRYPTION WITHOUT RANDOM ORACLES., IN FRANKLIN [20
"... We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model. Selective identity secure IBE is a slightly weaker security model than the standard security model for IBE. In this model the adversary must commit ahead of time t ..."
Abstract

Cited by 221 (8 self)
 Add to MetaCart
We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model. Selective identity secure IBE is a slightly weaker security model than the standard security model for IBE. In this model the adversary must commit ahead of time
The Universal Protein Resource (UniProt): an expanding universe of protein information
 Nucleic Acids Res
, 2006
"... The Universal Protein Resource (UniProt) provides a central resource on protein sequences and functional annotation with three database components, each addressing a key need in protein bioinformatics. The UniProt Knowledgebase (UniProtKB), comprising the manually annotated UniProtKB/SwissProt sec ..."
Abstract

Cited by 302 (20 self)
 Add to MetaCart
Prot Reference Clusters (UniRef) speed similarity searches via sequence space compression by merging sequences that are 100 % (UniRef100), 90% (UniRef90) or 50 % (UniRef50) identical. Finally, the UniProt Archive (UniParc) stores all publicly available protein sequences, containing the history of sequence data
The Social Cost of Cheap Pseudonyms
 Journal of Economics and Management Strategy
, 2000
"... We consider the problems of societal norms for cooperation and reputation when it is possible to obtain "cheap pseudonyms", something which is becoming quite common in a wide variety of interactions on the Internet. This introduces opportunities to misbehave without paying reputational con ..."
Abstract

Cited by 273 (10 self)
 Add to MetaCart
We consider the problems of societal norms for cooperation and reputation when it is possible to obtain "cheap pseudonyms", something which is becoming quite common in a wide variety of interactions on the Internet. This introduces opportunities to misbehave without paying reputational
The Daugavet equation for operators not fixing a copy of C[0, 1
 J. Operator Theory
, 1998
"... Abstract. We prove the norm identity ‖Id+T ‖ = 1+‖T‖, which is known as the Daugavet equation, for operators T on C(S) not fixing a copy of C[0, 1], where S is a compact Hausdorff space without isolated points. ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract. We prove the norm identity ‖Id+T ‖ = 1+‖T‖, which is known as the Daugavet equation, for operators T on C(S) not fixing a copy of C[0, 1], where S is a compact Hausdorff space without isolated points.
The Daugavet equation for operators not fixing a copy of C(S)
, 1996
"... Abstract. We prove the norm identity ‖Id + T ‖ = 1 + ‖T ‖, which is known as the Daugavet equation, for operators T on C(S) not fixing a copy of C(S), where S is a compact metric space without isolated points. 1. ..."
Abstract
 Add to MetaCart
Abstract. We prove the norm identity ‖Id + T ‖ = 1 + ‖T ‖, which is known as the Daugavet equation, for operators T on C(S) not fixing a copy of C(S), where S is a compact metric space without isolated points. 1.
Lassotype recovery of sparse representations for highdimensional data
 ANNALS OF STATISTICS
, 2009
"... The Lasso is an attractive technique for regularization and variable selection for highdimensional data, where the number of predictor variables pn is potentially much larger than the number of samples n. However, it was recently discovered that the sparsity pattern of the Lasso estimator can only ..."
Abstract

Cited by 250 (14 self)
 Add to MetaCart
be asymptotically identical to the true sparsity pattern if the design matrix satisfies the socalled irrepresentable condition. The latter condition can easily be violated in the presence of highly correlated variables. Here we examine the behavior of the Lasso estimators if the irrepresentable condition
Certificateless Public Key Cryptography
 ASIACRYPT'03
, 2003
"... This paper introduces the concept of certificateless public key cryptography (CLPKC). In contrast to traditional public key cryptographic systems, CLPKC does not require the use of certificates to guarantee the authenticity of public keys. It does rely on the use of a trusted third party (TTP) who ..."
Abstract

Cited by 240 (4 self)
 Add to MetaCart
) who is in possession of a master key. In these respects, CLPKC is similar to identitybased public key cryptography (IDPKC). On the other hand, CLPKC does not suffer from the key escrow property that seems to be inherent in IDPKC. Thus CLPKC can be seen as a model for the use of public key
Results 1  10
of
2,866