EFFICIENT NON-INTERACTIVE PROOF SYSTEMS FOR BILINEAR GROUPS

摘要

An apparatus and method for constructing efficient non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs that work directly for groups with a bilinear map is described. Groups with bilinear maps have enjoyed tremendous success in the field of cryptography in recent years and have been used to construct a plethora of protocols. This disclosure provides n on -interactive witness-indistinguishable proofs and non-interactive zero-knowledge proofs that can be used in connection with these protocols.