123 search results - page 8 / 25 » Composable Security in the Bounded-Quantum-Storage Model |
84
Voted
TCC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated th...
101
click to vote
IFIP
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
115
click to vote
SCN
2011
Springer
14 years 4 months ago
2011
Springer
Model checking cryptographic protocols have evolved to a valuable method for discovering counterintuitive security flaws, which make possible for a hostile agent to subvert the go...
RE
2010
Springer
14 years 4 months ago
2010
Springer
Secure software engineering is a new research area that has been proposed to address security issues during the development of software systems. This new area of research advocates...
TCC
2009
Springer
15 years 10 months ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...