Sciweavers

154 search results - page 15 / 31
» Modeling and Analyzing Security in the Presence of Compromis...
Sort
View
JCS
2010
121views more  JCS 2010»
13 years 6 months ago
Computational soundness of symbolic zero-knowledge proofs
raction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significa...
Michael Backes, Dominique Unruh
TCC
2009
Springer
255views Cryptology» more  TCC 2009»
14 years 8 months ago
LEGO for Two-Party Secure Computation
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
Jesper Buus Nielsen, Claudio Orlandi
SP
2005
IEEE
156views Security Privacy» more  SP 2005»
14 years 1 months ago
Distributed Detection of Node Replication Attacks in Sensor Networks
The low-cost, off-the-shelf hardware components in unshielded sensor-network nodes leave them vulnerable to compromise. With little effort, an adversary may capture nodes, analyze...
Bryan Parno, Adrian Perrig, Virgil D. Gligor
ICC
2007
IEEE
14 years 1 months ago
A Novel k-Parent Flooding Tree for Secure and Reliable Broadcasting in Sensor Networks
Abstract— Securing broadcast communication over sensor networks is an important research challenge. In general, broadcast communication has two important metrics: security and re...
Avinash Srinivasan, Jie Wu
PODS
2005
ACM
119views Database» more  PODS 2005»
14 years 7 months ago
Security analysis of cryptographically controlled access to XML documents
Some promising recent schemes for XML access control employ encryption for implementing security policies on published data, avoiding data duplication. In this paper we study one ...
Bogdan Warinschi, Martín Abadi