610 search results - page 38 / 122 » Information-theoretically secure protocols and security unde... |
CCS
2009
ACM
16 years 13 days ago
2009
ACM
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
TCC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Cryptographic protocols are often designed and analyzed under some trusted set-up assumptions, namely in settings where the participants have access to global information...
STOC
2004
ACM
16 years 3 days ago
2004
ACM
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
101
click to vote
CRYPTO
2004
Springer
15 years 5 months ago
2004
Springer
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
129
click to vote
ENTCS
2007
14 years 11 months ago
2007
Designing secure protocols over ad-hoc networks has proved to be a very challenging task, due to various features of such networks, such as partial connectivity, node mobility, an...