Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

88

ASIACRYPT
2008
Springer

101views Cryptology» more ASIACRYPT 2008»

Efficient Protocols for Set Membership and Range Proofs

15 years 4 months ago

Efficient Protocols for Set Membership and Range Proofs

Download infoscience.epfl.ch

Jan Camenisch, Rafik Chaabouni, Abhi Shelat

Real-time Traffic

ASIACRYPT 2008 | Cryptology |

claim paper

Related Content

» Universal Accumulators with Efficient Nonmembership Proofs

» SyntaxDriven Private Evaluation of Quantified Membership Queries

» Concise Mercurial Vector Commitments and Independent ZeroKnowledge Sets with Short Proofs

» On the cell probe complexity of membership and perfect hashing

» Efficient Multicast Key Distribution Using HOWFbased Access Control Structures

» Guard placement for efficient pointinpolygon proofs

» On the Portability of Generalized Schnorr Proofs

» Efficient Mutual Data Authentication Using Manually Authenticated Strings

» LinearComplexity Private Set Intersection Protocols Secure in Malicious Model

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	ASIACRYPT
Authors	Jan Camenisch, Rafik Chaabouni, Abhi Shelat

Comments (0)