Abstract
A wide variety of powerful cryptographic tools have been built using RSA, Diffie-Hellman, and other similar assumptions as their basis. Computational security has been achieved relative to complexity assumptions about the computational difficulty of a variety of number theoretic problems. However, these problems are closely related, and it is likely that if any one of them turns out to be efficiently solvable with new mathematical advances or new kinds of computational devices, then similar techniques could be applicable to all of them. To provide greater diversity of security assumptions so that a break of one of them is less likely to yield a break of many or all of them, it is important to expand the body of computational problems on which security systems are based. Specifically, we suggest the use of hardness assumptions based on the complexity of logic problems, and in particular, we consider the well known Boolean 3Sat problem.
In this paper, we consider the use of the 3Sat problem to provide a cryptographic primitive, secure set membership. Secure set membership is a general problem for participants holding set elements to generate a representation of their set that can then be used to prove knowledge of set elements to others. Set membership protocols can be used, for example, for authentication problems such as digital credentials and some signature problems such as timestamping.
This work was supported in part by the National Science Foundation under grant number CCR-0331584.
Chapter PDF
Similar content being viewed by others
References
Acquisiti, A.: Anonymous credentials through acid mixing (2003) (upublished manuscript)
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)
Baric, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 480–494. Springer, Heidelberg (1997)
Benaloh, J.: Verifiable Secret-Ballot Elections. PhD thesis, Yale University Department of Computer Science (September 1987)
Benaloh, J., de Mare, M.: Efficient broadcast time-stamping. Technical Report TR-MCS-91-1, Clarkson University Department of Mathematics and Computer Science (1991)
Benaloh, J., de Mare, M.: One-way accumulators: A decentralized approach to digital signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 274–285. Springer, Heidelberg (1994)
Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. SIAM Journal of Computing 32(3), 586–615 (2003)
Brassard, G., Crepeau, C.: Zero-knowledge simulation of boolean circuits. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 223–233. Springer, Heidelberg (1987)
Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, p. 93. Springer, Heidelberg (2001)
Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, p. 61. Springer, Heidelberg (2002)
de Mare, M.: An analysis of certain cryptosystems and related mathematics. Master’s thesis, State University of New York Institute of Technology (December 2004)
Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory 22(6), 644–654 (1976)
Esponda, F.: Negative Representations of Information. PhD thesis, University of New Mexico (2005)
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. 3239, pp. 175–188. Springer, Heidelberg (2004)
Esponda, F., Forrest, S., Helman, P.: Enhancing privacy through negative representations of data. Technical report, University of New Mexico (2004)
Esponda, F., Forrest, S., Helman, P.: Information hiding through negative representations of data. Technical report, University of New Mexico (2004)
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. 263, pp. 171–185. Springer, Heidelberg (1987)
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–219. ACM Press, New York (1996)
Håstad, J.: Some optimal inapproximability results. J. ACM 48(4), 798–859 (2001)
Hoos, H.H., Stützle, T.: SATLIB: An online resource for research on SAT. In: SAT 2000, pp. 283–292. IOS Press, Amsterdam (2000), http://www.satlib.org
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–71. ACM, New York (2003)
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–415. IEEE Computer Society, Los Alamitos (1997)
Merkle, R.C.: Secrecy, authentication, and public key systems. UMI Research Press (1982)
Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369–378. Springer, Heidelberg (1988)
Odlyzko, A.M.: The rise and fall of the knapsack cryptosystems. In: PSAM: Proceedings of the 42nd Symposium in Applied Mathematics, pp. 75–88 (1990)
Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM 21(2), 120–126 (1978)
Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124–134. IEEE, Los Alamitos (1994)
Szydlo, M.: Merkle tree traversal in log space and time. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 541–554. Springer, Heidelberg (2004)
Watrous, J.: Zero knowledge against quantum attacks. In: STOC 2006 – 38th Annual ACM Symposium on Theory of Computing, pp. 296–315. ACM, New York (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Mare, M., Wright, R.N. (2006). Secure Set Membership Using 3Sat . In: Ning, P., Qing, S., Li, N. (eds) Information and Communications Security. ICICS 2006. Lecture Notes in Computer Science, vol 4307. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11935308_32
Download citation
DOI: https://doi.org/10.1007/11935308_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49496-6
Online ISBN: 978-3-540-49497-3
eBook Packages: Computer ScienceComputer Science (R0)