Sciweavers

2601 search results - page 88 / 521
» Secure Rewarding Schemes
Sort
View
ICICS
2004
Springer
15 years 8 months ago
Factorization-Based Fail-Stop Signatures Revisited
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even i...
Katja Schmidt-Samoa
CJ
2006
123views more  CJ 2006»
15 years 3 months ago
Unconditionally Secure Anonymous Encryption and Group Authentication
Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic prim...
Goichiro Hanaoka, Junji Shikata, Yumiko Hanaoka, H...
ICDCSW
2005
IEEE
15 years 8 months ago
Increasing Attack Resiliency of Wireless Ad Hoc and Sensor Networks
An ad hoc or sensor network that is employed for security sensitive applications is expected to tolerate a certain quantity of maliciously behaving nodes. Algorithms must be desig...
Harald Vogt
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 10 months ago
Fully Simulatable Quantum-Secure Coin-Flipping and Applications
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...
Carolin Lunemann, Jesper Buus Nielsen
CCS
2010
ACM
15 years 9 months ago
Secure provenance: the essential of bread and butter of data forensics in cloud computing
Secure provenance that records ownership and process history of data objects is vital to the success of data forensics in cloud computing, yet it is still a challenging issue toda...
Rongxing Lu, Xiaodong Lin, Xiaohui Liang, Xuemin (...