>>> 哲学 经济学 法学 教育学 文学 历史学 理学 工学 农学 医学 军事学 管理学 旅游学 文化学 特色库
搜索结果: 1-15 共查到Logarithmic相关记录77条 . 查询时间(0.156 秒)
The logarithmic Brunn-Minkowski inequality conjecture is one of the most intriguing challenges in convex geometry since 2012. Notably, this conjectured inequality is stronger than the celebrated Brunn...
A fundamental problem from computational learning theory is to well-reconstruct an unknown function on the discrete hypercubes. One classical result of this problem for the random query model is the l...
In this talk, we are concerned with the nonlinear logarithmic Schrodinger equations. When the potential satisfies a global assumption, we give the multiple solutions. When the potential satisfies a lo...
Ring signatures allow for creating signatures on behalf of an ad hoc group of signers, hiding the true identity of the signer among the group. A natural goal is to construct a ring signature scheme fo...
Oblivious RAM (ORAM) is a cryptographic primitive that allows a client to securely execute RAM programs over data that is stored in an untrusted server. Distributed Oblivious RAM is a variant of ORAM,...
Rank estimation is an important tool for a side-channel evaluations laboratories. It allows estimating the remaining security after an attack has been performed, quantified as the time complexity and ...
The computation of private set union/intersection cardinality (PSU-CA/PSI-CA) is one of the most intensively studied problems in Privacy Preserving Data Mining (PPDM). However, existing protocols are ...
the input has a certain level of entropy. We combine these two primitives to improve the shuffle time in our hierarchical ORAM construction by avoiding heavy oblivious shuffles and leveraging entropy ...
The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives.
A distributed computation in which nodes are connected by a partial communication graph is called \emph{topology-hiding} if it does not reveal information about the graph (beyond what is revealed by t...
A general method to protect a cryptographic algorithm against side-channel attacks consists in masking all intermediate variables with a random value. For cryptographic algorithms combining Boolean op...
In the paper about the cryptosystem MST3, Svaba and Trung proposed a way to build a cryptosystem based on the concept of logarithmic signatures, and they choose Suzuki’s group, which is not abelian ...
This is an expository paper on the use of logarithmic Sobolev inequalities for bounding rates of convergence of Markov chains on finite state spaces to their stationary distributions. Logarithmic So...
Let each of n particles starting at the origin in Z2 perform simple random walk until reaching a site with no other particles. Lawler, Bramson, and Griffeath proved that the resulting random set A(n) ...
We consider solutions of the KPP-type equations with a periodically varying reaction rate, and compactly supported initial data. It has been shown by Bramson [5, 6] in the case of the constant reactio...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...