搜索结果: 1-15 共查到“Logarithmic”相关记录77条 . 查询时间(0.088 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：The logarithmic Brunn-Minkowski inequality conjecture in convex geometry
凸几何 对数 布伦-闵可夫斯基 不等式猜想
2023/4/21
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...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Learning Quantum Observables of Low Degrees from a Logarithmic Number of Random Queries
对数 随机查询 低次量子 可观察量
2023/4/14
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...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Some results on the nonlinear logarithmic Schrodinger equations
非线性对数 薛定谔方程 量子力学
2023/4/28
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: Logarithmic-Size, No Setup --- from Standard Assumptions
ring signatures linkable ring signatures standard model
2019/3/1
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...
Sub-logarithmic Distributed Oblivious RAM with Small Block Size
Oblivious RAM Multi-Server Setting Secure Computation
2019/1/26
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,...
Poly-Logarithmic Side Channel Rank Estimation via Exponential Sampling
Side Channel Rank Estimation Key Enumeration
2018/11/13
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 ...
Approximating Private Set Union/Intersection Cardinality with Logarithmic Complexity
Private Set Union Cardinality Private Set Intersection Cardinality Privacy Preserving Data Mining
2018/5/28
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 ...
PanORAMa: Oblivious RAM with Logarithmic Overhead
Oblivious RAM Oblivious Shuffle Oblivious Hash Table
2018/5/2
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
non-canonical lifts logarithmic derivatives
2017/3/6
The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives.
Topology-Hiding Computation Beyond Logarithmic Diameter
topology hiding multi party computation broadcast voting
2017/2/20
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...
Conversion from Arithmetic to Boolean Masking with Logarithmic Complexity
Side-channel attack first-order countermeasure arithmetic to Boolean conversion
2016/1/6
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...
SOME REMARKS ON THE LOGARITHMIC SIGNATURES OF FINITE ABELIAN GROUPS
logarithmic signatures quasi-logarithmic signatures cyclic 2-group
2015/12/22
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 ...
LOGARITHMIC SOBOLEV INEQUALITIES FOR FINITE MARKOV CHAINS
Sobolev inequality MARKOV CHAINS
2015/8/26
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) ...
The logarithmic delay of KPP fronts in a periodic medium
logarithmic delay KPP fronts periodic medium
2015/7/14
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...