Sciweavers

6251 search results - page 382 / 1251
» Randomness, Computability, and Density
Sort
View
ASIACRYPT
2005
Springer
16 years 9 days ago
Revealing Additional Information in Two-Party Computations
Abstract. A two-argument function is computed privately by two parties if after the computation, no party should know anything about the other inputs except for what he is able to ...
Andreas Jakoby, Maciej Liskiewicz
ASIACRYPT
2005
Springer
16 years 9 days ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
CCGRID
2003
IEEE
16 years 2 days ago
Supporting Peer-to-Peer Computing with FlexiNet
Formation of suitable overlay-network topologies that are able to reflect the structure of the underlying network-infrastructure, has rarely been addressed by peer-to-peer applic...
Thomas Fuhrmann
CRYPTO
2003
Springer
109views Cryptology» more  CRYPTO 2003»
16 years 3 hour ago
Weak Key Authenticity and the Computational Completeness of Formal Encryption
Abstract. A significant effort has recently been made to rigorously relate the formal treatment of cryptography with the computational one. A first substantial step in this dire...
Omer Horvitz, Virgil D. Gligor
NC
2006
130views Neural Networks» more  NC 2006»
15 years 6 months ago
Dynamic self-assembly in living systems as computation
Biochemical reactions taking place in living systems that map different inputs to specific outputs are intuitively recognized as performing information processing. Conventional wis...
Ann M. Bouchard, Gordon C. Osbourn