Evaluating encrypted boolean functions on encrypted bits: Secure decision-making on the black side

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 8754, Issue , 2013, Pages

  Krishnan, Rajesh ^a   Sundaram, Ravi ^b  

^a Cosocket LLC ^*  (United States)

^b Northeastern University   (United States)

Author keywords

Barrington's theorem; Confidential publish subscribe; Encrypted operations on encrypted data; Feige kilian naor protocol; Fixed structure group program; Secure cloud infrastructure; Secure decision making on black side

Indexed keywords

BARRINGTON'S THEOREM; CLOUD INFRASTRUCTURES; ENCRYPTED DATA; FIXED STRUCTURE; PUBLISH/SUBSCRIBE; SECURE DECISION-MAKING ON BLACK SIDE;

BOOLEAN FUNCTIONS; COMPUTER SYSTEM FIREWALLS; DECISION MAKING; FUNCTION EVALUATION; HAMMING DISTANCE;

CRYPTOGRAPHY;

EID: 84881183582     PISSN: 0277786X     EISSN: 1996756X     Source Type: Conference Proceeding    
DOI: 10.1117/12.2018574     Document Type: Conference Paper

References (17)

1. Barrington, D. A. M., "Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC1, " STOC 1986.
2. Carzaniga, A. and Wolf, A. L., "Forwarding in a Content-Based Network, " ACM SIGCOMM, 2003.
3. Even, S., Goldreich, O. and Lempel, A., "A Randomized Protocol for Signing Contracts, " CACM, Jun 1985.
4. Feige, U., Kilian, J. and Naor, M., "A Minimal Model for Secure Computation, " STOC 1994.
5. Gentry, C., "Fully Homomorphic Encryption using Ideal Lattices, " STOC 2009.
6. Huang, Y., Evans, D., Katz, J., and Malka, l., "Faster Secure Two-Party Computation Using Garbled Circuits, " USENIX Security Symposium, 2011.
7. Kolesnikov, V., Sadeghi, A.-R. and Schneider, T., "From dust to dawn: Practically efficient two-party secure function evaluation protocols and their modular design, " Cryptology ePrint Archive, Report 2010/079, 2010.
8. Krishnan, R. and Sundaram, R., "Policy-agile Encrypted Networks Via Secure Function Computation, " MILCOM 2010.
9. Naor, M., Pinkas, B., "Oblivious transfer with adaptive queries, " CRYPTO 1999.
10. Papadimitriou, C., "Section 15.3: The class NC, " Computational Complexity (1st ed.), Addison Wesley, pp. 375- 381, ISBN 0-201-53082-1, 1993.
11. Quisquater, J.-J., Guillou, L., Annick, M., Berson, T., "How to explain zero-knowledge protocols to your children, " CRYPTO 1989.
12. Rabin, M. O., "How to exchange secrets by oblivious transfer, " Tech Report TR-81, Harvard U., 1981.
13. Raiciu C., and Rosenblum, D. S., "Enabling Confidentiality in Content-Based Publish/Subscribe Infrastructures, " SecureComm 2006.
14. Rivest, R. L., Adleman, L. and Dertouzos, M. L., "On data banks and privacy homomorphisms, " Foundations of Secure Computation, 1978.
15. Valiant, L. G., "Universal Circuits (Preliminary Report), " STOC 1976.
16. Yao, A. C., "Protocols for secure computations, " FOCS 1982.
17. Yao, A.C., "How to Generate and Exchange Secrets, " FOCS 1986.