New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs

Questions tagged [shuffle]

The tag has no usage guidance.

11 questions
Filter by
Sorted by
Tagged with
38 views

How to attack the shuffling of correlated numbers?

Suppose I have a function that accepts vector input $x$ and outputs vector $y=f(x)$. I want to protect the output $y$ through shuffling numbers in it. I hope the shuffling can confuse the attacker by ...
1 vote
96 views

How to construct a permutation (shuffle) oblivious pseudorandom function?

We know that OPRF is a two-party protocol, where Alice inputs $X = {x_1, ..., x_n}$, Bob has no input, and after executing the OPRF protocol, Alice gets $F_k(x_i)$, and Bob receives a pseudorandom key ...
• 11
68 views

Achieving sub-block non-malleability

I have a noisy one-way communication channel where data is sent as a series of words of width n bits. Assume n is a constant roughly in the range of 16...48. I don't want bit errors in one word to ...
1 vote
71 views

Is this transposition cipher unbreakable?

Given a password as a seed for a Psuedo Random number generator and Fisher Yates Algorithm to shuffle bytes of a string to random places like Hello World to ...
• 19
97 views

After ZK-shuffle, how can we let people who got the same number card know each other without letting anyone else know?

In mental poker, we can use ZK-shuffle to deal cards to the players such that the cards are kept private to each player (https://hackmd.io/@nmohnblatt/SJKJfVqzq). Suppose we deal exactly one card to ...
• 101
645 views

Deterministic shuffling algorithm

Is there a well know (cryptographically secure) algorithm to shuffle a vector of values, deterministically, without using any randomness, such that it is hard (or as hard as possible) to guess its ...
• 161
1 vote
42 views

Paillier cryptosystem for verifiable shuffles

I am looking for some algorithm or implementation on Pailler cryptosystem-based verifiable shuffles for mixNet. So far, all the verifiable shuffles and mixNet are available for ElGamal cryptosystems ...
• 41
1 vote
72 views

Are there on-line ways to use a block cipher to generate unique $n$ bits that guarantee collision-freeness for $2^n$ times?

$n$ is a run-time variable chosen each time the user runs the implementation. One way I can think is to use any block cipher, say AES, as a seeded CSPRNG to randomly shuffle list of numbers \$0, 1, \...
• 573
1 vote
98 views

Multiple attributes under shuffled differential privacy

Notation: eps_c (epsilon central), eps_l (epsilon local), n (number of users), d (number of attributes). A single attribute A_i may have |A_i|=r different values for i in [1,d]. Let's suppose each ...
97 views

Fisher Yates on "faulted" random number generator cryptanalysis

For the sake of curiosity and fun, i have implemented a C# program that operate as deck dealer on 40 cards deck (following the Fisher Yates shuffeling algorithm https://en.wikipedia.org/wiki/Fisher%E2%...
• 371