Related papers: Public-key encryption from a trapdoor one-way embedding of $SL

Public-key encryption from a trapdoor one-way embedding of $SL_2(\mathbb{N}$)

URL: http://arxiv.org/abs/2409.07616v1
Date: Wed, 11 Sep 2024 20:58:11 GMT
Title: Public-key encryption from a trapdoor one-way embedding of $SL_2(\mathbb{N}$)
Authors: Robert Hines,
Abstract summary: We obfuscate words of a given length in a free monoid on two generators with a simple factorization algorithm to create a public-key encryption scheme. We provide a reference implementation in Python and suggested parameters.
Score: 0.04662017507844856
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
Abstract: We obfuscate words of a given length in a free monoid on two generators with a simple factorization algorithm (namely $SL_2(\mathbb{N})$) to create a public-key encryption scheme. We provide a reference implementation in Python and suggested parameters. The security analysis is between weak and non-existent, left to future work.

Related papers

Conditional Encryption with Applications to Secure Personalized Password Typo Correction [7.443139252028032]
We introduce the notion of a conditional encryption scheme as an extension of public key encryption. A conditional encryption scheme for a binary predicate $P$ adds a new conditional encryption algorithm $mathsfCEnc$. We demonstrate how to use conditional encryption to improve the security of personalized password typo correction systems.
arXiv Detail & Related papers (2024-09-10T00:49:40Z)
Perturb-and-Project: Differentially Private Similarities and Marginals [73.98880839337873]
We revisit the input perturbations framework for differential privacy where noise is added to the input $Ain mathcalS$. We first design novel efficient algorithms to privately release pair-wise cosine similarities. We derive a novel algorithm to compute $k$-way marginal queries over $n$ features.
arXiv Detail & Related papers (2024-06-07T12:07:16Z)
Superposed Decoding: Multiple Generations from a Single Autoregressive Inference Pass [72.07642648108849]
Superposed Decoding is a new decoding algorithm that generates $k$ drafts at the cost of one autoregressive inference pass. Superposed Decoding can be combined with other decoding strategies, resulting in universal coverage gains when scaling inference time compute.
arXiv Detail & Related papers (2024-05-28T17:40:48Z)
Implementation of Entropically Secure Encryption: Securing Personal Health Data [0.704590071265998]
Entropically Secure Encryption (ESE) offers unconditional security with shorter keys to the One-Time Pad. We present the first implementation of ESE for bulk encryption.
arXiv Detail & Related papers (2024-04-04T12:07:33Z)
Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations [49.1574468325115]
Sponge hashing is a widely used class of cryptographic hash algorithms. Intrepid permutations have so far remained a fundamental open problem. We show that finding zero-pairs in a random $2n$-bit permutation requires at least $Omega (2n/2)$ many queries.
arXiv Detail & Related papers (2024-03-07T18:46:58Z)
Efficient Algorithms for Recognizing Weighted Tree-Adjoining Languages [104.90415092306219]
Four formalisms are equivalent to tree-adjoining grammars (TAG), linear indexed grammars (LIG), pushdown-adjoining automata (PAA) and embedded pushdown automata (EPDA) We design new algorithms for computing their stringsum derivations (the weight of all automatons of a string) and allsums (the weight of all derivations) For EPDA, our algorithm is both more space-efficient and time-efficient than the algorithm of Alonso et al. (2001) by factors of $mathcalO(|Gamma|2)$ and $
arXiv Detail & Related papers (2023-10-23T18:26:00Z)
Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
arXiv Detail & Related papers (2023-03-15T15:00:20Z)
Private estimation algorithms for stochastic block models and mixture models [63.07482515700984]
General tools for designing efficient private estimation algorithms. First efficient $(epsilon, delta)$-differentially private algorithm for both weak recovery and exact recovery.
arXiv Detail & Related papers (2023-01-11T09:12:28Z)
Entropically secure encryption with faster key expansion [2.355458445741348]
We introduce a new key expansion method that is faster than existing ones. Speed gain is most notable when the key length is a sizeable fraction of the message length.
arXiv Detail & Related papers (2022-01-01T13:29:56Z)
Efficient Quantum Public-Key Encryption From Learning With Errors [1.8021287677546958]
Our main result is a quantum public-key encryption scheme based on the Extrapolated Dihedral Coset problem (EDCP) For limited number of public keys, the proposed scheme is information-theoretically secure.
arXiv Detail & Related papers (2021-05-26T18:48:26Z)
Unclonable Encryption, Revisited [7.129830575525267]
Unclonable encryption, introduced by Broadbent and Lord (TQC'20), is an encryption scheme with the following attractive feature. We construct unclonable encryption schemes with semantic security. We show that unclonable encryption implies copy-protection for a simple class of unlearnable functions.
arXiv Detail & Related papers (2021-03-27T22:37:59Z)

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