92 search results - page 7 / 19 » Provable Secure Generalized Signcryption |
BPM
2003
Springer
15 years 2 months ago
2003
Springer
We present a general methodology for integrating arbitrary security requirements in the development of business processes in a both elegant and rigorous way. We show how trust rela...
97
Voted
CRYPTO
2010
Springer
14 years 10 months ago
2010
Springer
We prove beyond-birthday-bound security for most of the well-known types of generalized Feistel networks: (1) unbalanced Feistel networks, where the n-bit to m-bit round functions ...
PROVSEC
2009
Springer
15 years 4 months ago
2009
Springer
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...
EUROCRYPT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We present a formalism for the analysis of key-exchange protocols that combines previous definitional approaches and results in a definition of security that enjoys som...
67
Voted
INFORMATIKTAGE
2008
14 years 11 months ago
2008
: This thesis focuses on the practical aspects of general two-party Secure Function Evaluation (SFE). A new SFE protocol that allows free evaluation of XOR gates and is provably se...