Sciweavers

122 search results - page 24 / 25
» Practical Threshold Signatures Without Random Oracles
Sort
View
CCS
2005
ACM
14 years 1 months ago
Direct chosen ciphertext security from identity-based techniques
We describe a new encryption technique that is secure in the standard model against adaptive chosen ciphertext (CCA2) attacks. We base our method on two very efficient Identity-Ba...
Xavier Boyen, Qixiang Mei, Brent Waters
SASN
2003
ACM
14 years 21 days ago
Admission control in Peer-to-Peer: design and performance evaluation
Peer-to-Peer (P2P) applications and services are very common in today’s computing. The popularity of the P2P paradigm prompts the need for specialized security services which ma...
Nitesh Saxena, Gene Tsudik, Jeong Hyun Yi
IJISEC
2008
69views more  IJISEC 2008»
13 years 7 months ago
A survey of certificateless encryption schemes and security models
Abstract This paper surveys the literature on certificateless encryption schemes. In particular, we examine the large number of security models that have been proposed to prove the...
Alexander W. Dent
SCN
2010
Springer
232views Communications» more  SCN 2010»
13 years 5 months ago
Authenticated Key Agreement with Key Re-use in the Short Authenticated Strings Model
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
Stanislaw Jarecki, Nitesh Saxena
TON
2010
136views more  TON 2010»
13 years 2 months ago
Distributed Opportunistic Scheduling With Two-Level Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...