860 search results - page 22 / 172 » Completeness in two-party secure computation: a computationa... |
158
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
195
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
157
click to vote
ICISC
2008
15 years 7 months ago
2008
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
179
click to vote
SDMW
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. We investigate the experimental effectiveness of query rewriting over XML security views. Our model consists of access control policies specified over DTDs with XPath e...
191
click to vote
EUROPKI
2006
Springer
15 years 9 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...