Sciweavers

130 search results - page 26 / 26
» Idealizing Identity-Based Encryption
Sort
View
SPW
2004
Springer
13 years 10 months ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson
SASN
2003
ACM
13 years 10 months ago
Location-based pairwise key establishments for static sensor networks
Sensor networks are ideal candidates for applications such as target tracking and environment monitoring. Security in sensor networks is critical when there are potential adversar...
Donggang Liu, Peng Ning
PKC
2010
Springer
210views Cryptology» more  PKC 2010»
13 years 9 months ago
Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem
Abstract. In this paper, we fully break the Algebraic Surface Cryptosystem (ASC for short) proposed at PKC’2009 [3]. This system is based on an unusual problem in multivariate cr...
Jean-Charles Faugère, Pierre-Jean Spaenleha...
IJSN
2008
145views more  IJSN 2008»
13 years 5 months ago
Clique-based group key assignment in Wireless Sensor Networks
: Security has become the corner stone of research in wireless sensor networks (WSNs). Due to the unique operational environment of WSNs, where the communication medium is open to ...
Avinash Srinivasan, Feng Li, Jie Wu, Minglu Li
CSFW
2012
IEEE
11 years 7 months ago
Provably Secure and Practical Onion Routing
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
Michael Backes, Ian Goldberg, Aniket Kate, Esfandi...