Witness encryption from smooth projective hashing system
From MaRDI portal
Publication:6111981
DOI10.1007/978-3-031-22390-7_4zbMATH Open1530.94047MaRDI QIDQ6111981FDOQ6111981
Authors:
Publication date: 4 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pairings for cryptographers
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate Multilinear Maps from Ideal Lattices
- How to Run Turing Machines on Encrypted Data
- An Algebraic Framework for Diffie-Hellman Assumptions
- Title not available (Why is that?)
- How to build time-lock encryption
- Witness encryption and its applications
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- Hash proof systems over lattices revisited
- How to Avoid Obfuscation Using Witness PRFs
- New Techniques for SPHFs and Efficient One-Round PAKE Protocols
- Witness Encryption from Instance Independent Assumptions
- On the Size of Pairing-Based Non-interactive Arguments
- Disjunctions for Hash Proof Systems: New Constructions and Applications
- Offline Witness Encryption
- Adaptive Witness Encryption and Asymmetric Password-Based Cryptography
- Predictable Arguments of Knowledge
- Title not available (Why is that?)
- Offline witness encryption with semi-adaptive security
- Offline witness encryption from witness PRF and randomized encoding in CRS model
- Semi-adaptively secure offline witness encryption from puncturable witness PRF
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
Cited In (1)
This page was built for publication: Witness encryption from smooth projective hashing system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6111981)