Sciweavers

526 search results - page 30 / 106
» A Z Based Approach to Verifying Security Protocols
Sort
View
144
Voted
EUROCRYPT
2007
Springer
15 years 7 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas
138
Voted
JCS
2011
126views more  JCS 2011»
14 years 10 months ago
Authentication protocols based on low-bandwidth unspoofable channels: A comparative survey
One of the main challenges in pervasive computing is how we can establish secure communication over an untrusted high-bandwidth network without any initial knowledge or a Public K...
L. H. Nguyen, A. W. Roscoe
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
DIM
2008
ACM
15 years 5 months ago
Minimal information disclosure with efficiently verifiable credentials
Public-key based certificates provide a standard way to prove one's identity, as attested by some certificate authority (CA). However, plain certificates provide a binary ide...
David Bauer, Douglas M. Blough, David Cash
147
Voted
CCS
2001
ACM
15 years 8 months ago
A new approach to DNS security (DNSSEC)
The Domain Name System (DNS) is a distributed database that allows convenient storing and retrieving of resource records. DNS has been extended to provide security services (DNSSE...
Giuseppe Ateniese, Stefan Mangard