Highly Efficient and Re-executable Private Function Evaluation with Linear Complexity
- Submitting institution
-
De Montfort University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 11265
- Type
- D - Journal article
- DOI
-
10.1109/TDSC.2020.3009496
- Title of journal
- IEEE Transactions on Dependable and Secure Computing
- Article number
- 9141372
- First page
- -
- Volume
- 0
- Issue
- -
- ISSN
- 1545-5971
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2020
- URL
-
https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9141372
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This work aims to design secure and efficient private function evaluation (PFE) schemes to be used in real-life applications. One of the novelties over the state-of-the-art is that it provides a re-usability feature which is quite beneficial in relevant real-life scenarios where individuals/enterprises can mutually and continuously have a long-term business relationship instead of a single deal. To the best of our knowledge, this is the most efficient and the first PFE scheme with reusability feature. The outcomes of this work have remarkable impacts on real-life cryptographic applications such as i-voting, e-auction, satellite collision avoidance system, genomic search problem.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -