Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Communications in computer and information science

Elliptic Curve Based Secure Outsourced Computation in Multi-party Cloud Environment

V. Thangam, K. Chandrasekaran

Published Jan 1, 2016• 1 citation
Publisher
DOI
10.1007/978-981-10-2738-3_17

Related papers

Generic server-aided secure multi-party computation in cloud computing

Yulin Wu, Xuan Wang, Willy Susilo +4 more

Computer Standards & Interfaces•Jun 29, 2021•38 citations

Secure outsourced decryption for FHE-based privacy-preserving cloud computing

Xirong Ma, Chuan Li, Yuchang Hu +5 more

arXiv:2406.19964•Journal of Information Security and Applications•Oct 16, 2024•4 citations

More Secure Outsource Protocol for Matrix Multiplication in Cloud Computing

Xu An Wang, Shuaishuai Zhu, Arun Kumar Sangaiah +2 more

Lecture notes on data engineering and communications technologies•Oct 16, 2018•3 citations

QSKCG: Quantum‐based secure key communication and key generation scheme for outsourced data in cloud

A. Vamshi, Eswari Rajagopal

Abstract In the era of digital proliferation, individuals opt for cloud servers to store their data due to the diverse advantages they offer. However, entrusting data to cloud servers relinquishes users' control, potentially compromising data confidentiality and integrity. Traditional auditing methods designed to ensure data integrity in cloud servers typically depend on Trusted Third Party Auditors. Yet, many of these existing auditing approaches grapple with intricate certificate management and key escrow issues. Furthermore, the imminent threat of powerful quantum computers poses a risk of swiftly compromising these methods in polynomial time. To overcome these challenges, this paper introduces a Quantum‐based Secure Key Communication and Key Generation Scheme QSKCG for Outsourced Data in the Cloud. Leveraging Elliptic Curve Cryptography, the BB84 secure communication protocol, certificateless signature, and blockchain network, the proposed scheme is demonstrated through security analysis, affirming its robustness and high efficiency. Additionally, performance analysis underscores the practicality of the proposed scheme in achieving post‐quantum security in cloud storage.

Concurrency and Computation Practice and Experience•Jun 11, 2024•3 citations

Secure Multiparty Computation in Cloud Computing

Han Jiang, Qiuliang Xu

Journal of Computer Research and Development•Oct 1, 2016•1 citation

Elliptic curve cryptography based secure multi-party computation over discrete algebraic structures

Mamta Koban, Shivaji Gadadhe, Deepali Yewale +1 more

Secure multi-party computation (MPC) enables mutually distrusting parties to jointly evaluate a function over their private inputs without revealing those inputs to any participant.Classical MPC constructions based on Boolean or arithmetic circuits incur significant computational overhead when deployed over large participant groups, and their security guarantees rest upon hardness assumptions that are vulnerable to quantum adversaries.This paper introduces an elliptic curve cryptography-based secure MPC framework that exploits the algebraic structure of elliptic curve groups over finite fields to construct efficient oblivious transfer extensions, Beaver triple generation, and verifiable secret sharing protocols.The framework models the computation as a directed acyclic graph over the elliptic curve group law, enabling algebraic optimizations that reduce the number of point multiplications required per gate evaluation.Pedersen commitments over the curve group provide unconditionally hiding and computationally binding commitment guarantees, while zeroknowledge proofs of knowledge of discrete logarithms authenticate each party's contribution without information leakage.Security is formalized in the universal composability (UC) framework under the decisional Diffie-Hellman (DDH) assumption in the standard model.Evaluation on benchmark circuits including AES key expansion, SHA-3 compression, and private set intersection demonstrates that the proposed EC-MPC protocol achieves 42.3 ms per gate for a four-party evaluation, outperforming BGW by 52.8% and GMW by 42.9% in identical configurations.The framework scales to 32-party computations with sub-quadratic communication overhead, confirming its practicality for cloud-based secure computation, privacy-preserving machine learning inference, and federated healthcare analytics.

Journal of Discrete Mathematical Sciences and Cryptography•Sep 30, 2026•0 citations
Abstract In the era of digital proliferation, individuals opt for cloud servers to store their data due to the diverse advantages they offer. However, entrusting data to cloud servers relinquishes users' control, potentially compromising data confidentiality and integrity. Traditional auditing methods designed to ensure data integrity in cloud servers typically depend on Trusted Third Party Auditors. Yet, many of these existing auditing approaches grapple with intricate certificate management and key escrow issues. Furthermore, the imminent threat of powerful quantum computers poses a risk of swiftly compromising these methods in polynomial time. To overcome these challenges, this paper introduces a Quantum‐based Secure Key Communication and Key Generation Scheme QSKCG for Outsourced Data in the Cloud. Leveraging Elliptic Curve Cryptography, the BB84 secure communication protocol, certificateless signature, and blockchain network, the proposed scheme is demonstrated through security analysis, affirming its robustness and high efficiency. Additionally, performance analysis underscores the practicality of the proposed scheme in achieving post‐quantum security in cloud storage.
Secure multi-party computation (MPC) enables mutually distrusting parties to jointly evaluate a function over their private inputs without revealing those inputs to any participant.Classical MPC constructions based on Boolean or arithmetic circuits incur significant computational overhead when deployed over large participant groups, and their security guarantees rest upon hardness assumptions that are vulnerable to quantum adversaries.This paper introduces an elliptic curve cryptography-based secure MPC framework that exploits the algebraic structure of elliptic curve groups over finite fields to construct efficient oblivious transfer extensions, Beaver triple generation, and verifiable secret sharing protocols.The framework models the computation as a directed acyclic graph over the elliptic curve group law, enabling algebraic optimizations that reduce the number of point multiplications required per gate evaluation.Pedersen commitments over the curve group provide unconditionally hiding and computationally binding commitment guarantees, while zeroknowledge proofs of knowledge of discrete logarithms authenticate each party's contribution without information leakage.Security is formalized in the universal composability (UC) framework under the decisional Diffie-Hellman (DDH) assumption in the standard model.Evaluation on benchmark circuits including AES key expansion, SHA-3 compression, and private set intersection demonstrates that the proposed EC-MPC protocol achieves 42.3 ms per gate for a four-party evaluation, outperforming BGW by 52.8% and GMW by 42.9% in identical configurations.The framework scales to 32-party computations with sub-quadratic communication overhead, confirming its practicality for cloud-based secure computation, privacy-preserving machine learning inference, and federated healthcare analytics.