搜索结果: 1-11 共查到“Minimal Number”相关记录11条 . 查询时间(0.207 秒)
ZCZ - Achieving n-bit SPRP Security with a Minimal Number of Tweakable-block-cipher Calls
n-bit security beyond birthday bound tweakable blockcipher
2018/11/19
Strong Pseudo-random Permutations (SPRPs) are important for various applications. In general, it is desirable to base an SPRP on a single-keyed primitive for minimizing the implementation costs. For c...
Monitoring Massive Appliances by a Minimal Number of Smart Meters
Energy auditing smart meter deployment optimization state tracking
2016/1/22
This article presents a framework for deploying a minimal number of smart meters to accurately track the ON/OFF states of a massive number of electrical appliances which exploits the sparseness featur...
Card-based Cryptographic Protocols Using a Minimal Number of Cards
Card-based protocols Committed format Boolean AND
2015/12/23
Secure multiparty computation can be done with a deck of playing cards. For example, den Boer (EUROCRYPT ’89) devised his famous “five-card trick”, which is a secure two-party AND protocol using five ...
Tight Oracle Bounds for Low-rank Matrix Recovery from a Minimal Number of Random Measurements
Matrix completion The Dantzig selector oracle inequalities norm of random matrices convex optimization and semidefinite programming
2015/6/17
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entries. We show that pro...
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
cryptographic protocols
2014/3/5
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware for universally composable secure computation. As our main result, we show an efficient oblivious-transfe...
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number f Stateless Tokens
2012/6/14
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware tokens for universally composable secure computation with no additional setup. As our main result, we sho...
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens
Minimal Number Stateless Tokens
2012/3/20
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware tokens for universally composable secure computation with no additional setup. As our main result, we sho...
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens
Universally Composable Two-Party Computation Using Minimal Number
2012/8/28
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware tokens for universally composable secure computation with no additional setup. As our main result, we sho...
Minimal Number of Discrete Velocities for a Flow Description
Minimal Number Discrete Velocities Flow Description
2011/8/17
Abstract: It seems intuitively correct to describe fluid flows by using fictitious particles hopping on homogeneously separated nodes with a given finite set of discrete velocities, however, it is not...
Minimal Number of Discrete Velocities for a Flow Description
Minimal Number of Discrete Velocities Computational Physics Fluid Dynamics
2011/9/13
Abstract: It seems intuitively correct to describe fluid flows by using fictitious particles hopping on homogeneously separated nodes with a given finite set of discrete velocities, however, it is not...
Depth and minimal number of generators of square free monomial ideals
Monomial Ideals Depth Stanley depth Commutative Algebra
2011/9/5
Abstract: Let $I$ be an ideal of a polynomial algebra $S$ over a field generated by square free monomials of degree $\geq d$. If $I$ contains more monomials of degree $d$ than $(d+1)/d$ of the total n...