Sciweavers

177 search results - page 24 / 36
» Provably Secure Key Exchange: An Engineering Approach
Sort
View
CCS
2011
ACM
13 years 9 months ago
Information-flow types for homomorphic encryptions
We develop a flexible information-flow type system for a range of encryption primitives, precisely reflecting their diverse functional and security features. Our rules enable e...
Cédric Fournet, Jérémy Planul...
73
Voted
SIGOPSE
2004
ACM
15 years 3 months ago
Trust but verify: accountability for network services
This paper promotes accountability as a central design goal for dependable networked systems. We define three properties for accountable systems that extend beyond the basic secu...
Aydan R. Yumerefendi, Jeffrey S. Chase
CCS
2007
ACM
15 years 3 months ago
Detecting relay attacks with timing-based protocols
Distance bounding protocols have been proposed as means of detecting relay attacks, also known as mafia fraud. In this paper we present the first symmetric key based distance bou...
Jason Reid, Juan Manuel González Nieto, Tee...
ISI
2005
Springer
15 years 3 months ago
Private Mining of Association Rules
This paper introduces a new approach to a problem of data sharing among multiple parties, without disclosing the data between the parties. Our focus is data sharing among two parti...
Justin Z. Zhan, Stan Matwin, LiWu Chang
ISN
2000
Springer
127views Communications» more  ISN 2000»
15 years 1 months ago
Supporting Advanced Multimedia Telecommunications Services Using the Distributed Component Object Model
The demand for a great variety of sophisticated telecommunications services with multimedia characteristics is increasing. This trend highlights the need for the efficient creation...
Dionisis X. Adamopoulos, George Pavlou, Constantin...