101,017 research outputs found
A geometric protocol for cryptography with cards
In the generalized Russian cards problem, the three players Alice, Bob and
Cath draw a,b and c cards, respectively, from a deck of a+b+c cards. Players
only know their own cards and what the deck of cards is. Alice and Bob are then
required to communicate their hand of cards to each other by way of public
messages. The communication is said to be safe if Cath does not learn the
ownership of any specific card; in this paper we consider a strengthened notion
of safety introduced by Swanson and Stinson which we call k-safety.
An elegant solution by Atkinson views the cards as points in a finite
projective plane. We propose a general solution in the spirit of Atkinson's,
although based on finite vector spaces rather than projective planes, and call
it the `geometric protocol'. Given arbitrary c,k>0, this protocol gives an
informative and k-safe solution to the generalized Russian cards problem for
infinitely many values of (a,b,c) with b=O(ac). This improves on the collection
of parameters for which solutions are known. In particular, it is the first
solution which guarantees -safety when Cath has more than one card
Combinatorial Solutions Providing Improved Security for the Generalized Russian Cards Problem
We present the first formal mathematical presentation of the generalized
Russian cards problem, and provide rigorous security definitions that capture
both basic and extended versions of weak and perfect security notions. In the
generalized Russian cards problem, three players, Alice, Bob, and Cathy, are
dealt a deck of cards, each given , , and cards, respectively.
The goal is for Alice and Bob to learn each other's hands via public
communication, without Cathy learning the fate of any particular card. The
basic idea is that Alice announces a set of possible hands she might hold, and
Bob, using knowledge of his own hand, should be able to learn Alice's cards
from this announcement, but Cathy should not. Using a combinatorial approach,
we are able to give a nice characterization of informative strategies (i.e.,
strategies allowing Bob to learn Alice's hand), having optimal communication
complexity, namely the set of possible hands Alice announces must be equivalent
to a large set of -designs, where . We also provide some
interesting necessary conditions for certain types of deals to be
simultaneously informative and secure. That is, for deals satisfying
for some , where and the strategy is assumed to satisfy
a strong version of security (namely perfect -security), we show that and hence . We also give a precise characterization of informative
and perfectly -secure deals of the form satisfying involving -designs
Crossing Hands in the Russian Cards Problem
When communicating using an unconditionally secure protocol, a sender and receiver is able to transmit secret information over a public, insecure channel without fear of the secret being intercepted by a third party. The Russian cards problem is an example of an unconditionally secure protocol where the communication is fully understandable for everyone listening in. Even though everyone can understand what is being said, only the sender and receiver are able to uncover the secrets being transmitted. In this thesis we investigate the interaction among the communicating parties. By extending existing problem-specific software we are able to more efficiently analyze protocols, and we are therefore able to provide an answer to an open problem in the literature. We provide a completely new solution to the Russian cards protocol and show that it fulfills all requirements by the problem. Discovering this new solution provides the person initiating the protocol two new strategies to choose from when constructing the initial announcement of the protocol.Masteroppgave i informasjonsvitenskapINFO39
Lower Tanana flashcards
Master's Project (M.A.) University of Alaska Fairbanks, 2019As part of a study of Lower Tanana, I found it expedient to create a learning tool to help myself gain
familiarity with Lower Tanana. I chose to employ Anki, an open-source tool for creating digital flashcard
based learning tools. With Anki, I created cards for individual Lower Tanana words and phrases. In
producing the computer flashcards for Lower Tanana, I realized that they could serve as a highly flexible
system for both preserving and learning Lower Tanana. Further, because of the built-in system flexibility,
such systems can be created to aid in preserving and teaching other endangered languages
Secure aggregation of distributed information: How a team of agents can safely share secrets in front of a spy
We consider the generic problem of Secure Aggregation of Distributed
Information (SADI), where several agents acting as a team have information
distributed among them, modeled by means of a publicly known deck of cards
distributed among the agents, so that each of them knows only her cards. The
agents have to exchange and aggregate the information about how the cards are
distributed among them by means of public announcements over insecure
communication channels, intercepted by an adversary "eavesdropper", in such a
way that the adversary does not learn who holds any of the cards. We present a
combinatorial construction of protocols that provides a direct solution of a
class of SADI problems and develop a technique of iterated reduction of SADI
problems to smaller ones which are eventually solvable directly. We show that
our methods provide a solution to a large class of SADI problems, including all
SADI problems with sufficiently large size and sufficiently balanced card
distributions
A new approach to a changing global environment
Title VI National Resource Center Grant (P015A060066)unpublishednot peer reviewe
Special Libraries, December 1959
Volume 50, Issue 10https://scholarworks.sjsu.edu/sla_sl_1959/1009/thumbnail.jp
- …