Saro Meguerdichian
ABSTRACT
Hardware-based physically unclonable functions (PUFs) are elegant security primitives that leverage process variation inherent in modern integrated circuits. Recently proposed matched public PUFs (mPPUFs) use a combination of coordinated device aging and gate disabling to create two PUFs that securely realize identical input-output mappings. However, mPPUFs of any reasonable size allow for protocols between only a very limited number of parties. We propose quantization of possible delay values to enable matching of an unbounded number of arbitrary PPUF instances, improving stability in the presence of fluctuations in temperature or supply voltage while maintaining resiliency against a wide number of attacks.
- B. Gassend et al., "Silicon physical random functions," ACM CCS, pp. 148--160, 2002. Google Scholar
Digital Library
- N. Beckmann and M. Potkonjak, "Hardware-based public-key cryptography with public physically unclonable functions," IH, pp. 206--220, 2009. Google ScholarDigital Library
- S. Meguerdichian and M. Potkonjak, "Matched public PUF: ultra low energy security platform," IEEE/ACM ISLPED, pp. 45--50, 2011. Google ScholarDigital Library
- R. Pappu et al., "Physical one-way functions," Science, vol. 297, no. 5589, pp. 2026--2030, 2002.Google ScholarCross Ref
- U. Rührmair, "SIMPL systems, or: can we design cryptographic hardware without secret key information?" SOFSEM, vol. 6543, pp. 26--45, 2011. Google ScholarDigital Library
- M. Potkonjak, S. Meguerdichian, and J. L. Wong, "Trusted sensors and remove sensing," IEEE Sensors, pp. 1104--1107, 2010.Google Scholar
- M. Potkonjak et al., "Differential public physically unclonable functions: architecture and applications," IEEE/ACM DAC, pp. 242--247, 2011. Google ScholarDigital Library
- S. Meguerdichian and M. Potkonjak, "Device aging-based physically unclonable functions," IEEE/ACM DAC, pp. 288--289, 2011. Google ScholarDigital Library
- S. Meguerdichian and M. Potkonjak, "Security primitives and protocols for ultra low power sensor systems," IEEE Sensors, pp. 1225--1228, 2011.Google Scholar
- D. Markovic et al., "Ultralow-power design in near-threshold region," Proceedings of the IEEE, vol. 98, no. 2, pp. 237--252, 2010.Google ScholarCross Ref
- B. Cline et al., "Analysis and modeling of CD variation for statistical static timing," IEEE ICCAD, pp. 60--66, 2006. Google ScholarDigital Library
- A. Asenov, "Random dopant induced threshold voltage lowering and fluctuations in sub-0.1 um MOSFETs: a 3-D atomistic simulation study," IEEE T-ED. vol. 45, no. 12, pp. 2505--2513, 1998.Google ScholarCross Ref
- M. A. Alam et al., "A comprehensive model of PMOS NBTI degradation," Microelectronics Reliability, vol. 45, pp. 71--81, 2005.Google ScholarCross Ref
- S. Chakravarthi et al., "A comprehensive framework for predictive modeling of negative bias temperature instability," IRPS, pp. 273--282, 2004.Google Scholar
Index Terms
- Using standardized quantization for multi-party PPUF matching: foundations and applications
Recommendations
Multi-Party Fair Exchange with an Off-Line Trusted Neutral Party
DEXA '99: Proceedings of the 10th International Workshop on Database & Expert Systems ApplicationsRecently developed cryptographic techniques [2, 4, 6, 14] make it possible to construct fair exchange protocols with an off-line trusted third party(TTP). The technique is referred to as a verifiable encryption scheme(VES) proves that a ciphertext is ...
Collusive attacks to "circle-type" multi-party quantum key agreement protocols
We find that existing multi-party quantum key agreement (MQKA) protocols designed for fairness of the key are, in fact, unfair. Our analysis shows that these protocols are sensitive to collusive attacks; that is, dishonest participants can collaborate ...
Efficient two party and multi party computation against covert adversaries
EUROCRYPT'08: Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptologyRecently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure computation protocols which are efficient enough to be usable in ...
Comments