.png){kind=icon}
返回
Framing in Secret Sharing
.png){kind=icon}
OA
AI
DOI：10.1109/TIFS.2021.3067468.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Secret sharing, a well-known cryptographic technique, introduced 40 years ago as a private and reliable variant of classical storage, has now become a major cryptographic primitive with numerous real-world applications. In this paper we consider the digital forensics aspects of secret sharing. We investigate the problem of framing which occurs when a coalition is able to calculate the share of a participant who does not belong to it. In the extreme case one authorized coalition can calculate shares of another authorized coalition and use the secret in some way blaming another authorized coalition for their action. In this context seniority plays an important role. We define seniority, which comes natural in the context of hierarchical access structures. Roughly speaking, our work shows that in an ideal secret sharing scheme an authorized coalition cannot frame participants who are less senior than all members of the coalition and is able to frame a participant who is more senior than at least one pivotal member of the coalition. We show that for any monotone access structure there exists a (non-ideal) frameproof secret sharing scheme.
Keyword:
Cryptography
Mathematics
Game theory
Weapons
Tools
Terminology
Reliability
Forensics
framing
information theory
secret sharing
traitor
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
5.3K
被引数:
2.3W
机构
引用论文
Translocation and transformation of engineered nanomaterials in plant cells and their effect on metabolism.png)
BIOCELL
OAAI
BIOCELLIF0
OAAI分享收藏Effectiveness and cost-effectiveness against malaria of three types of dual-active-ingredient long-lasting insecticidal nets (LLINs) compared with pyrethroid-only LLINs in Tanzania: a four-arm, cluster-randomised trialThe LancetOAAI
The LancetIF0
OAAI分享收藏分享收藏
查看更多内容