Sciweavers

112 search results - page 10 / 23
» Secure Bit-Plane Based Steganography for Secret Communicatio...
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 11 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
FC
2006
Springer
153views Cryptology» more  FC 2006»
14 years 2 months ago
Revisiting Oblivious Signature-Based Envelopes
Secure, anonymous and unobservable communication is becoming increasingly important due to the gradual erosion of privacy in many aspects of everyday life. This prompts the need f...
Samad Nasserian, Gene Tsudik
IACR
2011
196views more  IACR 2011»
12 years 10 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
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...
Gilad Asharov, Abhishek Jain, Daniel Wichs
PAISI
2010
Springer
13 years 8 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 11 months ago
Covert two-party computation
We introduce the novel concept of covert two-party computation. Whereas ordinary secure two-party computation only guarantees that no more knowledge is leaked about the inputs of t...
Luis von Ahn, Nicholas J. Hopper, John Langford