Sciweavers

250 search results - page 12 / 50
» A Round and Communication Efficient Secure Ranking Protocol
Sort
View
JALC
2006
87views more  JALC 2006»
13 years 7 months ago
A Team Automaton Scenario for the Analysis of Security Properties of Communication Protocols
Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automa...
Maurice H. ter Beek, Gabriele Lenzini, Marinella P...
ASIACRYPT
2010
Springer
13 years 5 months ago
Optimistic Concurrent Zero Knowledge
We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is exp...
Alon Rosen, Abhi Shelat
GLOBECOM
2008
IEEE
13 years 8 months ago
An Efficient Group Key Management for Secure Routing in Ad Hoc Networks
This paper proposes and specifies a protocol for distributing and managing group keys in ad hoc environments, which applies for the Secure Optimized Link State Routing Protocol. Ou...
Natalia Castro Fernandes, Otto Carlos Muniz Bandei...
ACSAC
2003
IEEE
13 years 11 months ago
Scalable and Efficient PKI for Inter-Organizational Communication
We propose an efficient and flexible system for a secure and authentic data exchange in a multiinstitutional environment, where the institutions maintain different databases and p...
Arne Ansper, Ahto Buldas, Margus Freudenthal, Jan ...
SCN
2008
Springer
142views Communications» more  SCN 2008»
13 years 7 months ago
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
Yehuda Lindell, Benny Pinkas, Nigel P. Smart