A case study in almost-perfect security for unconditionally secure communication
From MaRDI portal
Publication:517272
DOI10.1007/s10623-016-0210-yzbMath1379.94044arXiv1506.04188OpenAlexW2232254651WikidataQ59603452 ScholiaQ59603452MaRDI QIDQ517272
Esteban Landerreche, David Fernández-Duque
Publication date: 23 March 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.04188
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Combinatorial structures in finite projective spaces (51E20) Authentication, digital signatures and secret sharing (94A62)
Related Items (3)
Unnamed Item ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A colouring protocol for the generalized Russian cards problem
- Additional constructions to solve the generalized Russian cards problem using combinatorial designs
- A geometric protocol for cryptography with cards
- Finite geometries.
- How many \(s\)-subspaces must miss a point set in \(\mathrm{PG}(d, q)\)
- Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy
- Unconditional secure communication: a Russian cards protocol
- Blocking sets in projective spaces and polar spaces
- The Russian cards problem
- Perfectly secure data aggregation via shifted projections
- Bounds on secret key exchange using a random deal of cards
- Combinatorial solutions providing improved security for the generalized Russian cards problem
- How to share a secret
- Three Steps
This page was built for publication: A case study in almost-perfect security for unconditionally secure communication