搜索结果: 1-6 共查到“军事学 Robust Secret Sharing”相关记录6条 . 查询时间(0.06 秒)
Towards optimal robust secret sharing with security against a rushing adversary
security against rushing adversary
font style='font-size:12px;'>
2019/3/2
Robust secret sharing enables the reconstruction of a secret-shared message in the presence of up to tt (out of nn) {\em incorrect} shares. The most challenging case is when n=2t+1n=2t+1, which is the...
Efficient Robust Secret Sharing from Expander Graphs
Robust Secret Sharing Expander Graphs Secure Message Transmission
font style='font-size:12px;'>
2016/7/29
Threshold secret sharing is a protocol that allows a dealer to share a secret among nn players so that any coalition of tt players learns nothing about the secret, but any t+1t+1 players can reconstru...
Robust Secret Sharing Schemes Against Local Adversaries
secret sharing macs error-correcting codes
font style='font-size:12px;'>
2016/1/6
We study robust secret sharing schemes in which between one third and one half of the
players are corrupted. In this scenario, robust secret sharing is possible only with a share size
larger than th...
Nearly Optimal Robust Secret Sharing
secret sharing information theoretic privacy
font style='font-size:12px;'>
2015/12/22
We prove that a known approach to improve Shamir’s celebrated secret sharing scheme; i.e.,
adding an information-theoretic authentication tag to the secret, can make it robust for n parties
against ...
Essentially Optimal Robust Secret Sharing with Maximal Corruptions
Secret Sharing Information Theoretic Security
font style='font-size:12px;'>
2015/12/22
In a t-out-of-n robust secret sharing scheme, a secret message is shared among n parties who
can reconstruct the message by combining their shares. An adversary can adaptively corrupt
up to t of the...
Detection of AlgebraicManipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
AlgebraicManipulation Robust Secret Sharing Fuzzy Extractors
font style='font-size:12px;'>
2009/6/2
Consider an abstract storage device (G) that can hold a single element x from a fixed, publicly known
finite group G. Storage is private in the sense that an adversary does not have read access to ...