IACR
2016
9 years 12 months ago
2016
The surprising success of cryptocurrencies has led to a surge of interest in deploying large scale, highly robust, Byzantine fault tolerant (BFT) protocols for mission-critical ap...
IACR
2016
9 years 12 months ago
2016
Abstract. We explore the feasibility of applying SAT solvers to optimizing implementations of small functions such as S-boxes for multiple optimization criteria, e.g., the number o...
IACR
2016
9 years 12 months ago
2016
Goldreich and Izsak (Theory of Computing, 2012) initiated the research on understanding the role of negations in circuits implementing cryptographic primitives, notably, consideri...
IACR
2016
9 years 12 months ago
2016
We outline an algorithm to compute θ(z, τ) in genus 2 in quasi-optimal time, borrowing
IACR
2016
9 years 12 months ago
2016
Abstract—A non-malleable encoding scheme is a keyless encoding scheme which is resilient to tampering attacks. Such a scheme is said to be continuously secure if the scheme is re...
IACR
2016
9 years 12 months ago
2016
Abstract. Non-interactive arguments enable a prover to convince a verifier that a statement is true. Recently there has been a lot of progress both in theory and practice on const...
IACR
2016
9 years 12 months ago
2016
IACR
2016
9 years 12 months ago
2016
Spritz is a stream cipher proposed by Rivest and Schuldt at the rump session of CRYPTO 2014. It is intended to be a replacement of the popular RC4 stream cipher. In this paper we p...
IACR
2016
9 years 12 months ago
2016
We investigate lower bounds in terms of time and memory on the parallel complexity of an adversary A computing labels of randomly selected challenge nodes in direct acyclic graphs,...
IACR
2016
9 years 12 months ago
2016
Computational notions of entropy have recently found many applications, including leakageresilient cryptography, deterministic encryption or memory delegation. The two main types ...