搜索结果: 1-15 共查到“worst-case”相关记录28条 . 查询时间(0.088 秒)
Instability in Antarctic ice projected to increase likelihood of worst-case sea level rise（图）
Instability Antarctic ice projected worst-case sea level rise
2019/10/23
Images of vanishing Arctic ice are jarring, but the region’s potential contributions to sea level rise are no match for Antarctica’s. Now, a study says that instability hidden in Antarctic ice increas...
We give Proofs of Work (PoWs) whose hardness is based on well-studied worst-case assumptions from fine-grained complexity theory. This extends the work of (Ball et al., STOC '17), that presents PoWs t...
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
LPN Worst-Case to Average Case Reductions Collision-Resistant Hashing
2018/3/23
We present a worst case decoding problem whose hardness reduces to that of solving the Learning Parity with Noise (LPN) problem, in some parameter regime. Prior to this work, no worst case hardness re...
A Systematic Approach to the Side-Channel Analysis of ECC Implementations with Worst-Case Horizontal Attacks
side-channel elliptic curves scalar multiplications
2017/6/28
The wide number and variety of side-channel attacks against scalar multiplication algorithms makes their security evaluations complex, in particular in case of time constraints making exhaustive analy...
Boolean Searchable Symmetric Encryption with Worst-Case Sub-Linear Complexity
searchable encryption structured encryption sub-linear boolean search
2017/2/20
Recent work on searchable symmetric encryption (SSE) has focused on increasing its expressiveness. A notable example is the OXT construction (Cash et al., CRYPTO '13 ) which is the first SSE scheme to...
Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
Lattices Worst-case to Average-case Reductions Homomorphic Encryption
2016/1/23
In lattice cryptography, worst-case to average-case reductions rely on two problems: Ajtai’s SIS and Regev’s LWE, which both refer to a very small class of random lattices related to the group G = Z...
Computation of the worst-case covariance for linear systems with uncertain parameters
Uncertain parameters of linear systems linear systems branch and bound algorithm is calculated
2015/8/12
For a class of linear systems with unknown parameters that lie in intervals, we present a branch and bound algorithm for computing the worst-case covariance of the state.
On computing the worst-case peak gain of linear systems
SISO discrete-time LTI systems computation of `1-gain discrete-time systems with diagonal perturbations worst-case `1-gain.
2015/8/12
Based on the bounds in the paper by Boyd and Doyle (Comparison of peak and RMS gains for discrete-time systems, Systems and Control Letters, 9:1-6), we present simple upper and lower bounds for the el...
Worst-case risk of a portfolio
Numerical calculation portfolio risk return on assets average semidefinite programming
2015/8/11
We show how to compute in a numerically efficient way the maximum risk of a portfolio, given uncertainty in the means and covariances of asset returns. This is a semidefinite programming problem, and ...
Worst-case capacity of vector Gaussian channels
Gaussian capacity interference noise assuming gaussian convex sets matrix variables
2015/8/11
We study the (Shannon) capacity of Gaussian multiple input multiple output (MIMO) systems when the exact distribution of the interference and/or noise is unknown, but the family the distribution belon...
Robust beamforming via worst-case SINR maximization
Minimum variance beamforming the signal to interference plus noise ratio the parameter estimation error and optimization problems
2015/8/10
Minimum variance beamforming, which uses a weight vector that maximizes the signal to interference plus noise ratio (SINR), is often sensitive to estimation error and uncertainty in the parameters, st...
On Computing the Worst-Case Peak Gain of Linear Systems
SISO discrete-time LTI systems computation of `1-gain discrete-time systems with diagonal perturbations
2015/7/13
Based on the bounds in the paper by Boyd and Doyle (Comparison of peak and RMS gains for discrete-time systems, Systems and Control Letters, 9:1-6), we present simple upper and lower bounds for the el...
We show how to compute in a numerically efficient way the maximum risk of a portfolio, given uncertainty in the means and covariances of asset returns. This is a semidefinite programming problem, and ...
Robust Beamforming via Worst-Case SINR Maximization
Beamforming convex optimization signal-to-interference-plus-noise ratio (SINR)
2015/7/9
Minimum variance beamforming, which uses a weight vector that maximizes the signal to interference plus noise ratio (SINR), is often sensitive to estimation error and uncertainty in the parameters, st...
Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices
public-key cryptography Lattice based cryptography
2013/2/21
NTRUEncrypt, proposed in 1996 by Hoffstein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic performance and conjectured resista...