Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Unconditionally Non-interactive Verifiable Secret Sharing Secure against Faulty Majorities in the Commodity Based Model

Anderson C. A. Nascimento, Joern Mueller-Quade, Akira Otsuka, Goichiro Hanaoka, Hideki Imai

Published Jan 1, 2004• 10 citations
Publisher
DOI
10.1007/978-3-540-24852-1_26

Related papers

Unconditionally secure non-malleable secret sharing and circular external difference families

Shannon Veitch, Douglas R. Stinson

arXiv:2305.09405•Designs Codes and Cryptography•Nov 16, 2023•6 citations

Unconditionally-Secure Robust Secret Sharing with Compact Shares

Alfonso Cevallos, Serge Fehr, Rafail Ostrovsky +1 more

Lecture notes in computer science•Jan 1, 2012•49 citations

Unconditionally-Secure Robust Secret Sharing with Minimum Share Size

Mahabir Prasad Jhanwar, Reihaneh Safavi–Naini

Lecture notes in computer science•Jan 1, 2013•16 citations

A Rational Secret Sharing Protocol with Unconditional Security in the Synchronous Setting

Yang Yu, Zhanfei Zhou

Lecture notes in computer science•Jan 1, 2013•0 citations

Unconditionally Secure Rational Secret Sharing in Standard Communication Networks

Zhifang Zhang, Mulan Liu

Lecture notes in computer science•Jan 1, 2011•17 citations

A Practical Framework for Lattice-Based Non-interactive Publicly Verifiable Secret Sharing

Behzad Abdolmaleki, John Clark, Mohammad Foroutani +2 more

Lecture notes in computer science•Jan 1, 2026•0 citations