123 search results - page 2 / 25 » Composable Security in the Bounded-Quantum-Storage Model |
IACR
2011
12 years 6 months ago
2011
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
CRYPTO
2012
Springer
11 years 8 months ago
2012
Springer
Abstract. We present the first black-box construction of a secure multiparty computation protocol that satisfies a meaningful notion of concurrent security in the plain model (wi...
FOCS
2010
IEEE
13 years 4 months ago
2010
IEEE
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
ACNS
2004
Springer
13 years 10 months ago
2004
Springer
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...
ACSAC
2002
IEEE
13 years 11 months ago
2002
IEEE
Security analysis should take advantage of a reliable knowledge base that contains semantically-rich information about a protected network. This knowledge is provided by network m...