Secret Sharing Scheme Research Articles

Secret Sharing Schemes for Data Protection and Secure Communication: A Review

Secret sharing, also one of the significant concepts, plays a vital role in computer science for guaranteed data security and secure communication with advanced digital security demands. This paper focuses on theoretical aspects, historical development, and various schemes of secret sharing using Shamir's polynomial-based and Blakely's geometric methods. Indeed, this importance in modern security is difficult to underestimate. It is based on a comprehensive literature review and the effectiveness of schemes in access control, data storage, and secure communications. From the evaluation, it can be seen that secret sharing prevents unauthorized access and secures against single points of failure very effectively; therefore, it finds wide usage in various secure applications. From this study, it can be concluded that secret sharing is a very flexible and core tool in the field of information security with possibilities for improvement up to the challenge of developing technological threats. The nature of the problem being addressed is the increasing need for superior protection in safeguarding sensitive data in a growing digital world

A Quantum Image Secret Sharing Scheme Based on Designated Multi‐Verifier Signature

AbstractThis paper presents a quantum image secret sharing scheme based on designated multi‐verifier signature. First, share images are generated by a 2D hyperchaotic system incorporating sinusoidal mapping, Henon mapping, and Cubic mapping using the cascade modulation method. Quantum Arnold scrambling and diffusion are performed on the secret image. Subsequently, the concept of designated multi‐verifier signature is introduced. In the secret image sharing phase, the pixel values of the share images are used to sign the secret image, and the signed secret image and share images are sent to a trusted third party and designated verifiers, respectively. In this scheme, no carrier images are required, and the share images held by the participants do not contain any information about the secret image. Finally, simulation experiments and security analysis are conducted on IBM Qiskit platform and Matlab software.

Higher-Order Cellular Automata Generated Symmetry-Protected Topological Phases and Detection Through Multi Point Strange Correlators

In computer and system sciences, higher-order cellular automata (HOCA) are a type of cellular automata that evolve over multiple time steps and generate complex patterns, which have various applications, such as secret-sharing schemes, data compression, and image encryption. In this paper, we introduce HOCA to quantum many-body physics and construct a series of symmetry-protected topological (SPT) phases of matter, in which symmetries are supported on a great variety of subsystems embbeded in the SPT bulk. We call these phases HOCA-generated SPT (HGSPT) phases. Specifically, we show that HOCA can generate not only well-understood SPTs with symmetries supported on either regular (e.g., linelike subsystems in the two-dimensional cluster model) or fractal subsystems, but also a large class of unexplored SPTs with symmetries supported on more choices of subsystems. One example is that has either fractal and linelike subsystem symmetries simultaneously or two distinct types of fractal symmetries simultaneously. Another example is in which chaotic-looking symmetries are significantly different from and thus cannot reduce to fractal or regular subsystem symmetries. We also introduce a new notation system to characterize HGSPTs. We prove that all possible subsystem symmetries in a square lattice can be locally simulated by an HOCA-generated symmetry. As the usual two-point strange correlators are trivial in most HGSPTs, we find that the nontrivial SPT orders can be detected by what we call . We propose a universal procedure to design the spatial configuration of the multi point strange correlators for a given HGSPT phase. Specifically, we find deep connections between multi point strange correlators and the spurious topological entanglement entropy (STEE), both exhibiting long-range behavior in a short-range entangled state. Our HOCA approaches and multi point strange correlators pave the way for a unified paradigm to design, classify, and detect phases of matter with symmetries supported on a great variety of subsystems, and also provide potential useful perspective in surpassing the computational irreducibility of HOCA in a quantum mechanical way. Published by the American Physical Society 2024

Randomness Recoverable Secret Sharing Schemes

Randomness Recoverable Secret Sharing Schemes

Dual-band complex-amplitude metasurface empowered high security cryptography with ultra-massive encodable patterns

Abstract The significance of a cryptograph method lies in its ability to provide high fidelity, high security, and large capacity. The emergence of metasurface-empowered cryptography offers a promising alternative due to its unparalleled wavefront modulation capabilities and easy integration with traditional schemes. However, the majority of reported strategies suffer from limited capacity as a result of restricted independent information channels. In this study, we present a novel method of cryptography that utilizes a dual-band complex-amplitude meta-hologram. The method allows for the encoding of 225 different patterns by combining a modified visual secret-sharing scheme (VSS) and a one-time-pad private key. The use of complex-amplitude modulation and the modified VSS enhances the quality and fidelity of the decrypted results. Moreover, the transmission of the private key through a separate mechanism can greatly heighten the security, and different patterns can be generated simply by altering the private key. To demonstrate the feasibility of our approach, we design, fabricate, and characterize a meta-hologram prototype. The measured results are in good agreement with the numerical ones and the design objectives. Our proposed strategy offers high security, ultra-capacity, and high fidelity, making it highly promising for applications in information encryption and anti-counterfeiting.

Empowering Data Owners: An Efficient and Verifiable Scheme for Secure Data Deletion

Cloud services have attracted numerous enterprises, organizations, and individual users due to their exceptional computing power and almost limitless storage capacity. A vast amount of business data and private data are continuously uploaded to the cloud platform, driven by a series of attractive services offered by the cloud. Unfortunately, once data is uploaded to the cloud, its owner has no way of ensuring that it is actually deleted as intended. This obviously increases the concerns of data owners about the security of their data, because it is related to the privacy of users. Therefore, there must be a reliable solution to prove that data is deleted as requested by users, to prevent data leakage or abuse. In existing data deletion schemes, most are designed based on cryptographic knowledge rather than erasure or overwrite techniques, in order not to cause incalculable damage to the storage medium. However, most cryptographic-based data deletion schemes, particularly attribute-based encryption, involve numerous complex bilinear mapping operations, which are expensive for most devices. To address this issue, the paper proposes an Efficient and Verifiable Scheme for Secure Data Deletion (EVSD). Firstly, Elliptic Curve Cryptography (ECC) is introduced to achieve efficient encryption of data. Then, leveraging Linear Secret Sharing Scheme (LSSS), fine-grained data deletion policies supporting logical operations are implemented. Finally, the deletion of the data is efficiently verified using the root of the Merkle Hash Tree (MHT) generated by the defined illegal and legal attributes, while the deletion proof is also generated. Satisfactorily, security analysis shows that the EVSD scheme is much more advantageous compared to existing schemes, and a trait likewise is also observed in the performance evaluation.

Privacy-preserving distributed market mechanism for active distribution networks

Amidst the worldwide efforts to decarbonize power networks, Local Electricity Markets (LEMs) in distribution networks are gaining importance due to the increased adoption of renewable energy sources and prosumers. Considering that LEMs involve data exchange among independent entities, privacy and cybersecurity are some of the main practical challenges in LEM design. This paper proposes a secure market protocol using innovations from distributed optimization and Secure MultiParty Computation (SMPC). The considered LEM is formulated as an uncertainty-aware joint market for energy and reserves with affine balancing policies. To achieve scalability and enable the use of SMPC, market clearing is solved using the Consensus ADMM algorithm. Subsequently, the data exchange among participants via ADMM iterations is protected using the Shamir secret-sharing scheme to ensure privacy. The market protocol is further reinforced by a secure and verifiable settlement process that uses SMPC and ElGamal commitments to verify market quantities and by a secure recovery scheme for missing network measurements. Finally, the feasibility and performance of the proposed LEM are evaluated on a 15-bus test network.

Efficient attribute-based strong designated verifier signature scheme based on elliptic curve cryptography.

In an attribute-based strong designated verifier signature, a signer who satisfies the access structure signs the message and assigns it to a verifier who satisfies the access structure to verify it, which enables fine-grained access control for signers and verifiers. Such signatures are used in scenarios where the identity of the signer needs to be protected, or where the public verifiability of the signature is avoided and only the designated recipient can verify the validity of the signature. To address the problem that the overall overhead of the traditional attribute-based strong designated verifier signature scheme is relatively large, an efficient attribute-based strong designated verifier signature scheme based on elliptic curve cryptography is proposed, as well as a security analysis of the new scheme given in the standard model under the difficulty of the elliptic curve discrete logarithm problem (ECDLP). On the one hand, the proposed scheme is based on elliptic curve cryptography and uses scalar multiplication on elliptic curves, which is computationally lighter, instead of bilinear pairing, which has a higher computational overhead in traditional attribute-based signature schemes. This reduces the computational overhead of signing and verification in the system, improves the efficiency of the system, and makes the scheme more suitable for resource-constrained cloud end-user scenarios. On the other hand, the proposed scheme uses LSSS (Linear Secret Sharing Schemes) access structure with stronger access policy expression, which is more efficient than the "And" gate or access tree access structure, making the computational efficiency of the proposed scheme meet the needs of resource-constrained cloud end-users.

BAFL-SVM: A blockchain-assisted federated learning-driven SVM framework for smart agriculture

The combination of blockchain and Internet of Things technology has made significant progress in smart agriculture, which provides substantial support for data sharing and data privacy protection. Nevertheless, achieving efficient interactivity and privacy protection of agricultural data remains a crucial issues. To address the above problems, we propose a blockchain-assisted federated learning-driven support vector machine (BAFL-SVM) framework to realize efficient data sharing and privacy protection. The BAFL-SVM is composed of the FedSVM-RiceCare module and the FedPrivChain module. Specifically, in FedSVM-RiceCare, we utilize federated learning and SVM to train the model, improving the accuracy of the experiment. Then, in FedPrivChain, we adopt homomorphic encryption and a secret-sharing scheme to encrypt the local model parameters and upload them. Finally, we conduct a large number of experiments on a real-world dataset of rice pests and diseases, and the experimental results show that our framework not only guarantees the secure sharing of data but also achieves a higher recognition accuracy compared with other schemes.

Size-invariant two-in-one image secret sharing scheme based on gray mixing model

TiOISSS (Two-in-One Image Secret Sharing Scheme) can reconstruct the secret through computation and realize secret preview recovery when the power system is destroyed or the network is paralyzed. However, the visual quality of previewing images obtained by the existing TiOISSS is not satisfactory and usually affected by pixel expansion. To resolve the two problems, this paper introduces multiple gray values in the share image generation stage and establishes an optimization model to obtain the grayscale probabilistic matrix needed in the encoding stage. By using the probability matrix, a secret sharing algorithm is designed to obtain size-invariant shares with multiple gray values. Then, the secret information of another image can be shared and embedded into the multi-level gray shares through Lagrange polynomials over finite fields. In the decryption stage, the electronic shares can be directly superimposed based on a gray mixing model, or they can be printed to transparent films by a multi-level gray printer and then superimposed to obtain the preview image. If computational devices are available, a high-resolution gray image can be obtained by Lagrange interpolation over finite fields. Experimental results indicate that the proposed scheme is effective for generating shares without pixel expansion and improving the preview image quality.

Traceable Attribute-Based Encryption Scheme Using BIM Collaborative Design

BIM collaborative design involves numerous participants from various specialties who create and share vast amounts of design data at different design stages to ensure the efficient transmission of design data between these specialties. It is imperative for the BIM collaborative design platform to guarantee the security of design data and effectively trace any instances of malicious leakage or tampering. Therefore, this paper proposes a traceable ciphertext-policy attribute-based encryption scheme (TCP-ABE) that formulates a dynamic data access control mechanism based on different participants and effectively tracks malicious users in the event of risks such as tampering, theft, and unauthorized access to BIM data. In this scheme, the user’s identity information is embedded into their private key as a key component, ensuring that only users who satisfy the access policy can decrypt it. The compromised private key allows for tracing of the user’s identity. Additionally, Linear Secret Sharing Scheme (LSSS) is employed as the access structure with the user’s attribute set divided into an attribute name set and an attribute value set to protect privacy by concealing the latter within the access policy. Furthermore, the scheme integrates blockchain with cloud storage as a trusted third-party storage mechanism to ensure data integrity. Finally, the TCP-ABE scheme is comprehensively evaluated by comparing its strengths and weaknesses with other algorithms. This evaluation includes a theoretical analysis of functional and computational time overhead aspects, as well as an experimental analysis of initialization time, data encryption time, and data decryption time. The scheme exhibits excellent performance across all stages and encompasses the most comprehensive functionalities, as demonstrated by the comparative analysis and experimental results.

Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience

In this work, we study almost-surely terminating asynchronous Byzantine agreement (ABA) for n parties tolerating a computationally-unbounded adversary. While the existing works in this domain have primarily considered a threshold adversarial model where the adversary can corrupt any subset of up to t parties, very little attention has been paid to the non-threshold adversarial model. In the latter model, the corruption capacity of the adversary is characterized by an adversary structure Z, which enumerates all possible subsets of potentially corrupt parties and where the adversary can select any one subset from Z for corruption. While the optimal resilience for ABA against threshold adversaries is t<n/3, against non-threshold adversaries one can design an ABA protocol, provided Z satisfies the Q(3) condition; i.e. if the union of no three subsets from Z covers all the n parties. We present the first almost-surely terminating ABA protocol against Q(3) adversary structures. Previously, almost-surely terminating ABA protocol is known with non-optimal resilience where Z satisfies the Q(4) condition; i.e. if the union of no four subsets from Z covers all the n parties. To design our protocol, we present a shunning asynchronous verifiable secret-sharing (SAVSS) scheme for Q(3) adversary structures, which is of independent interest.

Accelerating randomized image secret sharing with GPU: contrast enhancement and secure reconstruction using progressive and convolutional approaches

AbstractImage Secret Sharing (ISS) is a cryptographic technique used to distribute secret images among multiple users. However, current Visual Secret Sharing (VSS) schemes produce a halftone image with only 50% contrast when reconstructing the original image. To overcome this limitation, the Randomized Image Secret Sharing (RISS) scheme was introduced. RISS achieves a higher contrast of 70% when extracting the secret image but comes with a high computational cost. This research paper presents a novel approach called Graphics Processing Unit (GPU)-based Randomized Image Secret Sharing (GRISS), which utilizes data parallelism within the RISS pipeline. The proposed technique also incorporates an Autoencoder-based Single Image Super-Resolution (ASISR) to enhance the contrast of the recovered image. The performance of GRISS is evaluated against RISS, and the contrast of the ASISR images is compared to current benchmark models. The results demonstrate that GRISS outperforms state-of-the-art models in both efficiency and effectiveness.

Lattice-Based Threshold Secret Sharing Scheme and Its Applications: A Survey

As the most popular cryptographic scheme in the post-quantum field, lattices have received extensive attention and research. Not only do they provide quantum-resistant security, they also enable the construction of complex applications. Currently, lattice cryptography schemes based on different difficult problems have been applied in different fields. The threshold secret sharing (TSS) scheme is an important field of cryptography and has important application value and development prospects in key protection, secure multi-party computation, privacy protection, etc. However, with the rapid development of quantum computing, many existing cryptography-underlying technologies are facing huge difficulties and challenges. Therefore, post-quantum TSS has important research significance and value for the future development of cryptography. In this paper, we summarize the existing secret sharing schemes based on lattice-hard problems and the relevant applications of these schemes in the post-quantum realm. We classify existing lattice-based TSS according to different functions and introduce typical solutions. To the best of our knowledge, this is the first review paper on lattice-based TSS schemes.

Verifiable Quantum Secret Sharing Scheme Based on LDPC Codes

Verifiable Quantum Secret Sharing Scheme Based on LDPC Codes

Semantic pixel encoding visual secret sharing technique for balancing quality and security in color images

&lt;p&gt;Color images are widely utilized across various domains, encompassing digital media and extending to critical applications in satellite and military arenas. As the significance of these images has grown, the need to protect their content from unauthorized access and potential threats has been underscored. Visual Secret Sharing (VSS) schemes have been proposed as effective mechanisms, with images being encrypted into multiple shares that, individually, offer no discernible information about the original content. Nevertheless, issues such as pixel expansion have been noted in traditional VSS methods, which result in increased complexity and a potential compromise in image quality. Maintaining impeccable image quality is emphasized, mainly since critical application decisions are often based on the clarity and accuracy of image details. The Semantic Pixel Encoding Visual Secret Sharing (SPEVSS) technique is proposed to address these identified challenges. A robust mechanism has been formulated through the integration of semantic pixel encoding with VSS, effectively countering pixel expansion while preserving the fidelity of the original image. As a result of this research, computational complexity has been significantly reduced, decryption methodologies have been made more efficient, and a more robust security framework for colour images has been established. The performance of the proposed SPEVSS shows the reconstructed images show the PSNR of 42 dB has been recorded in images processed, underscoring the method’s capability to balance security and optimal image quality.&lt;/p&gt;

A New Security Measure in Secret Sharing Schemes and Secure Network Coding

A New Security Measure in Secret Sharing Schemes and Secure Network Coding

A Self-Authenticating Multi-Tone Secret Sharing Scheme Using Meaningful Shares for Satellite Images

A Self-Authenticating Multi-Tone Secret Sharing Scheme Using Meaningful Shares for Satellite Images

A New Shift-Add Secret Sharing Scheme for Partial Data Protection With Parallel Zigzag Decoding

A New Shift-Add Secret Sharing Scheme for Partial Data Protection With Parallel Zigzag Decoding

A Dynamic Proactive Secret Sharing Scheme for Quadratic Functions

A Dynamic Proactive Secret Sharing Scheme for Quadratic Functions