User Lorenzo

3 votes

1 answer

146 views

How to encrypt a message such that it cannot be decrypted before a certain time?

asked May 13, 2020 at 22:46

2 votes

1 answer

140 views

Is linear secret sharing over the addittive group of integers modulo $p$ with $p$ non-prime secure?

asked Dec 12, 2020 at 20:28

2 votes

2 answers

91 views

Homomorphic encryption with both algorithm and data encrypted?

asked Apr 29 at 20:02

2 votes

1 answer

67 views

Implementing a Merkle tree using a 128 bit hash function?

asked May 6 at 0:18

1 vote

1 answer

71 views

Secure multiparty computation protocols for stable matching?

asked May 25 at 0:00

1 vote

1 answer

282 views

Adversary model for malicious but selfish adversaries?

asked May 10, 2020 at 5:38

1 vote

1 answer

229 views

What is the border between an ideal functionality and a protocol?

asked May 10, 2020 at 20:36

0 votes

1 answer

107 views

Is the random oracle commitment scheme secure against PPT active adversaries?

asked May 11, 2020 at 23:50

0 votes

2 answers

397 views

What is the difference between a cryptographic primitive and a functionality?

asked May 12, 2020 at 17:40

0 votes

0 answers

41 views

What does it mean exactly that an adversary can control a polynomial number of parties?

asked May 17, 2020 at 12:39

0 votes

1 answer

338 views

What does it mean that a semi-honest adversary can look at the internal state of a controlled party?

asked Jun 2, 2020 at 10:59

0 votes

0 answers

68 views

Model a dishonest majority controlled by several adversaries in a voting protocol?

asked Jun 4, 2020 at 23:08

0 votes

1 answer

276 views

Why Bellare-Micali Oblivious Transfer Construction requires ElGamal with hashed key?

asked Dec 25, 2020 at 17:25

0 votes

0 answers

34 views

Generalizations of designated verifier signatures?

asked Jul 18, 2022 at 15:12

0 votes

1 answer

118 views

Does secure multiplication makes sense in the case of 2 inputs?

asked Feb 28, 2020 at 19:11

0 votes

0 answers

108 views

Is it possible to compute permutations of a sequence of bytes by using exactly one pseudo-random number?

asked May 7, 2020 at 20:11

Stack Exchange Network

16 Questions

How to encrypt a message such that it cannot be decrypted before a certain time?

Is linear secret sharing over the addittive group of integers modulo $p$ with $p$ non-prime secure?

Homomorphic encryption with both algorithm and data encrypted?

Implementing a Merkle tree using a 128 bit hash function?

Secure multiparty computation protocols for stable matching?

Adversary model for malicious but selfish adversaries?

What is the border between an ideal functionality and a protocol?

Is the random oracle commitment scheme secure against PPT active adversaries?

What is the difference between a cryptographic primitive and a functionality?

What does it mean exactly that an adversary can control a polynomial number of parties?

What does it mean that a semi-honest adversary can look at the internal state of a controlled party?

Model a dishonest majority controlled by several adversaries in a voting protocol?

Why Bellare-Micali Oblivious Transfer Construction requires ElGamal with hashed key?

Generalizations of designated verifier signatures?

Does secure multiplication makes sense in the case of 2 inputs?

Is it possible to compute permutations of a sequence of bytes by using exactly one pseudo-random number?