Sciweavers

237 search results - page 29 / 48
» On the Security Notions for Public-Key Encryption Schemes
Sort
View
ASIACRYPT
2007
Springer
14 years 1 months ago
Bounded CCA2-Secure Encryption
Abstract. Whereas encryption schemes withstanding passive chosenplaintext attacks (CPA) can be constructed based on a variety of computational assumptions, only a few assumptions a...
Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, ...
FOCS
2010
IEEE
13 years 5 months ago
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
Ran Canetti, Huijia Lin, Rafael Pass
IACR
2011
80views more  IACR 2011»
12 years 7 months ago
History-Free Sequential Aggregate Signatures
Aggregation schemes allow to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion o...
Marc Fischlin, Anja Lehmann, Dominique Schröd...
AAECC
2006
Springer
135views Algorithms» more  AAECC 2006»
14 years 1 months ago
Applying Fujisaki-Okamoto to Identity-Based Encryption
The Fujisaki-Okamoto (FO) conversion is widely known to be able to generically convert a weak public key encryption scheme, say one-way against chosen plaintext attacks (OW-CPA), t...
Peng Yang 0002, Takashi Kitagawa, Goichiro Hanaoka...
CNSR
2008
IEEE
214views Communications» more  CNSR 2008»
14 years 2 months ago
HGKM: A Group-Based Key Management Scheme for Sensor Networks Using Deployment Knowledge
Key establishment plays a central role in authentication and encryption in wireless sensor networks, especially when they are mainly deployed in hostile environments. Because of t...
Ngo Trong Canh, Young-Koo Lee, Sungyoung Lee