Skip to main content

Energy-Privacy Trade-Offs in VLSI Computations

  • Conference paper
Progress in Cryptology - INDOCRYPT 2005 (INDOCRYPT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3797))

Included in the following conference series:

Abstract

VLSI circuits are open to sidechannel attacks which disclose information about its internal state to an adversary. Privacy is a design attribute to quantify the circuit’s resistance and resilience to sidechannel attacks. There has been some recent work in cryptography to capture the notion of privacy in circuits. Several constructions to transform a circuit into a private circuit have also been proposed. In this paper, we quantify the energy cost of providing privacy. We use the classical area-time-energy VLSI complexity theory techniques to prove lower bounds on the energy of any VLSI computation for a given function f parametrized by its privacy P (Privacy P or a P-private circuit implies that at least P bits of the circuit need to be observed to derive a single bit of information about an internal node). The main result establishes a lower bound of Ω(t 2 n 2) on the E or ET or AT 2 product of any t-private computation of an n-bit multiplier or shifter. Incidentally, the privacy transformation proposed by Ishai et al [6] will generate n-bit multiplier and shifter with matching energy, energy-time, and AT 2 characteristics establishing that these lower bounds are tight. The privacy of the base design, without any privacy enhancement techniques, is t = 1. Hence this demonstrates that the privacy comes at a quadratic multiplicative factor energy cost, which can be significant for portable, energy-starved applications such as Smart card. We further introduce the notion of information splitting secret sharing based privacy enhancement techniques. The lower bound on the energy for this case improves to Ω(Pn 2), a factor P improvement.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Agrawal, D., Aggarwal, C.C.: On the design and quantification of privacy preserving data mining algorithms. In: Symposium on Principles of Database Systems (2001)

    Google Scholar 

  2. Trusted Computing Platform Alliance. Trusted platform module (2003), http://www.trustedcomputing.org/

  3. Baudet, G.M.: On the Area Required by VLSI Circuits. In: Proceedings of CMU Conference on VLSI – VLSI Systems and Computations, pp. 100–107. CMU, Computer Science Press, Rockville (1981)

    Google Scholar 

  4. Blomer, J., Merchan, J., Krummel, V.: Provably secure masking of aes. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Chari, S., Jutla, C., Rao, J.R., Rohatgi, P.: Towards sound approaches to counteract power-analysis attacks. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 398–412. Springer, Heidelberg (1999)

    Google Scholar 

  6. Ishai, Y., Sahai, A., Wagner, D.: Private circuits: Securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729. Springer, Heidelberg (2003)

    Google Scholar 

  7. Kissin, G.: Measuring Energy Consumption in VLSI Circuits: a Foundation. In: Proceedings of ACM Symposium on Theory of Computing, pp. 99–104. ACM-SIGACT (1982)

    Google Scholar 

  8. Kocher, P., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 388–397. Springer, Heidelberg (1999)

    Google Scholar 

  9. Paul, C., Kocher, P.C.: Timing attacks on implementations of die-hellman, rsa, dss, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104–113. Springer, Heidelberg (1996)

    Google Scholar 

  10. Messerges, T.S.: Securing the aes finalists against power analysis attacks. In: Schneier, B. (ed.) FSE 2000. LNCS, vol. 1978, pp. 150–164. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Sentovich, E.M., Singh, K.J., Lavango, L., Moon, C., Muragi, R., Saldhana, A., Savoj, H., Stephen, P., Brayton, R., Sangiovanni-Vincentelli, A.: SIS: A System for Sequential Circuit Synthesis. Technical Report Memorandum Number UCB/ERL M92/41, Electronics Research Laboratory, Dept. of EECS, University of California, Berkeley (1992)

    Google Scholar 

  12. Thompson, C.D.: Area-Time Complexity for VLSI. In: Proceedings of ACM Symposium on Theory of Computing, pp. 81–88. ACM-SIGACT (1979)

    Google Scholar 

  13. Tyagi, A.: Energy-Time Trade-Offs in VLSI Computations. In: Veni Madhavan, C.E. (ed.) FSTTCS 1989. LNCS, vol. 405, pp. 301–311. Springer, Heidelberg (1989); submitted to IEEE TC

    Google Scholar 

  14. Ullman, J.D.: Computational Aspects of VLSI. Computer Science Press, Rockville (1984)

    MATH  Google Scholar 

  15. Vuillemin, J.: A Combinatorial Limit to the Computing Power of VLSI Circuits. IEEE Transactions on Computers C-32, 294–300 (1983)

    Article  Google Scholar 

  16. Yao, A.C.: Some Complexity Questions Related to Distributed Computing. In: Proceedings of ACM Symposium on Theory of Computing, pp. 209–213. ACM-SIGACT (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tyagi, A. (2005). Energy-Privacy Trade-Offs in VLSI Computations. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds) Progress in Cryptology - INDOCRYPT 2005. INDOCRYPT 2005. Lecture Notes in Computer Science, vol 3797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596219_29

Download citation

  • DOI: https://doi.org/10.1007/11596219_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30805-8

  • Online ISBN: 978-3-540-32278-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics