1769 search results - page 224 / 354 » Cryptography |
127
click to vote
TCC
2009
Springer
16 years 3 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...
108
click to vote
TCC
2009
Springer
16 years 3 months ago
2009
Springer
Various results show that oblivious transfer can be implemented using the assumption of noisy channels. Unfortunately, this assumption is not as weak as one might think, because i...
117
click to vote
TCC
2009
Springer
16 years 3 months ago
2009
Springer
We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple q...
107
click to vote
TCC
2009
Springer
16 years 3 months ago
2009
Springer
The known secret-sharing schemes for most access structures are not efficient; even for a one-bit secret the length of the shares in the schemes is 2O(n) , where n is the number of...
100
click to vote
PKC
2009
Springer
16 years 3 months ago
2009
Springer
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, netw...