Sciweavers

2601 search results - page 136 / 521
» Secure Rewarding Schemes
Sort
View
PKC
2009
Springer
166views Cryptology» more  PKC 2009»
16 years 3 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
PERCOM
2007
ACM
16 years 2 months ago
Securing distributed data storage and retrieval in sensor networks
Sensor networks have been an attractive platform for pervasive computing and communication. Due to the lack of physical protection, however, sensor networks are vulnerable to atta...
Nalin Subramanian, Chanjun Yang, Wensheng Zhang
111
Voted
TRUST
2010
Springer
15 years 8 months ago
Robust Combiners for Software Hardening
All practical software hardening schemes, as well as practical encryption schemes, e.g., AES, were not proven to be secure. One technique to enhance security is robust combiners. A...
Amir Herzberg, Haya Shulman
CCS
2006
ACM
15 years 7 months ago
Multi-signatures in the plain public-Key model and a general forking lemma
A multi-signature scheme enables a group of signers to produce a compact, joint signature on a common document, and has many potential uses. However, existing schemes impose key s...
Mihir Bellare, Gregory Neven
ASIACRYPT
1999
Springer
15 years 7 months ago
Doing More with Fewer Bits
We present a variant of the Diffie-Hellman scheme in which the number of bits exchanged is one third of what is used in the classical Diffie-Hellman scheme, while the offered secu...
Andries E. Brouwer, Ruud Pellikaan, Eric R. Verheu...