Sciweavers

2237 search results - page 164 / 448
» On the Security of Random Sources
Sort
View
217
Voted
ASIACRYPT
2004
Springer
15 years 10 months ago
Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
Group signature schemes are cryptographic systems that provide revocable anonymity for signers. We propose a group signature scheme with constant-size public key and signature leng...
Lan Nguyen, Reihaneh Safavi-Naini
AAAI
2008
15 years 9 months ago
Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
WINET
2010
199views more  WINET 2010»
15 years 5 months ago
Secure encrypted-data aggregation for wireless sensor networks
This paper proposes a secure encrypted-data aggregation scheme for wireless sensor networks. Our design for data aggregation eliminates redundant sensor readings without using encr...
Shih-I Huang, Shiuhpyng Shieh, J. D. Tygar
178
Voted
ICIP
2006
IEEE
16 years 8 months ago
Provably Secure Steganography: Achieving Zero K-L Divergence using Statistical Restoration
In this paper, we present a framework for the design of steganographic schemes that can provide provable security by achieving zero Kullback-Leibler divergence between the cover a...
Kaushal Solanki, Kenneth Sullivan, Upamanyu Madhow...
SAC
2009
ACM
16 years 1 months ago
Prestige-based peer sampling service: interdisciplinary approach to secure gossip
The Peer Sampling Service (PSS) has been proposed as a method to initiate and maintain the set of connections between nodes in unstructured peer to peer (P2P) networks. The PSS us...
Gian Paolo Jesi, Edoardo Mollona, Srijith K. Nair,...