CISPA
Browse
cispa_all_3694.pdf (951.7 kB)

Explainable Arguments

Download (951.7 kB)
conference contribution
posted on 2023-11-29, 18:21 authored by Lucjan HanzlikLucjan Hanzlik, Kamil Kluczniak
We introduce an intriguing new type of argument systems with the additional property of being explainable. Intuitively by explainable, we mean that given any argument under a statement, and any witness, we can produce the random coins for which the Prove algorithm outputs the same bits of the argument. This work aims at introducing the foundations for the interactive as well as the non-interactive setting. We show how to build explainable arguments from witness encryption and indistinguishability obfuscation. Finally, we show applications of explainable arguments. Notably, we construct deniable chosen-ciphertext secure encryption. Previous deniable encryption scheme achieved only chosen plaintext security.

History

Preferred Citation

Lucjan Hanzlik and Kamil Kluczniak. Explainable Arguments. In: Financial Cryptography and Data Security (FC). 2022.

Primary Research Area

  • Algorithmic Foundations and Cryptography

Name of Conference

Financial Cryptography and Data Security (FC)

Legacy Posted Date

2022-05-23

Open Access Type

  • Unknown

BibTeX

@inproceedings{cispa_all_3694, title = "Explainable Arguments", author = "Hanzlik, Lucjan and Kluczniak, Kamil", booktitle="{Financial Cryptography and Data Security (FC)}", year="2022", }

Usage metrics

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC