Sciweavers

102 search results - page 16 / 21
» Perfectly Secure Multiparty Computation and the Computationa...
Sort
View
CISC
2009
Springer
199views Cryptology» more  CISC 2009»
14 years 7 months ago
Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing
Abstract. Certificateless cryptography introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystems. Even though building practic...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
ASIACRYPT
2010
Springer
14 years 7 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
97
Voted
ICCV
2009
IEEE
16 years 2 months ago
Efficient Privacy Preserving Video Surveillance
Widespread use of surveillance cameras in offices and other business establishments, pose a significant threat to the privacy of the employees and visitors. The challenge of int...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
SOUPS
2009
ACM
15 years 4 months ago
Games for extracting randomness
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...
Ran Halprin, Moni Naor
JSAC
2006
127views more  JSAC 2006»
14 years 9 months ago
Location-based compromise-tolerant security mechanisms for wireless sensor networks
Abstract-- Node compromise is a serious threat to wireless sensor networks deployed in unattended and hostile environments. To mitigate the impact of compromised nodes, we propose ...
Yanchao Zhang, Wei Liu, Wenjing Lou, Yuguang Fang