IP Library › Granted Patent US 12,744,663
Granted Patent B2
US 12,744,663 · App. 19/116,000 · Granted Sep 22, 2026

Lightweight, resilient, and aggregate symmetric cryptographic tools for internet of things and forensics

Inventor: Attila Altay Yavuz (Tampa, FL)
Assignee: UNIVERSITY OF SOUTH FLORIDA
H04L9/085H04L9/3242
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,744,663
App. No.
19/116,000
Granted
Sep 22, 2026
Kind
B2
Abstract

A method of data encryption for messages transmitted between two or more computing devices includes determining a current secret key that is shared between a first computing device and a second computing device, calculating a current message authentication code (MAC) based on the current secret key and the message, calculating a subsequent secret key based on the current secret key using a one-way pseudorandom function, calculating a subsequent MAC by aggregating the current MAC and a first preceding aggregate MAC, and encrypting the message using the subsequent MAC and the subsequent secret key.

Claims (32)

1 . A method for encrypting a message transmitted between two or more computing devices, the method comprising:

determining a current secret key that is shared between a first computing device and a second computing device, wherein the second computing device is remote from the first computing device;

calculating a current message authentication code (MAC) based on the current secret key and the message;

calculating a subsequent secret key based on the current secret key using a one-way pseudorandom function;

calculating a subsequent MAC by aggregating the current MAC and a first preceding aggregate MAC; and

encrypting the message using the subsequent MAC and the subsequent secret key, wherein calculating the subsequent secret key based on the current secret key using the one-way pseudorandom function is defined as (a j+1 ∥b j+1 )←UPD(a j ∥b j ), where a j and b j are polynomials that define the current secret key and UPD is the one-way pseudorandom function.

2 . The method of claim 1 , wherein the current MAC is calculated as aajj·mmjj+bbjj mod qq if mmjj∈ qq, where aajj and bbjj are polynomials that define the current secret key, mmjj is the message, and qq is a large prime.

3 . The method of claim 1 , wherein mmjj is mapped into qq by applying one or a full domain hash (FDH) or a universal hash if m j ∉ qq.

4 . The method of claim 1 , wherein aajj and bbjj are deleted from a memory of the first computing device after calculating the subsequent secret key.

5 . The method of claim 1 , wherein the subsequent MAC is calculated as σσ1,jj+1←σσjj+σσ1,jj−1 mod qq, where σσjj is the current MAC, σσ1,jj−1 is the first preceding aggregate MAC, and σσ1,jj+1 is the subsequent MAC.

6 . The method of claim 5 , wherein σσjj and σσ1,jj−1 are deleted from a memory of the first computing device after calculating the subsequent MAC.

7 . The method of claim 1 , wherein the current secret key is in the format ssss1={aa1,bb1}$← qq*.

8 . A non-transitory computer readable medium having instructions stored thereon that, when executed by one or more processors, cause a computing device to:

determine a current secret key that is shared between the computing device and a remote computing device;

calculate a current message authentication code (MAC) based on the current secret key for a message being transmitted from the computing device to the remote computing device;

calculate a subsequent secret key based on the current secret key using a one-way pseudorandom function;

calculate a subsequent MAC by aggregating the current MAC and a first preceding aggregate MAC; and

encrypt the message using the subsequent MAC and the subsequent secret key, wherein calculating the subsequent secret key based on the current secret key using the one-way pseudorandom function is defined as (a j+1 ∥b j+1 )←UPD(a j ∥b j ), where a j and b j are polynomials that define the current secret key and UPD is the one-way pseudorandom function.

9 . The computer readable medium of claim 8 , wherein the current MAC is calculated as aajj·mmjj+bbjj mod qq if mmjj∈ qq, where aajj and bbjj are polynomials that define the current secret key, mmjj is the message, and qq is a large prime.

10 . The computer readable medium of claim 8 , wherein mmjj is mapped into q by applying one or a full domain hash (FDH) or a universal hash if mmjj∉ qq.

11 . The computer readable medium of claim 8 , wherein aajj and bbjj are deleted from a memory of the first computing device after calculating the subsequent secret key.

12 . The computer readable medium of claim 8 , wherein the subsequent MAC is calculated as σσ1,jj+1←σσjj+σσ1,jj−1 mod qq, where σσjj is the current MAC, σσ1,jj−1 is the first preceding aggregate MAC, and σσ1,jj+1 is the subsequent MAC.

13 . The computer readable medium of claim 12 , wherein σσjj and σσ1,jj−1 are deleted from a memory of the first computing device after calculating the subsequent MAC.

14 . The computer readable medium of claim 8 , wherein the current secret key is in the format ssss1={aa1,bb1}$← qq*.

15 . A method for encrypting a message transmitted between two or more computing devices, the method comprising:

determining a current secret key that is shared between the two or more computing devices;

calculating a current message authentication code (MAC) and a current ciphertext based on the current secret key and the message using authenticated encryption (AE);

calculating a subsequent secret key based on the current secret key using a one-way pseudorandom function;

calculating a subsequent MAC by aggregating the current MAC and a first preceding aggregate MAC; and

encrypting the message using the subsequent MAC, the current ciphertext, and the subsequent secret key, wherein calculating the subsequent secret key based on the current secret key using the one-way pseudorandom function is defined as (a j+1 ∥b j+1 )←UPD(a j ∥b j ), where a j and b j are polynomials that define the current secret key and UPD is the one-way pseudorandom function.

16 . The method of claim 15 , wherein the current MAC and the current ciphertext are calculated as (σσjj,ccjj)←AAAA(ssssjj,mmjj), where σσjj is the current MAC, ccjj is the current ciphertext, mmjj is the message, and ssssjj is the current secret key.

17 . The method of claim 15 , wherein the subsequent aggregate MAC is calculated as σσ1,jj+1←σσjj⊕σσ1,jj−1, where σσjj is the current MAC, σσ1,jj−1 is the first preceding aggregate MAC, and σσ1,jj+1 is the subsequent MAC.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 1, 2025
From: YAVUZ, ATTILA ALTAY
To: UNIVERSITY OF SOUTH FLORIDA
Reel/Frame 070693/0554 →
Continuity (2)
Provisional Application 63377446 · Sep 28, 2022
Related Publication 20260106736A1 · Apr 16, 2026
References Cited (92)
US 10587416B1 · Yavuz · 2020 [cited by applicant]
US 10630478B1 · Yavuz · 2020 [cited by applicant]
US 11271728B2 · Mandal · 2022 [cited by examiner]
US 11323267B1 · Griffin · 2022 [cited by examiner]
US 11418329B1 · Miller · 2022 [cited by examiner]
US 11698869B1 · Kulkarni · 2023 [cited by examiner]
US 11736459B2 · Wang · 2023 [cited by examiner]
US 11750580B2 · O'Connell · 2023 [cited by examiner]
US 11799662B2 · Shahar · 2023 [cited by examiner]
US 11818268B2 · Vermeulen · 2023 [cited by examiner]
US 12047519B2 · Zheng · 2024 [cited by examiner]
US 12489620B2 · Rindal · 2025 [cited by examiner]
US 20190074975A1 · Koskimies · 2019 [cited by examiner]
US 20210391983A1 · Will · 2021 [cited by examiner]
US 20220417002A1 · Esiner · 2022 [cited by examiner]
EP 0836775B1 · 2006 [cited by applicant]
EP 3654579A1 · 2020 [cited by applicant]
WO 2022046130A1 · 2022 [cited by applicant]
Rivest R.L., et al., “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communications of the ACM, Feb. 1, 1978, vol. 21, No. 2, pp. 120-126. [cited by applicant]
Rushanan M., et al., “SOK: Security and Privacy in Implantable Medical Devices and Body Area Networks,” Proceedings of the 2014 IEEE Symposium on Security and Privacy (SP '14), IEEE Computer Society, 2014, pp. 524-539. [cited by applicant]
Sadeghi A-R., et al., “Security and Privacy Challenges in Industrial Internet of Things,” Proceedings of the 52nd Annual Design Automation Conference (DAC '15), Jun. 7-11, 2015, pp. 54:1-54:6 (6 Pages). [cited by applicant]
Schneier B., et al., “Secure Audit Logs to Support Computer Forensics,” ACM Transactions on Information and System Security (TISSEC), May 1, 1999, vol. 2, No. 2, pp. 159-176. [cited by applicant]
Serrano N., et al., “A Complete Study of P.K.I. (PKI's Known Incidents),” The 47th Research Conference on Communications, Information, and Internet Policy (TPRC), 2019, 45 Pages. [cited by applicant]
Seyitoglu E.U.A., et al., “Compact and Resilient Cryptographic Tools for Digital Forensics,” IEEE Conference on Communications and Network Security (CNS), Jun. 29, 2020, pp. 1-9. [cited by applicant]
Shamir A., “How to Share a Secret,” Communications of the ACM, Nov. 1979, vol. 22, No. 11, pp. 612-613. [cited by applicant]
Shoup V., “A Proposal for an ISO Standard for Public Key Encryption,” (Version 2.1), IACR Cryptology ePrint Archive, 2001, p. 112 (63 pages). [cited by applicant]
Singla A., et al., “Look Before You Leap: Secure Connection Bootstrapping for 5G Networks to Defend Against Fake Base-stations,” ASIA Conference on Computer and Communications Security(CCS '21), Virtual Event, Hong Kong… [cited by applicant]
Stinson, D., “Cryptography: Theory and Practice,” CRC/C&H, 2002, Second Edition, 573 pages. [cited by applicant]
Stinson D.R., “Universal Hashing and Authentication Codes,” Designs, Codes and Cryptography, Oct. 1994, vol. 4, No. 4, pp. 369-380. [cited by applicant]
Sun S.F., et al., “Efficient Completely Nonmalleable and RKA Secure Public Key Encryptions,” Australasian Conference on Information Security and Privacy, 2016, pp. 134-150 (17 pages). [cited by applicant]
Turan M.S., et al., “Status Report on the Second Round of the NIST Lightweight Cryptography Standardization Process,” National Institute of Standards and Technology Internal Report, Jul. 20, 2021, vol. 8369, No. 10.6028… [cited by applicant]
Wang G., et al., “Improved Fault-Tolerant Aggregate Signatures,” The Computer Journal, Apr. 2019, vol. 62, No. 4, 9 pages. [cited by applicant]
Wang Q., et al., “Time Valid One-Time Signature for Time-Critical Multicast Data Authentication,” INFOCOM 2009, IEEE, Apr. 2009, 9 pages. [cited by applicant]
Yavuz A.A., et al., “BAF: An Efficient Publicly Verifiable Secure Audit Logging Scheme for Distributed Systems,” 2009 Annual Computer Security Applications Conference, Dec. 7, 2009, pp. 219-228 (10 Pages). [cited by applicant]
Yavuz A.A., et al., “BAF and FI-BAF: Efficient and Publicly Verifiable Cryptographic Schemes for Secure Logging in Resource-Constrained Systems,” ACM Transactions on Information and System Security (TISSEC), Jul. 1, 201… [cited by applicant]
Yavuz A.A., et al., “Efficient, Compromise Resilient and Append-only Cryptographic Schemes for Secure Audit Logging,” 16th International Conference on Financial Cryptography and Data Security, Feb. 27-Mar. 2, 2012, pp. … [cited by applicant]
Yavuz A.A., et al., “Self-Sustaining, Efficient and Forward-Secure Cryptographic Constructions for Unattended Wireless Sensor Networks,” Ad Hoc Networks, 2012, vol. 10, No. 7, pp. 1204-1220. [cited by applicant]
Yavuz A.A., et al., “Hash-Based Sequential Aggregate and Forward Secure Signature for Unattended Wireless Sensor Networks,” Proceedings of the 6th Annual International Conference on Mobile and Ubiquitous Systems (MobiQu… [cited by applicant]
Yavuz A.A., “ETA: Efficient and Tiny Authentication for Heterogeneous Wireless Systems,” Proceedings of the Sixth ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec '13), Apr. 2013, pp. 67-72. [cited by applicant]
Yavuz A.A., “Immutable Authentication and Integrity Schemes for Outsourced Databases,” IEEE Transactions on Dependable and Secure Computing, 2018, vol. 15, No. 1, pp. 69-82 (14 pages). [cited by applicant]
Zhao S., et al., “Smart and Practical Privacy-Preserving Data Aggregation for Fog-Based Smart Grids,” IEEE Transactions on Information Forensics and Security, 2020, vol. 16, pp. 521-536 (16 pages). [cited by applicant]
Agrawal S., et al., “DiSE: Distributed Symmetric-Key Encryption,” Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018, pp. 1993-2010. [cited by applicant]
Agrawal S., et al., “Homomorphic MACs: MAC-Based Integrity for Network Coding,” Applied Cryptography and Network Security, 2009, pp. 292-305 (12 pages). [cited by applicant]
Aumasson J-P., et al., “Blake2: Simpler, Smaller, Fast as MD5,” Applied Cryptography and Network Security, Springer Berlin Heidelberg, Editors: Jacobson M., Locasto M., Mohassel P and Safavi-Naini R., 2013, pp. 119-135 … [cited by applicant]
Behnia R., et al., “Towards Practical Post-Quantum Signatures for Resource-Limited Internet of Things,” Association for Computing Machinery, New York, USA, Conference'21, Jun. 2021, pp. 119-130. [cited by applicant]
Bellare M., et al., “Introduction to Modern Cryptography,” May 11, 2005, 283 Pages, UCSD CSE Course, 1st Edition, p. 207 [Online], Retrieved From URL: http://www.cs.ucsd.edu/~mihir/cse207/classnotes.html. [cited by applicant]
Bernstein D.J., “The Poly1305-AES Message-Authentication Code,” Fast Software Encryption: 12th International Workshop, FSE 2005, Revised Selected Papers, Feb. 2005, pp. 32-49 (17 pages). [cited by applicant]
Best J., “Could Implanted Medical Devices Be Hacked,” (BMJ) British Medical Journal, Jan. 14, 2020, vol. 368, m102, 3 Pages. [cited by applicant]
Black J., et al., “UMAC: Fast and Secure Message Authentication,” Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO '99), 1999, pp. 216-233 (29 pages). [cited by applicant]
Boneh D., et al., “Compact Multi-Signatures for Smaller Blockchains,” Advances in Cryptology—ASIACRYPT 2018, 2018, pp. 435-464 (33 pages). [cited by applicant]
Borghoff J., et al., “Prince: A Low-Latency Block Cipher for Pervasive Computing Applications,” In Proceedings of the 18th International Conference on The Theory and Application of Cryptology and Information Security, A… [cited by applicant]
Coron J.S., “On the Exact Security of Full Domain Hash,” Advances in Cryptology (CRYPTO '00), 2000, pp. 229-235 (8 pages). [cited by applicant]
Cozzo D., et al., “Sharing the LUOV: Threshold Post-Quantum Signatures,” Cryptology ePrint Archive, IMA International Conference on Cryptography and Coding, 2019, 24 pages, Retrieved from URL: https://ia.cr/2019/1060. [cited by applicant]
Cronin E., et al., “On the Performance, Feasibility, and Use of Forward-Secure Signatures,” Proceedings of the 10th ACM Conference on Computer and Communications Security, Oct. 27, 2003, pp. 131-144 (15 Pages). [cited by applicant]
Crosby S.A., et al., “Efficient Data Structures for Tamper Evident Logging,” Proceedings of the 18th Conference on USENIX Security Symposium, Aug. 2009, 17 Pages. [cited by applicant]
Daemen J., et al., “The Design of Rijndael: AES—The Advanced Encryption Standard,” Springer Science & Business Media, 2002, 243 pages. [cited by applicant]
Damgard I., et al., “Multiparty Computation From Somewhat Homomorphic Encryption,” Annual Cryptology Conference, 2012, pp. 643-662 (46 pages). [cited by applicant]
Delgado-Mohatar O., et al., “An Energy-Efficient Symmetric Cryptography Based Authentication Scheme for Wireless Sensor Networks,” in Proceedings of the 4th IFIP WG 11.2 International Conference on Information Security … [cited by applicant]
Elgamal T., “A public key cryptosystem and a signature scheme based on discrete logarithms.” IEEE transactions on information theory 31.4 (1985): 469-472. [cited by applicant]
Etzel M., et al., “Square Hash: Fast Message Authentication via Optimized Universal Hash Functions,” Proceedings of CRYPTO '99, Lecture Notes in Computer Science, 1999, pp. 234-251 (18 pages). [cited by applicant]
Evans D., et al., “A Pragmatic Introduction to Secure Multi-Party Computation,” Foundations and Trends in Privacy and Security, 2018, vol. 2, No. 2-3, pp. 70-246, 181 Pages, Retrieved from URL: https://doi.org/10.1561/3… [cited by applicant]
Gaba G.S., et al., “Secure Device-to-Device Communications for 5G Enabled Internet of Things Applications,” Computer Communications, 2021, vol. 169, pp. 114-128 (19 Pages). [cited by applicant]
Gentry C., et al., “Hierarchical ID-Based Cryptography,” Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, 2002, vol. 2501, pp.… [cited by applicant]
Ghosh S., et al., “Variants of Wegman-Carter Message Authentication Code Supporting Variable Tag Lengths,” Designs, Codes and Cryptography, 2021, vol. 89, No. 4, pp. 709-736 (29 pages). [cited by applicant]
Goldreich O., et al., “How to Construct Random Functions,” Journal of the Association for Computing Machinery, Oct. 1986, vol. 33, No. 4, pp. 792-807. [cited by applicant]
Grissa, M., et al., “LPOS: Location Privacy for Optimal Sensing in Cognitive Radio Networks,” 2015 IEEE Global Communications Conference (GLOBECOM), 2015, 7 pages. [cited by applicant]
Halevi S., et al., “MMH: Software Message Authentication in the Gbit/Second Rates,” Proceedings of the 4th International Workshop on Fast Software Encryption (FSE '97), 1997, pp. 172-189 (18 pages). [cited by applicant]
Hankerson D., et al., “Guide to Elliptic Curve Cryptography,” Springer, 2004, 138 Pages. [cited by applicant]
He Y., et al., “Attacking and Defence Pathways for Intelligent Medical Diagnosis System (IMDS),” International Journal of Medical Informatics, 2021, vol. 148, 104415, 13 Pages. [cited by applicant]
Holt J.E., “Logcrypt: Forward Security and Public Verification for Secure Audit Logs,” Proceedings of the 2006 Australasian Workshops on Grid Computing and E-Research, Jan. 1, 2006, vol. 54, pp. 203-211 (9 Pages). [cited by applicant]
Idalino T.B., et al., “Nested Cover-Free Families for Unbounded Fault-Tolerant Aggregate Signatures,” Theoretical Computer Science, 2021, vol. 854, pp. 116-130. [cited by applicant]
Itkis G., et al., “Forward-Secure Signatures with Optimal Signing and Verifying,” Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology (CRYPTO '01), Editor: Killian J, Lecture Not… [cited by applicant]
Johnson D., et al., “The Elliptic Curve Digital Signature Algorithm (ECDSA),” Certicom, International Journal of Information Security, 2001, vol. 1, No. 1, pp. 36-63 (55 Pages). [cited by applicant]
Kampanakis P., et al., “BAFi: A Practical Cryptographic Secure Audit Logging Scheme for Digital Forensics,” Security and Communication Networks, 2015, vol. 8, pp. 3180-3190, Epublished On: Mar. 26, 2015. [cited by applicant]
Kaps J.P., et al., “Energy Scalable Universal Hashing,” IEE Transactions on Computers, 2005, vol. 54, pp. 1484-1495 (11 pages). [cited by applicant]
Katz J., et al., “Aggregate Message Authentication Codes,” Cryptographers Track at the RSA Conference, Apr. 8, 2008, pp. 155-169 (13 Pages). [cited by applicant]
Keoh S.L., et al., “Securing the Internet of Things: A Standardization Perspective,” IEEE Internet of Things Journal, Jun. 2014, vol. 1, No. 3, pp. 265-275 (13 Pages). [cited by applicant]
Krawczyk H., et al., “HMAC: Keyed-Hashing for Message Authentication,” IETF RFC 2104, Feb. 1997, 11 pages. [cited by applicant]
Krovetz T., “Message Authentication on 64-Bit Architectures,” Selected Areas in Cryptography: 13th International Workshop, SAC 2006, 2007, pp. 327-341 (11 pages). [cited by applicant]
Kumar R., et al., “On Improving Wireless Broadcast Reliability of Sensor Networks Using Erasure Codes,” Mobile Ad-hoc and Sensor Networks, Lecture Notes in Computer Science, 2006, vol. 4325, pp. 155-170 (17 pages). [cited by applicant]
Liang Y., et al., “Energy-Efficient Collaborative Sensing: Learning the Latent Correlations of Heterogeneous Sensors,” ACM Transactions on Sensor Networks, Jun. 2021, vol. 17, No. 3, Article. 33, 28 Pages. [cited by applicant]
Ma D., et al., “A New Approach to Secure Logging,” Transactions on Storage, Mar. 2009, vol. 5, No. 1, pp. 2:1-2:21 (16 Pages). [cited by applicant]
Ma D., et al., “Forward-Secure Sequential Aggregate Authentication,” IEEE Symposium on Security and Privacy (SP'07), May 20, 2007, pp. 86-91 (10 Pages). [cited by applicant]
Ma D., “Practical Forward Secure Sequential Aggregate Signatures,” Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, Mar. 18, 2008, pp. 341-352. [cited by applicant]
Malkin T., et al., “Efficient Generic Forward-Secure Signatures with an Unbounded Number of Time Periods,” Proceedings of the 21st International Conference on the Theory and Applications of Cryptographic Techniques (EUR… [cited by applicant]
Mu Y., et al. “Compact Sequential Aggregate Signatures,” Proceedings of the 2007 ACM Symposium on Applied Computing, Mar. 11, 2007, pp. 249-253 (6 Pages). [cited by applicant]
Munch J.P., et al., “VASA: Vector AES Instructions for Security Applications,” Association for Computing Machinery, 2021, pp. 131-145. [cited by applicant]
Ozmen M.O., et al., “Energy-Aware Digital Signatures for Embedded Medical Devices,” IEEE Conference on Communications and Network Security (CNS), Jun. 10, 2019, pp. 55-63 (10 Pages). [cited by applicant]
Pabbuleti K., et al., “Energy Budget Analysis for Signature Protocols on a Self-Powered Wireless Sensor Node,” Radio Frequency Identification: Security and Privacy Issues: 10th International Workshop, Jul. 21-23, 2014, … [cited by applicant]
Rahman M., et al., “Security Vulnerabilities in Existing Security Mechanisms for IoMT and Potential Solutions for Mitigating Cyber Attacks,” Springer International Publishing, Cham, 2021, pp. 307-334. [cited by applicant]
Rechberger C., et al., “Cryptanalysis of Low-Data Instances of Full LowMCv2,” IACR Transactions on Symmetric Cryptology, 2018, vol. 3, pp. 163-181. [cited by applicant]
International Search Report and Written Opinion, mailed Dec. 19, 2023, received in connection with corresponding International Patent Application No. PCT/US2023/075133. [cited by applicant]