ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
4
views
17
references
Top references
cited by
4
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,152
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Information Theoretic Security
Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
other
Author(s):
Avishek Adhikari
,
Kirill Morozov
,
Satoshi Obana
,
Partha Sarathi Roy
,
Kouichi Sakurai
,
Rui Xu
Publication date
(Online):
November 10 2016
Publisher:
Springer International Publishing
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
17
Record
: found
Abstract
: not found
Article
: not found
New hash functions and their use in authentication and set equality
Mark Wegman
,
J.Lawrence Carter
(1981)
0
comments
Cited
267
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Safeguarding cryptographic keys
G Blakley
(1979)
0
comments
Cited
64
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
How to share a secret with cheaters
Martin Tompa
,
Heather Woll
(1989)
0
comments
Cited
27
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2016
Publication date (Online):
November 10 2016
Pages
: 3-23
DOI:
10.1007/978-3-319-49175-2_1
SO-VID:
509f3d2e-a3e5-45c0-9a07-56ac724ac447
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
pp. 24
Dynamic and Verifiable Hierarchical Secret Sharing
pp. 47
Computational Security of Quantum Encryption
pp. 72
Efficient Simulation for Quantum Message Authentication
pp. 95
Private Visual Share-Homomorphic Computation and Randomness Reduction in Visual Cryptography
pp. 114
Revisiting the False Acceptance Rate Attack on Biometric Visual Cryptographic Schemes
pp. 129
Detecting Algebraic Manipulation in Leaky Storage Systems
pp. 151
Cheater Detection in SPDZ Multiparty Computation
pp. 177
Error-Correcting Codes Against Chosen-Codeword Attacks
pp. 190
Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract)
pp. 213
Unconditionally Secure Revocable Storage: Tight Bounds, Optimal Construction, and Robustness
pp. 241
A Practical Fuzzy Extractor for Continuous Features
pp. 259
Almost Perfect Privacy for Additive Gaussian Privacy Filters
pp. 279
A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage
Similar content
1,152
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths
Authors:
Michael Goodrich
,
Siddharth Gupta
,
Hadi Khodabandeh
…
Limiting cheaters in mutualism: evidence from hybridization between mutualist and cheater yucca moths
Authors:
K Segraves
,
D M Althoff
,
O Pellmyr
Cheater detection in social exchange
Authors:
T Yamagishi
,
M Kosugi
,
T Yamagishi
See all similar
Cited by
4
Secrecy and Robustness for Active Attack in Secure Network Coding
Authors:
Masahito Hayashi
,
Masaki Owari
,
Go Kato
…
Linear \((t,n)\) Secret Sharing Scheme with Reduced Number of Polynomials
Authors:
Kenan Phiri
,
Hyunsung Kim
Verifiable Quantum Secure Modulo Summation
Authors:
Masahito Hayashi
,
Takeshi Koshiba
See all cited by