Fine-Tuning Groth-Sahai Proofs

摘要: Groth-Sahai proofs are efficient non-interactive zero-knowledge that have found widespread use in pairing-based cryptography. We propose efficiency improvements of the SXDH setting, which is one yields most proofs. We replace some commitments with ElGamal encryptions, reduces prover's computation and for types equations proof size.Groth-Sahai when no public elements paired to each other. observe they also base groups constants.The can be reduced by letting her pick own common reference string. By giving a she has picked valid string this does not compromise soundness.We define type-based commit-and-prove scheme, allows reused many different proofs.