Sciweavers

2601 search results - page 23 / 521
» Secure Rewarding Schemes
Sort
View
CCS
2006
ACM
15 years 3 months ago
Provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Fe...
ASIACRYPT
2000
Springer
15 years 4 months ago
Provably Secure Metering Scheme
Abstract. Naor and Pinkas introduced metering schemes at Eurocrypt ’98 in order to decide on advertisement fees for web servers. In the schemes, any server should be able to cons...
Wakaha Ogata, Kaoru Kurosawa
EUROCRYPT
2010
Springer
15 years 4 months ago
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck W...
ACSAC
1997
IEEE
15 years 3 months ago
An Efficient Message Authentication Scheme for Link State Routing
We study methods for reducing the cost of secure link state routing. In secure link state routing, routers may need to verify the authenticity of many routing updates, and some ro...
S. Cheung
DCC
2003
IEEE
15 years 11 months ago
On the Security of Digital Signature Schemes Based on Error-Correcting Codes
In this paper we discuss the security of digital signature schemes based on error? correcting codes. Several attacks to the Xinmei scheme are surveyed, and some reasons given to e...
Sheng-Bo Xu, Jeroen Doumen, Henk C. A. van Tilborg