搜索结果: 1-10 共查到“军事学 C/N ratio”相关记录10条 . 查询时间(0.127 秒)
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation
oblivious transfer differential privacy hardness amplification
2019/6/4
Consider a PPT two-party protocol Π=(A,B)Π=(A,B) in which the parties get no private inputs and obtain outputs OA,OB∈{0,1}OA,OB∈{0,1}, and let VAVA and VBVB denote the parties' individual views. Proto...
A Candidate Access Structure for Super-polynomial Lower Bound on Information Ratio
secret sharing general access structures information ratio
2019/6/3
The contribution vector (convec) of a secret sharing scheme is the vector of all share sizes divided by the secret size. A measure on the convec (e.g., its maximum or average) is considered as a crite...
Leakage-resilient Identity-based Encryption in Bounded Retrieval Model with Nearly Optimal Leakage-Ratio
Leakage-resilience Bounded retrieval model Identity-based Encryption
2019/1/26
We propose new constructions of leakage-resilient public-key encryption (PKE) and identity-based encryption (IBE) schemes in the bounded retrieval model (BRM). In the BRM, adversaries are allowed to o...
Information-Theoretic Secret-Key Agreement: The Secret-Key Rate as a Function of the Channel Quality Ratio
Secret-Key Agreement Information-theoretic security Satellite model
2017/11/28
Information theoretically secure secret-key exchange between two parties, Alice and Bob, is a well-studied problem that is provably impossible without additional assumptions. However, it has shown to ...
In a recent paper, Aggarwal, Joux, Prakash, and Santha (AJPS) describe an ingenious public-key cryptosystem mimicking NTRU over the integers. This algorithm relies on the properties of Mersenne primes...
On the smallest ratio problem of lattice bases
lattice reduction lattice enumeration algorithms smallest ratio problem
2016/12/10
Let (b1,…,bn)(b1,…,bn) be a lattice basis with Gram-Schmidt orthogonalization (b∗1,…,b∗n)(b1∗,…,bn∗), the quantities ∥b1∥/∥b∗i∥∥b1∥/∥bi∗∥ for i=1,…,ni=1,…,n play im...
On the Information Ratio of Non-Perfect Secret Sharing Schemes
Secret sharing Non-perfect secret sharing Information Ratio Polymatroid
2016/1/25
A secret sharing scheme is non-perfect if some subsets of players that cannot recover the
secret value have partial information about it. The information ratio of a secret sharing
scheme is the rati...
Lower Bounds on the Information Ratio of Linear Secret Sharing Schemes
cryptographic protocols secet sharing linear secret sharing schemes
2013/2/21
Superpolynomial lower bounds on the average information ratio of linear secret sharing scheme are presented in this note for the first time. The previously known superpolynomial lower bounds applied o...
Asymptotic Behavior of the Ratio Between the Numbers of Binary Primitive and Irreducible Polynomials
Asymptotic Behavior Binary Primitive Irreducible Polynomials
2008/8/14
In this paper we study the ratio (n) = 2(n) 2(n) , where 2(n) is the number
of primitive polynomials and 2(n) is the number of irreducible polynomials
in GF(2)[x] of degree n. Let n = Q`i=1 prii...
Asymptotic Behavior of the Ratio Between the Numbers of Binary Primitive and Irreducible Polynomials
Asymptotic Behavior of the Ratio Binary Primitive Irreducible Polynomials
2008/6/2
In this paper we study the ratio (n) = 2(n) 2(n) , where 2(n) is the number
of primitive polynomials and 2(n) is the number of irreducible polynomials
in GF(2)[x] of degree n.