Privacy Preserving String Matching With a Constant Size Token
碩士 === 國立交通大學 === 資訊科學與工程研究所 === 97 === Nowadays, many cryptographic schemes have been developed to achieve search on encrypted data, but most of them are keyword search. Few of schemes can support more general query like string matching on encrypted data. In our protocol, the tag stands for the en...
Main Authors: | Liu, Szu-Wei, 劉思維 |
---|---|
Other Authors: | Tzeng, Wen-Guey |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/58360187350364722748 |
Similar Items
-
An Approximate String Matching Based on an Exact String Matching with Constant Pattern Length
by: Z. H. Pan, et al.
Published: (2008) -
SwapCT: Swap Confidential Transactions for Privacy-Preserving Multi-Token Exchanges
by: Engelmann Felix, et al.
Published: (2021-10-01) -
A Review of String Matching Algorithms with Constant Space
by: Hong-Chieh Chen, et al.
Published: (2006) -
An Efficient Privacy Preserving Record Matching Protocol
by: Tai-Feng Huang, et al.
Published: (2008) -
Fully Constant-Size CP-ABE with Privacy-Preserving Outsourced Decryption for Lightweight Devices in Cloud-Assisted IoT
by: Zhishuo Zhang, et al.
Published: (2021-01-01)