Items where Subject is "46 INFORMATION AND COMPUTING SCIENCES > 4604 Cybersecurity and privacy > 460401 Cryptography"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0 [feed] RSS 2.0
Group by: Creators | Item Type
Number of items at this level: 14.

Article

Cianciullo, Louis, and Ghodosi, Hossein (2022) Unconditionally Secure Oblivious Polynomial Evaluation: A Survey and New Results. Journal of computer science and technology, 37 (2). pp. 443-458.

Chawla, Shailey (2020) Goal oriented requirements engineering for blockchain based food supply chain. International Journal of Software Engineering and Computer Systems, 6 (2). pp. 94-103.

Aslam, Md Nazish, Belazi, Akram, Kharbech, Sofiane, Talha, Muhammad, and Xiang, Wei (2019) Fourth order MCA and chaos-based image encryption scheme. IEEE Access, 7. pp. 66395-66409.

Prihandoko, Antonius Cahya, Ghodosi, Hossein, and Litow, Bruce (2017) White-box implementation to advantage DRM. International Journal on Advanced Science, Engineering and Information Technology, 7 (2). pp. 460-467.

Prihandoko, Antonius Cahya, Ghodosi, Hossein, and Litow, Bruce (2016) Scenarios for securing content delivery in the DRM environment. INFORMAL: Informatics Journal, 1 (1). pp. 32-38.

Conference Item

Hamidi, Amirreza, and Ghodosi, Hossein (2023) Efficient Distributed Keys Generation of Threshold Paillier Cryptosystem. In: Lecture Notes in Computer Science (13809) pp. 117-132. From: SecITC 2022: 15th International Conference on Innovative Security Solutions for Information Technology and Communications, 8-9 December 2022, Virtual.

Hamidi, Amirreza, and Ghodosi, Hossein (2023) Fair Distributed Oblivious Polynomial Evaluation via Bitcoin Deposits: Compute-as-a-Service. In: Lecture Notes in Computer Science (14324) pp. 73-86. From: NordSEC 2023: Nordic Conference on Secure IT Systems, 16-17 November 2023, Oslo, Norway.

Hamidi, Amirreza, and Ghodosi, Hossein (2023) Outsourcing Verifiable Distributed Oblivious Polynomial Evaluation from Threshold Cryptography. In: Lecture Notes in Computer Science (14252) pp. 235-246. From: ICICS 2023: 25th International Conference on Information and Communications Security, 18-20 November 2023, Tianjin, China.

Hamidi, Amirreza, and Ghodosi, Hossein (2023) Unconditionally Fast Secure Multi-party Computation with Multi-depths Gates Using Pre-computed Information. In: Lecture Notes in Networks and Systems (448) pp. 329-340. From: ICICT 2022: 7th International Congress on Information and Communication Technology, 21-24 February 2022, London, UK.

Hamidi, Amirreza, and Ghodosi, Hossein (2022) Verifiable DOPE from Somewhat Homomorphic Encryption, and the Extension to DOT. In: Lecture Notes in Computer Science (13580) pp. 105-120. From: SciSec 2022: 4th International Conference on Science of Cyber Security, 10-12 August 2022, Matsue, Japan.

Cianciullo, Louis, and Ghodosi, Hossein (2019) Efficient information theoretic multi-party computation from oblivious linear evaluation. In: Lecture Notes in Computer Science (11469) pp. 78-90. From: Information Security Theory and Practice, 12th IFIP WG 11.2 International Conference, WISTP 2018, 10 - 11 December 2018, Brussels, Belgium.

Cianciullo, Louis, and Ghodosi, Hossein (2019) Unconditionally secure distributed oblivious polynomial evaluation. In: Lecture Notes in Computer Science (11396) pp. 132-142. From: Information Security and Cryptology – ICISC 2018, 28-30 November 2018, Seoul, South Korea.

Prihandoko, Antonius Cahya, and Ghodosi, Hossein (2017) Oblivious content distribution system to advantage Digital Rights Management. In: Proceedings of the 4th International Conference on Computer Applications and Information Processing and Technology. pp. 266-270. From: CAIPT 2017: 4th International Conference on Computer Applications and Information Processing and Technology, 8-10 August 2017, Kuta Bali, Indonesia.

Thesis

Cianciullo, Louis (2022) Investigation of unconditionally secure multi-party computation. PhD thesis, James Cook University.

This list was generated on Tue Dec 24 22:44:40 2024 AEST.