Sciweavers

469 search results - page 41 / 94
» On Adversary Models and Compositional Security
Sort
View
ACNS
2009
Springer
143views Cryptology» more  ACNS 2009»
14 years 2 months ago
A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks
Abstract. We examine the problem of message recognition by reviewing the definitions and the security model in the literature. In particular, we examine the Jane Doe protocol, whi...
Ian Goldberg, Atefeh Mashatan, Douglas R. Stinson
ICALP
2005
Springer
14 years 1 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
ESORICS
2009
Springer
14 years 8 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
COMPSAC
2006
IEEE
14 years 1 months ago
A Pattern-Based Technique for Developing UML Models of Access Control Systems
This paper describes a pattern-based technique for systematic development of UML models of secure systems using access control. Access control is viewed and specified as a design...
Dae-Kyoo Kim, Priya Gokhale
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...