Dual RSA Accumulators and Its Application for Private Revocation Check Export

@article{citeulike:5849649, abstract = {This paper points out the privacy issue in the OCSP (Online Certificate Status Protocol), namely, the OCSP responder learns confidential information - who sends a message to whom. To preserve the privacy of the OCSP requester, this paper presents a cryptographic protocol for the authenticated dictionary, namely, an untrusted directory provides a verifiable answer to a membership query for a given element. In the protocol, a user is able to retrieve whether or not a target element belongs to a database that the directory has without revealing which element he/she wishes to know against the untrusted directory. The protocol requires linear exponentiations to the number of elements in the database, but achieves a constant size communication complexity between a user and a directory. The privacy of query is assured under the ?-hiding assumption introduced by Cachin.}, address = {Los Alamitos, CA, USA}, author = {Kikuchi, Hiroaki}, citeulike-article-id = {5849649}, citeulike-linkout-0 = {http://doi.ieeecomputersociety.org/10.1109/AINA.2006.157}, citeulike-linkout-1 = {http://dx.doi.org/10.1109/AINA.2006.157}, doi = {10.1109/AINA.2006.157}, issn = {1550-445X}, journal = {Advanced Information Networking and Applications, International Conference on}, keywords = {accumulators}, pages = {237--242}, posted-at = {2009-09-29 15:52:50}, priority = {2}, publisher = {IEEE Computer Society}, title = {Dual RSA Accumulators and Its Application for Private Revocation Check}, url = {http://dx.doi.org/10.1109/AINA.2006.157}, volume = {1}, year = {2006} }

TY - JOUR ID - citeulike:5849649 L3 - citeulike-article-id:5849649 N2 - This paper points out the privacy issue in the OCSP (Online Certificate Status Protocol), namely, the OCSP responder learns confidential information - who sends a message to whom. To preserve the privacy of the OCSP requester, this paper presents a cryptographic protocol for the authenticated dictionary, namely, an untrusted directory provides a verifiable answer to a membership query for a given element. In the protocol, a user is able to retrieve whether or not a target element belongs to a database that the directory has without revealing which element he/she wishes to know against the untrusted directory. The protocol requires linear exponentiations to the number of elements in the database, but achieves a constant size communication complexity between a user and a directory. The privacy of query is assured under the ?-hiding assumption introduced by Cachin. JF - Advanced Information Networking and Applications, International Conference on SN - 1550-445X AD - Los Alamitos, CA, USA EP - 242 TI - Dual RSA Accumulators and Its Application for Private Revocation Check PB - IEEE Computer Society VL - 1 SP - 237 KW - accumulators AU - Kikuchi, Hiroaki PY - 2006/// UR - http://dx.doi.org/10.1109/AINA.2006.157 ER -