Translation-Randomizable Distributions via Random Walks

  title={Translation-Randomizable Distributions via Random Walks},
  author={Nirattaya Khamsemanan and William E. Skeith},
This work continues the search for viable intractability assumptions over infinite groups. In particular, we study the possibility of phrasing random self-reducibility properties for infinite groups in an analogous manner to the case of finite groups with the uniform distribution. As a first step, it is natural to look for distributions which are translation-invariant, i.e., the probability of an event and its translate by a group element are the same (as is the case for the uniform… 



Discrete Gaussian Leftover Hash Lemma over Infinite Domains

This work proves a "lattice world" analog of LHL over infinite domains, proving that certain "generalized subset sum" distributions are statistically close to well behaved discrete Gaussian distributions, even without any modular reduction.

How to generate cryptographically strong sequences of pseudo random bits

  • M. BlumS. Micali
  • Computer Science, Mathematics
    23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
  • 1982
A more operative definition of Randomness should be pursued in the light of modern Complexity Theory.

An Efficient and Parallel Gaussian Sampler for Lattices

To the knowledge, this is the first algorithm and rigorous analysis demonstrating the security of a perturbation-like technique and a new Gaussian sampling algorithm for lattices that is efficient and highly parallelizable.

On the random-self-reducibility of complete sets

  • J. FeigenbaumL. Fortnow
  • Computer Science, Mathematics
    [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference
  • 1991
The authors show that sets complete for the classes PP and MOD/sub m/P are random-self-reducible, unless the hierarchy collapses at the third level.

Length-Based Attacks for Certain Group Based Encryption Rewriting Systems

A probabilistic attack on public key cryptosystems based on the word/conjugacy problems for finitely presented groups of the type proposed recently by Anshel, Anshel and Goldfeld is described.

On lattices, learning with errors, random linear codes, and cryptography

  • O. Regev
  • Computer Science, Mathematics
  • 2009
A (classical) public-key cryptosystem whose security is based on the hardness of the learning problem, which is a reduction from worst-case lattice problems such as GapSVP and SIVP to a certain learning problem that is quantum.

Random Walks on Infinite Graphs and Groups

Part I. The Type Problem: 1. Basic facts 2. Recurrence and transience of infinite networks 3. Applications to random walks 4. Isoperimetric inequalities 5. Transient subtrees, and the classification

Random Walks On Finite Groups With Few Random Generators

Let $G$ be a finite group. Choose a set $S$ of size $k$ uniformly from $G$ and consider a lazy random walk on the corresponding Cayley graph. We show that for almost all choices of $S$ given $k =

Right-Invariance: A Property for Probabilistic Analysis of Cryptography Based on Infinite Groups

This paper pays attention to a property, the so-called right-invariance, which makes finite groups so convenient in cryptography, and gives a mathematical framework for correct, appropriate use of it in infinite groups.