IP Library Granted Patent US 12,632,546
Granted Patent B1
US 12,632,546 · App. 19/296,721 · Granted May 19, 2026

Performing authentication

Inventor: Bjorn Markus Jakobsson (New York, NY)
Assignee: Raven White Security, Inc.
G06F21/554G06F21/00G06F21/31G06F21/552H04L9/0891H04L63/083H04L63/102H04L63/107H04L63/1483H04L63/18G06F2221/2131H04L2209/56H04L2209/605H04L2209/805
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,632,546
App. No.
19/296,721
Granted
May 19, 2026
Kind
B1
Abstract

Preference data is received. The received preference data is compared to stored preference data associated with a user with which the received preference data is associated. A determination is made whether to authorize an action based at least on the comparison. The preference data is received as a selection.

Claims (16)

1 . A system for utilizing a computer-readable tamper-evident log to manage an action to be performed by at least one computing device, the tamper-evident log accessible via at least one network interface that is communicatively coupled to a communications network, the system comprising:

one or more processors configured to:

generate an attestation value for the action with a cryptographic digital signature function;

transmit information about the action to at least one node on the network, the information corresponding to the attestation value; and

a memory, coupled to the one or more processors, for storing computer program instructions to be executed by the one or more processors;

wherein:

before the action is allowed to be performed, the tamper-evident log is updated by appending the information about the action to the tamper-evident log, the attestation value based at least in part on the action to be performed;

after the information about the action has been appended to the tamper-evident log, the action is caused to be performed; and

tampering of the tamper-evident log is detectable by performing a verification using the information about the action and the attestation value for the action.

2 . The system of claim 1 , wherein:

the one or more processors are further configured to:

generate with the cryptographic digital signature function an other attestation value for an other action, and

transmit information about the other action to at least one other node on the network, the information about the other action corresponding to the other attestation value; and

before the other action is allowed to be performed, the tamper-evident log is updated by appending the information about the other action to the tamper-evident log, the other attestation value based at least in part on the other action to be performed;

after the information about the other action has been appended to the tamper-evident log, the other action is caused to be performed; and

tampering of the tamper-evident log is detectable by performing an other verification using the information about the other action and the other attestation value.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 21, 2026
From: JAKOBSSON, BJORN MARKUS
To: RAVENWHITE SECURITY, INC.
Reel/Frame 075334/0716 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 21, 2026
From: RAVENWHITE SECURITY, INC.
To: NUECES BLOCKCHAIN LLC
Reel/Frame 075334/0752 →
Continuity (11)
Continuation 19011897 · Jan 7, 2025
Continuation 18763760 · Jul 3, 2024
Continuation 17592209 · Feb 3, 2022
Continuation 16997174 · Aug 19, 2020
Continuation 16048082 · Jul 27, 2018
Continuation 14325239 · Jul 7, 2014
Continuation 12215048 · Jun 23, 2008
Continuation In Part 11890408 · Aug 6, 2007
Provisional Application 60967675 · Sep 6, 2007
Provisional Application 60918781 · Mar 19, 2007
Provisional Application 60836641 · Aug 9, 2006
References Cited (133)
US 5446895A · White · 1995 [cited by examiner]
US 5704017A · Heckerman · 1997 [cited by applicant]
US 5721781A · Deo · 1998 [cited by applicant]
US 5978475A · Schneier · 1999 [cited by applicant]
US 5991882A · O'Connell · 1999 [cited by applicant]
US 6035406A · Moussa · 2000 [cited by applicant]
US 6108706A · Birdwell · 2000 [cited by applicant]
US 6385596B1 · Wiser · 2002 [cited by applicant]
US 6421453B1 · Kanevsky · 2002 [cited by applicant]
US 6496936B1 · French · 2002 [cited by applicant]
US 6766319B1 · Might · 2004 [cited by applicant]
US 6965948B1 · Eneborg · 2005 [cited by applicant]
US 7024690B1 · Young · 2006 [cited by applicant]
US 7095850B1 · McGrew · 2006 [cited by applicant]
US 7152165B1 · Maheshwari · 2006 [cited by applicant]
US 7310733B1 · Pearson · 2007 [cited by applicant]
US 7509290B1 · McKee · 2009 [cited by applicant]
US 7698442B1 · Krsihnamurthy · 2010 [cited by applicant]
US 7792738B2 · Channell · 2010 [cited by applicant]
US 7800534B1 · Yenney · 2010 [cited by applicant]
US 7861287B2 · Pomerantz · 2010 [cited by applicant]
US 7930735B2 · Vigelette · 2011 [cited by applicant]
US 7979908B2 · Millwee · 2011 [cited by applicant]
US 8069484B2 · McMillan · 2011 [cited by applicant]
US 8078881B1 · Liu · 2011 [cited by applicant]
US 8086533B1 · Maglaque · 2011 [cited by applicant]
US 8102253B1 · Brady · 2012 [cited by applicant]
US 8453222B1 · Newstadt · 2013 [cited by applicant]
US 8869243B2 · McGeehan · 2014 [cited by applicant]
US 20020023221A1 · Miyazaki · 2002 [cited by examiner]
US 20020026345A1 · Juels · 2002 [cited by applicant]
US 20020031230A1 · Sweet · 2002 [cited by applicant]
US 20020062268A1 · Sato · 2002 [cited by applicant]
US 20020169865A1 · Tarnoff · 2002 [cited by applicant]
US 20030131256A1 · Ackroyd · 2003 [cited by applicant]
US 20030145224A1 · Bailey · 2003 [cited by applicant]
US 20030154406A1 · Honarvar · 2003 [cited by applicant]
US 20030194094A1 · Lampson · 2003 [cited by applicant]
US 20030212800A1 · Jones · 2003 [cited by applicant]
US 20030225707A1 · Ehrman · 2003 [cited by applicant]
US 20030236992A1 · Yami · 2003 [cited by applicant]
US 20040054908A1 · Circenis · 2004 [cited by examiner]
US 20040083390A1 · Cuenod · 2004 [cited by applicant]
US 20040111621A1 · Himberger · 2004 [cited by applicant]
US 20040123116A1 · Jin · 2004 [cited by applicant]
US 20040123162A1 · Antell · 2004 [cited by applicant]
US 20040186813A1 · Tedesco · 2004 [cited by applicant]
US 20040189441A1 · Stergiou · 2004 [cited by applicant]
US 20040255150A1 · Sezan · 2004 [cited by applicant]
US 20050076384A1 · Upendran · 2005 [cited by applicant]
US 20050091492A1 · Benson · 2005 [cited by examiner]
US 20050097320A1 · Golan · 2005 [cited by applicant]
US 20050097364A1 · Edecki · 2005 [cited by applicant]
US 20050128989A1 · Bhagwat · 2005 [cited by applicant]
US 20050166065A1 · Eytchison · 2005 [cited by applicant]
US 20060036857A1 · Hwang · 2006 [cited by applicant]
US 20060123092A1 · Madams · 2006 [cited by applicant]
US 20060123478A1 · Rehfuss · 2006 [cited by applicant]
US 20060178918A1 · Mikurak · 2006 [cited by applicant]
US 20060225136A1 · Rounthwaite · 2006 [cited by applicant]
US 20060235764A1 · Bamborough · 2006 [cited by applicant]
US 20060258368A1 · Granito · 2006 [cited by applicant]
US 20060282660A1 · Varghese · 2006 [cited by applicant]
US 20060293921A1 · Mccarthy · 2006 [cited by applicant]
US 20070005967A1 · Mister · 2007 [cited by applicant]
US 20070016951A1 · Piccard · 2007 [cited by applicant]
US 20070022300A1 · Eppert · 2007 [cited by applicant]
US 20070039038A1 · Goodman · 2007 [cited by applicant]
US 20070081667A1 · Hwang · 2007 [cited by applicant]
US 20070179848A1 · Jain · 2007 [cited by applicant]
US 20070261109A1 · Renaud · 2007 [cited by applicant]
US 20070277224A1 · Osborn · 2007 [cited by applicant]
US 20090055910A1 · Lee · 2009 [cited by applicant]
US 20090094164A1 · Fontaine · 2009 [cited by applicant]
US 20090119763A1 · Park · 2009 [cited by applicant]
US 20090150986A1 · Foreman · 2009 [cited by applicant]
US 20090245572A1 · Redlich · 2009 [cited by applicant]
US 20090254971A1 · Herz · 2009 [cited by applicant]
US 20090319274A1 · Gross · 2009 [cited by applicant]
US 20100030578A1 · Siddique · 2010 [cited by applicant]
US 20100031330A1 · Von Ahn · 2010 [cited by applicant]
US 20100122341A1 · Golle · 2010 [cited by applicant]
US 20120011567A1 · Cronk · 2012 [cited by applicant]
US 20130117813A1 · Yudkin · 2013 [cited by applicant]
US 20150334077A1 · Feldman · 2015 [cited by applicant]
US 20160021105A1 · Pellom · 2016 [cited by applicant]
WO WO03034633 · 2003 [cited by applicant]
Agrawal, “Privacy-Preserving Data Mining”, Jan. 1, 2000, ACM SIGMOD Conference on Management of Data (2000), ACM Press, pp. 439-450. [cited by applicant]
Author Unknown, “ActiveX Spyware & Adware Scanning, Spywareinfo”, Oct. 9, 2006, Online Spyware Detection, http://www.spywareinfo.com/xscan.php. [cited by applicant]
Bellare, “A Forward-Secure Digital Signature Scheme”, Dec. 16, 1999, Michael Wiener (Ed.): CRYPTO'99, LNCS 1666, pp. 431-448. [cited by applicant]
Bellare, “Forward Integrity for Secure Audit Logs”, Nov. 23, 1997, Technical Report, University of California of San Diego, Dept. of Computer Science & Engineer., pp. 1-16. [cited by applicant]
Bellare, “Forward-Security in Private-Key Cryptography, in CT-RSA”, Jan. 1, 2003, Springer-Verlag, LNCS No. 2612, pp. 1-18. [cited by applicant]
Benaloh, “Efficient Broadcast Time-Stamping (Extended Abstract)”, Apr. 21, 1992, Clarkson University, Potsdam, New York. [cited by applicant]
Buldas, “On Provably Secure Time-Stamping Schemes”, Jan. 1, 2004, International Conference on the Theory and Application of Cryptology and Information Security. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. [cited by applicant]
Buldas, “Optimally Efficient Accountable Time-Stamping”, Jan. 1, 2000, International workshop on public key cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. [cited by applicant]
Buldas, “Universally Composable Time-Stamping Schemes with Audit”, Sep. 20, 2005, Information Security: 8th International Conference, ISC 2005, Singapore, Sep. 20-23, 2005. Proceedings 8. Springer Berlin Heidelberg, 200… [cited by applicant]
Chong, “Secure Audit Logging with Tamper-Resistant Hardware”, Jan. 1, 2003, Security and Privacy in the Age of Uncertainty. SEC 2003. IFIP—The International Federation for Information Processing, vol. 122. Springer, Bos… [cited by applicant]
Chun, “Attested Append-Only Memory: Making Adversaries Stick to their Word”, Oct. 14, 2007, SOSP'07, Oct. 14-17, 2007, Stevenson, Washington, USA. [cited by applicant]
Clover, “Timing Attacks on Web Privacy (Paper and Specific Issue),”, Feb. 20, 2002, http://www.securiteam.com/securityreviews/5GP020A6LG.html. [cited by applicant]
Devanbu, “Authentic Data Publication Over the Internet”, Jul. 1, 2003, Journal of Computer Security, vol. 11, No. 3, pp. 291-314, 2003. [cited by applicant]
Diffie, “Authentication and Authenticated Key Exchanges”, Jan. 1, 1992, Designs, Codes and Cryptography, 2, pp. 107-125. [cited by applicant]
Felten, “Timing Attacks on Web Privacy”, Jan. 1, 2000, ACM Conference on Computer and Communication Security (2000), ACM Press, pp. 25-32. [cited by applicant]
Gennaro, “How to Sign Digital Streams”, Jan. 1, 2006, Advances in Cryptology—CRYPTO '97 (CRYPTO 1997), Conference paper First Online: Jan. 1, 2006 pp. 180-197. [cited by applicant]
Gunther, “An Identity-Based Key-Exchange Protocol,”, Oct. 9, 2007, http://dsns.csie.nctu.edu.tw/research/crypto/HTML/PDF/E89/29.PDF. [cited by applicant]
Haber, “How to Time-Stamp a Digital Document”, Jan. 1, 1991, Journal of Cryptology, International Assoc. for Cryptologic Research, 3: 99-111. [cited by applicant]
Jin, “Key Evolution-Based Tamper Resistance: A Subgroup Extension”, Jan. 1, 2007, In R.H. Deng and P. Samarati, editors, ACM ASIACCS. [cited by applicant]
Jin, “Towards Better Software Tamper Resistance”, Jan. 1, 2005, In J. Zhou et al., editor, Information Security Conference, Springer, LNCS 3650, 3650, pp. 417-430. [cited by applicant]
Just, “Some Timestamping Protocol Failures”, Mar. 12, 1998, In NDSS (vol. 98, pp. 89-96). [cited by applicant]
Kawaguchi, “Efficient log authentication for forensic computing”, Jun. 1, 2005, Proceedings from the Sixth Annual IEEE SMC Information Assurance Workshop (pp. 215-223). [cited by applicant]
Kelsey, “An authenticated camera”, Dec. 1, 1996, Proceedings 12th Annual Computer Security Applications Conference. IEEE, 1996, (pp. 24-30). [cited by applicant]
Krawczyk, “Simple Forward-Secure Signatures From Any Signature Scheme”, Nov. 1, 2000, CCS '00: Proceedings of the 7th ACM conference on Computer and Communications Security pp. 108-115. [cited by applicant]
Maniatis, “Secure History Preservation through Timeline Entanglement”, Aug. 5, 2002, Proceedings of the 11th USENIX Security Symposium, Aug. 5-9, 2002, San Francisco, CA, USA. [cited by applicant]
Rabkin, “Personal Knowledge Questions for Fallback Authentication: Security Questions in the Era of Facebook”, Jan. 1, 2008, Symposium on Usable Privacy and Security (SOUPS), 2008. [cited by applicant]
Schneier, “Cryptographic Support for Secure Logs on Untrusted Machine”, May 1, 1999, In USENIX Security Symposium, pp. 53-62,1998. Schneier et al., Secure Audit Logs to Support Computer Forensics, ACM Transactions on In… [cited by applicant]
Schneier, “Secure Audit Logs to Support Computer Forensics”, May 1, 1999, ACM Transactions on Information and System Security (TISSEC), 2(2), pp. 159-176. [cited by applicant]
Snodgrass, “Tamper Detection in Audit Logs”, Jan. 1, 2004, Proceedings of the Thirtieth international conference on Very large data bases—vol. 30. 2004. [cited by applicant]
Une, “The Security Evaluation of Time Stamping Schemes: The Present Situation and Studies”, 2001, IMES Discussion Paper Series 2001-E-18, Bank of Japan. [cited by applicant]
Waters, “Building an Encrypted and Searchable Audit Log”, Jan. 9, 2004, https://people.cs.georgetown.edu/˜clay/classes/fall2014/papers/Building_an_Encrypted_and_Searchable_Audit_Log.pdf. [cited by applicant]
U.S. Appl. No. 11/890,408: Non-Final Office Action, Aug. 26, 2010. [cited by applicant]
U.S. Appl. No. 11/890,408: Response, Feb. 24, 2011. [cited by applicant]
U.S. Appl. No. 11/890,408: Final Office Action, Apr. 7, 2011. [cited by applicant]
U.S. Appl. No. 11/890,408: Response, Sep. 7, 2011. [cited by applicant]
U.S. Appl. No. 11/890,408: Non-Final Office Action, Oct. 17, 2011. [cited by applicant]
U.S. Appl. No. 11/890,408: Response, Mar. 19, 2012. [cited by applicant]
U.S. Appl. No. 11/890,408: Final Office Action, Apr. 24, 2012. [cited by applicant]
U.S. Appl. No. 11/890,408: Interview Summary & Office Action Appendix, Oct. 19, 2012. [cited by applicant]
U.S. Appl. No. 11/890,408: Response, Oct. 24, 2012. [cited by applicant]
U.S. Appl. No. 11/890,408: Non-Final Office Action, Nov. 9, 2012. [cited by applicant]
U.S. Appl. No. 11/890,408: Response, Feb. 11, 2013. [cited by applicant]
U.S. Appl. No. 11/890,408: Interview Summary, Feb. 13, 2013. [cited by applicant]
U.S. Appl. No. 11/890,408: Final Office Action, Apr. 4, 2013. [cited by applicant]
Random House Webster's Unabridged Dictionary Second Edition, 2001, Random House Inc., p. 2093. Definition of “upon”. [cited by applicant]
Oxford English Dictionary, 2nd Edition (1989), vol. XIX, p. 299, 301, Clarendon Press. Definition of “upon”. [cited by applicant]