Skip to main content
Daniel's user avatar
Daniel's user avatar
Daniel's user avatar
Daniel
  • Member for 10 years
  • Last seen more than a month ago
3 votes

Difficulty of forging MACs based on linear functions over $GF\left(2^n\right)$

1 vote

Impact of a non-uniform distribution in a secret sharing scheme

1 vote
Accepted

What (Where) is the formal definition of Multiparty Computation?

5 votes
Accepted

Implementation of oblivious transfer with symmetric primitive?

9 votes
Accepted

Can post-quantum algorithms be run on commercial devices?

17 votes

Possibility of Chosen Plaintext Attack (CPA) in real-world scenario?

4 votes
Accepted

Bitwise operation on secret values revealing the result only to the participants

2 votes

In coin flipping protocols, why aborting is allowed, and why the non-aborting party flips a coin at the end?

2 votes

Secret sharing over $Z_n*$

4 votes

Subgroup generation: should we check that order is not 2? or g in not too small?

2 votes

Naor Pinkas OT - senders security; reduction to DDH

5 votes

Is it possible to find the product of two numbers without knowing the two numbers?

23 votes
Accepted

What is the main difference between finite fields and rings?

2 votes

Lower Bound on the Probability an LWE Matrix is Primitive

2 votes
Accepted

Is the following construction of a secure PRG is also a secure PRG?

12 votes
Accepted

Is a secure deterministic MAC always a PRF?

6 votes
Accepted

What is definition of "adversary"? And what do they do?

5 votes
Accepted

Understand LWE(Learning With Error) negligible error probability

3 votes

Overdeterminate system of multivariate equation

3 votes

Why use two affine transformations in Multivariate Cryptography?

9 votes
Accepted

Are there deterministic private-key encryption schemes that are CPA-secure?

4 votes

Is this PRG secure? Different on halves of input

4 votes
Accepted

Information theoretic message authentication code (MAC)

4 votes
Accepted

Geometric Cryptography and Zero-Knowledge Proofs

2 votes
Accepted

Select a single message without showing which one has been selected

3 votes
Accepted

Why do we use one transformation to hide the structure in UOV?

4 votes
Accepted

Why is pseudorandom OTP (P-OTP) IND-CPA insecure

1 vote
Accepted

Relevance of Input and Ouput size of PRF on CTR mode

3 votes
Accepted

Indistinguishable encryptions in the presence of an eavesdropper equivalence

5 votes
Accepted

Modulo properties of two prime numbers

1
2