CRYPTO NEWS

Babel Finance Halts Withdrawals, Citing Low Liquidity

Babel Finance, a Hong Kong-based cryptocurrency lending company, has announced that it is suspending withdrawals. Babel Suspends Redemptions and Withdrawals Babel wrote today that “redemptions and withdrawals from Babel Finance…

Compute a hash function given commitment to some secret element

Given a secret key x and a commitment to it comm(x) where comm(x) is both binding and hiding (it can be for example $g^x$ or some homomorphic encryption). Given public parameters $P_1,…,P_k$, comm(x), and an index i, is there a scheme, other than fully homomorphic encryption, to to compute $H(P_1,…,P_{i-1},x,P_{i+1},…,P_k)$ (where H is some collision ::Listen

Given a secret key x and a commitment to it comm(x) where comm(x) is both binding and hiding (it can be for example $g^x$ or some homomorphic encryption). Given public parameters $P_1,…,P_k$, comm(x), and an index i, is there a scheme, other than fully homomorphic encryption, to to compute $H(P_1,…,P_{i-1},x,P_{i+1},…,P_k)$ (where H is some collision resistant hash function that act as a random oracle both on x and over public parameters $P_i$‘s)?