15 search results - page 3 / 3 » Card-Based Cryptographic Protocols Using a Minimal Number of... |
CCS
2008
ACM
13 years 7 months ago
2008
ACM
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
Secure wireless communications is a challenging problem due to the shared nature of the wireless medium. Most existing security protocols apply cryptographic techniques for bit sc...
GD
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. As the number of devices connected to the internet continues to grow rapidly and software systems are being increasingly deployed on the web, security and privacy have be...