搜索结果: 76-90 共查到“complexity”相关记录479条 . 查询时间(0.093 秒)
Big Data–The New Science of Complexity
big data data-intensive science computer simulations modeling complexity non-parametric statistics causation
2016/6/15
Data-intensive techniques, now widely referred to as 'big data', allow for novel ways to address complexity in science. I assess their impact on the scientific method. First, big-data science is disti...
On the Multiplicative Complexity of Boolean Functions and Bitsliced Higher-Order Masking
Higher-Order Masking Boolean Functions Multiplicative Complexity
2016/6/6
Higher-order masking is a widely used countermeasure to
make software implementations of blockciphers achieve high security levels
against side-channel attacks. Unfortunately, it often comes with a
...
Bounded Indistinguishability and the Complexity of Recovering Secrets
Foundations of cryptography secret sharing visual cryptography
2016/6/6
Motivated by cryptographic applications, we study the notion of {\em bounded indistinguishability}, a natural relaxation of the well studied notion of bounded independence.
Position-Based Cryptography and Multiparty Communication Complexity
Position based cryptography construct secure
2016/6/2
Position based cryptography (PBC), proposed in the seminal work of Chandran, Goyal,
Moriarty, and Ostrovsky (SIAM J. Computing, 2014), aims at constructing cryptographic schemes
in which the identit...
Set constraints are relations between sets of terms. They have been used extensively in various applications in program analysis and type inference. We present several results on the computational com...
Measuring Empirical Computational Complexity
trend-prof empirical computational complexity
2016/5/24
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of programs in practice b...
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
distributed cryptography cryptanalysis block ciphers
2016/5/23
We explore cryptographic primitives with low multiplicative complexity. This is motivated by recent progress in practical applications of secure multi-party computation (MPC), fully homomorphic encryp...
Can Large Deviation Theory be Used for Estimating Data Complexity?
block ciphers cryptanalysis data complexity
2016/5/17
Statistical analysis of attacks on block ciphers have mostly used normal approximations. A few recent works have proposed doing away with normal approximations and instead use Chernoff and Hoeffding b...
On the complexity of constructing pseudorandom functions (especially when they don't exist)
OWF PRF
2016/4/6
We study the complexity of black-box constructions of pseudorandom functions
(PRF) from one-way functions (OWF) that are secure against non-uniform adversaries.
We show that if OWF do not exist, the...
Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck
probabilistically checkable proofs interactive proofs proof composition
2016/3/24
We study *interactive oracle proofs* (IOPs) (Ben-Sasson, Chiesa, Spooner '16), which combine aspects of probabilistically checkable proofs (PCPs) and interactive proofs (IPs). We present IOP construct...
A Note on Black-Box Complexity of Indistinguishability Obfuscation
Indistinguishability Obfuscation Black-Box Separations
2016/3/23
Mahmoody et al. (TCC 2016-A) showed that basing indistinguishability obfuscation (IO) on a wide range of primitives in a semi-black-box way is as hard as basing public-key cryptography on one-way func...
The Exact Round Complexity of Secure Computation
Exact Round Complexity Multi-Party Computation Two-Party Computation
2016/3/9
We revisit the exact round complexity of secure computation in the multi-party and twoparty
settings. For the special case of two-parties without a simultaneous message exchange channel, this
questi...
Randomness Complexity of Private Circuits for Multiplication
Private Circuits Multiplication
2016/3/1
Many cryptographic algorithms are vulnerable to side channel analysis and several leakage models
have been introduced to better understand these flaws. In 2003, Ishai, Sahai and Wagner introduced
th...
Low Linear Complexity Estimates for Coordinate Sequences of Linear Recurrences of Maximal Period over Galois Ring
linear recurrent sequence linear complexity/rank estimations pseudo-random sequences
2016/3/1
In this work we provide low rank estimations for coordinate sequences of linear recurrent sequences (LRS) of maximal period (MP) over Galois ring R=GR(pn,r), p≥5, r≥2, with numbers s such that s=kr+2,...
On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography
monotone boolean circuits negation complexity one-way functions
2016/2/24
Goldreich and Izsak (Theory of Computing, 2012) initiated the research on understanding
the role of negations in circuits implementing cryptographic primitives, notably, considering
one-way function...