2022 Developer Survey is open! Take survey.

New answers tagged

1 vote

non-reversible additive cryptographic hash algorithm

I'm in hurry now, but I want to share with you some ideas (which if needed I'll detail next days): concatenation can be seen as $x||y = xk+y$ where $k=2^{|y|}$ so $f(x||y) = f(xk+y)$ if we assume $f$ ...
user avatar
  • 448
1 vote

Additively homomorphic (modified) RSA?

I tried proving that $E(message_{1} + message_{2}) \equiv E(message_{1}) \cdot E(message_{2})$. Does anyone see where I messed up? It is appeared you messed up when you tried to take this paper ...
user avatar
  • 131k
0 votes
Accepted

Difference between Non-Interactive Secure Multiparty Computation (NISMPC) and Fully Homomorphic Encryption (FHE)

To my best knowledge, the notion of non-interactive secure multiparty computation was introduced by Beimel et. al.. In the original paper, ... It (NIMPC) can also be viewed as a simpler and weaker ...
user avatar
0 votes

Practical implementations of Private Set Membership

This is something I've been working on. I would like "small" below to be much smaller than what follows. But this would work for your purposes for a set of binary strings $S$, cryptographic ...
user avatar

Top 50 recent answers are included