Harnessing Lightweight Ciphers for PDF Encryption

• URL: http://arxiv.org/abs/2409.09428v1
• Date: Sat, 14 Sep 2024 12:59:04 GMT
• Title: Harnessing Lightweight Ciphers for PDF Encryption
• Abstract summary: Portable Document Format (PDF) is used worldwide as de-facto standard for exchanging documents. At present, PDF encryption only supports Advanced Encryption Standard (AES) to encrypt and decrypt information. Lightweight Cryptography, which is referred to as crypto for resource constrained environments has gained lot of popularity.
• Score: 1.104960878651584
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Portable Document Format (PDF) is a file format which is used worldwide as de-facto standard for exchanging documents. In fact this document that you are currently reading has been uploaded as a PDF. Confidential information is also exchanged through PDFs. According to PDF standard ISO 3000-2:2020, PDF supports encryption to provide confidentiality of the information contained in it along with digital signatures to ensure authenticity. At present, PDF encryption only supports Advanced Encryption Standard (AES) to encrypt and decrypt information. However, Lightweight Cryptography, which is referred to as crypto for resource constrained environments has gained lot of popularity specially due to the NIST Lightweight Cryptography (LWC) competition announced in 2018 for which ASCON was announced as the winner in February 2023. The current work constitutes the first attempt to benchmark Java implementations of NIST LWC winner ASCON and finalist XOODYAK against the current PDF encryption standard AES. Our research reveals that ASCON emerges as a clear winner with regards to throughput when profiled using two state-of-the-art benchmarking tools YourKit and JMH.

Related papers

• CryptanalysisBench: Can LLMs do Cryptanalysis? [76.79639292270497]
  We introduce CryptanalysisBench, 191 tasks across six families of cryptographic primitives.<n>Our benchmark consists of three tiers: (i) primitives with known practical breaks; (ii) primitives with no known practical break, evaluated both at full strength and as scaled-down variants.<n>Five frontier models break 65%-86% of Tier 1 schemes, 6-12 Tier-2 schemes at full strength, and 24-61 across all scaled-down variants.
  arXiv  Detail & Related papers  (2026-07-20T22:09:40Z)
• Leveraging Interpretable Tsetlin Machine for PDF Malware Detection [0.0]
  This paper presents a novel interpretable Tsetlin Machine (TM)-based framework for PDF malware detection.<n>The proposed framework extracts salient features from PDF documents through static analysis without executing the files.<n>It employs rule-based learning to accurately classify benign and malicious PDF documents.
  arXiv  Detail & Related papers  (2026-07-10T11:06:35Z)
• Authorized and Verifiable Searchable Encryption Based on Public Key Equality Test for Cloud Storage [9.042313728893694]
  Cloud storage revolutionizes data management but raises conflicts between functionality and privacy.<n>PKEET can enable multi-user searchable encryption (SE) through cross-key ciphertext comparison without shared keys.<n>Existing PKEET-based SE schemes lack ciphertext-file-level authorization, public verifiability, or SE-level support.<n>This paper first proposes a novel PKEET scheme, AVPKEET (Authorized and Verifiable PKEET)<n>It enables non-transferable and non-replayable authorization of ciphertext files, while supporting public verifiability, all without the need for trusted third parties
  arXiv  Detail & Related papers  (2026-06-05T14:38:57Z)
• BitC-3DGS: High-Capacity 3D Gaussian Splatting Watermarking via Bit Compression [68.33622936663876]
  High-capacity watermarking is necessary for 3D Gaussian Splatting (3DGS) assets to embed rich information.<n>Existing bit-to-token watermarking methods are limited to 77-bit messages due to CLIP's fixed 77-token context length.<n>We introduce BitC-3DGS, a bit-compression framework that encodes multiple message bits per token.
  arXiv  Detail & Related papers  (2026-05-28T08:28:04Z)
• Cryptanalysis of LC-MUME: A Lightweight Certificateless Multi-User Matchmaking Encryption for Mobile Devices [0.0]
  We show that a Type-I adversary can successfully forge a validtext cipher without possessing the complete private key of the sender.<n>We propose a strategy to strengthen the security of matchmaking encryption schemes in mobile computing environments.
  arXiv  Detail & Related papers  (2025-07-30T13:36:52Z)
• Decompiling Smart Contracts with a Large Language Model [51.49197239479266]
  Despite Etherscan's 78,047,845 smart contracts deployed on (as of May 26, 2025), a mere 767,520 ( 1%) are open source.<n>This opacity necessitates the automated semantic analysis of on-chain smart contract bytecode.<n>We introduce a pioneering decompilation pipeline that transforms bytecode into human-readable and semantically faithful Solidity code.
  arXiv  Detail & Related papers  (2025-06-24T13:42:59Z)
• On the Semantic Security of NTRU -- with a gentle introduction to cryptography [1.0878040851638]
  NTRU is a lattice based cryptosystem that appears to be safe against attacks by quantum computers. NTRU's efficiency suggests it is a strong candidate as an alternative to RSA, ElGamal, and ECC for the post quantum world.
  arXiv  Detail & Related papers  (2025-03-10T19:14:13Z)
• Mixing Algorithm for Extending the Tiers of the Unapparent Information Send through the Audio Streams [0.0]
  Secrecy and efficiency can be obtained through steganographic involvement. This paper analyzes and proposes a way out according to the performance based on robustness, security, and hiding capacity.
  arXiv  Detail & Related papers  (2025-02-18T05:08:45Z)
• 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)
• PDF-WuKong: A Large Multimodal Model for Efficient Long PDF Reading with End-to-End Sparse Sampling [63.93112754821312]
  Document understanding is a challenging task to process and comprehend large amounts of textual and visual information. Recent advances in Large Language Models (LLMs) have significantly improved the performance of this task. We introduce PDF-WuKong, a multimodal large language model (MLLM) which is designed to enhance multimodal question-answering (QA) for long PDF documents.
  arXiv  Detail & Related papers  (2024-10-08T12:17:42Z)
• NTTSuite: Number Theoretic Transform Benchmarks for Accelerating Encrypted Computation [2.704681057324485]
  Homomorphic encryption (HE) is a cryptographic system that enables computation directly on encrypted data. HE has seen little adoption due to extremely high computational overheads, rendering it impractical. We develop a benchmark suite, named NTTSuite, to enable researchers to better address these overheads. We find our implementation outperforms the state-of-the-art by 30%.
  arXiv  Detail & Related papers  (2024-05-18T17:44:17Z)
• Hiding Sensitive Information Using PDF Steganography [3.6533698604619587]
  We present a novel PDF steganography algorithm based upon least-significant bit insertion into the real-valued operands of PDF stream operators. We also provide a case study which embeds malware into a given cover PDF document.
  arXiv  Detail & Related papers  (2024-05-01T20:54:12Z)
• A Quantitative Security Analysis of S-boxes in the NIST Lightweight Cryptography Finalists [1.3349615170141398]
  In 2017, NIST put forward security requirements for a standard lightweight scheme.<n>In this paper, we evaluate the S-boxes of 6 NIST LWC competition finalists based on well-known cryptographic properties.
  arXiv  Detail & Related papers  (2024-04-09T07:56:52Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• SOCI^+: An Enhanced Toolkit for Secure OutsourcedComputation on Integers [50.608828039206365]
  We propose SOCI+ which significantly improves the performance of SOCI. SOCI+ employs a novel (2, 2)-threshold Paillier cryptosystem with fast encryption and decryption as its cryptographic primitive. Compared with SOCI, our experimental evaluation shows that SOCI+ is up to 5.4 times more efficient in computation and 40% less in communication overhead.
  arXiv  Detail & Related papers  (2023-09-27T05:19:32Z)
• GPT-4 Is Too Smart To Be Safe: Stealthy Chat with LLMs via Cipher [85.18213923151717]
  Experimental results show certain ciphers succeed almost 100% of the time to bypass the safety alignment of GPT-4 in several safety domains. We propose a novel SelfCipher that uses only role play and several demonstrations in natural language to evoke this capability.
  arXiv  Detail & Related papers  (2023-08-12T04:05:57Z)
• A Comprehensive Survey on the Implementations, Attacks, and Countermeasures of the Current NIST Lightweight Cryptography Standard [2.055054374525828]
  This survey is the first work on the current standard for lightweight cryptography, standardized in 2023. Lightweight cryptography plays a vital role in securing resource-constrained embedded systems. NIST initiated a standardization process for lightweight cryptography.
  arXiv  Detail & Related papers  (2023-04-13T02:29:38Z)
• 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)
• Digest of Quantum Stream Cipher based on Holevo-Yuen Theory [0.0]
  This paper introduces an overview and a back ground of our paper that is entitled Quantum stream cipher based on Holevo-Yuen theory. Around 2000, a new quantum stream cipher was proposed as a technique to challenge the possibility of overcoming drawbacks of OTP in practical use.
  arXiv  Detail & Related papers  (2022-06-04T08:17:34Z)
• Uncloneable Decryptors from Quantum Copy-Protection [0.38073142980733]
  We show that CPA secure uncloneable bit decryptors could be instantiated from a copy protection scheme. We then show how to strengthen the CPA security of uncloneable decryptors to CCA2 security using strong EUF-CMA secure digital signatures.
  arXiv  Detail & Related papers  (2022-03-11T11:47:04Z)
• 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)

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

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.