Efficient Fair Data Exchange without In-Circuit Public-Key Operations

본문 미리보기

Fair data exchange (FDE) lets a seller receive payment if and only if a buyer can recover data matching an agreed commitment. Existing code-based schemes achieve near-plaintext communication, but their auxiliary public-key ciphertexts make consistency proving expensive when low redundancy requires many samples. We replace these auxiliary ciphertexts with direct polynomial authentication and external witness linking. The resulting circuit checks unmasking and consistency using only field ari