Paper 2025/1650
WISCH: Efficient data signing via correlated signatures
Abstract
We present WISCH, a commit-reveal protocol that combines compact aggregate signatures with hash-based commitments to enable selective disclosure of correlated data in multiparty computation. The protocol separates an on-chain verification core from off chain preparation, so that verification cost depends only on the number of openings, not on the size of the underlying message space. This yields asymptotic efficiency: on-chain cost grows linearly in the number of revealed items and is independent of the ambient domain, while the per-byte overhead decreases with the message granularity. Security is established via a simulation-based proof in a UC framework with an ideal ledger functionality, in the algebraic group and global random-oracle models, under standard assumptions for discrete-log-based signatures and hash-based commitments. Thus WISCH provides selectively verifiable revelation with succinct on-chain checks and provable security guarantees.
Note: New version with improved security proofs, and better structure.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Winternitz signatureSchnorr signatureCorrelated signaturesEncapsulated signaturesMulti-party computation
- Contact author(s)
-
futo @ fairgate io
ramses fernandez @ fairgate io
emilio garcia @ fairgate io
glaroton @ dm uba ar
sergio lerner @ fairgate io - History
- 2025-12-31: revised
- 2025-09-12: received
- See all versions
- Short URL
- https://ia.cr/2025/1650
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/1650,
author = {Ariel Futoransky and Ramses Fernandez and Emilio Garcia and Gabriel Larotonda and Sergio Demian Lerner},
title = {{WISCH}: Efficient data signing via correlated signatures},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1650},
year = {2025},
url = {https://eprint.iacr.org/2025/1650}
}
