In this paper, we present a new scheme, which is secure against rushing adversary, with |V i | = |S|/ε n − t + 1, assuming t < k/3. We note that the share size ...

This paper presents a new scheme, which is secure against rushing adversary, with |V i | = |S|/e n − t + 1, assuming t < k/3, and demonstrates an ...

Abstract. At EUROCRYPT 2011, Obana proposed a k-out-of-n secret sharing scheme capable of identifying up to t cheaters with probability.

In this paper, we present a new scheme, which is secure against rushing adversary, with |Vi| = |S|/εn-t+1, assuming t < k/3. We note that the share size of our ...

On cheater identifiable secret sharing schemes secure against rushing adversary. Lecture Notes in Computer Science (including subseries Lecture Notes in ...

Rui Xu, Kirill Morozov, Tsuyoshi Takagi: On Cheater Identifiable Secret Sharing Schemes Secure against Rushing Adversary. IWSEC 2013: 258-271.

On Cheater Identifiable Secret Sharing Schemes Secure against Rushing Adversary Rui Xu1 , Kirill Morozov2, and Tsuyoshi Takagi2 1 2 Graduate School of ...

Abstract. In Crypto'95, Kurosawa, Obana and Ogata proposed a k- out-of-n secret sharing scheme capable of identifying up to t cheaters.

Dive into the research topics of 'On cheater identifiable secret sharing schemes secure against rushing adversary'. Together they form a unique fingerprint.

Takagi: On cheater identifiable secret sharing schemes secure against rushing adversary, in Proc. the 8th International Workshop on. Security (IWSEC 2013) ...