1-out-of-\(n\) oblivious signatures: security revisited and a generic construction with an efficient communication cost

DOI10.1007/978-981-97-1235-9_14MaRDI QIDQ6547872

Keisuke Tanaka, Masayuki Tezuka

Publication date: 31 May 2024

zbMATH Keywords

generic constructionMerkle treeround-optimal1-out-of-\(n\) oblivious signaturesefficient communication cost

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)

This page was built for publication: 1-out-of-\(n\) oblivious signatures: security revisited and a generic construction with an efficient communication cost