Three steps

DOI10.1007/978-3-642-22359-4_4MaRDI QIDQ3092292zbMATHOpenAlexFDO

Authors Fernando Soler-Toscano, Hans van Ditmarsch

Publication date 16 September 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22359-4_4

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42)

Recommendations

• scientific article; zbMATH DE number 2230917
• The Russian cards problem
• A geometric protocol for cryptography with cards
• The case of the hidden hand
• scientific article; zbMATH DE number 176546

Cites work

• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• scientific article; zbMATH DE number 2230917 (Why is no real title available?)
• A knowledge based semantics of messages
• Bounds on secret key exchange using a random deal of cards
• Combinatorial Designs
• Computations with a deck of cards
• Computing and Combinatorics
• Model checking Russian cards
• The Russian cards problem
• The logic of public announcements, common knowledge, and private suspicions
• Using temporal logics of knowledge for specification and verification -- a case study

Cited in

(18)

• Combinatorial solutions providing improved security for the generalized Russian cards problem
• Information Exchange in the Russian Cards Problem
• Mental poker with three or more players
• A colouring protocol for the generalized Russian cards problem
• Three steps ahead
• Additional constructions to solve the generalized Russian cards problem using combinatorial designs
• Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy
• Who holds the best card? Secure communication of optimal secret bits
• Perfectly secure data aggregation via shifted projections
• A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
• A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
• scientific article; zbMATH DE number 2230917 (Why is no real title available?)
• A case study in almost-perfect security for unconditionally secure communication
• The case of the hidden hand
• A geometric protocol for cryptography with cards
• Crossing hands in the Russian cards problem
• Efficient card-based protocols for generating a hidden random permutation without fixed points
• scientific article; zbMATH DE number 7583728 (Why is no real title available?)

Describes a project that uses

Uses Software

• DEMO

This page was built for publication: Three steps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092292)