Sciweavers

5722 search results - page 284 / 1145
» Security Function Interactions
Sort
View
118
Voted
TCC
2007
Springer
116views Cryptology» more  TCC 2007»
15 years 9 months ago
Long-Term Security and Universal Composability
Abstract. Algorithmic progress and future technology threaten today’s cryptographic protocols. Long-term secure protocols should not even in future reveal more information to aâ€...
Jörn Müller-Quade, Dominique Unruh
FOCS
2003
IEEE
15 years 8 months ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
Rafael Pass, Alon Rosen
143
Voted
ERSHOV
2003
Springer
15 years 8 months ago
On the Possibility of Provably Secure Obfuscating Programs
By obfuscation we mean any efficient semantic-preserving transformation of computer programs aimed at bringing a program into such a form, which impedes the understanding of its al...
Nikolay P. Varnovsky, Vladimir A. Zakharov
130
Voted
DANCE
2002
IEEE
15 years 8 months ago
A Secure PLAN
— Active Networks, being programmable, promise greater flexibility than current networks. Programmability, however, may introduce safety and security risks. This paper describes...
Michael W. Hicks, Angelos D. Keromytis, Jonathan M...
DEXAW
2009
IEEE
129views Database» more  DEXAW 2009»
15 years 7 months ago
Towards a Generic Process for Security Pattern Integration
Abstract--Interdependencies between different security patterns can influence the properties of a particular pattern when applied in conjunction with other patterns. The resulting ...
Andreas Fuchs, Sigrid Gürgens, Carsten Rudolp...