Sciweavers

164 search results - page 24 / 33
» Covert two-party computation
Sort
View
ECOOP
2006
Springer
14 years 1 months ago
Session Types for Object-Oriented Languages
A session takes place between two parties; after establishing a connection, each party interleaves local computations and communications (sending or receiving) with the other. Ses...
Mariangiola Dezani-Ciancaglini, Dimitris Mostrous,...
EUROPKI
2006
Springer
14 years 1 months ago
On the Resilience of Key Agreement Protocols to Key Compromise Impersonation
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...
Maurizio Adriano Strangio
ISCI
2007
99views more  ISCI 2007»
13 years 9 months ago
Privacy-preserving algorithms for distributed mining of frequent itemsets
Standard algorithms for association rule mining are based on identification of frequent itemsets. In this paper, we study how to maintain privacy in distributed mining of frequen...
Sheng Zhong
IACR
2011
101views more  IACR 2011»
12 years 9 months ago
Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies
Companies, organizations, and individuals often wish to share information to realize valuable social and economic goals. Unfortunately, privacy concerns often stand in the way of ...
Emil Stefanov, Elaine Shi, Dawn Song
IACR
2011
120views more  IACR 2011»
12 years 9 months ago
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...
David Jao, Luca De Feo