{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:10:14Z","timestamp":1742911814549,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540494966"},{"type":"electronic","value":"9783540494973"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11935308_32","type":"book-chapter","created":{"date-parts":[[2006,11,15]],"date-time":"2006-11-15T06:26:42Z","timestamp":1163572002000},"page":"452-468","source":"Crossref","is-referenced-by-count":6,"title":["Secure Set Membership Using 3Sat"],"prefix":"10.1007","author":[{"given":"Michael","family":"de Mare","sequence":"first","affiliation":[]},{"given":"Rebecca N.","family":"Wright","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Acquisiti, A.: Anonymous credentials through acid mixing (2003) (upublished manuscript)"},{"key":"32_CR2","unstructured":"Alekhnovich, M., Ben-Sasson, E.: Linear upper bounds for random walk on small density random 3-CNFs. In: Proceedings of the 44th Annual IEEE Symposium on the Foundations of Computer Science (2003)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"N. Baric","year":"1997","unstructured":"Baric, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 480\u2013494. Springer, Heidelberg (1997)"},{"key":"32_CR4","unstructured":"Benaloh, J.: Verifiable Secret-Ballot Elections. PhD thesis, Yale University Department of Computer Science (September 1987)"},{"key":"32_CR5","unstructured":"Benaloh, J., de Mare, M.: Efficient broadcast time-stamping. Technical Report TR-MCS-91-1, Clarkson University Department of Mathematics and Computer Science (1991)"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/3-540-48285-7_24","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"J. Benaloh","year":"1994","unstructured":"Benaloh, J., de Mare, M.: One-way accumulators: A decentralized approach to digital signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 274\u2013285. Springer, Heidelberg (1994)"},{"issue":"3","key":"32_CR7","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. SIAM Journal of Computing\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM Journal of Computing"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"G. Brassard","year":"1987","unstructured":"Brassard, G., Crepeau, C.: Zero-knowledge simulation of boolean circuits. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 223\u2013233. Springer, Heidelberg (1987)"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, p. 93. Springer, Heidelberg (2001)"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Camenisch","year":"2002","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, p. 61. Springer, Heidelberg (2002)"},{"key":"32_CR11","unstructured":"de Mare, M.: An analysis of certain cryptosystems and related mathematics. Master\u2019s thesis, State University of New York Institute of Technology (December 2004)"},{"issue":"6","key":"32_CR12","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"32_CR13","unstructured":"Esponda, F.: Negative Representations of Information. PhD thesis, University of New Mexico (2005)"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-30220-9_14","volume-title":"Artificial Immune Systems","author":"F. Esponda","year":"2004","unstructured":"Esponda, F., Ackley, E.S., Forrest, S., Helman, P.: On-line negative databases. In: Nicosia, G., Cutello, V., Bentley, P.J., Timmis, J. (eds.) ICARIS 2004. LNCS, vol.\u00a03239, pp. 175\u2013188. Springer, Heidelberg (2004)"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Esponda, F., Forrest, S., Helman, P.: Enhancing privacy through negative representations of data. Technical report, University of New Mexico (2004)","DOI":"10.21236\/ADA498766"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Esponda, F., Forrest, S., Helman, P.: Information hiding through negative representations of data. Technical report, University of New Mexico (2004)","DOI":"10.21236\/ADA498766"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","first-page":"171","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 171\u2013185. Springer, Heidelberg (1987)"},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/237814.237866","volume-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing","author":"L. Grover","year":"1996","unstructured":"Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219. ACM Press, New York (1996)"},{"issue":"4","key":"32_CR19","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"J. ACM"},{"key":"32_CR20","first-page":"283","volume-title":"SAT 2000","author":"H.H. Hoos","year":"2000","unstructured":"Hoos, H.H., St\u00fctzle, T.: SATLIB: An online resource for research on SAT. In: SAT 2000, pp. 283\u2013292. IOS Press, Amsterdam (2000), \n                    \n                      http:\/\/www.satlib.org"},{"key":"32_CR21","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/1005140.1005150","volume-title":"Proceedings of the 2003 ACM Workshop on Privacy in the Electronic Society","author":"R. Impagliazzo","year":"2003","unstructured":"Impagliazzo, R., Miner, S.: Anonymous credentials with biometrically-enforced non-transferability. In: Proceedings of the 2003 ACM Workshop on Privacy in the Electronic Society, pp. 60\u201371. ACM, New York (2003)"},{"key":"32_CR22","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/SFCS.1997.646129","volume-title":"Proceedings of the 38th Annual Symposium on Foundations of Computer Science","author":"H.J. Karloff","year":"1997","unstructured":"Karloff, H.J., Zwick, U.: A 7\/8-approximation algorithm for MAX 3SAT? In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 406\u2013415. IEEE Computer Society, Los Alamitos (1997)"},{"key":"32_CR23","unstructured":"Merkle, R.C.: Secrecy, authentication, and public key systems. UMI Research Press (1982)"},{"key":"32_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"R.C. Merkle","year":"1988","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 369\u2013378. Springer, Heidelberg (1988)"},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"Odlyzko, A.M.: The rise and fall of the knapsack cryptosystems. In: PSAM: Proceedings of the 42nd Symposium in Applied Mathematics, pp. 75\u201388 (1990)","DOI":"10.1090\/psapm\/042\/1095552"},{"issue":"2","key":"32_CR26","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"32_CR27","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/SFCS.1994.365700","volume-title":"Proceedings of the 35th Annual Symposium on Foundations of Computer Science","author":"P. Shor","year":"1994","unstructured":"Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE, Los Alamitos (1994)"},{"key":"32_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-540-24676-3_32","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Szydlo","year":"2004","unstructured":"Szydlo, M.: Merkle tree traversal in log space and time. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 541\u2013554. Springer, Heidelberg (2004)"},{"key":"32_CR29","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1145\/1132516.1132560","volume-title":"STOC 2006 \u2013 38th Annual ACM Symposium on Theory of Computing","author":"J. Watrous","year":"2006","unstructured":"Watrous, J.: Zero knowledge against quantum attacks. In: STOC 2006 \u2013 38th Annual ACM Symposium on Theory of Computing, pp. 296\u2013315. ACM, New York (2006)"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11935308_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T20:09:53Z","timestamp":1566763793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11935308_32"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540494966","9783540494973"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11935308_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}