Sciweavers

1612 search results - page 101 / 323
» About models of security protocols
Sort
View
FLAIRS
2000
15 years 5 months ago
The Use of Formal Methods for Trusted Digital Signature Devices
This paper presents a formal security policy model for SmartCards with digital signature application. This kind of model is necessary for each evaluation according to Information ...
Bruno Langenstein, Roland Vogt, Markus Ullmann
PROVSEC
2009
Springer
15 years 10 months ago
GUC-Secure Set-Intersection Computation
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...
Yuan Tian, Hao Zhang
CTRSA
2005
Springer
72views Cryptology» more  CTRSA 2005»
15 years 9 months ago
Proofs for Two-Server Password Authentication
Traditional password-based authentication and key-exchange protocols suffer from the simple fact that a single server stores the sensitive user password. In practice, when such a ...
Michael Szydlo, Burton S. Kaliski Jr.
FSTTCS
2003
Springer
15 years 9 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
15 years 10 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...