IACR
2016
9 years 12 months ago
2016
In order to remember long passwords, it is not uncommon users are recommended to create a sentence which then is assembled to form a long password, a passphrase. However, theoretic...
112
click to vote
IACR
2016
9 years 12 months ago
2016
A (γ, δ)-elastic channel is a binary symmetric channel between a sender and a receiver where the error rate of an honest receiver is δ while the error rate of a dishonest recei...
106
click to vote
IACR
2016
9 years 12 months ago
2016
Secure multi-party computation (MPC) allows several mutually distrustful parties to securely compute a joint function of their inputs and exists in two main variants: In synchrono...
108
click to vote
IACR
2016
9 years 12 months ago
2016
How to securely run untrusted software? A typical answer is to try to isolate the actual effects this software might have. Such counter-measures can take the form of memory segmen...
103
click to vote
IACR
2016
9 years 12 months ago
2016
We introduce a debiasing scheme that solves the more-noise-than-entropy problem which can occur in Helper Data Systems when the source is very biased. We perform a condensing step...
100
click to vote
IACR
2016
9 years 12 months ago
2016
Staircase-Generator codes (St-Gen codes) have recently been introduced in the design of code-based public key schemes and for the design of steganographic matrix embedding schemes...
IACR
2016
9 years 12 months ago
2016
Typically, secure channels are constructed from an authenticated key exchange (AKE) protocol, which authenticates the communicating parties based on long-term public keys and esta...
103
click to vote
IACR
2016
9 years 12 months ago
2016
In Crypto’05, Bellare et al. proved O( q2 /2n ) bound for the PRF (pseudorandom function) security of the CBC-MAC based on an n-bit random permutation Π, provided < 2n/3 . He...
IACR
2016
9 years 12 months ago
2016
In this paper, we investigate a variant of the BKZ algorithm, called progressive BKZ, which performs BKZ reductions by starting with a small blocksize and gradually switching to la...
103
click to vote
IACR
2016
9 years 12 months ago
2016
Abstract. The security of homomorphic encryption over the integers and its variants depends on the hardness of the Approximate Common Divisor (ACD) problem. In this paper we review...