Sciweavers

977 search results - page 12 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
CONCUR
2008
Springer
13 years 9 months ago
Modeling Computational Security in Long-Lived Systems
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
EUROCRYPT
2007
Springer
13 years 11 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo
PODC
2010
ACM
13 years 11 months ago
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
Christoph Lucas, Dominik Raub, Ueli M. Maurer
FCS
2006
13 years 9 months ago
Cryptographic and Computational Challenges in Grid Computing
A computational grid is a large-scale distributed computing environment capable of providing dependable, consistent, pervasive, and inexpensive access to high-end computational re...
Song Y. Yan, Glyn James, Gongyi Wu
ASIACRYPT
2009
Springer
14 years 2 months ago
Secure Two-Party Computation Is Practical
Abstract. Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few im...
Benny Pinkas, Thomas Schneider, Nigel P. Smart, St...