搜索结果: 1-15 共查到“军事学 T 1-Theorem”相关记录33条 . 查询时间(0.14 秒)
A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland
TFNP round-collapse average-case hardness
2019/6/26
This result follows from a more general theory of interactive average-case complexity, and in particular, a novel round-collapse theorem for computationally-sound protocols, analogous to Babai-Moran's...
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments
parallel repetition interactive argument smooth KL-divergence
2019/4/22
Soundness amplification is a central problem in the study of interactive protocols. While ``natural'' parallel repetition transformation is known to reduce the soundness error of some special cases of...
Privacy Loss Classes: The Central Limit Theorem in Differential Privacy
differential privacy privacy loss
2018/11/19
In recent years, privacy enhancing technologies have gained tremendous momentum and they are expected to keep a sustained importance. Quantifying the degree of privacy offered by any mechanism working...
Constructing Ideal Secret Sharing Schemes based on Chinese Remainder Theorem
Threshold Secret Sharing Chinese Remainder Theorem Polynomial Ring
2018/11/16
Since (t,n)(t,n)-threshold secret sharing (SS) was initially proposed by Shamir and Blakley separately in 1979, it has been widely used in many aspects. Later on, Asmuth and Bloom presented a (t,n)(t,...
Non-interactive zero-knowledge (NIZK) proofs are fundamental to modern cryptography. Numerous NIZK constructions are known in both the random oracle and the common reference string (CRS) models. In th...
In the area of distributed graph algorithms a number of network's entities with local views solve some computational task by exchanging messages with their neighbors. Quite unfortunately, an inherent ...
The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem
Discrete logarithm Hensel lift Multivaraible Chinese Remainder theorem
2016/12/10
The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem.
Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem (Full Version)
Boolean functions APN Butterfly structure
2016/6/2
The existence of Almost Perfect Non-linear (APN) permutations
operating on an even number of bits has been a long standing open
question until Dillon et al., who work for the NSA, provided an exampl...
Optimizing Obfuscation: Avoiding Barrington's Theorem
natural function classes Optimizing Obfuscation
2016/1/23
In this work, we seek to optimize the efficiency of secure general-purpose obfuscation schemes. We focus on the problem of optimizing the obfuscation of Boolean formulas and branching programs – thi...
A Chinese Remainder Theorem Approach to Bit-Parallel GF(2^n) Polynomial Basis Multipliers for Irreducible Trinomials
implementation Irreducible Trinomials
2016/1/5
We show that the step “modulo the degree-n field generating irreducible polynomial” in the classical definition of the GF(2^n) multiplication operation can be avoided. This leads to an alternative rep...
An alleged theorem of Neven, Smart and Warinschi (NSW) about
the security of Schnorr signatures seems to have a flaw described in
this report.
We present a new, more constructive proof of von Neumann's Min-Max Theorem for two-player zero-sum game --- specifically, an algorithm that builds a near-optimal mixed strategy for the second player f...
Yet Another Attack On the Chinese Remainder Theorem Based Hierarchical Access Control Scheme
communication security CRTHACS Chinese remainder theorem hierarchical access control secure group communication
2013/4/18
The hierarchical access control scheme based on Chinese Reminder Theorem [49] (CRTHACS) was supposed to be capable of hiding hierarchical structure, but Geiselmann et al. [18] showed practical attacks...
A leakage resilient encryption scheme is one which stays secure even against an attacker that obtains a bounded amount of side information on the secret key (say $\lambda$ bits of ``leakage''). A fund...
Another Look at Automated Theorem-Proving. II
public-key cryptography / public-key cryptography automated proofs proof checking, encryption
2012/3/26
I continue the discussion initiated in part I of whether or not computer-assisted proofs are a promising approach to preventing errors in reductionist security arguments. I examine some recent papers ...