Sciweavers

469 search results - page 9 / 94
» On Adversary Models and Compositional Security
Sort
View
TCC
2009
Springer
160views Cryptology» more  TCC 2009»
14 years 8 months ago
Simple, Black-Box Constructions of Adaptively Secure Protocols
We present a compiler for transforming an oblivious transfer (OT) protocol secure against an adaptive semi-honest adversary into one that is secure against an adaptive malicious ad...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...
QSIC
2007
IEEE
14 years 1 months ago
Model Checking Security Pattern Compositions
Security patterns capture best practice on secure software design and development. They document typical solutions to security problems. To ensure security, large software system ...
Jing Dong, Tu Peng, Yajing Zhao
ALT
2010
Springer
13 years 9 months ago
Optimal Online Prediction in Adversarial Environments
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
Peter L. Bartlett
SACRYPT
2004
Springer
14 years 29 days ago
On Proactive Secret Sharing Schemes
Abstract. This paper investigates the security of Proactive Secret Sharing Schemes. We start with revision of the mobile adversary model of Herzberg’s et al. imposing less restri...
Ventzislav Nikov, Svetla Nikova
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
13 years 11 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth