Explainable arguments
From MaRDI portal
Publication:6045191
DOI10.1007/978-3-031-18283-9_4zbMath1514.94095MaRDI QIDQ6045191
Lucjan Hanzlik, Kamil Kluczniak
Publication date: 26 May 2023
Published in: Financial Cryptography and Data Security (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New approaches for deniable authentication
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- The edited truth
- Characterizing deterministic-prover zero knowledge
- Fully deniable interactive encryption
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On the cryptographic deniability of the Signal protocol
- It wasn't me! Repudiability and claimability of ring signatures
- Deniable Functional Encryption
- Receipt-free secret-ballot elections (extended abstract)
- How to Run Turing Machines on Encrypted Data
- Constrained Pseudorandom Functions and Their Applications
- Designated Verifier Proofs and Their Applications
- Deniable Group Key Agreement
- Verifiable Predicate Encryption and Applications to CCA Security and Anonymous Predicate Authentication
- Interactive Encryption and Message Authentication
- Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art
- Lower and Upper Bounds for Deniable Public-Key Encryption
- Deniable Attribute Based Encryption for Branching Programs from LWE
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
- Deniable Internet Key Exchange
- Perfect Non-interactive Zero Knowledge for NP
- An Efficient Deniable Key Exchange Protocol (Extended Abstract)
- Composability and On-Line Deniability of Authentication
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Witness Maps and Applications
- Bi-Deniable Public-Key Encryption
- How to use indistinguishability obfuscation
- A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware (sPA1) Encryption Scheme
- Functional Signatures and Pseudorandom Functions
- On Minimal Assumptions for Sender-Deniable Public Key Encryption
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Zaps and Their Applications
- Witness encryption and its applications
- Public Key Cryptography - PKC 2005
- Predictable Arguments of Knowledge
- Non-interactive Zaps and New Techniques for NIZK
- Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
This page was built for publication: Explainable arguments