Sciweavers

123 search results - page 15 / 25
» Composable Security in the Bounded-Quantum-Storage Model
Sort
View
AAAI
2012
12 years 11 months ago
POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration Testing
Penetration Testing is a methodology for assessing network security, by generating and executing possible hacking attacks. Doing so automatically allows for regular and systematic...
Carlos Sarraute, Olivier Buffet, Jörg Hoffman...
78
Voted
AOSD
2010
ACM
15 years 2 months ago
A permission system for secure AOP
The integration of third-party aspects into applications creates security challenges. Due to the intrusive impact of aspects, one cannot guarantee that the dynamic composition of ...
Wouter De Borger, Bart De Win, Bert Lagaisse, Wout...
CRYPTO
2000
Springer
128views Cryptology» more  CRYPTO 2000»
15 years 1 months ago
The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search
We investigate the all-or-nothing encryption paradigm which was introduced by Rivest as a new mode of operation for block ciphers. The paradigm involves composing an all-or-nothing...
Anand Desai
61
Voted
IACR
2011
124views more  IACR 2011»
13 years 9 months ago
Generic Fully Simulatable Adaptive Oblivious Transfer
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, DCR, and LWE. To t...
Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong
88
Voted
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
15 years 3 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...