Sciweavers

554 search results - page 66 / 111
» Verifying Security Protocols Modelled by Networks of Automat...
Sort
View
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
14 years 8 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
EUROCRYPT
1998
Springer
13 years 12 months ago
Securing Threshold Cryptosystems against Chosen Ciphertext Attack
For the most compelling applications of threshold cryptosystems, security against chosen ciphertext attack is a requirement. However, prior to the results presented here, there ap...
Victor Shoup, Rosario Gennaro
WINET
2008
81views more  WINET 2008»
13 years 7 months ago
Interference power statistics in ad-hoc and sensor networks
Abstract There exist accurate calculation methods for estimation of interference power sum statistics in fixedtopology wireless networks based on the log-normal shadowing radio mod...
Ramin Hekmat, Piet Van Mieghem
CCS
2008
ACM
13 years 9 months ago
Flexible security configuration for virtual machines
Virtual machines are widely accepted as a promising basis for building secure systems. However, while virtual machines offer effective mechanisms to create isolated environments, ...
Sandra Rueda, Yogesh Sreenivasan, Trent Jaeger
CIKM
2009
Springer
14 years 2 months ago
A framework for safely publishing communication traces
A communication trace is a detailed record of the communication between two entities. Communication traces are vital for research in computer networks and protocols in many domain...
Abhinav Parate, Gerome Miklau