# Server aided Authentication
###### tags: `bibliography`
## [Toward Verifiable and Privacy Preserving Machine Learning Prediction](https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9247447)
* IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. 19, NO. 3, MAY/JUNE 2022
* Chaoyue Niu et al.
*
------
## [HELIOPOLIS: Verifiable Computation over Homomorphically Encrypted Data from Interactive Oracle Proofs is Practical](https://eprint.iacr.org/2023/1949.pdf)
* Preprint 2023
* Diego F. Aranha1, Anamaria Costache2, Antonio Guimarães3, and Eduardo Soria-Vazquez4
*
------
## [A Verifiable Privacy-preserving Machine Learning Prediction Scheme for Edge-enhanced HCPSs](https://research.tees.ac.uk/ws/portalfiles/portal/35727870/TII_2021_2280_FINAL_VERSION.pdf)
* IEEE Transactions on Industrial Informatics - Volume: 18, Issue: 8, August 2022
* SXiong Li; Jiabei He; Pandi Vijayakumar; Xiaosong Zhang; Victor Chang
*
------
## [Recyclable PUFs: Logically Reconfigurable PUFs](https://www.iacr.org/archive/ches2011/69170375/69170375.pdf)
* Journal of Cryptographic Engineering, vol. 1, no. 3, pp. 177–186, 2011
* Stefan Katzenbeisser et al.
* They have proved the security under unpredictability game. However, detailed proof is missing.
------
## [Converse PUF-Based Authentication](https://link.springer.com/chapter/10.1007/978-3-642-30921-2_9#publish-with-us)
* International Conference on Trust and Trustworthy Computing 2012
* Unal Kocaba ̧ Andreas Peter, Stefan Katzenbeisser, and Ahmad-Reza Sadeghi.
* Their security proof technique could be followed which directly proves the security proof based on the cryptographic primitives -- no reduction is used here.
------
## [CPAKA: Mutual Authentication and Key Agreement Scheme Based on Conditional PUF in Space-Air-Ground Integrated Network](https://www.computer.org/csdl/journal/tq/5555/01/10319787/1S7TrN4JOdq)
* IEEE Transaction on Dependable and Secure Computing, 2023
* Dawei Li, Di Liu, Yangkun Ren, Yu Sun, Zhenyu Guan, Qianhong Wu, Jiankun Hu, Jianwei Liu.
* This paper defines the concept of the security model of conditional physical unclonable function (CPUF) that guarantees the security of the protocol while allowing the use of PUFs that can be modeled.
* proposes a CPUF-based authentication and key agreement (AKA) scheme, named CPAKA, that addresses the challenges of device key leakage and inefficient authentication in resource-asymmetric environments.
* The CPAKA scheme embeds PUFs in weak nodes and deploys prediction models corresponding to the PUFs in strong nodes, eliminating the need to store challenge-response pairs or perform complex calculations.
* [MD] The full paper is not accessible yet. We can use this paper to justify use of simulatable PUFs in our proposal.
------
## [TREVERSE: TRial-and-Error Lightweight Secure ReVERSE Authentication With Simulatable PUFs](https://ieeexplore.ieee.org/abstract/document/9091218)
* IEEE Transactions on Dependable and Secure Computing, 2022
* Yansong Gao , Marten van Dijk, Lei Xu , Wei Yang , Surya Nepal , and Damith C. Ranasinghe
[SS] This work is directly related to ours.
Similar to our method:
* they have used simulated PUF - provided references in this regard, but did not mention PYPUF tool that we have used
* they have mentioned APUF as an example of linear additive delay PUF (LAPUF) which can be simulated. Our protocol considers APUF, however, I think we can extend our protocol to any LAPUF
* this is a server aided authentication:
* server keeps a simulated model and recreates responses
The only difference is that server and verifier are the same. This makes a strong assumption that server is secure. So if this server is comprmised, then authentication will also be compromised. We differentiate server and verifier, so that we don't need to assume stronger security assurance for the server.
Another difference with this work is the problem statement: this works takes care of the authentication based on noisy responses (which is a real issue). We assume noisy response is a solved problem and consider server compromise scenario.

-----------------
## [Building PUF Based Authentication and Key Exchange Protocol for IoT Without Explicit CRPs in Verifier Database](http://www.acsu.buffalo.edu/~mblanton/cse708/pufs-without-database.pdf)
* IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2019
* Urbi Chatterjee , Vidya Govindan, Rajat Sadhukhan, Debdeep Mukhopadhyay, Rajat Subhra Chakraborty, Debashis Mahata, Mukesh M. Prabhu
* [SS] This work's setup is directly related to our setup. It draws the example from IoT network. A bunch of IoT nodes are attached to a Verifier, every IoT node is a PUF enables and acts as a Prover. There is a secure Server that stores the challenge-response pairs (CRPs) and the server helps the Veirifier during the authentication of an IoT node prover. It does not directly applies the CRPs during the authentication, rather derives information based on CRPs which are used in the authentication. However, if the server is compromised the authentication will be compromised. Like us they also consider that PUF is not accessible to the adversary. They write: "its challenge-response character- istics is an implicit property, and is thus not accessible to the adversary."

-----------------
## [Physically Unclonable Functions found in Standard Components of Commercial Devices](https://www.intrinsic-id.com/wp-content/uploads/2017/05/Unclonable-functions.pdf)
* WORKSHOP ON TRUSTWORTHY MANUFACTURING AND UTILIZATION OF SECURE DEVICES
* Andre Schaller and Vincent van der Leest (Intrinsic-ID)
* [SS] One of the authors in this paper is from Intrinsic-ID. This paper does speak about device authentication using server that stores CRPs related to the PUF associated with the device.
-----------------
## [A survey on physical unclonable function (PUF)-based security solutions for Internet of Things](https://doi.org/10.1016/j.comnet.2020.107593)
* Computer Networks, Volume 183, 2020
* Alireza Shamsoshoara, Ashwija Korenda, Fatemeh Afghah, Sherali Zeadally
* [SS] This survey mentions that CRPs are stored in the server.
## [PUFs in Security Protocols: Attack Models and Security Evaluations](https://ieeexplore.ieee.org/document/6547116)
* IEEE Symposium on Security and Privacy, 2013
* Ulrich Ruhrmair, Marten van Dijk
--------------------
## [A novel lightweight PUF based authentication protocol for IoT without explicit CRPs in verifier database](https://link.springer.com/article/10.1007/s12652-021-03421-4)
* Journal of Ambient Intelligence and Humanized Computing, 2021
* K. Nimmy, Sriram Sankaran, Krishnashree Achuthan