Buscar
Mostrando ítems 1-4 de 4
Artículo
A geometric protocol for cryptography with cards
(Springer, 2015)
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 ...
Artículo
A secure additive protocol for card players
(University of Queensland, 2012)
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 ...
Artículo
Predicativity through Transfinite Reflection
(The Association for Symbolic Logic, 2017)
Let T be a second-order arithmetical theory, Λ a well-order, λ < Λ and X ⊆ ℕ. We use as a formalization of “φ is provable from T and an oracle for the set X, using ω-rules of nesting depth at most λ”. For a set of ...
Artículo
A colouring protocol for the generalized Russian cards problem
(Elsevier, 2013)
In the generalized Russian cards problem, Alice, Bob and Cath draw a, b and c cards, respectively, from a deck of size a + b + c. Alice and Bob must then communicate their entire hand to each other, without Cath learning ...