BACKGROUND:  Non-interactive zero-knowledge proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, and various cryptographic protocols. Non-interactive zero-knowledge proofs allow a prover to create a proof of membership of an NP language. The proof can be used to convince anybody that indeed the statement in question belongs to the language, but the zero-knowledge property ensures that the proof will reveal nothing but the truth of the statement. Compared to traditional NIZK techniques, the invention described here yields significant reductions in the length of the common reference string and the size of the proofs, and is particularly applicable to ECC systems.

INNOVATION:  The invention discloses new non-interactive zero-knowledge proof systems based on groups with a bilinear map, such as ECC systems.

POTENTIAL APPLICATIONS 

• Cryptographic protocols, digital signatures, privacy-preserving and e-voting protocols, and place CCA2-secure cryptosystems

ADVANTAGES

• Reduced computational complexity compared to other cryptographic proofs
• Better security compared to other proofs
• Allows for the construction of perfect argument system for all NP languages
• Allows for the construction of UC-secure arguments for all NP languages in the presence of an adaptive adversary
• Allows for the construction of non-interactive zap for all NP languages based on a standard cryptographic security assumption

DEVELOPMENT-TO-DATE:  The invention has been mathematically proven. Anyone skilled in cryptography can easily implement the invention.

Reference: UCLA Case No. 2007-015