Related papers: Comment on "Improved RSA Technique with Efficient Data Integrity Verification for Outsourcing Database in Cloud"

Related papers

Anamorphic Cryptography using Baby-Step Giant-Step Recovery [0.46040036610482665]
This paper outlines the implementation of Anamorphic Cryptography using ECC (Elliptic Curve Cryptography)<n>It outlines how the secret message sent to Alice is hidden within the random nonce value, which is used within the encryption process.<n>It also shows that the BSGS (Baby-step Giant-step) variant significantly outperforms unoptimised elliptic curve methods.
arXiv Detail & Related papers (2025-04-21T12:53:32Z)
Post-Quantum Homomorphic Encryption: A Case for Code-Based Alternatives [0.6749750044497732]
Homomorphic Encryption (HE) allows secure and privacy-protected computation on encrypted data without the need to decrypt it. Most of the current PQHE algorithms are secured by lattice-based problems. Code-based encryption is a novel way to diversify post-quantum algorithms.
arXiv Detail & Related papers (2025-03-28T06:49:22Z)
The Beginner's Textbook for Fully Homomorphic Encryption [1.6679662639178265]
Fully Homomorphic Encryption (FHE) is a cryptographic scheme that enables computations to be performed directly on encrypted data.<n>FHE enables privacy-preserving machine learning by allowing a server to process the client's data in its encrypted form through an ML model.<n>Other applications of FHE include secure outsourcing of data analytics, encrypted database queries, privacy-preserving searches, efficient multi-party for digital signatures.
arXiv Detail & Related papers (2025-03-07T04:29:11Z)
Cryptanalysis on Lightweight Verifiable Homomorphic Encryption [7.059472280274008]
Verifiable Homomorphic Encryption (VHE) is a cryptographic technique that integrates Homocrypt Encryption (HE) with Verifiable Computation (VC) This paper presents efficient attacks that exploit the homomorphic properties of encryption schemes.
arXiv Detail & Related papers (2025-02-18T08:13:10Z)
Secure Semantic Communication With Homomorphic Encryption [52.5344514499035]
This paper explores the feasibility of applying homomorphic encryption to SemCom. We propose a task-oriented SemCom scheme secured through homomorphic encryption.
arXiv Detail & Related papers (2025-01-17T13:26:14Z)
Registered Attribute-Based Encryption with Reliable Outsourced Decryption Based on Blockchain [12.205762282360482]
Attribute-based encryption (ABE) is a promising solution that enables fine-grained access control in data sharing.<n>We propose the first auditable RABE scheme with reliable outsourced decryption (ORABE) based on blockchain.
arXiv Detail & Related papers (2024-12-12T05:38:50Z)
Enc2DB: A Hybrid and Adaptive Encrypted Query Processing Framework [47.11111145443189]
We introduce Enc2DB, a novel secure database system following a hybrid strategy on and openGauss. We present a micro-benchmarking test and self-adaptive mode switch strategy that can choose the best execution path (cryptography or TEE) to answer a given query. We also design and implement a ciphertext index compatible with native cost model and querys to accelerate query processing.
arXiv Detail & Related papers (2024-04-10T08:11:12Z)
Ciphertext-Only Attack on a Secure $k$-NN Computation on Cloud [0.0]
encryption can prevent unauthorized access, data breaches, and the resultant financial loss, reputation damage, and legal issues. Sanyashi et al. proposed an encryption scheme to facilitate privacy-preserving $k$-NN computation on the cloud. We give an efficient algorithm and empirically demonstrate that their encryption scheme is vulnerable to the ciphertext-only attack (COA)
arXiv Detail & Related papers (2024-03-14T03:53:01Z)
CodeChameleon: Personalized Encryption Framework for Jailbreaking Large Language Models [49.60006012946767]
We propose CodeChameleon, a novel jailbreak framework based on personalized encryption tactics. We conduct extensive experiments on 7 Large Language Models, achieving state-of-the-art average Attack Success Rate (ASR) Remarkably, our method achieves an 86.6% ASR on GPT-4-1106.
arXiv Detail & Related papers (2024-02-26T16:35:59Z)
A Survey on Property-Preserving Database Encryption Techniques in the Cloud [0.0]
There are concerns about the security and confidentiality of the outsourced data. The report at hand presents a survey on common encryption techniques used for storing data in relation Cloud database services.
arXiv Detail & Related papers (2023-12-19T11:50:31Z)
Lightweight Public Key Encryption in Post-Quantum Computing Era [0.0]
Confidentiality in our digital world is based on the security of cryptographic algorithms. In the course of technological progress with quantum computers, the protective function of common encryption algorithms is threatened. Our concept describes the transformation of a classical asymmetric encryption method to a modern complexity class.
arXiv Detail & Related papers (2023-11-24T21:06:42Z)
RiDDLE: Reversible and Diversified De-identification with Latent Encryptor [57.66174700276893]
This work presents RiDDLE, short for Reversible and Diversified De-identification with Latent Encryptor. Built upon a pre-learned StyleGAN2 generator, RiDDLE manages to encrypt and decrypt the facial identity within the latent space.
arXiv Detail & Related papers (2023-03-09T11:03:52Z)
Revocable Cryptography from Learning with Errors [61.470151825577034]
We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
arXiv Detail & Related papers (2023-02-28T18:58:11Z)
Verifiable Encodings for Secure Homomorphic Analytics [10.402772462535884]
Homomorphic encryption is a promising solution for protecting privacy of cloud-delegated computations on sensitive data. We propose two error detection encodings and build authenticators that enable practical client-verification of cloud-based homomorphic computations. We implement our solution in VERITAS, a ready-to-use system for verification of outsourced computations executed over encrypted data.
arXiv Detail & Related papers (2022-07-28T13:22:21Z)
Recovering AES Keys with a Deep Cold Boot Attack [91.22679787578438]
Cold boot attacks inspect the corrupted random access memory soon after the power has been shut down. In this work, we combine a novel cryptographic variant of a deep error correcting code technique with a modified SAT solver scheme to apply the attack on AES keys. Our results show that our methods outperform the state of the art attack methods by a very large margin.
arXiv Detail & Related papers (2021-06-09T07:57:01Z)
A brief history on Homomorphic learning: A privacy-focused approach to machine learning [2.055949720959582]
Homomorphic encryption allows running arbitrary operations on encrypted data. It enables us to run any sophisticated machine learning algorithm without access to the underlying raw data. It took more than 30 years of collective effort to finally find the answer "yes"
arXiv Detail & Related papers (2020-09-09T21:57:47Z)
Faster Secure Data Mining via Distributed Homomorphic Encryption [108.77460689459247]
Homomorphic Encryption (HE) is receiving more and more attention recently for its capability to do computations over the encrypted field. We propose a novel general distributed HE-based data mining framework towards one step of solving the scaling problem. We verify the efficiency and effectiveness of our new framework by testing over various data mining algorithms and benchmark data-sets.
arXiv Detail & Related papers (2020-06-17T18:14:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.