1562 search results - page 177 / 313 » Mathematics, Cryptology, Security |
PKC
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
CHES
2009
Springer
14 years 3 months ago
2009
Springer
Power-based side channel attacks are a significant security risk, especially for embedded applications. To improve the security of such devices, protected logic styles have been p...
CRYPTO
2007
Springer
14 years 2 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Informally, a public-key steganography protocol allows two parties, who have never met or exchanged a secret, to send hidden messages over a public channel so that an adversary can...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...