Sciweavers

3115 search results - page 350 / 623
» Synthesizing Secure Protocols
Sort
View
PAKDD
2010
ACM
182views Data Mining» more  PAKDD 2010»
15 years 10 months ago
Computation of Ratios of Secure Summations in Multi-party Privacy-Preserving Latent Dirichlet Allocation
In this paper, we focus our attention on the problem of computing the ratio of two numbers, both of which are the summations of the private numbers distributed in different parties...
Bin Yang, Hiroshi Nakagawa
COLCOM
2008
IEEE
15 years 8 months ago
SelectAudit: A Secure and Efficient Audit Framework for Networked Virtual Environments
Networked virtual environments (NVE) refer to the category of distributed applications that allow a large number of distributed users to interact with one or more central servers i...
Tuan Phan, Danfeng (Daphne) Yao
ACMSE
2007
ACM
15 years 10 months ago
Chinese remainder theorem based group key management
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By shifting more computing load onto the key server we o...
Xinliang Zheng, Chin-Tser Huang, Manton M. Matthew...
CRYPTO
2009
Springer
121views Cryptology» more  CRYPTO 2009»
16 years 1 months ago
Collusion-Free Multiparty Computation in the Mediated Model
Collusion-free protocols prevent subliminal communication (i.e., covert channels) between parties running the protocol. In the standard communication model, if one-way functions ex...
Joël Alwen, Jonathan Katz, Yehuda Lindell, Gi...
FOCS
2007
IEEE
16 years 29 days ago
Round Complexity of Authenticated Broadcast with a Dishonest Majority
Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI an...
Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafai...