Sciweavers

321 search results - page 31 / 65
» Secure Multiparty Computation of Approximations
Sort
View
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
14 years 7 months ago
On Complete Primitives for Fairness
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostr...
HICSS
2009
IEEE
126views Biometrics» more  HICSS 2009»
14 years 5 months ago
Computational Evaluation of Software Security Attributes
In the current state of practice, security properties of software systems are typically assessed through subjective, labor-intensive human evaluation. Moreover, much of the quanti...
Gwendolyn H. Walton, Thomas A. Longstaff, Richard ...
ISPEC
2010
Springer
14 years 3 months ago
On Fast and Approximate Attack Tree Computations
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
Aivo Jürgenson, Jan Willemson
SRDS
2010
IEEE
13 years 8 months ago
Protection of Identity Information in Cloud Computing without Trusted Third Party
Cloud computing allows the use of Internet-based services to support business processes and rental of IT-services on a utility-like basis. It offers a concentration of resources bu...
Rohit Ranchal, Bharat K. Bhargava, Lotfi Ben Othma...
CSFW
2007
IEEE
14 years 5 months ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini