Metraipolis › archive › dc_e581919cdfdc

Subgroup Packing for Batched PASTA Transciphering — arXiv:2609.12624

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.12624
License (as archived)
CC0-1.0
Archived
2026-10-16T03:14:35.732Z
SHA-256 of the archived text
1dd19995f4fd5df5cbc5dfad57f3165a8a510079638e059d74de03824fa782e3
Stable URL of this page
https://metraipolis.com/documento/dc_e581919cdfdc

How to cite

Subgroup Packing for Batched PASTA Transciphering — arXiv:2609.12624 — arXiv (en), https://arxiv.org/abs/2609.12624 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e581919cdfdc (Metraipolis archive dc_e581919cdfdc, sha256 1dd19995f4fd5df5cbc5dfad57f3165a8a510079638e059d74de03824fa782e3)
BibTeX
@misc{dce581919cdfdc,
  title = {Subgroup Packing for Batched PASTA Transciphering — arXiv:2609.12624},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.12624},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e581919cdfdc; sha256 1dd19995f4fd5df5cbc5dfad57f3165a8a510079638e059d74de03824fa782e3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.12624. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

With transciphering, a server converts symmetrically encrypted records into homomorphic ciphertexts without learning the records or the symmetric key. For the PASTA cipher, this conversion involves dense linear maps whose implementation depends on how record words are arranged in the ciphertext. We ask whether rearranging a fixed batch can reduce its conversion cost. Instead of storing each record's words in a contiguous block, our layout interleaves records so that cyclic word shifts preserve each record's positions, which form a coset of a cyclic subgroup. For direct evaluation as a sum of masked translations, we characterize the required displacements and relate their counts, 255 for the contiguous layout and 128 for the subgroup layout, to a prior transversal-difference invariant. We implement three equally batched schedules for complete PASTA-3 conversion and subsequent public subset-sum queries in HElib. Across twelve paired corpora under six homomorphic keys, all 24 direct and subgroup conversions and all 48 subsequent queries return the expected values and required zeroes. The median paired ratio of direct to subgroup server cost is 1.60, including fresh public generation, conversion and two queries. The reduction comes with less remaining noise capacity. These results establish a packing-dependent cost--noise tradeoff.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-14 in cs.CR).
Categorie arXiv: Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.12624 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T03:05:08.065Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).