A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (Q5918638): Difference between revisions

Latest revision as of 10:34, 28 July 2024

scientific article; zbMATH DE number 7495145

Language	Label	Description	Also known as
English	A distributed computing perspective of unconditionally secure information transmission in Russian cards problems	scientific article; zbMATH DE number 7495145

Statements

instance of

scholarly article

0 references

title

A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (English)

0 references

author

Sergio Rajsbaum

0 references

published in

Structural Information and Communication Complexity

0 references

publication date

22 March 2022

0 references

full work available at URL

https://arxiv.org/abs/2009.13644

0 references

zbMATH Keywords

Johnson graphs

0 references

Russian cards problem

0 references

information theoretic security

0 references

combinatorial cryptography

0 references

constant weight codes

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q5708984

0 references

Renaming in an asynchronous environment

0 references

Some new distance-4 constant weight codes

0 references

The Complexity Gap between Consensus and Safe-Consensus

0 references

Q2869467

0 references

A geometric protocol for cryptography with cards

0 references

A colouring protocol for the generalized Russian cards problem

0 references

Cyclic Spaces for Grassmann Derivatives and Additive Theory

0 references

Communication Complexity of Wait-Free Computability in Dynamic Networks

0 references

The Russian cards problem

0 references

Three Steps

0 references

Unconditional secure communication: a Russian cards protocol

0 references

On the chromatic number, colorings, and codes of the Johnson graph

0 references

Q3211252

0 references

Q4035713

0 references

Q3140454

0 references

Erdős–Ko–Rado Theorems: Algebraic Approaches

0 references

Lower bounds for constant weight codes

0 references

Q5498755

0 references

The topological structure of asynchronous computability

0 references

A case study in almost-perfect security for unconditionally secure communication

0 references

Constant factor approximation for balanced cut in the PIE model

0 references

Additive group theory—A progress report

0 references

The Automorphism Group of a Johnson Graph

0 references

Combinatorial solutions providing improved security for the generalized Russian cards problem

0 references

Additional constructions to solve the generalized Russian cards problem using combinatorial designs

0 references

The zero-error side information problem and chromatic numbers (Corresp.)

0 references

Identifiers

DOI

10.1007/978-3-030-79527-6_16

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5918638

@@ Property / OpenAlex ID @@
+W3173369058
@@ Property / OpenAlex ID: W3173369058 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5708984
@@ Property / cites work: Q5708984 / rank @@
+Normal rank
@@ Property / cites work @@
+Renaming in an asynchronous environment
@@ Property / cites work: Renaming in an asynchronous environment / rank @@
+Normal rank
@@ Property / cites work @@
+Some new distance-4 constant weight codes
@@ Property / cites work: Some new distance-4 constant weight codes / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity Gap between Consensus and Safe-Consensus
+Normal rank
@@ Property / cites work @@
+Q2869467
@@ Property / cites work: Q2869467 / rank @@
+Normal rank
@@ Property / cites work @@
+A geometric protocol for cryptography with cards
@@ Property / cites work: A geometric protocol for cryptography with cards / rank @@
+Normal rank
@@ Property / cites work @@
+A colouring protocol for the generalized Russian cards problem
+Normal rank
@@ Property / cites work @@
+Cyclic Spaces for Grassmann Derivatives and Additive Theory
+Normal rank
@@ Property / cites work @@
+Communication Complexity of Wait-Free Computability in Dynamic Networks
+Normal rank
@@ Property / cites work @@
+The Russian cards problem
@@ Property / cites work: The Russian cards problem / rank @@
+Normal rank
@@ Property / cites work @@
+Three Steps
@@ Property / cites work: Three Steps / rank @@
+Normal rank
@@ Property / cites work @@
+Unconditional secure communication: a Russian cards protocol
+Normal rank
@@ Property / cites work @@
+On the chromatic number, colorings, and codes of the Johnson graph
+Normal rank
@@ Property / cites work @@
+Q3211252
@@ Property / cites work: Q3211252 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4035713
@@ Property / cites work: Q4035713 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140454
@@ Property / cites work: Q3140454 / rank @@
+Normal rank
@@ Property / cites work @@
+Erdős–Ko–Rado Theorems: Algebraic Approaches
@@ Property / cites work: Erdős–Ko–Rado Theorems: Algebraic Approaches / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for constant weight codes
@@ Property / cites work: Lower bounds for constant weight codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q5498755
@@ Property / cites work: Q5498755 / rank @@
+Normal rank
@@ Property / cites work @@
+The topological structure of asynchronous computability
+Normal rank
@@ Property / cites work @@
+A case study in almost-perfect security for unconditionally secure communication
+Normal rank
@@ Property / cites work @@
+Constant factor approximation for balanced cut in the PIE model
+Normal rank
@@ Property / cites work @@
+Additive group theory—A progress report
@@ Property / cites work: Additive group theory—A progress report / rank @@
+Normal rank
@@ Property / cites work @@
+The Automorphism Group of a Johnson Graph
@@ Property / cites work: The Automorphism Group of a Johnson Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial solutions providing improved security for the generalized Russian cards problem
+Normal rank
@@ Property / cites work @@
+Additional constructions to solve the generalized Russian cards problem using combinatorial designs
+Normal rank
@@ Property / cites work @@
+The zero-error side information problem and chromatic numbers (Corresp.)
+Normal rank