Sciweavers

216 search results - page 20 / 44
» Models and Proofs of Protocol Security: A Progress Report
Sort
View
CCS
2006
ACM
13 years 11 months ago
Securing the drop-box architecture for assisted living
Home medical devices enable individuals to monitor some of their own health information without the need for visits by nurses or trips to medical facilities. This enables more con...
Michael J. May, Wook Shin, Carl A. Gunter, Insup L...
EUROCRYPT
2008
Springer
13 years 9 months ago
Efficient Two Party and Multi Party Computation Against Covert Adversaries
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
Vipul Goyal, Payman Mohassel, Adam Smith
FOSAD
2000
Springer
13 years 11 months ago
Security Goals: Packet Trajectories and Strand Spaces
This material was presented in a series of lectures at fosad, a summer school on Foundations of Security Analysis and Design, at the University of Bologna Center at Bertinoro in Se...
Joshua D. Guttman
IJNSEC
2006
110views more  IJNSEC 2006»
13 years 7 months ago
Password-based Encrypted Group Key Agreement
This paper presents an efficient password-based authenticated encrypted group key agreement protocol immune to dictionary attack under the computation Diffie-Hellman (CDH) assumpt...
Ratna Dutta, Rana Barua
CTRSA
2008
Springer
111views Cryptology» more  CTRSA 2008»
13 years 9 months ago
Efficient Fully-Simulatable Oblivious Transfer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
Andrew Y. Lindell