Sciweavers

84 search results - page 10 / 17
» Verifying Security Protocols: An ASM Approach
Sort
View
115
Voted
WECWIS
2005
IEEE
116views ECommerce» more  WECWIS 2005»
15 years 9 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
160
Voted
EUROCRYPT
2000
Springer
15 years 7 months ago
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
Ronald Cramer, Ivan Damgård, Ueli M. Maurer
140
Voted
ICC
2009
IEEE
132views Communications» more  ICC 2009»
15 years 10 months ago
A Chaotic Maps-Based Key Agreement Protocol that Preserves User Anonymity
—A key agreement protocol is a protocol whereby two or more communicating parties can agree on a key or exchange information over an open communication network in such a way that...
Huei-Ru Tseng, Rong-Hong Jan, Wuu Yang
134
Voted
ESORICS
2009
Springer
16 years 4 months ago
Reliable Evidence: Auditability by Typing
Abstract. Many protocols rely on audit trails to allow an impartial judge to verify a posteriori some property of a protocol run. However, in current practice the choice of what da...
Nataliya Guts, Cédric Fournet, Francesco Za...
124
Voted
COMPSAC
2008
IEEE
15 years 10 months ago
A Probabilistic Attacker Model for Quantitative Verification of DoS Security Threats
This work introduces probabilistic model checking as a viable tool-assisted approach for systematically quantifying DoS security threats. The proposed analysis is based on a proba...
Stylianos Basagiannis, Panagiotis Katsaros, Andrew...