QANIZK for adversary-dependent languages and their applications
From MaRDI portal
Publication:2420581
DOI10.1016/j.tcs.2019.01.041zbMath1455.94164OpenAlexW2912442614MaRDI QIDQ2420581
Lin Lyu, Shengli Liu, Shuai Han
Publication date: 6 June 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.01.041
digital signaturesimulation-soundnesslinearly homomorphic structure-preserving signatureQANIZK proofs
Formal languages and automata (68Q45) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth NIZK arguments
- Compactly Hiding Linear Spans
- Tightly CCA-Secure Encryption Without Pairings
- New Techniques for SPHFs and Efficient One-Round PAKE Protocols
- An Algebraic Framework for Diffie-Hellman Assumptions
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
- Computing on Authenticated Data
- Disjunctions for Hash Proof Systems: New Constructions and Applications
- Quasi-Adaptive NIZK for Linear Subspaces Revisited
- Structure-Preserving Signatures from Standard Assumptions, Revisited
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Computing on Authenticated Data: New Privacy Definitions and Constructions
- Candidate Multilinear Maps from Ideal Lattices
- Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures