Sciweavers

21 search results - page 3 / 5
» Evaluating Security of Voting Schemes in the Universal Compo...
Sort
View
FOCS
2010
IEEE
13 years 3 months ago
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
Ran Canetti, Huijia Lin, Rafael Pass
CRYPTO
2010
Springer
167views Cryptology» more  CRYPTO 2010»
13 years 6 months ago
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
Ivan Damgård, Claudio Orlandi
ECEASST
2010
13 years 1 days ago
Security Evaluation and Hardening of Free and Open Source Software (FOSS)
Abstract: Recently, Free and Open Source Software (FOSS) has emerged as an alternative to Commercial-Off-The-Shelf (COTS) software. Now, FOSS is perceived as a viable long-term sol...
Robert Charpentier, Mourad Debbabi, Dima Alhadidi,...
CRYPTO
2005
Springer
137views Cryptology» more  CRYPTO 2005»
13 years 10 months ago
A Formal Treatment of Onion Routing
Anonymous channels are necessary for a multitude of privacy-protecting protocols. Onion routing is probably the best known way to achieve anonymity in practice. However, the crypto...
Jan Camenisch, Anna Lysyanskaya
ACNS
2009
Springer
123views Cryptology» more  ACNS 2009»
13 years 11 months ago
Practical Secure Evaluation of Semi-private Functions
Abstract. Two-party Secure Function Evaluation (SFE) is a very useful cryptographic tool which allows two parties to evaluate a function known to both parties on their private (sec...
Annika Paus, Ahmad-Reza Sadeghi, Thomas Schneider