搜索结果: 1-15 共查到“shuffling”相关记录18条 . 查询时间(0.107 秒)
We consider the problem of designing scalable, robust protocols for computing statistics about sensitive data. Specifically, we look at how best to design differentially private protocols in a distrib...
Repeatable Oblivious Shuffling of Large Outsourced Data Blocks
oblivious shuffling data outsourcing cloud computing
2019/1/26
As data outsourcing becomes popular, oblivious algorithms have raised extensive attentions since their control flow and data access pattern appear to be independent of the input data they compute on a...
Low Randomness Masking and Shuffling: An Evaluation Using Mutual Information
masking shuffling RNG
2018/11/19
Side-channel countermeasure designers often face severe performance overheads when trying to protect a device. Widely applied countermeasures such as masking and shuffling entail generating a large am...
Analyzing the Shuffling Side-Channel Countermeasure for Lattice-Based Signatures
Lattice-Based Cryptography BLISS Side-Channel Analysis
2017/2/20
Implementation security for lattice-based cryptography is still a vastly unexplored field. At CHES 2016, the very first side-channel attack on a lattice-based signature scheme was presented. Later, sh...
Combining Leakage-Resilient PRFs and Shuffling (Towards Bounded Security for Small Embedded Devices)
PRFs Shuffling
2016/1/9
Combining countermeasures is usually assumed to be the
best way to protect embedded devices against side-channel attacks. These
combinations are at least expected to increase the number of measureme...
In secure multi-party shuffling, multiple parties, each holding an input, want to agree on a random permutation of their inputs while keeping the permutation secret. This problem is important as a pri...
SHUFFLING CARDS AND STOPPING TIMES.
From shuffling cards to walking around the building:An Inetroduction to modern markov chain theory
Shuffle CARDS walk around buildings markov chain theory
2015/7/14
From shuffling cards to walking around the building:An Inetroduction to modern markov chain theory。
MATHEMATICAL DEVELOPMENTS FROM THE ANALYSIS OF RIFFLE SHUFFLING
Mathematical analysis development ripples shuffling
2015/7/8
Introduction The most common method of mixing cards is the ordinary riffle shuffle, in which a deck of n cards (often n = 52) is cut into two parts and the
parts are riffled together. A sharp mathema...
We study how many riffle shuffles are required to mix n cards if only certain features of the deck are of interest, e.g. suits disregarded or only the colors of interest. For a wide variety ...
Analysis of Casino Shelf Shuffling Machines
Casino Shelf Shuffling Machines Combinatorics Probability
2011/9/9
Abstract: Many casinos routinely use mechanical card shuffling machines. We were asked to evaluate a new product, a shelf shuffler. This leads to new probability, new combinatorics, and to some practi...
We present a version of the domino shuffling algorithm (due to Elkies, Kuperberg, Larsen and Propp) which works on a different lattice: the hexagonal lattice superimposed on its dual graph. We use our...
Stretching and folding versus cutting and shuffling: An illustrated perspective on mixing and deformations of continua
Fluid Dynamics (physics.flu-dyn) Chaotic Dynamics (nlin.CD)
2010/11/10
We compare and contrast two types of deformations inspired by mixing applications -- one from the mixing of fluids (stretching and folding), the other from the mixing of granular matter (cutting and s...
We present a version of the domino shuffling algorithm (due to Elkies, Kuperberg, Larsen and Propp) which works on a different lattice: the hexagonal lattice superimposed on its dual graph. We use our...
为研究高抗草甘膦N-乙酰转移酶（glyphosateN—acetyhransferase，GAT）的草甘膦抗性相关位点，以高抗草甘膦的gatl基因和不具草甘膦抗性的gat2基因为出发基因，通过一轮双基因DNAshuffling，获得了抗性较野生型gatl下降的突变体14个：10个单位点突变，3个双位点突变，1个3位点突变。其中，MTGAT3（H41Q）、MTGAT5（$52P）、MTGATT6（1...