Sciweavers

129 search results - page 15 / 26
» iacr 2011
Sort
View
110
Voted
IACR
2011
147views more  IACR 2011»
13 years 9 months ago
Adaptive Security of Concurrent Non-Malleable Zero-Knowledge
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...
Zhenfu Cao, Zongyang Zhang, Yunlei Zhao
IACR
2011
84views more  IACR 2011»
13 years 9 months ago
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
In this paper, we explore a general methodology for converting composite order pairingbased cryptosystems into the prime order setting. We employ the dual pairing vector space app...
Allison B. Lewko
IACR
2011
132views more  IACR 2011»
13 years 9 months ago
Homomorphic encryption from codes
We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous latticeba...
Andrej Bogdanov, Chin Ho Lee
IACR
2011
113views more  IACR 2011»
13 years 9 months ago
Fully Homomorphic SIMD Operations
At PKC 2010 Smart and Vercauteren presented a variant of Gentry’s fully homomorphic public key encryption scheme and mentioned that the scheme could support SIMD style operations...
Nigel P. Smart, Frederik Vercauteren
IACR
2011
97views more  IACR 2011»
13 years 9 months ago
Two-Output Secure Computation with Malicious Adversaries
We present a method to compile Yao’s two-player garbled circuit protocol into one that is secure against malicious adversaries that relies on witness indistinguishability. Our ap...
Abhi Shelat, Chih-Hao Shen