310 search results - page 15 / 62 » An Efficient Protocol for Fair Secure Two-Party Computation |
JUCS
2008
14 years 9 months ago
2008
: In the paper we study parallel key exchange among multiple parties. The status of parallel key exchange can be depicted by a key graph. In a key graph, a vertex represents a part...
103
click to vote
EUROPKI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Key agreement protocols are a fundamental building block for ensuring authenticated and private communications between two parties over an insecure network. This paper fo...
102
click to vote
CRYPTO
2010
Springer
14 years 10 months ago
2010
Springer
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
109
click to vote
IACR
2011
13 years 9 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
EUROCRYPT
1995
Springer
15 years 1 months ago
1995
Springer
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...