Perfectly secure data aggregation via shifted projections

DOI10.1016/J.INS.2016.03.031zbMath1398.94114DBLPjournals/isci/Duque16arXiv1505.02824OpenAlexW884168093WikidataQ58883272 ScholiaQ58883272MaRDI QIDQ1615724

David Fernández-Duque

Publication date: 31 October 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.02824

zbMATH Keywords

secret sharingdata aggregationinformation-theoretic cryptographyprivate key safeguarding

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

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

Cites Work

• 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.
• Secure distributed key generation for discrete-log based cryptosystems
• The Russian cards problem
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• How to share a secret
• Three Steps

This page was built for publication: Perfectly secure data aggregation via shifted projections