Sciweavers

102 search results - page 19 / 21
» Perfectly Secure Multiparty Computation and the Computationa...
Sort
View
PKC
2009
Springer
166views Cryptology» more  PKC 2009»
14 years 6 months ago
Security of Blind Signatures under Aborts
We explore the security of blind signatures under aborts where the user or the signer may stop the interactive signature issue protocol prematurely. Several works on blind signatur...
Dominique Schröder, Marc Fischlin
CF
2007
ACM
13 years 10 months ago
Accelerating memory decryption and authentication with frequent value prediction
This paper presents a novel architectural technique to hide fetch latency overhead of hardware encrypted and authenticated memory. A number of recent secure processor designs have...
Weidong Shi, Hsien-Hsin S. Lee
GI
2004
Springer
13 years 11 months ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
ICDCSW
2005
IEEE
13 years 12 months ago
Defending against Sybil Attacks in Sensor Networks
Sybil attack is a harmful threat to sensor networks, in which a malicious node illegally forges an unbounded number of identities to defeat redundancy mechanisms. Digital certifi...
Qinghua Zhang, Pan Wang, Douglas S. Reeves, Peng N...
FOCS
2002
IEEE
13 years 11 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer