Sciweavers

2601 search results - page 335 / 521
» Secure Rewarding Schemes
Sort
View
CSFW
2010
IEEE
15 years 8 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
CCS
2008
ACM
15 years 6 months ago
Robust, anonymous RFID authentication with constant key-lookup
A considerable number of anonymous RFID authentication schemes have been proposed. However, current proposals either do not provide robust security guarantees, or suffer from scal...
Mike Burmester, Breno de Medeiros, Rossana Motta
ESORICS
2008
Springer
15 years 6 months ago
Sharemind: A Framework for Fast Privacy-Preserving Computations
Gathering and processing sensitive data is a difficult task. In fact, there is no common recipe for building the necessary information systems. In this paper, we present a provably...
Dan Bogdanov, Sven Laur, Jan Willemson
SECRYPT
2007
121views Business» more  SECRYPT 2007»
15 years 5 months ago
Using Steganography to Improve Hash Functions' Collision Resistance
Lately, hash function security has received increased attention. Especially after the recent attacks that were presented for SHA-1 and MD5, the need for a new and more robust hash...
Emmanouel Kellinis, Konstantinos Papapanagiotou
CN
2006
115views more  CN 2006»
15 years 4 months ago
MuSeQoR: Multi-path failure-tolerant security-aware QoS routing in Ad hoc wireless networks
In this paper, we present MuSeQoR: a new multi-path routing protocol that tackles the twin issues of reliability (protection against failures of multiple paths) and security, whil...
Tamma Bheemarjuna Reddy, S. Sriram, B. S. Manoj, C...