Witness encryption from smooth projective hashing system
From MaRDI portal
Publication:6111981
DOI10.1007/978-3-031-22390-7_4zbMath1530.94047MaRDI QIDQ6111981
No author found.
Publication date: 4 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pairings for cryptographers
- Hash proof systems over lattices revisited
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- How to build time-lock encryption
- Offline witness encryption from witness PRF and randomized encoding in CRS model
- Offline witness encryption with semi-adaptive security
- Semi-adaptively secure offline witness encryption from puncturable witness PRF
- How to Avoid Obfuscation Using Witness PRFs
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Offline Witness Encryption
- New Techniques for SPHFs and Efficient One-Round PAKE Protocols
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- An Algebraic Framework for Diffie-Hellman Assumptions
- How to Run Turing Machines on Encrypted Data
- Witness Encryption from Instance Independent Assumptions
- Adaptive Witness Encryption and Asymmetric Password-Based Cryptography
- Disjunctions for Hash Proof Systems: New Constructions and Applications
- Candidate Multilinear Maps from Ideal Lattices
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Witness encryption and its applications
- Predictable Arguments of Knowledge
- On the Size of Pairing-Based Non-interactive Arguments
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
This page was built for publication: Witness encryption from smooth projective hashing system
