Results 21 to 30 of about 2,263 (49)

A secure additive protocol for card players [PDF]

open access: yesAustralasian Journal of Combinatorics 54: 163-175, 2012, 2011
Consider three players Alice, Bob and Cath who hold a, b and c cards, respectively, from a deck of d=a+b+c cards. The cards are all different and players only know their own cards. Suppose Alice and Bob wish to communicate their cards to each other without Cath learning whether Alice or Bob holds a specific card.
arxiv  

Stable Fixed Points of Card Trick Functions [PDF]

open access: yesarXiv, 2013
The 21-card trick is a way of dealing cards in order to predict the card selected by a volunteer. We give a mathematical explanation of why the well-known 21-card trick works using a simple linear discrete function. The function has a stable fixed point which corresponds to the position where the selected card reaches at the end of the trick.
arxiv  

Mixing times of the biased card shuffling and the asymmetric exclusion process [PDF]

open access: yesarXiv, 2002
Consider the following method of card shuffling. Start with a deck of $N$ cards numbered 1 through N. Fix a parameter $p$ between 0 and 1. In this model a ``shuffle'' consists of uniformly selecting a pair of adjacent cards and then flipping a coin that is heads with probability p.
arxiv  

Learning With Generalised Card Representations for "Magic: The Gathering" [PDF]

open access: yesIEEE Conference on Games 2024
A defining feature of collectable card games is the deck building process prior to actual gameplay, in which players form their decks according to some restrictions. Learning to build decks is difficult for players and models alike due to the large card variety and highly complex semantics, as well as requiring meaningful card and deck representations ...
arxiv  

MESURE Tool to benchmark Java Card platforms [PDF]

open access: yesS. Bouzefrane, J. Cordry and P. Paradinas,"MESURE Tool to benchmark Java Card platforms", International Journal of Computer Science Issues, Volume 1, pp49-57, August 2009, 2009
The advent of the Java Card standard has been a major turning point in smart card technology. With the growing acceptance of this standard, understanding the performance behavior of these platforms is becoming crucial. To meet this need, we present in this paper a novel benchmarking framework to test and evaluate the performance of Java Card platforms.
arxiv  

A data mining approach using transaction patterns for card fraud detection [PDF]

open access: yesarXiv, 2013
Credit and debit cards, rather than actual money, have become the universal payment means. With these cards, it has become possible to buy expensive items easily without an additional complex authentication procedure being conducted. However, card transaction features are targeted by criminals seeking to use a lost or stolen card and looking for a ...
arxiv  

Mixing time of the Card-Cyclic-to-Random shuffle [PDF]

open access: yesarXiv, 2012
The Card-Cyclic-to-Random shuffle on $n$ cards is defined as follows: at time $t$ remove the card with label $t$ mod $n$ and randomly reinsert it back into the deck. Pinsky introduced this shuffle and asked how many steps are needed to mix the deck. He showed $n$ steps do not suffice.
arxiv  
Some of the next articles are maybe not open access.

On the (In)Security of ElGamal in OpenPGP

Communications of the ACM, 2023
exaly  

Home - About - Disclaimer - Privacy