Sciweavers

719 search results - page 60 / 144
» Proving Security Protocols Correct
Sort
View
DEXAW
2009
IEEE
141views Database» more  DEXAW 2009»
14 years 11 months ago
Improving Practical Performance on Secure and Private Collaborative Linear Programming
Although information sharing in supply chain management dramatically reduces costs, parties are reluctant to do so, mainly due to fear of information leakage. Solutions based on se...
Rafael Deitos, Florian Kerschbaum
TPDS
2010
89views more  TPDS 2010»
14 years 8 months ago
Energy-Efficient Protocol for Deterministic and Probabilistic Coverage in Sensor Networks
—Various sensor types, e.g., temperature, humidity, and acoustic, sense physical phenomena in different ways, and thus, are expected to have different sensing models. Even for th...
Mohamed Hefeeda, Hossein Ahmadi
SRDS
2003
IEEE
15 years 3 months ago
Group Communication Protocols under Errors
Group communication protocols constitute a basic building block for highly dependable distributed applications. Designing and correctly implementing a group communication system (...
Claudio Basile, Long Wang, Zbigniew Kalbarczyk, Ra...
WECWIS
2005
IEEE
116views ECommerce» more  WECWIS 2005»
15 years 3 months ago
Security and Privacy Using One-Round Zero-Knowledge Proofs
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...
Sultan Almuhammadi, Clifford Neuman
ESORICS
2006
Springer
15 years 1 months ago
Conditional Reactive Simulatability
Abstract. Simulatability has established itself as a salient notion for defining and proving the security of cryptographic protocols since it entails strong security and compositio...
Michael Backes, Markus Dürmuth, Dennis Hofhei...