Gotowa bibliografia na temat „Verifiable computing”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Verifiable computing”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Verifiable computing"
Simunic, Silvio, Dalen Bernaca i Kristijan Lenac. "Verifiable Computing Applications in Blockchain". IEEE Access 9 (2021): 156729–45. http://dx.doi.org/10.1109/access.2021.3129314.
Pełny tekst źródłaYan, Zheng, Xixun Yu i Wenxiu Ding. "Context-Aware Verifiable Cloud Computing". IEEE Access 5 (2017): 2211–27. http://dx.doi.org/10.1109/access.2017.2666839.
Pełny tekst źródłaSong, Beibei, Dehua Zhou, Jiahe Wu, Xiaowei Yuan, Yiming Zhu i Chuansheng Wang. "Protecting Function Privacy and Input Privacy in the Publicly Verifiable Outsourcing Computation of Polynomial Functions". Future Internet 15, nr 4 (21.04.2023): 152. http://dx.doi.org/10.3390/fi15040152.
Pełny tekst źródłaSun, Jiameng, Binrui Zhu, Jing Qin, Jiankun Hu i Qianhong Wu. "Confidentiality-Preserving Publicly Verifiable Computation". International Journal of Foundations of Computer Science 28, nr 06 (wrzesień 2017): 799–818. http://dx.doi.org/10.1142/s0129054117400196.
Pełny tekst źródłaYao, Shuang, i Dawei Zhang. "An Anonymous Verifiable Random Function with Applications in Blockchain". Wireless Communications and Mobile Computing 2022 (19.04.2022): 1–12. http://dx.doi.org/10.1155/2022/6467866.
Pełny tekst źródłaJiao, Zi, Fucai Zhou, Qiang Wang i Jintong Sun. "RPVC: A Revocable Publicly Verifiable Computation Solution for Edge Computing". Sensors 22, nr 11 (25.05.2022): 4012. http://dx.doi.org/10.3390/s22114012.
Pełny tekst źródłaWang, Jianfeng, Xiaofeng Chen, Xinyi Huang, Ilsun You i Yang Xiang. "Verifiable Auditing for Outsourced Database in Cloud Computing". IEEE Transactions on Computers 64, nr 11 (1.11.2015): 3293–303. http://dx.doi.org/10.1109/tc.2015.2401036.
Pełny tekst źródłaXu, Lingling, i Shaohua Tang. "Verifiable computation with access control in cloud computing". Journal of Supercomputing 69, nr 2 (29.10.2013): 528–46. http://dx.doi.org/10.1007/s11227-013-1039-z.
Pełny tekst źródłaZhang, Kai, Lifei Wei, Xiangxue Li i Haifeng Qian. "Scalable and Soundness Verifiable Outsourcing Computation in Marine Mobile Computing". Wireless Communications and Mobile Computing 2017 (2017): 1–11. http://dx.doi.org/10.1155/2017/6128437.
Pełny tekst źródłaGheorghiu, Alexandru, Elham Kashefi i Petros Wallden. "Robustness and device independence of verifiable blind quantum computing". New Journal of Physics 17, nr 8 (19.08.2015): 083040. http://dx.doi.org/10.1088/1367-2630/17/8/083040.
Pełny tekst źródłaRozprawy doktorskie na temat "Verifiable computing"
Madi, Abbass. "Secure Machine Learning by means of Homomorphic Encryption and Verifiable Computing". Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG019.
Pełny tekst źródłaMachine Learning (ML) represents a new trend in science because of its power to solve problems automatically and its wide spectrum of applications (e.g., business, healthcare domain, etc.). This attractive technology caught our attention from a cryptography point of view in the sense that we worked during this Ph.D. to ensure secure usage of ML setups. Our Ph.D. work proposes a secure remote evaluation over different ML setups (for inference and for training). This thesis addresses two cornerstones: confidentiality of training or inference data and remote evaluation integrity in different ML setups (federated learning or transfer learning-based inference). In contrast, most other works focus only on data confidentiality. In our thesis, we proposed three architectures/frameworks to ensure a secure remote evaluation for the following ML setups: Neural Networks (NN), Federated Learning (FL), and Transfer Learning (TL). Particularly, our FL and TL architectures are the first that treat both the confidentiality and integrity security properties. We built these architectures using or modifying pre-existing VC schemes over homomorphic encrypted data: mainly we use VC protocols for BFV and Paillier schemes. An essential characteristic for our architectures is their generality, in the sense, if there are improvements in VC protocols and HE schemes, our frameworks can easily take into account these new approaches. This work opens up many perspectives, not only in privacy-preserving ML architectures, but also for the tools used to ensure the security properties. For example, one important perspective is to add differential privacy (DP) to our FL architecture
Sun, Wenhai. "Towards Secure Outsourced Data Services in the Public Cloud". Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/84396.
Pełny tekst źródłaPh. D.
Azraoui, Monir. "Vérifiabilité et imputabilité dans le Cloud". Thesis, Paris, ENST, 2016. http://www.theses.fr/2016ENST0032/document.
Pełny tekst źródłaThis thesis proposes more efficient cryptographic protocols that enable cloud users to verify (i) the correct storage of outsourced data and (ii) the correct execution of outsourced computation. We first describe a cryptographic protocol that generates proofs of retrievability, which enable data owners to verify that the cloud correctly stores their data. We then detail three cryptographic schemes for verifiable computation by focusing on three operations frequent in data processing routines, namely polynomial evaluation, matrix multiplication and conjunctive keyword search. The security of our solutions is analyzed in the provable security framework and we also demonstrate their efficiency thanks to prototypes. We also introduce A-PPL, an accountability policy language that allows the expression of accountability obligations into machine-readable format. We expect our contributions to foster cloud adoption by organizations still wary of using this promising paradigm
Azraoui, Monir. "Vérifiabilité et imputabilité dans le Cloud". Electronic Thesis or Diss., Paris, ENST, 2016. http://www.theses.fr/2016ENST0032.
Pełny tekst źródłaThis thesis proposes more efficient cryptographic protocols that enable cloud users to verify (i) the correct storage of outsourced data and (ii) the correct execution of outsourced computation. We first describe a cryptographic protocol that generates proofs of retrievability, which enable data owners to verify that the cloud correctly stores their data. We then detail three cryptographic schemes for verifiable computation by focusing on three operations frequent in data processing routines, namely polynomial evaluation, matrix multiplication and conjunctive keyword search. The security of our solutions is analyzed in the provable security framework and we also demonstrate their efficiency thanks to prototypes. We also introduce A-PPL, an accountability policy language that allows the expression of accountability obligations into machine-readable format. We expect our contributions to foster cloud adoption by organizations still wary of using this promising paradigm
Rathi, Nilesh. "Scaling Blockchains Using Coding Theory and Verifiable Computing". Thesis, 2021. https://etd.iisc.ac.in/handle/2005/5203.
Pełny tekst źródłaKsiążki na temat "Verifiable computing"
Demirel, Denise, Lucas Schabhüser i Johannes Buchmann. Privately and Publicly Verifiable Computing Techniques. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53798-6.
Pełny tekst źródłaSchabhüser, Lucas, Johannes Buchmann i Denise Demirel. Privately and Publicly Verifiable Computing Techniques: A Survey. Springer International Publishing AG, 2017.
Znajdź pełny tekst źródłaCzęści książek na temat "Verifiable computing"
Xu, Cheng, Ce Zhang i Jianliang Xu. "Verifiable Cloud Computing". W Encyclopedia of Wireless Networks, 1448–51. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-319-78262-1_299.
Pełny tekst źródłaXu, Cheng, Ce Zhang i Jianliang Xu. "Verifiable Cloud Computing". W Encyclopedia of Wireless Networks, 1–4. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-319-32903-1_299-1.
Pełny tekst źródłaDemirel, Denise, Lucas Schabhüser i Johannes Buchmann. "Verifiable Computing for Specific Applications". W Privately and Publicly Verifiable Computing Techniques, 43–47. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53798-6_7.
Pełny tekst źródłaDemirel, Denise, Lucas Schabhüser i Johannes Buchmann. "Proof and Argument Based Verifiable Computing". W Privately and Publicly Verifiable Computing Techniques, 13–22. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53798-6_3.
Pełny tekst źródłaDemirel, Denise, Lucas Schabhüser i Johannes Buchmann. "Verifiable Computing from Fully Homomorphic Encryption". W Privately and Publicly Verifiable Computing Techniques, 23–25. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53798-6_4.
Pełny tekst źródłaDemirel, Denise, Lucas Schabhüser i Johannes Buchmann. "Verifiable Computing Frameworks from Functional Encryption and Functional Signatures". W Privately and Publicly Verifiable Computing Techniques, 37–41. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53798-6_6.
Pełny tekst źródłaMadi, Abbass, Renaud Sirdey i Oana Stan. "Computing Neural Networks with Homomorphic Encryption and Verifiable Computing". W Lecture Notes in Computer Science, 295–317. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-61638-0_17.
Pełny tekst źródłaDemirel, Denise, Lucas Schabhüser i Johannes Buchmann. "Introduction". W Privately and Publicly Verifiable Computing Techniques, 1–3. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53798-6_1.
Pełny tekst źródłaDemirel, Denise, Lucas Schabhüser i Johannes Buchmann. "Preliminaries". W Privately and Publicly Verifiable Computing Techniques, 5–11. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53798-6_2.
Pełny tekst źródłaDemirel, Denise, Lucas Schabhüser i Johannes Buchmann. "Homomorphic Authenticators". W Privately and Publicly Verifiable Computing Techniques, 27–35. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53798-6_5.
Pełny tekst źródłaStreszczenia konferencji na temat "Verifiable computing"
Fournet, Cedric, Chantal Keller i Vincent Laporte. "A Certified Compiler for Verifiable Computing". W 2016 IEEE 29th Computer Security Foundations Symposium (CSF). IEEE, 2016. http://dx.doi.org/10.1109/csf.2016.26.
Pełny tekst źródłaLiu, Shushu, i Zheng Yan. "Verifiable Edge Computing for Indoor Positioning". W ICC 2020 - 2020 IEEE International Conference on Communications (ICC). IEEE, 2020. http://dx.doi.org/10.1109/icc40277.2020.9148819.
Pełny tekst źródłaGennaro, Rosario. "Verifiable Outsourced Computation". W PODC '17: ACM Symposium on Principles of Distributed Computing. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3087801.3087872.
Pełny tekst źródłaHsu, Shuo-Fang, Yu-Jie Chang, Ran-Zan Wang, Yeuan-Kuen Lee i Shih-Yu Huang. "Verifiable Visual Cryptography". W 2012 Sixth International Conference on Genetic and Evolutionary Computing (ICGEC). IEEE, 2012. http://dx.doi.org/10.1109/icgec.2012.150.
Pełny tekst źródłaXiang, Tao, Weimin Zhang i Fei Chen. "A verifiable PSO algorithm in cloud computing". W 2014 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2014. http://dx.doi.org/10.1109/cec.2014.6900252.
Pełny tekst źródłaSekar, Vyas, i Petros Maniatis. "Verifiable resource accounting for cloud computing services". W the 3rd ACM workshop. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2046660.2046666.
Pełny tekst źródłaDolev, Shlomi, i Arseni Kalma. "Verifiable Computing Using Computation Fingerprints Within FHE". W 2021 IEEE 20th International Symposium on Network Computing and Applications (NCA). IEEE, 2021. http://dx.doi.org/10.1109/nca53618.2021.9685831.
Pełny tekst źródłaWen, Zhaocong, Jinman Luo, Huajun Chen, Jiaxiao Meng, Xuan Li i Jin Li. "A Verifiable Data Deduplication Scheme in Cloud Computing". W 2014 International Conference on Intelligent Networking and Collaborative Systems (INCoS). IEEE, 2014. http://dx.doi.org/10.1109/incos.2014.111.
Pełny tekst źródłaIslam, Mohammad Kamrul, i Ragib Hasan. "Verifiable Data Redundancy in the Cloud". W 2016 IEEE International Conferences on Big Data and Cloud Computing (BDCloud), Social Computing and Networking (SocialCom), Sustainable Computing and Communications (SustainCom) (BDCloud-SocialCom-SustainCom). IEEE, 2016. http://dx.doi.org/10.1109/bdcloud-socialcom-sustaincom.2016.16.
Pełny tekst źródłaChen, Yi-Hui, Ci-Wei Lan i Chiao-Chih Huang. "A Verifiable Visual Cryptography Scheme". W 2011 Fifth International Conference on Genetic and Evolutionary Computing (ICGEC). IEEE, 2011. http://dx.doi.org/10.1109/icgec.2011.53.
Pełny tekst źródła