686 search results - page 57 / 138 » Secure Two-Party Computation Is Practical |
ICDCS
2007
IEEE
14 years 4 months ago
2007
IEEE
Security and reliability of network protocol implementations are essential for communication services. Most of the approaches for verifying security and reliability, such as forma...
EUROCRYPT
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Recently, methods from provable security, that had been developped for the last twenty years within the research community, have been extensively used to support emerging...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
TCC
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
GI
2003
Springer
14 years 3 months ago
2003
Springer
: The Byzantine failure model allows arbitrary behavior of a certain fraction of network nodes in a distributed system. It was introduced to model and analyze the effects of very s...