Sciweavers

460 search results - page 6 / 92
» Heuristic Methods for Security Protocols
Sort
View
JCIT
2010
158views more  JCIT 2010»
13 years 2 months ago
Improvement of a Secure Convex Hull Two-Party Computation Protocol
In 2008, Wang et. al. first investigate a sort of specific secure multi-party computation--secure convex hull two-party computation, and construct two protocols based on Gift wrap...
Wenjie Zhao, Mingxing He
ICIW
2007
IEEE
13 years 7 months ago
Analysis of Web Services Secure Conversation with Formal Methods
Web Services Secure Conversation extends Web Services Trust to provide mechanisms for establishing security consecurity context is an abstract concept that refers an authenticated...
M. Llanos Tobarra, Diego Cazorla, Fernando Cuarter...
WPES
2003
ACM
14 years 26 days ago
Leveraging the "Multi" in secure multi-party computation
Secure Multi-Party Computation enables parties with private data to collaboratively compute a global function of their private data, without revealing that data. The increase in s...
Jaideep Vaidya, Chris Clifton
COMCOM
2000
97views more  COMCOM 2000»
13 years 7 months ago
Verification of security protocols using LOTOS-method and application
We explain how the formal language LOTOS can be used to specify security protocols and cryptographic operations. We describe how security properties can be modelled as safety prop...
Guy Leduc, François Germeau
CSFW
1999
IEEE
13 years 12 months ago
Mixed Strand Spaces
Strand space analysis [13, 12] is a method for stating and proving correctness properties for cryptographic protocols. In this paper we apply the same method to the related proble...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...