搜索结果: 1-13 共查到“军事学 Limitations”相关记录13条 . 查询时间(0.049 秒)
Computational Limitations in Robust Classification and Win-Win Results
Robust Classification Learning Parity with Noise
2019/2/28
We continue the study of statistical/computational tradeoffs in learning robust classifiers, following the recent work of Bubeck, Lee, Price and Razenshteyn who showed examples of classification tasks...
18 Seconds to Key Exchange: Limitations of Supersingular Isogeny Diffie-Hellman on Embedded Devices
Post-quantum cryptography supersingular isogeny SIDH
2018/11/8
The quantum secure supersingular isogeny Diffie-Hellman (SIDH) key exchange is a promising candidate in NIST's on-going post-quantum standardization process. The evaluation of various implementation c...
Finding Significant Fourier Coefficients: Clarifications, Simplifications, Applications and Limitations
Significant Fourier transform Goldreich-Levin algorithm Kushilevitz-Mansour algorithm
2016/7/13
Ideas from Fourier analysis have been used in cryptography for three decades. Akavia, Goldwasser
and Safra unified some of these ideas to give a complete algorithm that finds significant
Fourier coe...
On the Possibilities and Limitations of Computational Fuzzy Extractors
error-correcting code leakage-resilient cryptography key encapsulation mechanism
2016/1/8
Fuller et al. (Asiacrypt 2013) studied on computational fuzzy extractors, and showed, as a
negative result, that the existence of a computational “secure sketch” implies the existence of an
informat...
Zeroizing Without Low-Level Zeroes: New MMAP Attacks and Their Limitations
Cryptanalysis Hardness Assumptions Multilinear Maps
2015/12/29
We extend the recent zeroizing attacks of Cheon, Han, Lee, Ryu and Stehl磂 (Eurocrypt?5)
on multilinear maps to settings where no encodings of zero below the maximal level are available.
Some of the ...
On Limitations of the Fiat瓥Shamir Transformation
zero-knowledge sigma protocol adaptive security
2015/12/24
It has long been known (Shoup and Gennaro 1998 [1]) that non-interactive proofs in the
Random Oracle model that rely on rewinding extractors can be problematic. Recent results by
Seurin and Treger [...
Limitations of the Meta-Reduction Technique: The Case of Schnorr Signatures
Meta-Reduction Random Oracle Model Schnorr Signature
2013/4/18
We revisit the security of Fiat-Shamir signatures in the non-programmable random oracle model. The well-known proof by Pointcheval and Stern for such signature schemes (Journal of Cryptology, 2000) re...
Careful with Composition: Limitations of Indifferentiability and Universal Composability
Limitations of Indifferentiability Universal Composability
2011/7/25
We exhibit a hash-based storage auditing scheme which is provably secure in the random-oracle model (ROM), but easily broken when one instead uses typical indifferentiable hash constructions.
Careful with Composition: Limitations of Indifferentiability and Universal Composability
Universal Composability Limitations of Indifferentiability
2012/3/27
We exhibit a hash-based storage auditing scheme which is provably secure in the random-oracle model (ROM), but easily broken when one instead uses typical indifferentiable hash constructions. This con...
Generic Side-Channel Distinguishers: Improvements and Limitations
implementations / side-channel analysis
2012/3/29
The goal of generic side-channel distinguishers is to allow key recoveries against any type of implementation, under minimum assumptions on the underlying hardware. Such distinguishers are particularl...
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
blind signatures pairings composite-order groups
2010/9/9
In this paper, we show that there are limits to such transformations. Specifically, we show that Freeman's properties, cancelling and projecting, cannot simultaneously be obtained using prime-order gr...
Efficiency Limitations for $\Sigma$-Protocols for Group Homomorphisms
Generic Group Model Protocols Proofs of Knowledge Error Bounds
2009/12/29
Efficient zero-knowledge proofs of knowledge for group homomorphisms
are essential for numerous systems in applied cryptography.
Especially, protocols for proving knowledge of discrete logarithms
i...
On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions
Secure two-party computation universal composability impossibility results
2009/3/26
The recently proposed universally composable (UC) security framework for analyzing security
of cryptographic protocols provides very strong security guarantees. In particular, a
protocol proven secu...