Matchmaking encryption for NC1 circuits without obfuscation
- 3 March 2026
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1071
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (12441101)
- National Natural Science Foundation of China (62372180)
This publication has 10 references indexed in Scilit:
- Identity-based matchmaking encryption with stronger security and instantiation on latticesTheoretical Computer Science, 2024
- Post-Quantum Secure Identity-Based Matchmaking EncryptionIEEE Transactions on Dependable and Secure Computing, 2024
- Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with ErrorsJournal of Cryptology, 2024
- Catch me if you can: A Secure Bilateral Access Control System With Anonymous CredentialsIEEE Transactions on Services Computing, 2023
- Secure Cloud-Assisted Data Pub/Sub Service With Fine-Grained Bilateral Access ControlIEEE Transactions on Information Forensics and Security, 2023
- Match Me if You Can: Matchmaking Encryption and Its ApplicationsJournal of Cryptology, 2021
- Multi-theorem Preprocessing NIZKs from LatticesJournal of Cryptology, 2020
- (Leveled) Fully Homomorphic Encryption without BootstrappingACM Transactions on Computation Theory, 2014
- Dual-Policy Attribute Based Encryption: Simultaneous Access Control with Ciphertext and Key PoliciesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2010
- On lattices, learning with errors, random linear codes, and cryptographyJournal of the ACM, 2009