A discrete logarithm blob for noninteractive XOR gates | Zendy

Joan Boyar | Zendy; Ivan Damgård | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A discrete logarithm blob for noninteractive XOR gates

Author(s) -

Joan Boyar,

Ivan Damgård

Publication year - 1990

Publication title -

daimi report series

Language(s) - English

Resource type - Journals

eISSN - 2245-9316

pISSN - 0105-8517

DOI - 10.7146/dpb.v19i327.6717

Subject(s) - discrete logarithm , logarithm , zero knowledge proof , gas meter prover , arithmetic , scheme (mathematics) , negation , mathematics , discrete mathematics , theoretical computer science , computer science , zero (linguistics) , iterated logarithm , algorithm , cryptography , programming language , encryption , mathematical proof , public key cryptography , computer security , mathematical analysis , linguistics , philosophy , geometry

We present a bit commitment scheme based on discrete logarithms. Unlike earlier discrete log based schemes, our system allows non-interactive XORing and negation of bits contained in commitments. When used as a building block in zero-knowledge protocols, our scheme leads to protocols that are statistical (almost perfect) zero-knowledge, and where the prover is unable to break the system, unless he can find a secret discrete logarithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research