Sciweavers

341 search results - page 26 / 69
» Deniable Functional Encryption
Sort
View
IEICET
2008
119views more  IEICET 2008»
14 years 10 months ago
Universally Composable Identity-Based Encryption
Abstract-- The identity-based encryption (IBE) is one of the most important primitives in cryptography, and various security notions of IBE (e.g., IND-ID-CCA2, NM-ID-CCA2, IND-sID-...
Ryo Nishimaki, Yoshifumi Manabe, Tatsuaki Okamoto
CORR
2006
Springer
82views Education» more  CORR 2006»
14 years 10 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
SP
2000
IEEE
117views Security Privacy» more  SP 2000»
15 years 3 months ago
Practical Techniques for Searches on Encrypted Data
It is desirable to store data on data storage servers such as mail servers and file servers in encrypted form to reduce security and privacy risks. But this usually implies that ...
Dawn Xiaodong Song, David Wagner, Adrian Perrig
ACNS
2010
Springer
187views Cryptology» more  ACNS 2010»
15 years 2 months ago
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
Verifiably encrypted signature schemes (VES) allow a signer to encrypt his or her signature under the public key of a trusted third party, while maintaining public signature verifi...
Markus Rückert, Michael Schneider 0002, Domin...
ICIP
2009
IEEE
15 years 11 months ago
Secure Distortion Computation Among Untrusting Parties Using Homomorphic Encryption
Alice and Bob possess sequences xn and yn respectively and would like to compute d(xn , yn ) where d(., .) is a distortion measure. However, Alice and Bob do not trust each other ...