Sciweavers

526 search results - page 19 / 106
» A Z Based Approach to Verifying Security Protocols
Sort
View
ICALP
2010
Springer
13 years 9 months ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
SIGCOMM
1997
ACM
13 years 11 months ago
A Flow-Based Approach to Datagram Security
Datagram services provide a simple, exible, robust, and communication abstraction; their usefulness has been well demonstrated by the success of IP, UDP, and RPC. Yet, the overwh...
Suvo Mittra, Thomas Y. C. Woo
CCS
2007
ACM
14 years 1 months ago
Split-ballot voting: everlasting privacy with distributed trust
In this paper we propose a new voting protocol with desirable security properties. The voting stage of the protocol can be performed by humans without computers; it provides every...
Tal Moran, Moni Naor
ISSRE
2010
IEEE
13 years 6 months ago
Automata-Based Verification of Security Requirements of Composite Web Services
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
Hongyu Sun, Samik Basu, Vasant Honavar, Robyn R. L...
ICPADS
2007
IEEE
14 years 1 months ago
S/Kademlia: A practicable approach towards secure key-based routing
Security is a common problem in completely decentralized peer-to-peer systems. Although several suggestions exist on how to create a secure key-based routing protocol, a practicab...
Ingmar Baumgart, Sebastian Mies