Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
0 answers
31 views

What is the difference between Chaum-Pedersen NIZK vs Schnorr NIZK (OR-composition) for additively homomorphic ElGamal encryption?

I use additive homomorphic property of ElGamal encryption, where I encode a message into a ciphertext as $c1=g^k$, $c2=g^{xk}g^m$, where $m$ can only be either 0 or 1. I need to prove that $m$ is ...
Azii's user avatar
  • 87
0 votes
0 answers
70 views

Zero-Knowledge Proof of a number being generated "randomly" (similar to a dice roll)

If party1 asks other parties to give a random number, for simplicity, say in a range from 1 to 6 (like in a dice). Is it possible for party1 to ensure that the number received is in a given range and ...
user60588's user avatar
  • 307
1 vote
0 answers
26 views

Mental Poker: Can the shuffle of the deck be done Publicaly by a single player at the start of the game

Ref: Mental Poker Revisited by Barnett and Smart. I am looking at mental poker problem. Generally, the shuffling process is done by a single player who starts the game and not by all players. But, in ...
user60588's user avatar
  • 307
1 vote
1 answer
406 views

How to write zk-snark arithmetic circuits

Paper: "Dispute-free Scalable Open Vote Network using zk-SNARKs" by Muhammad ElSheikh Available at: https://arxiv.org/pdf/2203.03363.pdf In this paper, the author has mentioned some pre-...
user60588's user avatar
  • 307
1 vote
0 answers
50 views

Is it possible to verify and prove the decryption of an FHE cyphertext without the verifier knowing the key with zkProof?

Suppose Bob encrypts a plaintext($p$) with an FHE scheme and a key($k$), then sends the $c$ to Alice. Alice wants to know the plaintext but can't trust that Bob won't send a different string. Can Bob ...
Vasily Sobolev's user avatar
2 votes
1 answer
140 views

Statistics-heavy crypto papers

I'm currently taking a course in which we choose a stats-heavy paper and analyse it, summarising our work in the form of a written report and presentation. I have tried to find such a paper in crypto, ...
smoking_big_ole_doinks's user avatar
1 vote
0 answers
207 views

Quantum-safe algorithm for hiding cryptocurrency transaction amount [closed]

I have a decentralized coin system that I am trying to develop. Each coin can be split up into 1,000,000 units. I've been looking for a quantum-safe and practical (efficient) algorithm to send ...
rapt's user avatar
  • 91
3 votes
1 answer
192 views

Verify HMAC tag without knowing the key

Let's say there's Alice and Bob. Let Alice and Bob agree on a message $M_1$, a tag $T_1$, and a function $HMAC$. Alice proves to Bob that she knows a key $K$ such that $T_1 = HMAC(M_1, K)$ without ...
tock203's user avatar
  • 345
2 votes
0 answers
85 views

To prove equality/inequality of plaintexts of 2 ciphertexts encypted under different encryption schemes

We have 2 ciphertexts, one encrypted using Paillier and another encrypted under Elgamal encryption schemes. Is there a way to design ZK-proof to prove equality of the underlying plaintexts of these 2 ...
G Pavithra 's user avatar
4 votes
0 answers
167 views

Zero Knowledge Proofs for Microsoft SEAL (Homomorphic Encryption)

I am working on a system involving multiple parties performing homomorphic cryptographic operations using Microsoft SEAL (BFV). Because of the nature of the system, it would be preferable for the ...
Andrei Florian's user avatar
1 vote
1 answer
124 views

zk-SNARK: Encrypted Polynomial

I've read through, and roughly understand, Maksym Petkus' zk-SNARK paper (http://www.petkus.info/papers/WhyAndHowZkSnarkWorks.pdf). I'm re-reading it, and trying to code up the examples as I go along ...
Brendan's user avatar
  • 13
0 votes
1 answer
55 views

Transforming a encryption of binary representation of a number to an encryption of vector representation

Suppose Alice chooses a number $n\in Z_q$ and decompose it to its binary representation $b_0,b_1,...,b_d$. Then Alice encrypts these bits (can be any encryption scheme). Is it possible for Bob (who ...
Doron's user avatar
  • 99
3 votes
3 answers
521 views

Is it possible to prove that an encrypted message was encrypted with some public key without divulging the plaintext or secret key?

I know this seems a bit contrived, but I’m a layperson to cryptographic systems and have been trying to think if it’s possible to devise a scheme where it’s possible for a sender to prove, in a public ...
John Chadwick's user avatar
1 vote
1 answer
696 views

How to Prove Correct Decryption in ElGamal Cryptosystem

I am working on a project that uses ElGamal cryptography using multiplicative notation. The project is an internet voting implementation that uses the cryptosystem to encrypt the received ballots, re-...
Andrei Florian's user avatar
2 votes
2 answers
536 views

Role of AND operation in FHE, MPC and ZK

Going through LowMC, one of the main advantage of it seems to be useful in Fully Homomorphic Encryption (FHE), Multi-party Computation (MPC) and Zero Knowledge (ZK) proofs. I have no idea about any of ...
hola's user avatar
  • 613

15 30 50 per page