Sciweavers

150 search results - page 17 / 30
» Fair Secure Two-Party Computation
Sort
View
NOSSDAV
2009
Springer
14 years 2 months ago
Probabilistic event resolution with the pairwise random protocol
Peer-to-peer distributed virtual environments (DVE's) distribute state tracking and state transitions. Many DVE's - such as online games - require ways to fairly determi...
John L. Miller, Jon Crowcroft
AINA
2006
IEEE
14 years 1 months ago
Property-Based Taming of Lying Mobile Nodes
Intelligent security protocols can verify whether the involved principals have properties that are defined based on certain functional and security policies. The property we focu...
Mark Manulis, Ahmad-Reza Sadeghi
ESCIENCE
2006
IEEE
13 years 11 months ago
A Collaborative Virtual Computer Security Lab
The necessity of a lab course on computer security arises from the students' need to complement course work by hands-on experience. In order to meet the distance teaching dem...
Jörg Keller, Ralf Naues
CNIS
2006
13 years 9 months ago
Design of a virtual computer security lab
We present the design and a prototype of a lab course on computer security, the necessity of which arises from the students' need to complement course work by hands-on experi...
Jörg Keller, Ralf Naues
ICISC
2008
103views Cryptology» more  ICISC 2008»
13 years 9 months ago
Generalized Universal Circuits for Secure Evaluation of Private Functions with Application to Data Classification
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
Ahmad-Reza Sadeghi, Thomas Schneider 0003