Sciweavers

131
Voted
CSFW
2010
IEEE
15 years 8 months ago
Analysing Unlinkability and Anonymity Using the Applied Pi Calculus
—An attacker that can identify messages as coming from the same source, can use this information to build up a picture of targets’ behaviour, and so, threaten their privacy. In...
Myrto Arapinis, Tom Chothia, Eike Ritter, Mark Rya...
CSFW
2010
IEEE
15 years 8 months ago
Dynamic vs. Static Flow-Sensitive Security Analysis
—This paper seeks to answer fundamental questions about trade-offs between static and dynamic security analysis. It has been previously shown that flow-sensitive static informat...
Alejandro Russo, Andrei Sabelfeld
CSFW
2010
IEEE
15 years 8 months ago
Vulnerability Bounds and Leakage Resilience of Blinded Cryptography under Timing Attacks
—We establish formal bounds for the number of min-entropy bits that can be extracted in a timing attack against a cryptosystem that is protected by blinding, the state-of-the art...
Boris Köpf, Geoffrey Smith
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...
COORDINATION
2010
Springer
15 years 8 months ago
Coordinating Resource Usage through Adaptive Service Provisioning in Wireless Sensor Networks
Abstract. Wireless sensor networks (WSNs) exhibit high levels of network dynamics and consist of devices with limited energy. This results in the need to coordinate applications no...
Chien-Liang Fok, Gruia-Catalin Roman, Chenyang Lu