US 11,893,099 B2
Systems and methods for dynamic passphrases
Edison U. Ortiz, Toronto (CA); Mohammad Abuzar Shaikh, Toronto (CA); Margaret Inez Salter, Toronto (CA); Sarah Rachel Waigh Yean Wilkinson, Toronto (CA); Arya Pourtabatabaie, Toronto (CA); Iustina-Miruna Vintila, Bucharest (RO); Steven Fernandes, Omaha, NE (US); and Sumit Kumar Jha, San Antonio, TX (US)
Assigned to ROYAL BANK OF CANADA, Toronto (CA)
Filed by ROYAL BANK OF CANADA, Toronto (CA)
Filed on Aug. 29, 2022, as Appl. No. 17/898,463.
Application 17/898,463 is a continuation of application No. 17/129,631, filed on Dec. 21, 2020, granted, now 11,429,712.
Application 17/129,631 is a continuation in part of application No. 16/521,238, filed on Jul. 24, 2019, granted, now 11,539,525.
Claims priority of provisional application 62/951,528, filed on Dec. 20, 2019.
Claims priority of provisional application 62/839,384, filed on Apr. 26, 2019.
Claims priority of provisional application 62/775,695, filed on Dec. 5, 2018.
Claims priority of provisional application 62/774,130, filed on Nov. 30, 2018.
Claims priority of provisional application 62/751,369, filed on Oct. 26, 2018.
Claims priority of provisional application 62/702,635, filed on Jul. 24, 2018.
Prior Publication US 2022/0405381 A1, Dec. 22, 2022
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 21/32 (2013.01); G06F 21/46 (2013.01); G06N 20/00 (2019.01); G06N 5/04 (2023.01); G06Q 20/10 (2012.01); G10L 15/25 (2013.01); G10L 15/02 (2006.01); G06V 40/16 (2022.01); G06F 18/22 (2023.01); G06F 18/2413 (2023.01); G06V 10/10 (2022.01); G06V 10/764 (2022.01); G06V 10/771 (2022.01); G06V 10/776 (2022.01); G06V 10/80 (2022.01); G06V 10/82 (2022.01); G06V 10/44 (2022.01); G06V 40/20 (2022.01); G06V 40/40 (2022.01)
CPC G06F 21/32 (2013.01) [G06F 18/22 (2023.01); G06F 18/24137 (2023.01); G06F 21/46 (2013.01); G06N 5/04 (2013.01); G06N 20/00 (2019.01); G06Q 20/108 (2013.01); G06V 10/17 (2022.01); G06V 10/454 (2022.01); G06V 10/764 (2022.01); G06V 10/771 (2022.01); G06V 10/776 (2022.01); G06V 10/803 (2022.01); G06V 10/82 (2022.01); G06V 40/165 (2022.01); G06V 40/171 (2022.01); G06V 40/172 (2022.01); G06V 40/20 (2022.01); G06V 40/40 (2022.01); G10L 15/02 (2013.01); G10L 15/25 (2013.01); G06F 2221/2103 (2013.01); G10L 2015/025 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A computer system for conducting a dynamic passphrase challenge to control access to a secure electronic resource, the computer system comprising a non-transitory computer readable storage device, computer memory, and a processor configured to:
receive a script-reading video data set capturing a portion of or an entirety of an individual's face while the individual is speaking words corresponding to a script data structure, the script data structure having a sequence of pre-identified phonemes or phoneme transitions, the pre-identified phonemes or phoneme transitions including at least one overlapping phoneme or phoneme transition required to be spoken when speaking words of a correct response string;
extract, from the script-reading video data set, a data subset representing the one or more facial or lip features of the individual corresponding to each phoneme or phoneme transition corresponding to the sequence of pre-identified phonemes or phoneme transitions;
train, one or more baseline machine learning data model architectures, each baseline machine learning data model architecture of the one or more baseline machine learning data model architectures corresponding to a corresponding pre-identified phoneme or phoneme transition of the script data structure such that parameters of the baseline machine learning data model architectures are tuned based on the corresponding one or more facial or lip features;
receive an answer-reading video data set capturing a portion of or an entirety of the individual's face while the individual is speaking the words corresponding to the correct response string; and
process, the answer-reading video data set, using the one or more baseline machine learning data model architectures corresponding to the at least one overlapping phoneme or phoneme transition to determine an overall classification similarity score;
wherein a provisioning of access to the secure electronic resource only occurs if the overall classification similarity score is greater than a pre-defined threshold similarity score.