Sciweavers

10 search results - page 2 / 2
» Public-Key Encryption Schemes with Auxiliary Inputs
Sort
View
IACR
2011
196views more  IACR 2011»
12 years 7 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
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
14 years 1 months ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin
IACR
2011
104views more  IACR 2011»
12 years 7 months ago
Collusion Resistant Obfuscation and Functional Re-encryption
Program Obfuscation is the problem of transforming a program into one which is functionally equivalent, yet whose inner workings are completely unintelligible to an adversary. Des...
Nishanth Chandran, Melissa Chase, Vinod Vaikuntana...
IEEECIT
2010
IEEE
13 years 5 months ago
Efficient Sharing of Secure Cloud Storage Services
Suppose Bob, the boss in Company A, pays a secure cloud storage service and authorizes all the employees in that company to share such a service. There exists a user hierarchy: Bob...
Qin Liu, Guojun Wang, Jie Wu
DELTA
2006
IEEE
13 years 11 months ago
Modified Montgomery Modular Multiplication Using 4: 2 Compressor and CSA Adder
The efficiency of the Public Key encryption systems like RSA and ECC can be improved with the adoption of a faster multiplication scheme. In this paper, Modified Montgomery multip...
Himanshu Thapliyal, Anvesh Ramasahayam, Vivek Redd...