搜索结果: 1-15 共查到“Subexponential”相关记录16条 . 查询时间(0.296 秒)
We construct a 2-message publicly verifiable witness indistinguishable argument system for NP assuming that the Learning with Errors (LWE) problem is subexponentially hard. Moreover, the protocol is `...
The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
indistinguishability obfuscation extremely lossy functions subexponential assumptions
2018/5/23
We consider the problem of removing subexponential assumptions from cryptographic constructions based on indistinguishability obfuscation (iO). Specifically, we show how to apply complexity absorption...
A Subexponential Construction of Graph Coloring for Multiparty Computation
cryptographic protocols Multiparty Computations
2016/1/26
We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal...
Uniform Approximations for the M/G/1 Queue with Subexponential Processing Times
Uniform approximations M/G/1 queue subexponential distributions heavy traffi c heavy tails Cram′er series
2015/7/6
This paper studies the asymptotic behavior of the steady-state waiting time, W∞, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflo...
Equations System coming from Weil descent and subexponential attack for algebraic curve cryptosystem
ECDLP first fall degree
2014/3/10
Faug\'ere et al. shows that the decomposition problem of a point of elliptic curve over binary field $F_{2^n}$ reduces to solving low degree equations system over $F_2$ coming from Weil descent. Using...
General nonexact oracle inequalities for classes with a subexponential envelope
Statistical learning fast rates of convergence oracle inequalities regularization classification aggregation model selection
2012/6/21
We show that empirical risk minimization procedures and regularized empirical risk minimization procedures satisfy nonexact oracle inequalities in an unbounded framework, under the assumption that the...
Cayley hash functions are a particular kind of cryptographic hash functions with very appealing properties. Unfortunately, their security is related to a mathematical problem whose hardness is not ver...
Cayley hash functions are a particular kind of cryptographic hash functions with very appealing properties. Unfortunately, their security is related to a mathematical problem whose hardness is not ver...
Cayley hash functions are a particular kind of cryptographic hash functions with very appealing properties. Unfortunately, their security is related to a mathematical problem whose hardness is not ver...
Achieving a vanishing SNR-gap to exact lattice decoding at a subexponential complexity
SNR-gap subexponential complexity Information Theory
2011/9/15
Abstract: The work identifies the first lattice decoding solution that achieves, in the general outage-limited MIMO setting and in the high-rate and high-SNR limit, both a vanishing gap to the error-p...
Constructing elliptic curve isogenies in quantum subexponential time
Constructing elliptic curve isogenies quantum subexponential time
2011/3/3
Given two elliptic curves over a finite field having the same cardinality and endomorphism
ring, it is known that the curves admit an isogeny between them, but finding such an isogeny is believed to ...
Second order subexponential distributions with finite mean and their applications to subordinated distributions
Second order subexponential distributions subordinated distributions
2010/11/22
Consider a probability distribution subordinate to a subexponential distribution with finite mean. In this paper, we discuss the second order tail behavior of the subordinated distribution within a r...
Uniform Approximations for the M/G/1 Queue with Subexponential Processing Times
Uniform approximations M/G/1 queue subexponential distributions
2010/12/14
This paper studies the asymptotic behavior of the steady-state waiting time, W 1, of the
M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overf...
WEAKENING ASSUMPTIONS FOR DETERMINISTIC SUBEXPONENTIAL TIME NON-SINGULAR MATRIX COMPLETION
WEAKENING ASSUMPTIONS DETERMINISTIC NON-SINGULAR MATRIX
2012/11/30
Kabanets and Impagliazzo [9] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinear polynomial f...
Tail probabilities for a risk process with subexponential jumps in a regenerative and diffusion environment
Ruin probability Cox process diffusion process exponential change of measure
2009/9/21
In this paper we fmd a nonexponential Lundberg approximation
of the ruin probability in a Cox model, in which a governing
process has a regenerative structure and claims are light-tailed or
have an...