2008•Lecture notes in computer scienceOpen access

Efficient Protocols for Set Membership and Range Proofs

Jan Camenisch, Rafik Chaabouni, Abhi Shelat

Open full text 287 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 287 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Mathematical proof, Discrete logarithm, Commitment scheme, Computer science, Range (aeronautics), Group (periodic table), Security parameter, Gas meter prover

Back to paper search Browse research topics Original source

Efficient Protocols for Set Membership and Range Proofs — Research Paper | ScholarLens