Showing cs.CRShow all
2 papers · 1 filter
cs.CR2012
Information-Theoretically Secure Three-Party Computation with One Corrupted Party
Ye Wang, Prakash Ishwar, Shantanu Rane
The problem in which one of three pairwise interacting parties is required to securely compute a function of the inputs held by the other two, when one party may arbitrarily deviat…
cs.CR2010
Unconditionally Secure Computation on Large Distributed Databases with Vanishing Cost
Ye Wang, Shantanu Rane, Prakash Ishwar +1
Consider a network of k parties, each holding a long sequence of n entries (a database), with minimum vertex-cut greater than t. We show that any empirical statistic across the net…