OpenAlex
PricingAboutJobs
Log inGet started
Work

Differentially Oblivious Two-Party Pattern Matching With Sublinear Round Complexity

HTML

Year: 2022
Type: article
Source: IEEE Transactions on Dependable and Secure Computing
DOI: 10.1109/tdsc.2022.3206758
Authors: Pengfei Wu, Jianting Ning, Xinyi Huang, Joseph K. Liu
Institutions: National University of Singapore, Fujian Normal University, The Hong Kong University of Science and Technology (Guangzhou), Monash University
Language: English

Topic: Cryptography and Data Security
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences

Open Access status: closed

Funder: National Natural Science Foundation of China
Awards: 云环境下安全数据共享与访问控制机制研究, G5669255772
OpenAlex ID: W4295935045
FWCI: 0.161
Cites: 54
Cited by: 4
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms