Results 1 - 10 of 44,930

Practical two-party computation based on the conditional gate

by Berry Schoenmakers, Pim Tuyls - In Proceedings of Advances in Cryptology - ASIACRYPT ’04, volume 3329 of LNCS , 2004
"... Abstract. We present new results in the framework of secure multiparty computation based on homomorphic threshold cryptosystems. We introduce the conditional gate as a special type of multiplication gate that can be realized in a surprisingly simple and efficient way using just standard homomorphic ..."
Abstract - Cited by 24 (5 self) - Add to MetaCart
Abstract. We present new results in the framework of secure multiparty computation based on homomorphic threshold cryptosystems. We introduce the conditional gate as a special type of multiplication gate that can be realized in a surprisingly simple and efficient way using just standard homomorphic

Secure Two-party Computation is Practical

by Benny Pinkas, Thomas Schneider, Nigel P. Smart, Stephen C. Williams - In Advances in Cryptology — Asiacrypt , 2009
"... 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 implementations with which to test various ideas. This has led to a number of optimisations being proposed which are quite ..."
Abstract - Cited by 103 (18 self) - Add to MetaCart
are quite restricted in their application. In this paper we describe an implementation of the two-party case, using Yao’s garbled circuits, and present various algorithmic protocol improvements. These optimisations are analysed both theoretically and empirically, using experiments of various adversarial

Distributed Computing in Practice: The Condor Experience

by Douglas Thain, Todd Tannenbaum, Miron Livny , 2005
"... Since 1984, the Condor project has enabled ordinary users to do extraordinary computing. Today, the project continues to explore the social and technical problems of cooperative computing on scales ranging from the desktop to the world-wide computational Grid. In this paper, we provide the history a ..."
Abstract - Cited by 551 (8 self) - Add to MetaCart
Since 1984, the Condor project has enabled ordinary users to do extraordinary computing. Today, the project continues to explore the social and technical problems of cooperative computing on scales ranging from the desktop to the world-wide computational Grid. In this paper, we provide the history

Entity Authentication and Key Distribution

by Mihir Bellare, Phillip Rogaway , 1993
"... Entity authentication and key distribution are central cryptographic problems in distributed computing -- but up until now, they have lacked even a meaningful definition. One consequence is that incorrect and inefficient protocols have proliferated. This paper provides the first treatment of these p ..."
Abstract - Cited by 578 (13 self) - Add to MetaCart
of these problems in the complexity-theoretic framework of modern cryptography. Addressed in detail are two problems of the symmetric, two-party setting: mutual authentication and authenticated key exchange. For each we present a definition, protocol, and proof that the protocol meets its goal, assuming

Practical Secure Two-Party Computation

by Yan Huang , 2012
"... ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found

Lego for two-party secure computation

by Jesper Buus Nielsen, Claudio Orl - In Theory of Cryptography (TCC’09), volume 5444 of LNCS , 2009
"... Abstract The first and still most popular solution for secure two-party computation relies on Yao’s garbled circuits. Unfortunately, Yao’s construction provide security only against passive adversaries. Several constructions (zero-knowledge compiler, cut-and-choose) are known in order to provide sec ..."
Abstract - Cited by 42 (2 self) - Add to MetaCart
security against active adversaries, but most of them are not efficient enough to be considered practical. In this paper we propose a new approach called LEGO (Large Efficient Garbled-circuit Optimization) for two-party computation, which allows to construct more efficient protocols secure against active

Affective Computing

by R. W. Picard , 1995
"... Recent neurological studies indicate that the role of emotion in human cognition is essential; emotions are not a luxury. Instead, emotions play a critical role in rational decision-making, in perception, in human interaction, and in human intelligence. These facts, combined with abilities computers ..."
Abstract - Cited by 1909 (43 self) - Add to MetaCart
, and both theoretical and practical applications are described for learning, human-computer interaction, perceptual information retrieval, creative arts and entertainment, human health, and machine intelligence. Significant potential advances in emotion and cognition theory hinge on the development

A randomized protocol for signing contracts

by Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest , 1990
"... Two parties, A and B, want to sign a contract C over a communication network. To do so, they must “simultaneously” exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments in pie ..."
Abstract - Cited by 599 (11 self) - Add to MetaCart
Two parties, A and B, want to sign a contract C over a communication network. To do so, they must “simultaneously” exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments

Intelligent agents: Theory and practice

by Michael Wooldridge, Nicholas R. Jennings - The Knowledge Engineering Review , 1995
"... The concept of an agent has become important in both Artificial Intelligence (AI) and mainstream computer science. Our aim in this paper is to point the reader at what we perceive to be the most important theoretical and practical issues associated with the design and construction of intelligent age ..."
Abstract - Cited by 1441 (85 self) - Add to MetaCart
The concept of an agent has become important in both Artificial Intelligence (AI) and mainstream computer science. Our aim in this paper is to point the reader at what we perceive to be the most important theoretical and practical issues associated with the design and construction of intelligent

An axiomatic basis for computer programming

by C. A. R. Hoare - COMMUNICATIONS OF THE ACM , 1969
"... In this paper an attempt is made to explore the logical founda-tions of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This in-volves the elucidation of sets of axioms and rules of inference w ..."
Abstract - Cited by 1754 (4 self) - Add to MetaCart
which can be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and prac-tical, may follow from a pursuance of these topics.
Results 1 - 10 of 44,930