Skip to main content
Conference Proceedings

On cheater identifiable secret sharing schemes secure against rushing adversary

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 8231 LNCS 258-271
DOI: 10.1007/978-3-642-41383-4_17
12Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

At EUROCRYPT 2011, Obana proposed a k-out-of-n secret sharing scheme capable of identifying up to t cheaters with probability 1 - ε under the condition t

Author supplied keywords

Cite

CITATION STYLE

APA

Xu, R., Morozov, K., & Takagi, T. (2013). On cheater identifiable secret sharing schemes secure against rushing adversary. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8231 LNCS, pp. 258–271). https://doi.org/10.1007/978-3-642-41383-4_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free