610 search results - page 5 / 122 » Information-theoretically secure protocols and security unde... |
101
Voted
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
CCS
2003
ACM
15 years 2 months ago
2003
ACM
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...
CCS
2001
ACM
15 years 1 months ago
2001
ACM
The events of a security protocol and their causal dependency can play an important role in the analysis of security properties. This insight underlies both strand spaces and the ...
EUROCRYPT
2006
Springer
15 years 1 months ago
2006
Springer
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...
75
Voted
CRYPTO
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...