搜索结果: 1-8 共查到“Average-Case”相关记录8条 . 查询时间(0.156 秒)
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering
non-malleable codes streaming
2017/11/3
We show a general framework for constructing non-malleable codes against tampering families with average-case hardness bounds. Our framework adapts ideas from the Naor-Yung double encryption paradigm ...
We present functions that can be computed in some fixed polynomial time but are hard on average for any algorithm that runs in slightly smaller time, assuming widely-conjectured worst-case hardness fo...
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...
Average Case Behavior of Random Search for the Maximum
Average Case Behavior Random Search Maximum
2015/7/8
This paper is a study of the error in approximating the global maximum of a Brownian motion on the unit interval by observing the value at randomly chosen points. One point of view is to look at the e...
Average-Case Separation in Proof Complexity:Short Propositional Refutations for Random 3CNF Formulas
Average-Case Short Propositional Random 3CNF Formulas
2012/12/4
Separating different propositional proof systems梩hat is, demonstrating that one proof system cannot efficiently simulate another proof system梚s one of the main goals of proof complexity. Nevertheless,...
An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates
Quadratic Frobenius Primality Test Average Case Error Estimates
2009/4/16
We present an Extended Quadratic Frobenius Primality Test (EQFT),
which is related to the Miller-Rabin test and the Quadratic Frobenius test
(QFT) by Grantham. EQFT is well-suited for generating lar...
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors
Lattices Admit Logarithmic Worst-Case Average-Case Connection Factors
2009/1/5
We demonstrate an average-case problem which is as hard as finding
(n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where
(n) = O(plog n).The previously best k...
Query Complexity: Worst-Case Quantum Versus Average-Case Classical
Query Complexity Worst-Case Quantum Versus Average-Case Classical
2010/10/18
Withdrawn. The results in the paper only work for a certain subclass of Boolean functions, in which block sensitivity has properties similar to those of ordinary sensitivity. They don’t work in genera...