skip to main content

Search for: All records

Creators/Authors contains: "Pandey, O."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Boldyreva, A. ; Kolesnikov, V. (Ed.)
    A private set membership (PSM) protocol allows a β€œreceiver” to learn whether its input x is contained in a large database 𝖣𝖑 held by a β€œsender”. In this work, we define and construct credible private set membership (C-PSM) protocols: in addition to the conventional notions of privacy, C-PSM provides a soundness guarantee that it is hard for a sender (that does not know x) to convince the receiver that π‘₯βˆˆπ–£π–‘. Furthermore, the communication complexity must be logarithmic in the size of 𝖣𝖑. We provide 2-round (i.e., round-optimal) C-PSM constructions based on standard assumptions: We present a black-box construction in the plain model based on DDH or LWE. Next, we consider protocols that support predicates f beyond string equality, i.e., the receiver can learn if there exists π‘€βˆˆπ–£π–‘ such that 𝑓(π‘₯,𝑀)=1. We present two results with transparent setups: (1) A black-box protocol, based on DDH or LWE, for the class of NC1 functions f which are efficiently searchable. (2) An LWE-based construction for all bounded-depth circuits. The only non-black-box use of cryptography in this construction is through the bootstrapping procedure in fully homomorphic encryption. As an application, our protocols can be used to build enhanced round-optimal leaked password notification services, wheremore »unlike existing solutions, a dubious sender cannot fool a receiver into changing its password.« less
    Free, publicly-accessible full text available May 2, 2024