Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures

DOI10.1007/978-3-540-79499-8_14zbMath1166.94341OpenAlexW2111293459WikidataQ59485049 ScholiaQ59485049MaRDI QIDQ3600329

Josef Pieprzyk, Christophe Tartary, Huaxiong Wang

Publication date: 10 February 2009

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://eprints.qut.edu.au/70393/2/Verifiable_Multi_Secret_Sharing_Schemes_INSCRYPT2007.pdf0.pdf

zbMATH Keywords

Chinese Remainder TheoremKeyed One-Way FunctionsSecret Sharing SchemeShare VerifiabilityThreshold Access Structures

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Factorization; primality (11A51)

Related Items (1)

Quantum multi-secret sharing via trap codes and discrete quantum walks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme
• A \((t,n)\) multi-secret sharing scheme
• A scheme for threshold multi-secret sharing
• A new efficient \((t,n)\) verifiable multi-secret sharing (VMSS) based on YCH scheme
• How to share a secret
• VSH, an Efficient and Provable Collision-Resistant Hash Function
• On secret sharing systems
• Cryptanalysis of the Hash Functions MD4 and RIPEMD
• How to Break MD5 and Other Hash Functions
• Efficient Collision Search Attacks on SHA-0
• Finding Collisions in the Full SHA-1
• Cryptology and Network Security

This page was built for publication: Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures