IACR
2011
14 years 4 months ago
2011
152
click to vote
IACR
2011
14 years 4 months ago
2011
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...
142
click to vote
IACR
2011
14 years 4 months ago
2011
Although anonymous authentication has been extensively studied, so far no scheme has been widely adopted in practice. A particular issue with fully anonymous authentication schemes...
154
click to vote
IACR
2011
14 years 4 months ago
2011
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...
147
click to vote
IACR
2011
14 years 4 months ago
2011
We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a ...
IACR
2011
14 years 4 months ago
2011
139
click to vote
IACR
2011
14 years 4 months ago
2011
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...
158
click to vote
IACR
2011
14 years 4 months ago
2011
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
131
click to vote
IACR
2011
14 years 4 months ago
2011
In the last several years, micro-blogging Online Social Networks (OSNs), such as Twitter, have taken the world by storm, now boasting over 100 million subscribers. As an unparalle...
145
click to vote
IACR
2011
14 years 4 months ago
2011
—This paper proposes a novel fault-propagation pattern based differential fault analysis method - FPP-DFA, and proves its feasibility on SPN structure block ciphers using bitwise...