%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.74",
%%%     date            = "24 March 2026",
%%%     time            = "15:06:16 MDT",
%%%     filename        = "cryptography2020.bib",
%%%     address         = "University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     URL             = "https://www.math.utah.edu/~beebe",
%%%     checksum        = "31468 25255 110627 1170275",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "bibliography; BibTeX; Blowfish; cipher;
%%%                        Clipper; code breaking; cracking;
%%%                        cryptanalysis; crypto; cryptobytes;
%%%                        cryptography; cryptology; cryptosystem; data
%%%                        encryption algorithm; decryption; DES;
%%%                        Diffie; digital signature; encryption;
%%%                        Hellmann; International Data Encryption
%%%                        Algorithm (IDEA); Kahn; Kerberos; key escrow;
%%%                        kleptography; PGP; Pretty Good Privacy;
%%%                        Rivest; RSA; Schneier; Smart Card;
%%%                        steganography; Twofish; Zimmermann",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is bibliography of publications on
%%%                        cryptography and related subjects, covering
%%%                        publications for the decade 2020--2029.  The
%%%                        companion file, cryptography.bib, covers
%%%                        1606--1999, cryptography2000.bib covers
%%%                        2000--2009, and cryptography2010.bib covers
%%%                        2010--2019.
%%%
%%%                        Counterpane Systems maintains a Web site at
%%%
%%%                            http://www.counterpane.com/
%%%                            http://www.counterpane.com/publish.html
%%%
%%%                        with a substantial number of their technical
%%%                        reports and articles available in electronic
%%%                        form.
%%%
%%%                        The International Association for Cryptologic
%%%                        Research (IACR) is a ``non-profit scientific
%%%                        organization whose primary purpose is to
%%%                        further research in cryptology and related
%%%                        fields''.  It has a World-Wide Web site at
%%%
%%%                            http://www.iacr.org/index.html
%%%
%%%                        IACR publishes an email newsletter thrice
%%%                        yearly.  Back issues are available starting
%%%                        with Volume 15, Number 1, Fall 1998 at the
%%%                        above site.  It also supports a distinguished
%%%                        lecture series
%%%
%%%                            http://www.iacr.org/publications/dl/
%%%
%%%                        and a preprint server
%%%
%%%                            http://www.iacr.org/publications/preprint.html
%%%
%%%                        The Cryptography and Security Group at the
%%%                        Department of Computer Science and
%%%                        Engineering of the University of California
%%%                        at San Diego supports a World-Wide Web site,
%%%                        called the Theory of Cryptography Library, at
%%%
%%%                            http://philby.ucsd.edu/cryptolib/
%%%
%%%                        There is another site with cryptographic
%%%                        miscellanea and news articles at
%%%
%%%                            http://cryptome.org/
%%%
%%%                        There is an archive of the cryptography
%%%                        mailing list at
%%%
%%%                            http://www.mail-archive.com/cryptography%40wasabisystems.com/
%%%
%%%                        All of the cited references from all of the
%%%                        articles in the online journal CryptoBytes
%%%                        are also included, with referencedin key
%%%                        values recording the source of citations.
%%%
%%%                        However, publications in the journals
%%%
%%%                            * Computers & Security
%%%                            * Cryptography and Communications,
%%%                            * Cryptologia,
%%%                            * Designs, Codes, and Cryptography,
%%%                            * Groups Complexity Cryptology,
%%%                            * Information Security Technical Report
%%%                            * International Journal of Information Security
%%%                            * Journal of Cryptographic Engineering,
%%%                            * Journal of Cryptology,
%%%                            * Journal of Discrete Mathematical
%%%                              Sciences and Cryptography
%%%                            * Journal of Information Security and
%%%                              Applications (JISA)
%%%                            * Journal of Mathematical Cryptology
%%%                            * Network Security
%%%
%%%                        are generally excluded, unless they are
%%%                        cross-referenced by other entries in this
%%%                        bibliography, because they are covered in
%%%                        separate companion bibliographies,
%%%                        computsecurYYYY.bib, cryptologia.bib,
%%%                        designscodescryptogr.bib, intjinfosec.bib,
%%%                        jcryptoeng.bib, jcryptology.bib,
%%%                        jdiscrmathscicrypto.bib, jinfosecappl.bib,
%%%                        jmathcryptol.bib, and network-security.bib.
%%%
%%%                        At version 1.74, the year coverage looked
%%%                        like this:
%%%
%%%                             2020 ( 286)    2022 ( 207)    2024 (   5)
%%%                             2021 ( 287)    2023 (   5)    2025 (   2)
%%%
%%%                             Article:        767
%%%                             Book:             8
%%%                             InCollection:     1
%%%                             InProceedings:    1
%%%                             Misc:             7
%%%                             PhdThesis:        1
%%%                             TechReport:       7
%%%
%%%                             Total entries:  792
%%%
%%%                        There is a hypertext bibliography of
%%%                        classical cryptography at
%%%
%%%                            http://ourworld.compuserve.com/homepages/crypto/BIB1XX.HTM
%%%
%%%                        CIPHER, the Electronic Newsletter of the
%%%                        Technical Committee on Security and Privacy,
%%%                        A Technical Committee of the Computer Society
%%%                        of the IEEE, is available on the World-Wide
%%%                        Web at
%%%
%%%                            http://www.itd.nrl.navy.mil/ITD/5540/ieee/cipher
%%%
%%%                        with pointers to all back issues (1994--1998).
%%%
%%%                        ``CRYPTO-GRAM is a free monthly newsletter
%%%                        providing summaries, analyses, insights, and
%%%                        commentaries on cryptography and computer
%%%                        security.  To subscribe, visit
%%%
%%%                            http://www.counterpane.com/crypto-gram.html
%%%
%%%                        or send a blank message to
%%%
%%%                            crypto-gram-subscribe at chaparraltree.com
%%%
%%%                        Back issues are available on
%%%
%%%                            http://www.counterpane.com''
%%%
%%%                        CRYPTO-GRAM is a good source of news of
%%%                        recent developments in the field, and
%%%                        contains many interesting essays on aspects
%%%                        of cryptography.
%%%
%%%                        There is a Web site on steganography at
%%%
%%%                            http://www.cl.cam.ac.uk/~fapp2/steganography/
%%%
%%%                        In this bibliography, entries are sorted
%%%                        first by ascending year, and within each
%%%                        year, alphabetically by author or editor,
%%%                        and then, if necessary, by the 3-letter
%%%                        abbreviation at the end of the BibTeX
%%%                        citation tag, using the bibsort -byyear
%%%                        utility.  Year order has been chosen to
%%%                        make it easier to identify the most recent
%%%                        work.
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================

@Preamble{
    "\hyphenation{ }"
  # "\ifx \undefined \bbb       \def \bbb       #1{\mathbb{#1}}           \fi"
  # "\ifx \undefined \booktitle \def \booktitle #1{{{\em #1}}}            \fi"
  # "\ifx \undefined \cprime    \def \cprime      {$\mathsurround=0pt '$} \fi"
  # "\ifx \undefined \mathbb    \def \mathbb    #1{{\bf #1}}              \fi"
  # "\ifx \undefined \mathcal   \def \mathcal   #1{{\cal #1}}             \fi"
  # "\ifx \undefined \mathrm    \def \mathrm    #1{{\rm #1}}              \fi"
  # "\ifx \undefined \mathsf    \def \mathsf    #1{{\sf #1}}              \fi"
  # "\ifx \undefined \pkg       \def \pkg       #1{{{\tt #1}}}            \fi"
}

%%% ====================================================================
%%% Acknowledgement abbreviations:

@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|https://www.math.utah.edu/~beebe/|"}

%%% ====================================================================
%%% Institution abbreviations:

@String{inst-COUNTERPANE-INTERNET-SECURITY = "Counterpane Internet Security"}
@String{inst-COUNTERPANE-INTERNET-SECURITY:adr = "3031 Tisch Way, Suite 100PE,
                                  San Jose, CA 95128, USA"}

@String{inst-COUNTERPANE-SYSTEMS = "Counterpane Systems"}
@String{inst-COUNTERPANE-SYSTEMS:adr = "101 East Minnehaha Parkway, Minneapolis,
                                   MN 55419"}

@String{inst-UTAH-MATH          = "University of Utah, Department of Mathematics"}
@String{inst-UTAH-MATH:adr      = "Salt Lake City, UT 84112-0090, USA"}

%%% ====================================================================
%%% Journal abbreviations:

@String{j-ACM-COMM-COMP-ALGEBRA = "ACM Communications in Computer Algebra"}

@String{j-ALGORITHMICA          = "Algorithmica"}

@String{j-ALGORITHMS-BASEL      = "Algorithms ({Basel})"}

@String{j-AMER-MATH-MONTHLY     = "American Mathematical Monthly"}

@String{j-AMER-STAT             = "The American Statistician"}

@String{j-APPL-ALGEBRA-ENG-COMMUN-COMPUT = "Applicable algebra in engineering,
                                  communication and computing"}

@String{j-APPL-MATH-COMP        = "Applied Mathematics and Computation"}

@String{j-BELL-LABS-TECH-J      = "Bell Labs Technical Journal"}

@String{j-BRITISH-J-HIST-MATH   = "British Journal for the History of
                                  Mathematics"}

@String{j-BRITISH-J-HIST-SCI    = "British Journal for the History of Science"}

@String{j-BSHM-BULL             = "BSHM Bulletin: Journal of the British Society
                                   for the History of Mathematics"}

@String{j-BULL-AUSTRAL-MATH-SOC = "Bulletin of the Australian Mathematical
                                  Society"}

@String{j-CACM                  = "Communications of the Association for
                                  Computing Machinery"}

@String{j-CAN-J-MATH            = "Canadian Journal of Mathematics = Journal
                                  canadien de math{\'e}matiques"}

@String{j-CAN-MATH-BULL         = "Bulletin canadien de
                                  math\-{\'e}\-mat\-iques = Canadian
                                  Mathematical Bulletin"}

@String{j-CCPE                  = "Concurrency and Computation: Prac\-tice and
                                   Experience"}

@String{j-CGF                   = "Com{\-}pu{\-}ter Graphics Forum"}

@String{j-CHANCE                = "Chance"}

@String{j-CHIN-J-COMPUTERS      = "Chinese Journal of Computers = Chi suan chi
                                  hsueh pao"}

@String{j-CHIN-PHYS-LETT        = "Chinese Physics Letters"}

@String{j-COLLEGE-MATH-J        = "College Mathematics Journal"}

@String{j-COLLNET-J-SCIENTOMETRICS-INF-MANAGE = "Collnet Journal of
                                  Scientometrics and Information Management"}

@String{j-COMP-ARCH-NEWS        = "ACM SIGARCH Computer Architecture News"}

@String{j-COMP-J                = "The Computer Journal"}

@String{j-COMP-NET-AMSTERDAM    = "Computer Networks (Amsterdam, Netherlands:
                                  1999)"}

@String{j-COMP-SURV             = "ACM Computing Surveys"}

@String{j-COMP-VIS-IMAGE-UNDERSTANDING = "Computer Vision and Image
                                  Understanding: CVIU"}

@String{j-COMPLEX-SYSTEMS       = "Complex Systems"}

@String{j-COMPUT-AIDED-DES      = "Computer-Aided Design"}

@String{j-COMPUT-EDGE           = "Computing Edge"}

@String{j-COMPUT-INTELL         = "Computational Intelligence"}

@String{j-COMPUT-MATH-APPL      = "Computers and Mathematics with Applications"}

@String{j-COMPUT-SCI-ENG        = "Computing in Science and Engineering"}

@String{j-COMPUT-SECUR          = "Computers \& Security"}

@String{j-COMPUT-SECUR-J        = "Computer Security Journal"}

@String{j-COMPUTER              = "Computer"}

@String{j-COMPUTERS-AND-GRAPHICS = "Computers and Graphics"}

@String{j-COMPUTING             = "Computing"}

@String{j-CONTEMP-PHYS          = "Contemporary Physics"}

@String{j-DDJ                   = "Dr. Dobb's Journal of Software Tools"}

@String{j-DISCRETE-APPL-MATH    = "Discrete Applied Mathematics"}

@String{j-DTRAP                 = "Digital Threats: Research and Practice
                                  (DTRAP)"}

@String{j-ELECT-COMM-JAPAN-3-FUND-ELECT-SCI = "Electronics and communications
                                  in Japan. Part 3, Fundamental electronic
                                  science"}

@String{j-EMPIR-SOFTWARE-ENG    = "Empirical Software Engineering"}

@String{j-EURASIP-J-APPL-SIG-PROC = "EURASIP Journal on Applied Signal Processing"}

@String{j-FORM-ASP-COMPUT       = "Formal Aspects of Computing"}

@String{j-FOUND-PHYS            = "Foundations of Physics"}

@String{j-FUND-INFO             = "Fundamenta Informaticae"}

@String{j-FUT-GEN-COMP-SYS      = "Future Generation Computer Systems"}

@String{j-FUTURE-INTERNET       = "Future Internet"}

@String{j-IBM-JRD               = "IBM Journal of Research and Development"}

@String{j-IEEE-ACCESS           = "IEEE Access"}

@String{j-IEEE-ACM-TASLP        = "IEEE\slash ACM Transactions on Audio, Speech,
                                  and Language Processing"}

@String{j-IEEE-ANN-HIST-COMPUT  = "IEEE Annals of the History of Computing"}

@String{j-IEEE-COMPUT-ARCHIT-LETT = "IEEE Computer Architecture Letters"}

@String{j-IEEE-DISTRIB-SYST-ONLINE = "IEEE Distributed Systems Online"}

@String{j-IEEE-MICRO            = "IEEE Micro"}

@String{j-IEEE-MULTIMEDIA       = "IEEE MultiMedia"}

@String{j-IEEE-SEC-PRIV         = "IEEE Security \& Privacy"}

@String{j-IEEE-SPECTRUM         = "IEEE Spectrum"}

@String{j-IEEE-SOFTWARE         = "IEEE Software"}

@String{j-IEEE-TRANS-BIG-DATA   = "IEEE Transactions on Big Data"}

@String{j-IEEE-TRANS-COMPUT     = "IEEE Transactions on Computers"}

@String{j-IEEE-TRANS-ELECTROMAGN-COMPAT = "IEEE Transactions on Electromagnetic
                                  Compatibility"}

@String{j-IEEE-TRANS-INF-THEORY = "IEEE Transactions on Information Theory"}

@String{j-IEEE-TRANS-NETWORKING = "IEEE\slash ACM Transactions on Networking"}

@String{j-IEEE-TRANS-PAR-DIST-SYS = "IEEE Transactions on Parallel and
                                  Distributed Systems"}

@String{j-IEEE-TRANS-SOFTW-ENG  = "IEEE Transactions on Software Engineering"}

@String{j-IEEE-TRANS-VIS-COMPUT-GRAPH = "IEEE Transactions on Visualization
                                   and Computer Graphics"}

@String{j-IJHPCA                = "The International Journal of High
                                  Performance Computing Applications"}

@String{j-IMWUT                 = "Proceedings of the ACM on Interactive,
                                  Mobile, Wearable and Ubiquitous
                                  Technologies (IMWUT)"}

@String{j-INF-COMPUT            = "Information and Computation"}

@String{j-INFO-PROC-LETT        = "Information Processing Letters"}

@String{j-INFORMATIK-SPEKTRUM   = "Informatik Spektrum"}

@String{j-INFORMATION-WEEK      = "Information Week"}

@String{j-INT-J-BIFURC-CHAOS-APPL-SCI-ENG = "International journal of
                                  bifurcation and chaos in applied sciences
                                  and engineering"}

@String{j-INT-J-COMPUT-APPL     = "International Journal of Computer
                                   Applications"}

@String{j-INT-J-COMPUT-GEOM-APPL = "International Journal of
                                  Computational Geometry and
                                  Applications (IJCGA)"}

@String{j-INT-J-COMPUT-MATH     = "International Journal of Computer
                                  Mathematics"}

@String{j-INT-J-COMPUT-SYST-SCI-ENG = "International Journal of Computer
                                  Systems Science and Engineering"}

@String{j-INT-J-ELECTRON        = "International Journal of Electronics
                                  Theoretical \& Experimental"}

@String{j-INT-J-FOUND-COMP-SCI  = "International Journal of Foundations of
                                  Computer Science (IJFCS)"}

@String{j-INT-J-IMAGE-GRAPHICS  = "International Journal of Image and Graphics
                                  (IJIG)"}

@String{j-INT-J-INFO-SEC        = "International Journal of Information
                                  Security"}

@String{j-INT-J-NUMBER-THEORY  = "International Journal of Number Theory
                                  (IJNT)"}

@String{j-INT-J-PARALLEL-PROG   = "International Journal of Parallel
                                  Programming"}

@String{j-INT-J-PAR-EMER-DIST-SYS = "International Journal of Parallel, Emergent
                                  and Distributed Systems: IJPEDS"}

@String{j-INT-J-SYST-SCI        = "International Journal of Systems Science"}

@String{j-INT-J-WAVELETS-MULTIRESOLUT-INF-PROCESS = "International Journal of
                                  Wavelets, Multiresolution and
                                  Information Processing"}

@String{j-INTELL-NATL-SECUR     = "Intelligence and National Security"}

@String{j-ISIS                  = "Isis"}

@String{j-IT-PRO                = "{IT} Professional"}

@String{j-J-ACM                 = "Journal of the ACM"}

@String{j-J-AM-SOC-INF-SCI-TECHNOL = "Journal of the American Society for
                                  Information Science and Technology: JASIST"}

@String{j-J-ASSOC-INF-SCI-TECHNOL = "Journal of the Association for Information
                                  Science and Technology"}

@String{j-J-AUTOM-REASON        = "Journal of Automated Reasoning"}

@String{j-J-COMP-SCI-TECH       = "Journal of computer science and technology"}

@String{j-J-COMP-SYS-SCI        = "Journal of Computer and System Sciences"}

@String{j-J-COMP-SECUR          = "Journal of Computer Security"}

@String{j-J-COMPUT-APPL-MATH    = "Journal of Computational and Applied
                                  Mathematics"}

@String{j-J-GRID-COMP           = "Journal of Grid Computing"}

@String{j-J-INFO-SCI-ENG        = "Journal of Information Science and
                                  Engineering"}

@String{j-J-LOGIC-ALG-PROG      = "Journal of Logic and Algebraic Programming"}

@String{j-J-MATH-PHYS           = "Journal of Mathematical Physics"}

@String{j-J-NETW-COMPUT-APPL    = "Journal of Network and Computer
                                  Applications"}

@String{j-J-PAR-DIST-COMP       = "Journal of Parallel and Distributed
                                  Computing"}

@String{j-J-SOFTW-EVOL-PROC     = "Journal of Software: Evolution and Process"}

@String{j-J-SOUND-VIB           = "Journal of Sound and Vibration"}

@String{j-J-STAT-COMPUT-SIMUL   = "Journal of Statistical Computation and
                                   Simulation"}

@String{j-J-STAT-PHYS           = "Journal of Statistical Physics"}

@String{j-J-STAT-SOFT           = "Journal of Statistical Software"}

@String{j-J-SUPERCOMPUTING      = "The Journal of Supercomputing"}

@String{j-J-SYMBOLIC-COMP       = "Journal of Symbolic Computation"}

@String{j-J-SYST-SOFTW          = "The Journal of Systems and Software"}

@String{j-J-UCS                 = "J.UCS: Journal of Universal Computer
                                  Science"}

@String{j-JDIQ                  = "Journal of Data and Information
                                  Quality (JDIQ)"}

@String{j-JETC                  = "ACM Journal on Emerging Technologies
                                  in Computing Systems (JETC)"}

@String{j-JOCCH                 = "Journal on Computing and Cultural Heritage
                                  (JOCCH)"}

@String{j-LEARN-PUBL            = "Learned Publishing"}

@String{j-LECT-NOTES-COMP-SCI   = "Lecture Notes in Computer Science"}

@String{j-LIN-MULT-ALGEBRA      = "Linear Multilinear Algebra"}

@String{j-LINEAR-ALGEBRA-APPL   = "Linear Algebra and its Applications"}

@String{j-LINUX-J               = "Linux Journal"}

@String{j-LMS-J-COMPUT-MATH     = "LMS Journal of Computation and Mathematics"}

@String{j-LOGIN                 = ";login: the USENIX Association newsletter"}

@String{j-MATH-COMPUT           = "Mathematics of Computation"}

@String{j-MATH-COMPUT-SCI       = "Mathematics in Computer Science"}

@String{j-MATH-GAZ              = "The Mathematical Gazette"}

@String{j-MATHEMATIKA           = "Mathematika"}

@String{j-MONTE-CARLO-METHODS-APPL = "Monte Carlo Methods and Applications"}

@String{j-NAMS                  = "Notices of the American Mathematical
                                  Society"}

@String{j-NATURE-COMMUN         = "Nature Communications"}

@String{j-NETWORK-SECURITY      = "Network Security"}

@String{j-NETWORK-WORLD         = "Network World"}

@String{j-NY-TIMES              = "New York Times"}

@String{j-OBZORNIK-MAT-FIZ      = "Dru{\\v{s}}tvo Matematikov, Fizikov in
                                  Astronomov SRS. Obzornik za Matematiko in
                                  Fiziko"}

@String{j-OPEN-J-DISCRETE-MATH  = "Open Journal of Discrete Mathematics"}

@String{j-OPER-SYS-REV          = "Operating Systems Review"}

@String{j-PACMPL                = "Proceedings of the ACM on Programming
                                   Languages (PACMPL)"}

@String{j-PARALLEL-COMPUTING    = "Parallel Computing"}

@String{j-PARALLEL-PROCESS-LETT = "Parallel Processing Letters"}

@String{j-PHILIPS-J-RES         = "Philips Journal of Research"}

@String{j-PHYS-LET-A            = "Physics Letters A"}

@String{j-PHYS-PERSPECT         = "Physics in Perspective (PIP)"}

@String{j-PHYS-REV-A            = "Physical Review A (Atomic, Molecular, and
                                  Optical Physics)"}

@String{j-PHYS-REV-LET          = "Physical Review Letters"}

@String{j-PHYS-REV-X            = "Physical Review X"}

@String{j-POMACS                = "Proceedings of the ACM on Measurement and
                                   Analysis of Computing Systems (POMACS)"}

@String{j-PROC-NATL-ACAD-SCI-USA = "Proceedings of the National Academy of
                                  Sciences of the United States of America"}

@String{j-PROC-VLDB-ENDOWMENT   = "Proceedings of the VLDB Endowment"}

@String{j-QUEUE                 = "ACM Queue: Tomorrow's Computing Today"}

@String{j-R-JOURNAL             = "The R Journal"}

@String{j-REV-MOD-PHYS          = "Reviews of Modern Physics"}

@String{j-RES-DEV               = "Research \& Development"}

@String{j-REV-SCI-INSTRUM       = "Review of Scientific Instruments"}

@String{j-RUTHERFORD-J          = "Rutherford Journal"}

@String{j-SCI-ADV               = "Science Advances"}

@String{j-SCI-AMER              = "Scientific American"}

@String{j-SCI-COMPUT            = "Scientific Computing"}

@String{j-SCI-COMPUT-PROGRAM    = "Science of Computer Programming"}

@String{j-SCIENTOMETRICS        = "Scientometrics"}

@String{j-SCPE                  = "Scalable Computing: Practice and Experience"}

@String{j-SIAM-J-COMPUT         = "SIAM Journal on Computing"}

@String{j-SIAM-J-DISCR-MATH     = "SIAM Journal on Discrete Mathematics"}

@String{j-SIAM-J-IMAGING-SCI    = "SIAM Journal on Imaging Sciences"}

@String{j-SIAM-J-OPT            = "SIAM Journal on Optimization"}

@String{j-SIAM-REVIEW           = "SIAM Review"}

@String{j-SIGACT                = "ACM SIGACT News"}

@String{j-SIGADA-LETTERS        = "ACM SIGADA Ada Letters"}

@String{j-SIGCSE                = "SIGCSE Bulletin (ACM Special Interest Group
                                  on Computer Science Education)"}

@String{j-SIGMETRICS            = "ACM SIGMETRICS Performance Evaluation Review"}

@String{j-SIGMOD                = "SIGMOD Record (ACM Special Interest
                                  Group on Management of Data)"}

@String{j-SIGPLAN               = "ACM SIG{\-}PLAN Notices"}

@String{j-SIGSAM                = "SIGSAM Bulletin (ACM Special Interest Group
                                  on Symbolic and Algebraic Manipulation)"}

@String{j-SIGSOFT               = "ACM SIGSOFT Software Engineering Notes"}

@String{j-SOC-STUD-SCI          = "Social Studies of Science"}

@String{j-SPE                   = "Soft\-ware\emdash Prac\-tice and Experience"}

@String{j-STAT-COMPUT           = "Statistics and Computing"}

@String{j-STUD-HIST-PHILOS-SCI = "Studies in History and Philosophy of Science
                                  Part A"}

@String{j-SYS-ADMIN             = "Sys Admin: The Journal for UNIX Systems
                                  Administrators"}

@String{j-TAAS                  = "ACM Transactions on Autonomous and
                                  Adaptive Systems (TAAS)"}

@String{j-TACO                  = "ACM Transactions on Architecture and
                                  Code Optimization"}

@String{j-TALG                  = "ACM Transactions on Algorithms"}

@String{j-TALLIP                = "ACM Transactions on Asian and Low-Resource
                                  Language Information Processing (TALLIP)"}

@String{j-TAP                   = "ACM Transactions on Applied Perception"}

@String{j-TCBB                  = "IEEE/ACM Transactions on Computational
                                  Biology and Bioinformatics"}

@String{j-TCPS                  = "ACM Transactions on Cyber-Physical Systems
                                  (TCPS)"}

@String{j-TDS                   = "ACM Transactions on Data Science
                                  (TDS)"}

@String{j-TEAC                  = "ACM Transactions on Economics and
                                  Computation"}

@String{j-TECS                  = "ACM Transactions on Embedded Computing
                                  Systems"}

@String{j-THEOR-COMP-SCI        = "Theoretical Computer Science"}

@String{j-THEORY-PROBAB-APPL    = "Theory of Probability and its Applications"}

@String{j-TIIS                  = "ACM Transactions on Interactive Intelligent
                                  Systems (TIIS)"}

@String{j-TIOT                  = "ACM Transactions on Internet of Things
                                  (TIOT)"}

@String{j-TISSEC                = "ACM Transactions on Information and System
                                  Security"}

@String{j-TIST                 = "ACM Transactions on Intelligent Systems and
                                  Technology (TIST)"}

@String{j-TKDD                  = "ACM Transactions on Knowledge
                                  Discovery from Data (TKDD)"}

@String{j-TMIS                  = "ACM Transactions on Management Information
                                  Systems (TMIS)"}

@String{j-TOCE                  = "ACM Transactions on Computing Education"}

@String{j-TOCHI                 = "ACM Transactions on Computer-Human
                                  Interaction"}

@String{j-TOCL                  = "ACM Transactions on Computational Logic"}

@String{j-TOCS                  = "ACM Transactions on Computer Systems"}

@String{j-TOCT                  = "ACM Transactions on Computation Theory"}

@String{j-TODAES                = "ACM Transactions on Design Automation of
                                  Electronic Systems"}

@String{j-TODS                  = "ACM Transactions on Database Systems"}

@String{j-TOIT                  = "ACM Transactions on Internet Technology
                                  (TOIT)"}

@String{j-TOG                   = "ACM Transactions on Graphics"}

@String{j-TOMACS                = "ACM Transactions on Modeling and Computer
                                  Simulation"}

@String{j-TOMCCAP               = "ACM Transactions on Multimedia Computing,
                                  Communications, and Applications"}

@String{j-TOMM                  = "ACM Transactions on Multimedia Computing,
                                  Communications, and Applications"}

@String{j-TOMS                  = "ACM Transactions on Mathematical Software"}

@String{j-TOPC                  = "ACM Transactions on Parallel Computing
                                  (TOPC)"}

@String{j-TOPLAS                = "ACM Transactions on Programming
                                  Languages and Systems"}

@String{j-TOPS                  = "ACM Transactions on Privacy and Security
                                  (TOPS)"}

@String{j-TOS                   = "ACM Transactions on Storage"}

@String{j-TOSEM                 = "ACM Transactions on Software Engineering and
                                   Methodology"}

@String{j-TOSN                  = "ACM Transactions on Sensor Networks"}

@String{j-TQC                   = "ACM Transactions on Quantum Computing (TQC)"}

@String{j-TRETS                 = "ACM Transactions on Reconfigurable Technology
                                  and Systems"}

@String{j-TRANS-INFO-PROCESSING-SOC-JAPAN = "Transactions of the Information
                                  Processing Society of Japan"}

@String{j-TWEB                  = "ACM Transactions on the Web (TWEB)"}

@String{j-TWO-YEAR-COLL-MATH-J  = "Two-Year College Mathematics Journal"}

@String{j-VLDB-J                = "VLDB Journal: Very Large Data Bases"}

@String{j-WIRES                 = "WIREs Computational Statistics"}

%%% ====================================================================
%%% Publisher abbreviations:

@String{pub-A-K-PETERS          = "A. K. Peters, Ltd."}
@String{pub-A-K-PETERS:adr      = "Wellesley, MA, USA"}

@String{pub-ACADEMIC            = "Academic Press"}
@String{pub-ACADEMIC:adr        = "New York, NY, USA"}

@String{pub-ACM                 = "ACM Press"}
@String{pub-ACM:adr             = "New York, NY 10036, USA"}

@String{pub-AMS                 = "American Mathematical Society"}
@String{pub-AMS:adr             = "Providence, RI, USA"}

@String{pub-ANCHOR              = "Anchor Press/Doubleday"}
@String{pub-ANCHOR:adr          = "Garden City, NY, USA"}

@String{pub-ANSI                = "American National Standards Institute"}
@String{pub-ANSI:adr            = "1430 Broadway, New York, NY 10018, USA"}

@String{pub-APRESS              = "Apress"}
@String{pub-APRESS:adr          = "Berkeley, CA, USA"}

@String{pub-ARTECH              = "Artech House Inc."}
@String{pub-ARTECH:adr          = "Norwood, MA, USA"}

@String{pub-AW                  = "Ad{\-d}i{\-s}on-Wes{\-l}ey"}
@String{pub-AW:adr              = "Reading, MA, USA"}

@String{pub-BANTAM              = "Bantam Doubleday Dell Publishing Group Inc."}
@String{pub-BANTAM:adr          = "666 Fifth Avenue, New York, NY 10130, USA"}

@String{pub-BASIC-BOOKS         = "Basic Books"}
@String{pub-BASIC-BOOKS:adr     = "New York, NY, USA"}

@String{pub-BIRKHAUSER          = "Birkh{\"a}user Verlag"}
@String{pub-BIRKHAUSER:adr      = "Basel, Switzerland"}

@String{pub-BUTTERWORTH-HEINEMANN = "Butterworth-Heinemann"}
@String{pub-BUTTERWORTH-HEINEMANN:adr = "Boston, MA, USA"}

@String{pub-CAMBRIDGE           = "Cambridge University Press"}
@String{pub-CAMBRIDGE:adr       = "Cambridge, UK"}

@String{pub-CHAPMAN-HALL-CRC    = "Chapman and Hall/CRC"}
@String{pub-CHAPMAN-HALL-CRC:adr = "Boca Raton, FL, USA"}

@String{pub-CISCO               = "Cisco Press"}
@String{pub-CISCO:adr           = "Indianapolis, IN, USA"}

@String{pub-CLARENDON-PRESS     = "Clarendon Press"}
@String{pub-CLARENDON-PRESS:adr = "Oxford, UK"}

@String{pub-COPERNICUS          = "Copernicus (a division of Springer-Verlag
                                  New York, Inc.)"}
@String{pub-COPERNICUS:adr      = "175 Fifth Avenue, New York, NY 10010, USA"}

@String{pub-CRC                 = "CRC Press"}
@String{pub-CRC:adr             = "2000 N.W. Corporate Blvd., Boca Raton,
                                  FL 33431-9868, USA"}

@String{pub-DEKKER              = "Marcel Dekker, Inc."}
@String{pub-DEKKER:adr          = "New York, NY, USA"}

@String{pub-DP                  = "Digital Press"}
@String{pub-DP:adr              = "12 Crosby Drive, Bedford, MA 01730, USA"}

@String{pub-DOUBLEDAY           = "Doubleday"}
@String{pub-DOUBLEDAY:adr       = "New York, NY, USA"}

@String{pub-DOVER               = "Dover Publications, Inc."}
@String{pub-DOVER:adr           = "New York, NY, USA"}

@String{pub-ELSEVIER            = "Elsevier"}
@String{pub-ELSEVIER:adr        = "Amsterdam, The Netherlands"}

@String{pub-FREE                = "Free Press"}
@String{pub-FREE:adr            = "New York, NY, USA"}

@String{pub-GRUYTER             = "Walter de Gruyter"}
@String{pub-GRUYTER:adr         = "New York, NY, USA"}

@String{pub-HARPERCOLLINS       = "HarperCollins College Publishers"}
@String{pub-HARPERCOLLINS:adr   = "New York, NY, USA"}

@String{pub-HOUGHTON-MIFFLIN    = "Houghton-Mifflin"}
@String{pub-HOUGHTON-MIFFLIN:adr = "Boston, MA, USA"}

@String{pub-IBM                 = "IBM Corporation"}
@String{pub-IBM:adr             = "San Jose, CA, USA"}

@String{pub-IDG-WORLDWIDE       = "I D G Books Worldwide"}
@String{pub-IDG-WORLDWIDE:adr   = "Indianapolis, IN, USA"}

@String{pub-IEEE                = "IEEE Computer Society Press"}
@String{pub-IEEE:adr            = "1109 Spring Street, Suite 300, Silver
                                  Spring, MD 20910, USA"}

@String{pub-JONES-BARTLETT      = "Jones and Bartlett"}
@String{pub-JONES-BARTLETT:adr  = "Boston, MA, USA"}

@String{pub-KLUWER              = "Kluwer Academic Publishers"}
@String{pub-KLUWER:adr          = "Dordrecht, The Netherlands"}

@String{pub-KNOPF               = "Alfred A. Knopf"}
@String{pub-KNOPF:adr           = "New York, NY, USA"}

@String{pub-MATH-ASSOC-AMER     = "Mathematical Association of America"}
@String{pub-MATH-ASSOC-AMER:adr = "Washington, DC, USA"}

@String{pub-MCGRAW-HILL         = "Mc{\-}Graw-Hill"}
@String{pub-MCGRAW-HILL:adr     = "New York, NY, USA"}

@String{pub-MICROSOFT           = "Microsoft Press"}
@String{pub-MICROSOFT:adr       = "Redmond, WA, USA"}

@String{pub-MIT                 = "MIT Press"}
@String{pub-MIT:adr             = "Cambridge, MA, USA"}

@String{pub-MORGAN-KAUFMANN     = "Morgan Kaufmann Publishers"}
@String{pub-MORGAN-KAUFMANN:adr = "Los Altos, CA 94022, USA"}

@String{pub-MORGAN-KAUFMANN-SF  = "Morgan Kaufmann Publishers"}
@String{pub-MORGAN-KAUFMANN-SF:adr = "San Francisco, CA, USA"}

@String{pub-NEW-RIDERS          = "New Riders Publishing"}
@String{pub-NEW-RIDERS:adr      = "Carmel, IN, USA"}

@String{pub-NEWNES              = "Newnes Press"}
@String{pub-NEWNES:adr          = "Amsterdam, The Netherlands and Boston, MA,
                                  USA"}

@String{pub-NIST                = "National Institute for Standards and
                                  Technology"}
@String{pub-NIST:adr            = "Gaithersburg, MD 20899-8900, USA"}

@String{pub-NO-STARCH           = "No Starch Press"}
@String{pub-NO-STARCH:adr       = "San Francisco, CA, USA"}

@String{pub-NORTON              = "W. W. Norton \& Co."}
@String{pub-NORTON:adr          = "New York, NY, USA"}

@String{pub-ORA                 = "O'Reilly \& {Associates, Inc.}"}
@String{pub-ORA:adr             = "103a Morris Street,
                                   Sebastopol, CA 95472,
                                   USA,
                                   Tel: +1 707 829 0515,
                                   and
                                   90 Sherman Street,
                                   Cambridge, MA 02140,
                                   USA,
                                   Tel: +1 617 354 5800"}

@String{pub-ORA-MEDIA           = "O'Reilly Media, Inc."}
@String{pub-ORA-MEDIA:adr       = "1005 Gravenstein Highway North, Sebastopol,
                                  CA 95472, USA"}

@String{pub-OSBORNE-MCGRAW-HILL = "Osborne\slash Mc{\-}Graw-Hill"}
@String{pub-OSBORNE-MCGRAW-HILL:adr = "Berkeley, CA, USA"}

@String{pub-OXFORD              = "Oxford University Press"}
@String{pub-OXFORD:adr          = "Walton Street, Oxford OX2 6DP, UK"}

@String{pub-PENGUIN             = "Penguin"}
@String{pub-PENGUIN:adr         = "London, UK and New York, NY, USA"}

@String{pub-PH                  = "Pren{\-}tice-Hall, Inc."}
@String{pub-PH:adr              = "Upper Saddle River, NJ 07458, USA"}

@String{pub-PHPTR               = "Pren{\-}tice-Hall PTR"}
@String{pub-PHPTR:adr           = "Upper Saddle River, NJ 07458, USA"}

@String{pub-PPH                 = "Pearson Prentice Hall"}
@String{pub-PPH:adr             = "Upper Saddle River, NJ, USA"}

@String{pub-PRINCETON           = "Princeton University Press"}
@String{pub-PRINCETON:adr       = "Princeton, NJ, USA"}

@String{pub-RANDOM-HOUSE        = "Random House"}
@String{pub-RANDOM-HOUSE:adr    = "New York, NY, USA"}

@String{pub-RSA                 = "RSA Data Security, Inc."}
@String{pub-RSA:adr             = "Redwood City, CA, USA"}

@String{pub-SAMS                = "SAMS Publishing"}
@String{pub-SAMS:adr            = "Indianapolis, IN, USA"}

@String{pub-SPIE                = "Society of Photo-optical
                                  Instrumentation Engineers (SPIE)"}
@String{pub-SPIE:adr            = "Bellingham, WA, USA"}

@String{pub-SPRINGER-INTERNATIONAL  = "Springer International Publishing"}
@String{pub-SPRINGER-INTERNATIONAL:adr = "Cham, Switzerland"}

@String{pub-SUN                 = "Sun Microsystems"}
@String{pub-SUN:adr             = "2550 Garcia Avenue, Mountain View,
                                  CA 94043, USA"}

@String{pub-SV                  = "Spring{\-}er-Ver{\-}lag"}
@String{pub-SV:adr              = "Berlin, Germany~/ Heidelberg, Germany~/
                                  London, UK~/ etc."}

@String{pub-SYNGRESS            = "Syngress Publishing, Inc."}
@String{pub-SYNGRESS:adr        = "Rockland, MA, USA"}

@String{pub-TAYLOR-FRANCIS      = "Taylor and Francis"}
@String{pub-TAYLOR-FRANCIS:adr  = "Boca Raton, FL, USA"}

@String{pub-USENIX              = "USENIX"}
@String{pub-USENIX:adr          = "Berkeley, CA, USA"}

@String{pub-USGPO               = "United States Government Printing Office"}
@String{pub-USGPO:adr           = "Washington, DC, USA"}

@String{pub-VIKING              = "Viking"}
@String{pub-VIKING:adr          = "New York, NY, USA"}

@String{pub-WILEY               = "John Wiley and Sons, Inc."}
@String{pub-WILEY:adr           = "New York, NY, USA"}

@String{pub-WILEY-INTERSCIENCE  = "Wiley-In{\-}ter{\-}sci{\-}ence"}
@String{pub-WILEY-INTERSCIENCE:adr = "New York, NY, USA"}

@String{pub-WORLD-SCI           = "World Scientific Publishing Co."}
@String{pub-WORLD-SCI:adr       = "Singapore; Philadelphia, PA, USA; River
                                  Edge, NJ, USA"}

@String{pub-YALE                = "Yale University Press"}
@String{pub-YALE:adr            = "New Haven, CT, USA"}

%%% ====================================================================
%%% Series abbreviations:

@String{ser-LNAI                = "Lecture Notes in Artificial Intelligence"}

@String{ser-LNCS                = "Lecture Notes in Computer Science"}

@String{ser-LNMATH              = "Lecture Notes in Mathematics"}

@String{ser-PROJECT-GUTENBERG   = "Project Gutenberg"}

@String{ser-SIGPLAN             = "ACM SIG{\-}PLAN Notices"}

%%% ====================================================================
%%% Bibliography entries, sorted by year, and then by citation label:

@Article{Abdul:2020:CWH,
  author =       "Wadood Abdul and Ohoud Nafea and Sanaa Ghouzali",
  title =        "Combining Watermarking and Hyper-Chaotic Map to
                 Enhance the Security of Stored Biometric Templates",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "3",
  pages =        "479--493",
  month =        mar,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz047",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Mon Apr 27 07:04:55 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/3/479/5510728",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Aghaie:2020:IC,
  author =       "A. Aghaie and A. Moradi and S. Rasoolzadeh and A. R.
                 Shahmirzadi and F. Schellenberg and T. Schneider",
  title =        "Impeccable Circuits",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "3",
  pages =        "361--376",
  month =        mar,
  year =         "2020",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2019.2948617",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Mar 5 13:54:11 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
  keywords =     "active physical attack; Ciphers; Circuit faults;
                 concurrent error detection; cryptographic device;
                 error-detection code; Fault-injection attack;
                 Generators; Hardware; Linear codes; Redundancy",
}

@Article{Ahsan:2020:CCS,
  author =       "M. A. Manazir Ahsan and Ihsan Ali and Mohd Yamani Idna
                 Bin Idris and Muhammad Imran and Muhammad Shoaib",
  title =        "Correction to: {Countering Statistical Attacks in
                 Cloud-Based Searchable Encryption}",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "48",
  number =       "3",
  pages =        "580--580",
  month =        jun,
  year =         "2020",
  CODEN =        "IJPPE5",
  DOI =          "https://doi.org/10.1007/s10766-018-0599-1",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  ISSN-L =       "0885-7458",
  bibdate =      "Sat Jul 25 06:58:53 MDT 2020",
  bibsource =    "http://link.springer.com/journal/10766/48/3;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib",
  note =         "See \cite{Ahsan:2020:CSA}.",
  URL =          "http://link.springer.com/content/pdf/10.1007/s10766-018-0599-1.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Parallel Programming",
  journal-URL =  "http://link.springer.com/journal/10766",
}

@Article{Ahsan:2020:CSA,
  author =       "M. A. Manazir Ahsan and Ihsan Ali and Mohd Yamani Idna
                 Bin Idris and Muhammad Imran and Muhammad Shoaib",
  title =        "Countering Statistical Attacks in Cloud-Based
                 Searchable Encryption",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "48",
  number =       "3",
  pages =        "470--495",
  month =        jun,
  year =         "2020",
  CODEN =        "IJPPE5",
  DOI =          "https://doi.org/10.1007/s10766-018-0584-8",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  ISSN-L =       "0885-7458",
  bibdate =      "Sat Jul 25 06:58:53 MDT 2020",
  bibsource =    "http://link.springer.com/journal/10766/48/3;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib",
  note =         "See correction \cite{Ahsan:2020:CCS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Parallel Programming",
  journal-URL =  "http://link.springer.com/journal/10766",
}

@Article{Ahvanooey:2020:ANI,
  author =       "Milad Taleby Ahvanooey and Qianmu Li and Xuefang Zhu
                 and Mamoun Alazab and Jing Zhang",
  title =        "{ANiTW}: a {Novel Intelligent Text Watermarking}
                 technique for forensic identification of spurious
                 information on social media",
  journal =      j-COMPUT-SECUR,
  volume =       "90",
  number =       "??",
  pages =        "Article 101702",
  month =        mar,
  year =         "2020",
  CODEN =        "CPSEDU",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Sat Mar 14 18:49:57 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167404819302391",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Article{Akl:2020:FHE,
  author =       "Selim G. Akl and Ibrahim Assem",
  title =        "Fully homomorphic encryption: a general framework and
                 implementations",
  journal =      j-INT-J-PAR-EMER-DIST-SYS,
  volume =       "35",
  number =       "5",
  pages =        "493--498",
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/17445760.2018.1553041",
  ISSN =         "1744-5760 (print), 1744-5779 (electronic)",
  ISSN-L =       "1744-5760",
  bibdate =      "Tue May 18 09:32:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/intjparemerdistsys.bib;
                 http://www.tandfonline.com/toc/gpaa20/35/5",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Parallel, Emergent and
                 Distributed Systems: IJPEDS",
  journal-URL =  "http://www.tandfonline.com/loi/gpaa20",
}

@Article{Akl:2020:HEG,
  author =       "Selim G. Akl",
  title =        "How to encrypt a graph",
  journal =      j-INT-J-PAR-EMER-DIST-SYS,
  volume =       "35",
  number =       "6",
  pages =        "668--681",
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/17445760.2018.1550771",
  ISSN =         "1744-5760 (print), 1744-5779 (electronic)",
  ISSN-L =       "1744-5760",
  bibdate =      "Tue May 18 09:32:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/intjparemerdistsys.bib;
                 http://www.tandfonline.com/toc/gpaa20/35/6",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Parallel, Emergent and
                 Distributed Systems: IJPEDS",
  journal-URL =  "http://www.tandfonline.com/loi/gpaa20",
  onlinedate =   "20 Aug 2018",
}

@Article{Al-Odat:2020:SHA,
  author =       "Zeyad A. Al-Odat and Mazhar Ali and Assad Abbas and
                 Samee U. Khan",
  title =        "Secure Hash Algorithms and the Corresponding {FPGA}
                 Optimization Techniques",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "97:1--97:36",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3311724",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3311724",
  abstract =     "Cryptographic hash functions are widely used
                 primitives with a purpose to ensure the integrity of
                 data. Hash functions are also utilized in conjunction
                 with digital signatures to provide authentication and
                 non-repudiation services. The SHA has been developed
                 over time by the National Institute of Standards and
                 Technology for security, optimal performance, and
                 robustness. The best-known hash standards are SHA-1,
                 SHA-2, and SHA-3. Security is the most notable
                 criterion for evaluating the hash functions. However,
                 the hardware performance of an algorithm serves as a
                 tiebreaker among the contestants when all other
                 parameters (security, software performance, and
                 flexibility) have equal strength. Field Programmable
                 Gateway Array (FPGA) is a reconfigurable hardware that
                 supports a variety of design options, making it the
                 best choice for implementing the hash standards. In
                 this survey, particular attention is devoted to the
                 FPGA optimization techniques for the three hash
                 standards. The study covers several types of
                 optimization techniques and their contributions to the
                 performance of FPGAs. Moreover, the article highlights
                 the strengths and weaknesses of each of the
                 optimization methods and their influence on
                 performance. We are optimistic that the study will be a
                 useful resource encompassing the efforts carried out on
                 the SHAs and FPGA optimization techniques in a
                 consolidated form.",
  acknowledgement = ack-nhfb,
  articleno =    "97",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alabdulatif:2020:TSB,
  author =       "Abdulatif Alabdulatif and Ibrahim Khalil and Xun Yi",
  title =        "Towards secure big data analytic for cloud-enabled
                 applications with fully homomorphic encryption",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "137",
  number =       "??",
  pages =        "192--204",
  month =        mar,
  year =         "2020",
  CODEN =        "JPDCER",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Wed Mar 18 09:26:11 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0743731519300887",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
}

@Article{Alaca:2020:CAF,
  author =       "Furkan Alaca and Paul C. {Van Oorschot}",
  title =        "Comparative Analysis and Framework Evaluating {Web}
                 Single Sign-on Systems",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "112:1--112:34",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3409452",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3409452",
  abstract =     "We perform a comprehensive analysis and comparison of
                 14 web single sign-on (SSO) systems proposed and/or
                 deployed over the past decade, including federated
                 identity and credential/password management schemes. We
                 identify common design properties and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "112",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alawami:2020:LFG,
  author =       "Mohsen A. Alawami and Hyoungshick Kim",
  title =        "{LocAuth}: a fine-grained indoor location-based
                 authentication system using wireless networks
                 characteristics",
  journal =      j-COMPUT-SECUR,
  volume =       "89",
  number =       "??",
  pages =        "Article 101683",
  month =        feb,
  year =         "2020",
  CODEN =        "CPSEDU",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Sat Mar 14 18:49:57 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167404819302226",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Article{Ali:2020:FDH,
  author =       "Mohammad Ali and Javad Mohajeri and Mohammad-Reza
                 Sadeghi and Ximeng Liu",
  title =        "A fully distributed hierarchical attribute-based
                 encryption scheme",
  journal =      j-THEOR-COMP-SCI,
  volume =       "815",
  number =       "??",
  pages =        "25--46",
  day =          "2",
  month =        may,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2020.02.030",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Thu Apr 23 07:41:41 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397520301286",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Ali:2020:FPS,
  author =       "Isra Mohamed Ali and Maurantonio Caprolu and Roberto
                 {Di Pietro}",
  title =        "Foundations, Properties, and Security Applications of
                 Puzzles: a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "72:1--72:38",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3396374",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3396374",
  abstract =     "Cryptographic algorithms have been used not only to
                 create robust ciphertexts but also to generate
                 cryptograms that, contrary to the classic goal of
                 cryptography, are meant to be broken. These
                 cryptograms, generally called puzzles, require the use
                 of a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "72",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alyari:2020:SNR,
  author =       "Robab Alyari and Jaber Karimpour and Habib Izadkhah",
  title =        "Specifying a New Requirement Model for Secure Adaptive
                 Systems",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "8",
  pages =        "1148--1167",
  month =        aug,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz124",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Aug 25 18:11:58 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/8/1148/5645559",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Alzubi:2020:CDB,
  author =       "Omar A. Alzubi and Jafar A. Alzubi and Mohammad
                 Alsayyed",
  title =        "Cryptosystem design based on {Hermitian} curves for
                 {IoT} security",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "11",
  pages =        "8566--8589",
  month =        nov,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-020-03144-x",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri May 14 09:19:57 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-020-03144-x",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  online-date =  "Published: 14 January 2020 Pages: 8566 - 8589 This is
                 part of 1 collection : Intelligent and Pervasive
                 Computing for Cyber-Physical Systems",
}

@Article{Anand:2020:CTE,
  author =       "Ashima Anand and Amit Kumar Singh and Zhihan Lv and
                 Guarav Bhatnagar",
  title =        "Compression-Then-Encryption-Based Secure Watermarking
                 Technique for Smart Healthcare System",
  journal =      j-IEEE-MULTIMEDIA,
  volume =       "27",
  number =       "4",
  pages =        "133--143",
  year =         "2020",
  CODEN =        "IEMUE4",
  DOI =          "https://doi.org/10.1109/MMUL.2020.2993269",
  ISSN =         "1070-986X (print), 1941-0166 (electronic)",
  ISSN-L =       "1070-986X",
  bibdate =      "Thu May 27 16:42:50 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE MultiMedia",
  journal-URL =  "http://www.computer.org/multimedia/",
}

@Article{Anand:2020:JWE,
  author =       "Ashima Anand and Amit Kumar Singh",
  title =        "Joint Watermarking--Encryption--{ECC} for Patient
                 Record Security in Wavelet Domain",
  journal =      j-IEEE-MULTIMEDIA,
  volume =       "27",
  number =       "3",
  pages =        "66--75",
  year =         "2020",
  CODEN =        "IEMUE4",
  DOI =          "https://doi.org/10.1109/MMUL.2020.2985973",
  ISSN =         "1070-986X (print), 1941-0166 (electronic)",
  ISSN-L =       "1070-986X",
  bibdate =      "Thu May 27 16:42:50 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE MultiMedia",
  journal-URL =  "http://www.computer.org/multimedia/",
}

@Article{Anonymous:2020:DS,
  author =       "Anonymous",
  title =        "Demystifying stablecoins",
  journal =      j-QUEUE,
  volume =       "18",
  number =       "1",
  pages =        "??--??",
  month =        jan,
  year =         "2020",
  CODEN =        "AQCUAE",
  DOI =          "https://doi.org/10.1145/3387945.3388781",
  ISSN =         "1542-7730 (print), 1542-7749 (electronic)",
  ISSN-L =       "1542-7730",
  bibdate =      "Tue Mar 17 07:51:39 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/queue.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3387945.3388781",
  abstract =     "Cryptography meets monetary policy.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Queue: Tomorrow's Computing Today",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J882",
}

@Article{Applebaum:2020:PAS,
  author =       "Benny Applebaum and Barak Arkis",
  title =        "On the Power of Amortization in Secret Sharing:
                 $d$-Uniform Secret Sharing and {CDS} with Constant
                 Information Rate",
  journal =      j-TOCT,
  volume =       "12",
  number =       "4",
  pages =        "24:1--24:21",
  month =        dec,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3417756",
  ISSN =         "1942-3454 (print), 1942-3462 (electronic)",
  ISSN-L =       "1942-3454",
  bibdate =      "Sat Mar 20 18:27:42 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toct.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3417756",
  abstract =     "Consider the following secret-sharing problem: A file
                 $s$ should be distributed between $n$ servers such that
                 $ (d - 1)$-subsets cannot recover the file, $ (d +
                 1)$-subsets can recover the file, and $d$-subsets
                 should be able to recover $s$ if and only if they
                 appear in \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Transactions on Computation Theory",
  journal-URL =  "https://dl.acm.org/loi/toct",
}

@Article{Arfaoui:2020:CAA,
  author =       "Amel Arfaoui and Omar Rafik Merad Boudia and Ali
                 Kribeche and Sidi-Mohammed Senouci and Mohamed Hamdi",
  title =        "Context-aware access control and anonymous
                 authentication in {WBAN}",
  journal =      j-COMPUT-SECUR,
  volume =       "88",
  number =       "??",
  pages =        "Article 101496",
  month =        jan,
  year =         "2020",
  CODEN =        "CPSEDU",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Sat Mar 14 18:49:56 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167404818304802",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Article{Au:2020:SIC,
  author =       "Man Ho Au and Jinguang Han and Qianhong Wu and Colin
                 Boyd",
  title =        "Special Issue on Cryptographic Currency and Blockchain
                 Technology",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "107",
  number =       "??",
  pages =        "758--759",
  month =        jun,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2019.06.001",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:14 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X19314840",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Awad:2020:GEI,
  author =       "A. Awad and R. Wang",
  title =        "{Guest Editors}' Introduction to the Special Issue on
                 Hardware Security",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "11",
  pages =        "1556--1557",
  month =        nov,
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Oct 8 20:31:08 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Bahig:2020:UMP,
  author =       "Hatem M. Bahig and Dieaa I. Nassr and Ashraf Bhery and
                 Abderrahmane Nitaj",
  title =        "A Unified Method for Private Exponent Attacks on {RSA}
                 Using Lattices",
  journal =      j-INT-J-FOUND-COMP-SCI,
  volume =       "31",
  number =       "2",
  pages =        "207--231",
  month =        feb,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0129054120500045",
  ISSN =         "0129-0541",
  ISSN-L =       "0129-0541",
  bibdate =      "Tue Mar 10 07:39:25 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
                 http://www.worldscientific.com/loi/ijfcs",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0129054120500045",
  abstract =     "Let ($ n = p q $, $ e = n^\beta $) be an RSA public
                 key with private exponent $ d = n^\delta $, where $p$
                 and $q$ are large primes of the same bit size. At
                 Eurocrypt 96, Coppersmith presented a polynomial-time
                 algorithm for finding small roots of univariate modular
                 equations based on lattice reduction and then succeeded
                 to factorize the RSA modulus. Since then, a series of
                 attacks on the key equation $ e d - k \phi (n) = 1$ of
                 RSA have been presented. In this paper, we show that
                 many of such attacks can be unified in a single attack
                 using a new notion called Coppersmith's interval. We
                 determine a Coppersmith's interval for a given RSA
                 public key $ (n, e)$. The interval is valid for any
                 variant of RSA, such as Multi-Prime RSA, that uses the
                 key equation. Then we show that RSA is insecure if $
                 \delta < \beta + 1 / 3 \alpha - 1 / 3 \sqrt {12 \alpha
                 \beta + 4 \alpha^2}$ provided that we have
                 approximation $ p_0 \geq \sqrt {n}$ of $p$ with $ |p -
                 p_0 | \leq 1 / 2 n^\alpha $, $ \alpha \leq 1 / 2$. The
                 attack is an extension of Coppersmith's result.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Foundations of Computer
                 Science (IJFCS)",
  journal-URL =  "http://www.worldscientific.com/loi/ijfcs",
}

@Article{Bangalore:2020:PSE,
  author =       "Laasya Bangalore and Ashish Choudhury and Arpita
                 Patra",
  title =        "The Power of Shunning: Efficient Asynchronous
                 {Byzantine} Agreement Revisited*",
  journal =      j-J-ACM,
  volume =       "67",
  number =       "3",
  pages =        "14:1--14:59",
  month =        jun,
  year =         "2020",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/3388788",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Aug 14 15:12:00 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3388788",
  abstract =     "The problem of Byzantine Agreement (BA) is of interest
                 to both the distributed computing and cryptography
                 communities. Following well-known results from
                 distributed computing literature, the BA problem in the
                 asynchronous network setting encounters \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Barthe:2020:FVC,
  author =       "Gilles Barthe and Sandrine Blazy and Benjamin
                 Gr{\'e}goire and R{\'e}mi Hutin and Vincent Laporte and
                 David Pichardie and Alix Trieu",
  title =        "Formal verification of a constant-time preserving {C}
                 compiler",
  journal =      j-PACMPL,
  volume =       "4",
  number =       "POPL",
  pages =        "7:1--7:30",
  month =        jan,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3371075",
  bibdate =      "Fri Aug 7 18:46:52 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/pacmpl.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3371075",
  abstract =     "Timing side-channels are arguably one of the main
                 sources of vulnerabilities in cryptographic
                 implementations. One effective mitigation against
                 timing side-channels is to write programs that do not
                 perform secret-dependent branches and memory accesses.
                 This mitigation, known as ``cryptographic
                 constant-time'', is adopted by several popular
                 cryptographic libraries.\par

                 This paper focuses on compilation of cryptographic
                 constant-time programs, and more specifically on the
                 following question: is the code generated by a
                 realistic compiler for a constant-time source program
                 itself provably constant-time? Surprisingly, we answer
                 the question positively for a mildly modified version
                 of the CompCert compiler, a formally verified and
                 moderately optimizing compiler for C. Concretely, we
                 modify the CompCert compiler to eliminate sources of
                 potential leakage. Then, we instrument the operational
                 semantics of CompCert intermediate languages so as to
                 be able to capture cryptographic constant-time.
                 Finally, we prove that the modified CompCert compiler
                 preserves constant-time. Our mechanization maximizes
                 reuse of the CompCert correctness proof, through the
                 use of new proof techniques for proving preservation of
                 constant-time. These techniques achieve complementary
                 trade-offs between generality and tractability of proof
                 effort, and are of independent interest.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "Proceedings of the ACM on Programming Languages",
  journal-URL =  "https://pacmpl.acm.org/",
}

@Article{Barthe:2020:SLN,
  author =       "Gilles Barthe and Gustavo Betarte and Juan Diego Campo
                 and Carlos Luna and David Pichardie",
  title =        "System-Level Non-interference of Constant-Time
                 Cryptography. {Part II}: Verified Static Analysis and
                 Stealth Memory",
  journal =      j-J-AUTOM-REASON,
  volume =       "64",
  number =       "8",
  pages =        "1685--1729",
  month =        dec,
  year =         "2020",
  CODEN =        "JAREEW",
  DOI =          "https://doi.org/10.1007/s10817-020-09548-x",
  ISSN =         "0168-7433 (print), 1573-0670 (electronic)",
  ISSN-L =       "0168-7433",
  bibdate =      "Mon Jan 11 11:33:17 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jautomreason.bib",
  URL =          "http://link.springer.com/article/10.1007/s10817-020-09548-x",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Automated Reasoning",
  journal-URL =  "http://link.springer.com/journal/10817",
}

@Article{Behrad:2020:NSA,
  author =       "Shanay Behrad and Emmanuel Bertin and St{\'e}phane
                 Tuffin and Noel Crespi",
  title =        "A new scalable authentication and access control
                 mechanism for 5G-based {IoT}",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "108",
  number =       "??",
  pages =        "46--61",
  month =        jul,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2020.02.014",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:16 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X19310143",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Belguith:2020:APP,
  author =       "Sana Belguith and Nesrine Kaaniche and Maryline
                 Laurent and Abderrazak Jemai and Rabah Attia",
  title =        "Accountable privacy preserving attribute based
                 framework for authenticated encrypted access in
                 clouds",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "135",
  number =       "??",
  pages =        "1--20",
  month =        jan,
  year =         "2020",
  CODEN =        "JPDCER",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Wed Mar 18 09:26:10 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0743731519302175",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
}

@Article{Belman:2020:DPT,
  author =       "Amith K. Belman and Vir V. Phoha",
  title =        "Discriminative Power of Typing Features on Desktops,
                 Tablets, and Phones for User Identification",
  journal =      j-TOPS,
  volume =       "23",
  number =       "1",
  pages =        "4:1--4:36",
  month =        feb,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3377404",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Sat Feb 15 07:50:03 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3377404",
  abstract =     "Research in Keystroke-Dynamics (KD) has customarily
                 focused on temporal features without considering
                 context to generate user templates that are used in
                 authentication. Additionally, work on KD in hand-held
                 devices such as smart-phones and tablets have
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Bernabe:2020:AER,
  author =       "Jorge Bernal Bernabe and Martin David and Rafael
                 Torres Moreno and Javier Presa Cordero and
                 S{\'e}bastien Bahloul and Antonio Skarmeta",
  title =        "{ARIES}: Evaluation of a reliable and
                 privacy-preserving {European} identity management
                 framework",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "102",
  number =       "??",
  pages =        "409--425",
  month =        jan,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2019.08.017",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Mon Feb 10 12:55:04 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X1930843X",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Bhattacharya:2020:BPA,
  author =       "S. Bhattacharya and C. Maurice and S. Bhasin and D.
                 Mukhopadhyay",
  title =        "Branch Prediction Attack on Blinded Scalar
                 Multiplication",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "5",
  pages =        "633--648",
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Apr 9 11:05:24 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  abstract =     "In recent years, performance counters have been used
                 as a side channel source to monitor branch
                 mispredictions, in order to attack cryptographic
                 algorithms. However, the literature considers blinding
                 techniques as effective countermeasures against such
                 attacks. In this article, we present the first template
                 attack on the branch predictor. We target blinded
                 scalar multiplications with a side-channel attack that
                 uses branch misprediction traces. Since an accurate
                 model of the branch predictor is a crucial element of
                 our attack, we first reverse-engineer the branch
                 predictor. Our attack proceeds with a first online
                 acquisition step, followed by an offline template
                 attack with a template building phase and a template
                 matching phase. During the template matching phase, we
                 use a strategy we call Deduce & Remove , to first infer
                 the candidate values from templates based on a model of
                 the branch predictor, and subsequently eliminate
                 erroneous observations. This last step uses the
                 properties of the target blinding technique to remove
                 wrong guesses and thus naturally provides error
                 correction in key retrieval. In the later part of this
                 article, we demonstrate a template attack on Curve1174
                 where the double-and-add always algorithm
                 implementation is free from conditional branching on
                 the secret scalar. In that case, we target the
                 data-dependent branching based on the modular reduction
                 operations of long integer multiplications. Such
                 implementations still exist in open source software and
                 can be vulnerable, even if top level safeguards like
                 blinding are used. We provide experimental results on
                 scalar splitting, scalar randomization, and point
                 blinding to show that the secret scalar can be
                 correctly recovered with high confidence. Finally, we
                 conclude with recommendations on countermeasures to
                 thwart such attacks.",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Bhowmik:2020:EDA,
  author =       "Deepayan Bhowmik and Charith Abhayaratne",
  title =        "Embedding Distortion Analysis in Wavelet-domain
                 Watermarking",
  journal =      j-TOMM,
  volume =       "15",
  number =       "4",
  pages =        "1--24",
  month =        jan,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3357333",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Sat Jan 11 08:35:19 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3357333",
  abstract =     "Imperceptibility and robustness are two complementary
                 fundamental requirements of any watermarking algorithm.
                 Low-strength watermarking yields high imperceptibility,
                 but exhibits poor robustness. High-strength
                 watermarking schemes achieve good \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "108",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J961",
}

@Article{Bian:2020:BAE,
  author =       "Weixin Bian and Prosanta Gope and Yongqiang Cheng and
                 Qingde Li",
  title =        "{Bio-AKA}: an efficient fingerprint based two factor
                 user authentication and key agreement scheme",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "109",
  number =       "??",
  pages =        "45--55",
  month =        aug,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2020.03.034",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:18 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X19332467",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Bronzino:2020:ISV,
  author =       "Francesco Bronzino and Paul Schmitt and Sara Ayoubi
                 and Guilherme Martins and Renata Teixeira and Nick
                 Feamster",
  title =        "Inferring Streaming Video Quality from Encrypted
                 Traffic: Practical Models and Deployment Experience",
  journal =      j-SIGMETRICS,
  volume =       "48",
  number =       "3",
  pages =        "27--32",
  month =        dec,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3453953.3453958",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Sat Mar 6 08:32:44 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453953.3453958",
  abstract =     "Inferring the quality of streaming video applications
                 is important for Internet service providers, but the
                 fact that most video streams are encrypted makes it
                 difficult to do so.We develop models that infer quality
                 metrics (i.e., startup delay and \ldots{})",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "https://dl.acm.org/loi/sigmetrics",
}

@Article{Bultel:2020:FCC,
  author =       "Xavier Bultel and Jannik Dreier and Jean-Guillaume
                 Dumas and Pascal Lafourcade",
  title =        "A faster cryptographer's {Conspiracy Santa}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "839",
  number =       "??",
  pages =        "122--134",
  day =          "2",
  month =        nov,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2020.05.034",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Mar 12 06:53:44 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397520303170",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Busby:2020:ICC,
  author =       "J. A. Busby and E. N. Cohen and E. A. Dames and J.
                 Doherty and S. Dragone and D. Evans and M. J. Fisher
                 and N. Hadzic and C. Hagleitner and A. J. Higby and M.
                 D. Hocker and L. S. Jagich and M. J. Jordan and R.
                 Kisley and K. D. Lamb and M. D. Marik and J. Mayfield
                 and T. E. Morris and T. D. Needham and W.
                 Santiago-Fernandez and V. Urban and T. Visegrady and K.
                 Werner",
  title =        "The {IBM 4769} Cryptographic Coprocessor",
  journal =      j-IBM-JRD,
  volume =       "64",
  number =       "5/6",
  pages =        "3:1--3:11",
  year =         "2020",
  CODEN =        "IBMJAE",
  DOI =          "https://doi.org/10.1147/JRD.2020.3008145",
  ISSN =         "0018-8646 (print), 2151-8556 (electronic)",
  ISSN-L =       "0018-8646",
  bibdate =      "Fri Aug 28 09:26:17 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IBM Journal of Research and Development",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}

@Article{Cai:2020:ESN,
  author =       "Y. Cai and X. Chen and L. Tian and Y. Wang and H.
                 Yang",
  title =        "Enabling Secure {NVM}-Based in-Memory Neural Network
                 Computing by Sparse Fast Gradient Encryption",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "11",
  pages =        "1596--1610",
  month =        nov,
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Oct 8 20:31:08 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Cambou:2020:CAS,
  author =       "Bertrand Cambou and David H{\'e}ly and Sareh Assiri",
  title =        "Cryptography with Analog Scheme Using Memristors",
  journal =      j-JETC,
  volume =       "16",
  number =       "4",
  pages =        "40:1--40:30",
  month =        oct,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3412439",
  ISSN =         "1550-4832",
  ISSN-L =       "1550-4832",
  bibdate =      "Fri Oct 9 07:37:47 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jetc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3412439",
  abstract =     "Networks of low-power Internet of Things do not have
                 always access to enough computing power to support
                 mainstream cryptographic schemes; such schemes also
                 consume computing power that can be exposed to side
                 channel attacks. This article describes a method, that
                 we call ``cryptography with analog scheme using
                 memristors,'' leveraging the physical properties of
                 memristors, which are active elements suitable for the
                 design of components such as artificial neurons. The
                 proposed devices encrypt messages by segmenting them
                 into blocks of bits, each modulating the injected
                 currents into randomly selected memristor cells,
                 resulting into sets of resistance values turned into
                 cipher texts. Through hash-protected handshakes,
                 identical addresses are independently generated by both
                 communicating devices, to concurrently point at the
                 same set of cells in the arrays, and their images.
                 These block ciphers, for example, 1 KB long, can only
                 be decrypted with the same memristor array driven by
                 analog circuitry or its image, rather than digital
                 key-based schemes. The proposed methods generate cipher
                 text, and decrypt them, with approximately one femto
                 joule per bit, which is below observable level through
                 differential power analysis. The article explains how
                 the use of different cells for each message to encrypt,
                 driven under different conditions, has the potential to
                 mitigate mainstream attacks. It provides a detailed
                 characterization of memristors to evaluate the
                 feasibility of the approach and discusses some hardware
                 and architectures to implement the scheme.",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Journal on Emerging Technologies in Computing
                 Systems (JETC)",
  journal-URL =  "https://dl.acm.org/loi/jetc",
}

@Article{Campbell:2020:PPP,
  author =       "M. Campbell",
  title =        "Putting the Pass{\'e} Into Passwords: How Passwordless
                 Technologies Are Reshaping Digital Identity",
  journal =      j-COMPUTER,
  volume =       "53",
  number =       "8",
  pages =        "89--93",
  year =         "2020",
  CODEN =        "CPTRB4",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Wed Aug 12 15:19:17 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computer2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Article{Canetti:2020:UCS,
  author =       "Ran Canetti",
  title =        "Universally Composable Security",
  journal =      j-J-ACM,
  volume =       "67",
  number =       "5",
  pages =        "28:1--28:94",
  month =        oct,
  year =         "2020",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/3402457",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Oct 17 06:20:18 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3402457",
  abstract =     "This work presents a general framework for describing
                 cryptographic protocols and analyzing their security.
                 The framework allows specifying the security
                 requirements of practically any cryptographic task in a
                 unified and systematic way. Furthermore, in \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Challa:2020:DAA,
  author =       "Sravani Challa and Ashok Kumar Das and Prosanta Gope
                 and Neeraj Kumar and Fan Wu and Athanasios V.
                 Vasilakos",
  title =        "Design and analysis of authenticated key agreement
                 scheme in cloud-assisted cyber-physical systems",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "108",
  number =       "??",
  pages =        "1267--1286",
  month =        jul,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2018.04.019",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:16 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X17326328",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Chang:2020:CHS,
  author =       "Jinyong Chang and Yanyan Ji and Bilin Shao and Maozhi
                 Xu and Rui Xue",
  title =        "Certificateless Homomorphic Signature Scheme for
                 Network Coding",
  journal =      j-IEEE-TRANS-NETWORKING,
  volume =       "28",
  number =       "6",
  pages =        "2615--2628",
  month =        dec,
  year =         "2020",
  CODEN =        "IEANEP",
  DOI =          "https://doi.org/10.1109/TNET.2020.3013902",
  ISSN =         "1063-6692 (print), 1558-2566 (electronic)",
  ISSN-L =       "1063-6692",
  bibdate =      "Tue Feb 23 08:45:31 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
  URL =          "https://dl.acm.org/doi/10.1109/TNET.2020.3013902",
  abstract =     "Homomorphic signature is an extremely important public
                 key authentication technique for network coding to
                 defend against pollution attacks. As a public key
                 cryptographic primitive, it also encounters the same
                 problem of how to confirm the relationship \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE\slash ACM Transactions on Networking",
  journal-URL =  "https://dl.acm.org/loi/ton",
}

@Article{Chen:2020:NES,
  author =       "Jiahui Chen and Jianting Ning and Jie Ling and Terry
                 Shue Chien Lau and Yacheng Wang",
  title =        "A new encryption scheme for multivariate quadratic
                 systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "809",
  number =       "??",
  pages =        "372--383",
  day =          "24",
  month =        feb,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2019.12.032",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Thu Apr 23 07:41:38 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397520300025",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Chen:2020:SSI,
  author =       "G. Chen and S. Chen and Y. Xiao and Y. Zhang and Z.
                 Lin and T. Lai",
  title =        "{SgxPectre}: Stealing {Intel} Secrets From {SGX}
                 Enclaves via Speculative Execution",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "18",
  number =       "3",
  pages =        "28--37",
  month =        may # "\slash " # jun,
  year =         "2020",
  DOI =          "https://doi.org/10.1109/MSEC.2019.2963021",
  ISSN =         "1558-4046",
  ISSN-L =       "1540-7993",
  bibdate =      "Wed May 27 17:52:17 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
  keywords =     "computer security; hardware; microarchitecture;
                 program processors; registers",
}

@Article{Chen:2020:TIT,
  author =       "Liangchen Chen and Shu Gao and Zhengwei Jiang",
  title =        "{THS-IDPC}: A three-stage hierarchical sampling method
                 based on improved density peaks clustering algorithm
                 for encrypted malicious traffic detection",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "9",
  pages =        "7489--7518",
  month =        sep,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-020-03372-1",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri May 14 09:19:58 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-020-03372-1",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  online-date =  "Published: 29 June 2020 Pages: 7489 - 7518",
}

@Article{Christie:2020:MAA,
  author =       "Marcus A. Christie and Anuj Bhandar and Supun
                 Nakandala and Suresh Marru and Eroma Abeysinghe and
                 Sudhakar Pamidighantam and Marlon E. Pierce",
  title =        "Managing authentication and authorization in
                 distributed science gateway middleware",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "111",
  number =       "??",
  pages =        "780--785",
  month =        oct,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2019.07.018",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:21 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X18314729",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Clark:2020:DS,
  author =       "Jeremy Clark and Didem Demirag and Seyedehmahsa
                 Moosavi",
  title =        "Demystifying stablecoins",
  journal =      j-CACM,
  volume =       "63",
  number =       "7",
  pages =        "40--46",
  month =        jul,
  year =         "2020",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/3386275",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jun 22 06:05:31 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3386275",
  abstract =     "Cryptography meets monetary policy.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Article{Cosmo:2020:RSC,
  author =       "R. D. Cosmo and M. Gruenpeter and S. Zacchiroli",
  title =        "Referencing Source Code Artifacts: A Separate Concern
                 in Software Citation",
  journal =      j-COMPUT-SCI-ENG,
  volume =       "22",
  number =       "2",
  pages =        "33--43",
  month =        mar # "\slash " # apr,
  year =         "2020",
  CODEN =        "CSENFA",
  DOI =          "https://doi.org/10.1109/MCSE.2019.2963148",
  ISSN =         "1521-9615 (print), 1558-366X (electronic)",
  ISSN-L =       "1521-9615",
  bibdate =      "Thu Mar 05 14:46:04 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computscieng.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing in Science and Engineering",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5992",
  keywords =     "Citation analysis; Cryptography; Object recognition;
                 Semantics; Software tools; Source coding; Syntactics;
                 Uniform resource locators",
}

@Article{Cui:2020:RDS,
  author =       "Hui Cui and Baodong Qin and Willy Susilo and Surya
                 Nepal",
  title =        "Robust digital signature revisited",
  journal =      j-THEOR-COMP-SCI,
  volume =       "844",
  number =       "??",
  pages =        "87--96",
  day =          "6",
  month =        dec,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2020.08.005",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Mar 12 06:53:47 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S030439752030445X",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Dar:2020:CAE,
  author =       "Zaineb Dar and Adnan Ahmad and Farrukh Aslam Khan and
                 Furkh Zeshan and Razi Iqbal and Hafiz Husnain Raza
                 Sherazi and Ali Kashif Bashir",
  title =        "A context-aware encryption protocol suite for edge
                 computing-based {IoT} devices",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "4",
  pages =        "2548--2567",
  month =        apr,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-019-03021-2",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Sat Jul 25 07:17:56 MDT 2020",
  bibsource =    "http://link.springer.com/journal/11227/76/4;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Datta:2020:CPF,
  author =       "Pratish Datta",
  title =        "Constrained pseudorandom functions from functional
                 encryption",
  journal =      j-THEOR-COMP-SCI,
  volume =       "809",
  number =       "??",
  pages =        "137--170",
  day =          "24",
  month =        feb,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2019.12.004",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Thu Apr 23 07:41:38 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397519307662",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Debnath:2020:UAS,
  author =       "Saswati Debnath and Pinki Roy",
  title =        "User Authentication System Based on Speech and Cascade
                 Hybrid Facial Feature",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "20",
  number =       "03",
  pages =        "??--??",
  month =        jul,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0219467820500229",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Wed May 5 11:23:10 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0219467820500229",
  abstract =     "With the increasing demand for security in many
                 fastest growing applications, biometric recognition is
                 the most prominent authentication system. User
                 authentication through speech and face recognition is
                 the important biometric technique to enhance the
                 security. This paper proposes a speech and facial
                 feature-based multi-modal biometric recognition
                 technique to improve the authentication of any system.
                 Mel Frequency Cepstral Coefficients (MFCC) is extracted
                 from audio as speech features. In visual recognition,
                 this paper proposes cascade hybrid facial (visual)
                 feature extraction method based on static, dynamic and
                 key-point salient features of the face and it proves
                 that the proposed feature extraction method is more
                 efficient than the existing method. In this proposed
                 method, Viola--Jones algorithm is used to detect static
                 and dynamic features of eye, nose, lip, Scale Invariant
                 Feature Transform (SIFT) algorithm is used to detect
                 some stable key-point features of face. In this paper,
                 a research on the audio-visual integration method using
                 AND logic is also made. Furthermore, all the
                 experiments are carried out using Artificial Neural
                 Network (ANN) and Support Vector Machine (SVM). An
                 accuracy of 94.90\% is achieved using proposed feature
                 extraction method. The main objective of this work is
                 to improve the authenticity of any application using
                 multi-modal biometric features. Adding facial features
                 to the speech recognition improve system security
                 because biometric features are unique and combining
                 evidence from two modalities increases the authenticity
                 as well as integrity of the system.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Dehshibi:2020:RIB,
  author =       "Mohammad Mahdi Dehshibi and Jamshid Shanbehzadeh and
                 Mir Mohsen Pedram",
  title =        "A robust image-based cryptology scheme based on
                 cellular nonlinear network and local image
                 descriptors",
  journal =      j-INT-J-PAR-EMER-DIST-SYS,
  volume =       "35",
  number =       "5",
  pages =        "514--534",
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/17445760.2018.1510929",
  ISSN =         "1744-5760 (print), 1744-5779 (electronic)",
  ISSN-L =       "1744-5760",
  bibdate =      "Tue May 18 09:32:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/intjparemerdistsys.bib;
                 http://www.tandfonline.com/toc/gpaa20/35/5",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Parallel, Emergent and
                 Distributed Systems: IJPEDS",
  journal-URL =  "http://www.tandfonline.com/loi/gpaa20",
  onlinedate =   "29 Apr 2019",
}

@Article{Devi:2020:TPP,
  author =       "R. Ramya Devi and V. Vijaya Chamundeeswari",
  title =        "{Triple DES}: Privacy Preserving in Big Data
                 Healthcare",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "48",
  number =       "3",
  pages =        "515--533",
  month =        jun,
  year =         "2020",
  CODEN =        "IJPPE5",
  DOI =          "https://doi.org/10.1007/s10766-018-0592-8",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  ISSN-L =       "0885-7458",
  bibdate =      "Sat Jul 25 06:58:53 MDT 2020",
  bibsource =    "http://link.springer.com/journal/10766/48/3;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Parallel Programming",
  journal-URL =  "http://link.springer.com/journal/10766",
}

@Article{Dhanasekaran:2020:RIS,
  author =       "K. Dhanasekaran and P. Anandan and N. Kumaratharan",
  title =        "A robust image steganography using teaching learning
                 based optimization based edge detection model for smart
                 cities",
  journal =      j-COMPUT-INTELL,
  volume =       "36",
  number =       "3",
  pages =        "1275--1289",
  month =        aug,
  year =         "2020",
  CODEN =        "COMIE6",
  DOI =          "https://doi.org/10.1111/coin.12348",
  ISSN =         "0824-7935 (print), 1467-8640 (electronic)",
  ISSN-L =       "0824-7935",
  bibdate =      "Fri Apr 1 07:46:59 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/computintell.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Comput. Intell.",
  fjournal =     "Computational Intelligence",
  journal-URL =  "https://onlinelibrary.wiley.com/journal/14678640",
  onlinedate =   "28 May 2020",
}

@Article{Dhanuskodi:2020:TRS,
  author =       "S. N. Dhanuskodi and D. Holcomb",
  title =        "Techniques to Reduce Switching and Leakage Energy in
                 Unrolled Block Ciphers",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "10",
  pages =        "1414--1423",
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Sep 10 08:32:07 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Dhir:2020:UBF,
  author =       "S. Dhir and S. K. A. Devi",
  title =        "The Use of Biometric Fingerprints for On-the-Fly
                 Digital Signing of Documents",
  journal =      j-COMPUTER,
  volume =       "53",
  number =       "2",
  pages =        "57--67",
  month =        feb,
  year =         "2020",
  CODEN =        "CPTRB4",
  DOI =          "https://doi.org/10.1109/MC.2019.2939515",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Thu Mar 05 14:33:46 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computer2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
  keywords =     "Biological system modeling; Digital signatures;
                 Feature extraction; Fingerprint recognition; Fingers;
                 Public key",
}

@Article{Dong:2020:CCE,
  author =       "Cong Dong and Chen Zhang and Zhigang Lu and Baoxu Liu
                 and Bo Jiang",
  title =        "{CETAnalytics}: {Comprehensive} effective traffic
                 information analytics for encrypted traffic
                 classification",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "176",
  number =       "??",
  pages =        "Article 107258",
  day =          "20",
  month =        jul,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2020.107258",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Fri Aug 14 10:03:48 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128619309466",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Dong:2020:RNF,
  author =       "Shi Dong and Raj Jain",
  title =        "Retraction notice to {``Flow online identification
                 method for the encrypted Skype'' [YJNCA (2019)
                 75--85]}",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "161",
  number =       "??",
  pages =        "??--??",
  day =          "1",
  month =        jul,
  year =         "2020",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2020.102665",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:36 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804520301399",
  acknowledgement = ack-nhfb,
  articleno =    "102665",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Drusinsky:2020:OTE,
  author =       "D. Drusinsky and J. B. Michael",
  title =        "Obtaining Trust in Executable Derivatives Using
                 Crowdsourced Critiques With Blind Signatures",
  journal =      j-COMPUTER,
  volume =       "53",
  number =       "4",
  pages =        "51--56",
  month =        apr,
  year =         "2020",
  CODEN =        "CPTRB4",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Wed Jun 17 11:58:29 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computer2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Article{Duong:2020:MBR,
  author =       "Dung Hoang Duong and Willy Susilo and Ha Thanh Nguyen
                 Tran",
  title =        "A Multivariate Blind Ring Signature Scheme",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "8",
  pages =        "1194--1202",
  month =        aug,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz128",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Aug 25 18:11:58 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/8/1194/5643521",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Emura:2020:SCF,
  author =       "Keita Emura and Katsuhiko Ito and Toshihiro Ohigashi",
  title =        "Secure-channel free searchable encryption with
                 multiple keywords: a generic construction, an
                 instantiation, and its implementation",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "114",
  number =       "??",
  pages =        "107--125",
  month =        dec,
  year =         "2020",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1016/j.jcss.2020.06.003",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  bibdate =      "Wed May 26 15:41:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0022000018304598",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
}

@Article{Er-rajy:2020:NSR,
  author =       "Latifa Er-rajy and My Ahmed {El Kiram} and Mohamed {El
                 Ghazouani}",
  title =        "New Security Risk Value Estimate Method for {Android}
                 Applications",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "4",
  pages =        "593--603",
  month =        apr,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz109",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri May 8 08:50:40 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/4/593/5618854",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Erbsen:2020:SHL,
  author =       "Andres Erbsen and Jade Philipoom and Jason Gross and
                 Robert Sloan and Adam Chlipala",
  title =        "Simple High-Level Code For Cryptographic Arithmetic:
                 With Proofs, Without Compromises",
  journal =      j-OPER-SYS-REV,
  volume =       "54",
  number =       "1",
  pages =        "23--30",
  month =        aug,
  year =         "2020",
  CODEN =        "OSRED8",
  DOI =          "https://doi.org/10.1145/3421473.3421477",
  ISSN =         "0163-5980 (print), 1943-586X (electronic)",
  ISSN-L =       "0163-5980",
  bibdate =      "Tue Sep 1 12:58:05 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3421473.3421477",
  abstract =     "We introduce an unusual approach for implementing
                 cryptographic arithmetic in short high-level code with
                 machine-checked proofs of functional correctness. We
                 further demonstrate that simple partial evaluation is
                 sufficient to transform such initial code into highly
                 competitive C code, breaking the decades-old pattern
                 that the only fast implementations are those whose
                 instruction-level steps were written out by
                 hand.\par

                 These techniques were used to build an elliptic-curve
                 library that achieves competitive performance for a
                 wide range of prime fields and multiple CPU
                 architectures, showing that implementation and proof
                 effort scales with the number and complexity of
                 conceptually different algorithms, not their use cases.
                 As one outcome, we present the first verified
                 high-performance implementation of P-256, the most
                 widely used elliptic curve. Implementations from our
                 library were included in BoringSSL to replace existing
                 specialized code, for inclusion in several large
                 deployments for Chrome, Android, and
                 CloudFlare.\par

                 This is an abridged version of the full paper
                 originally presented in IEEE S&P 2019 [10]. We have
                 omitted most proof-engineering details in favor of a
                 focus on the system's functional capabilities.",
  acknowledgement = ack-nhfb,
  fjournal =     "Operating Systems Review",
  journal-URL =  "https://dl.acm.org/loi/sigops",
}

@Article{Eriguchi:2020:SSL,
  author =       "Reo Eriguchi and Noboru Kunihiro",
  title =        "Strong security of linear ramp secret sharing schemes
                 with general access structures",
  journal =      j-INFO-PROC-LETT,
  volume =       "164",
  number =       "??",
  pages =        "Article 106018",
  month =        dec,
  year =         "2020",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/j.ipl.2020.106018",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Mar 24 11:59:26 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/infoproc2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0020019020301058",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Fagin:2020:IFC,
  author =       "Barry S. Fagin",
  title =        "Idempotent Factorizations in the Cryptography
                 Classroom",
  journal =      j-TWO-YEAR-COLL-MATH-J,
  volume =       "51",
  number =       "3",
  pages =        "195--203",
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/07468342.2020.1724495",
  ISSN =         "0049-4925 (print), 2325-9116 (electronic)",
  ISSN-L =       "0049-4925",
  bibdate =      "Mon Jul 20 09:31:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/collegemathj.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.tandfonline.com/doi/full/10.1080/07468342.2020.1724495",
  acknowledgement = ack-nhfb,
  fjournal =     "Two-Year College Mathematics Journal",
  journal-URL =  "https://maa.tandfonline.com/loi/ucmj20;
                 http://www.jstor.org/journals/00494925.html",
  onlinedate =   "24 Apr 2020",
}

@Article{Fan:2020:FGA,
  author =       "Yongkai Fan and Shengle Liu and Gang Tan and Fei
                 Qiao",
  title =        "Fine-grained access control based on {Trusted
                 Execution Environment}",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "109",
  number =       "??",
  pages =        "551--561",
  month =        aug,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2018.05.062",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:18 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X17319362",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Fan:2020:HVS,
  author =       "Xingyue Fan and Ting Wu and Qiuhua Zheng and Yuanfang
                 Chen and Muhammad Alam and Xiaodong Xiao",
  title =        "{HSE-Voting}: a secure high-efficiency electronic
                 voting scheme based on homomorphic signcryption",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "111",
  number =       "??",
  pages =        "754--762",
  month =        oct,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2019.10.016",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:21 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X1931951X",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Fang:2020:HHR,
  author =       "Liming Fang and Hongwei Zhu and Boqing Lv and Zhe Liu
                 and Weizhi Meng and Yu Yu and Shouling Ji and Zehong
                 Cao",
  title =        "{HandiText}: Handwriting Recognition Based on Dynamic
                 Characteristics with Incremental {LSTM}",
  journal =      j-TDS,
  volume =       "1",
  number =       "4",
  pages =        "25:1--25:18",
  month =        dec,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3385189",
  ISSN =         "2691-1922",
  ISSN-L =       "2691-1922",
  bibdate =      "Wed Mar 10 06:28:06 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tds.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3385189",
  abstract =     "The Internet of Things (IoT) is a new manifestation of
                 data science. To ensure the credibility of data about
                 IoT devices, authentication has gradually become an
                 important research topic in the IoT ecosystem. However,
                 traditional graphical passwords and text passwords can
                 cause user's serious memory burdens. Therefore, a
                 convenient method for determining user identity is
                 needed. In this article, we propose a handwriting
                 recognition authentication scheme named HandiText based
                 on behavior and biometrics features. When people write
                 a word by hand, HandiText captures their static
                 biological features and dynamic behavior features
                 during the writing process (writing speed, pressure,
                 etc.). The features are related to habits, which make
                 it difficult for attackers to imitate. We also carry
                 out algorithms comparisons and experiments evaluation
                 to prove the reliability of our scheme. The experiment
                 results show that the Long Short-Term Memory has the
                 best classification accuracy, reaching 99\% while
                 keeping relatively low false-positive rate and
                 false-negative rate. We also test other datasets, the
                 average accuracy of HandiText reach 98\%, with strong
                 generalization ability. Besides, the 324 users we
                 investigated indicated that they are willing to use
                 this scheme on IoT devices.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Transactions on Data Science",
  journal-URL =  "https://dl.acm.org/loi/tds",
}

@Article{Feng:2020:MIM,
  author =       "H. Feng and J. Zhou and W. Lin and Y. Zhang and Z.
                 Qu",
  title =        "Multiple-Input, Multilayer-Perception-Based
                 Classification of Traces From Side-Channel Attacks",
  journal =      j-COMPUTER,
  volume =       "53",
  number =       "8",
  pages =        "40--48",
  year =         "2020",
  CODEN =        "CPTRB4",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Wed Aug 12 15:19:17 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computer2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Book{Ferris:2020:BEA,
  author =       "John Ferris",
  title =        "Behind the {Enigma}: the authorised history of {GCHQ},
                 {Britain}'s secret cyber-intelligence agency",
  publisher =    "Bloomsbury",
  address =      "London, UK",
  pages =        "xiii + 823 + 24",
  year =         "2020",
  ISBN =         "1-5266-0546-5 (hardcover), 1-5266-0547-3 (paperback),
                 1-5266-0548-1 (paperback), 1-5266-0549-X (e-book)",
  ISBN-13 =      "978-1-5266-0546-7 (hardcover), 978-1-5266-0547-4
                 (paperback), 978-1-5266-0548-1 (paperback),
                 978-1-5266-0549-8 (e-book)",
  LCCN =         "UB251.G7 F47 2020",
  bibdate =      "Tue Jan 13 06:31:38 MST 2026",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "For a hundred years GCHQ Government Communications
                 Headquarters has been at the forefront of British
                 secret statecraft. Born out of the need to support
                 military operations in the First World War, and fought
                 over ever since, today it is the UK's biggest
                 intelligence, security and cyber agency and a powerful
                 tool of the British state. Famed primarily for its
                 codebreaking achievements at Bletchley Park against
                 Enigma ciphers in the Second World War, GCHQ has
                 intercepted, interpreted and disrupted the information
                 networks of Britain's foes for a century, and yet it
                 remains the least known and understood of British
                 intelligence services. It has been one of the most
                 open-minded, too --- GCHQ has always demanded a
                 diversity of intellectual firepower, finding it in
                 places which strike us as ground-breaking today, and
                 allying it to the efforts of ordinary men and women to
                 achieve extraordinary insights in war, diplomacy and
                 peace. GCHQ shapes British decision-making more than
                 any other intelligence organisation and, along with its
                 partners in the Five Eyes intelligence partnership, has
                 become ever more crucial in an age governed by
                 information technology. Based on unprecedented access
                 to documents in GCHQ's archive, many of them hitherto
                 classified, this is the first book to authoritatively
                 explain the entire history of one of the world's most
                 potent intelligence agencies. Many of the major
                 international episodes of the last century including
                 the retreat from empire, the Cold War and the Falklands
                 become fully explicable only in the light of the secret
                 intelligence record. Written by one of the world's
                 leading experts in intelligence and strategy, Behind
                 the Enigma reveals the fascinating truth behind this
                 most remarkable and enigmatic of organisations.",
  acknowledgement = ack-nhfb,
  subject =      "Intelligence service; Great Britain; History;
                 Espionage, British; Enigma cipher system; Espionnage
                 britannique; Histoire; Enigma (Machine {\`a}
                 chiffrer)",
  tableofcontents = "Introduction \\
                 The origins of modern British Sigint, 1844--1914 \\
                 Britain and the birth of Signals Intelligence, 1914--18
                 \\
                 Whitehall's Black Chamber: British cryptology and the
                 Government Code and Cypher School, 1919--39 \\
                 Cryptoanalysis and British foreign policy, 1919--39 \\
                 Bletchley \\
                 Ultra and the Second World War, 1939--45 \\
                 Cheltenham: GCHQ, Britain and Whitehall, 1945--92 \\
                 UKUSA and the international politics of Sigint,
                 1941--92 \\
                 'We want to be Chetlonians': the Department \\
                 Just who are these guys, anyway? A
                 historical--sociological analysis of GCHQ, 1939--89 \\
                 Intercept to end product: the collection, processing
                 and dissemination of Sigint, 1945--92 \\
                 GCHQ vs the Main Enemy: Signals Intelligence and the
                 Cold War, 1945--92 \\
                 Comint and the End of Empire, 1945--82: Palestine,
                 Konfrontasi and the Falkland Islands \\
                 Secrecy, translucency and oversight, 1830--2019 \\
                 GCHQ and the Second Age of Sigint, 1990--2020 \\
                 Conclusion",
}

@Article{Fotouhi:2020:LST,
  author =       "Mahdi Fotouhi and Majid Bayat and Ashok Kumar Das and
                 Hossein Abdi Nasib Far and S. Morteza Pournaghi and M.
                 A. Doostari",
  title =        "A lightweight and secure two-factor authentication
                 scheme for wireless body area networks in health-care
                 {IoT}",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "177",
  number =       "??",
  pages =        "Article 107333",
  day =          "4",
  month =        aug,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2020.107333",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Fri Aug 14 10:03:49 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128619316457",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Fyrbiak:2020:GSA,
  author =       "M. Fyrbiak and S. Wallat and S. Reinhard and N.
                 Bissantz and C. Paar",
  title =        "Graph Similarity and its Applications to Hardware
                 Security",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "4",
  pages =        "505--519",
  month =        apr,
  year =         "2020",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2019.2953752",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Mar 12 16:58:27 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
  keywords =     "Graph similarity; Hardware; hardware obfuscation
                 assessment; hardware reverse engineering; hardware
                 trojan; Logic gates; Optimization; Registers; Reverse
                 engineering; Security; Trojan horses",
}

@Article{Ghahramani:2020:SBB,
  author =       "Meysam Ghahramani and Reza Javidan and Mohammad
                 Shojafar",
  title =        "A secure biometric-based authentication protocol for
                 global mobility networks in smart cities",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "11",
  pages =        "8729--8755",
  month =        nov,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-020-03160-x",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri May 14 09:19:57 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-020-03160-x",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  online-date =  "Published: 21 January 2020 Pages: 8729 - 8755 This is
                 part of 1 collection : Deep Learning in IoT: Emerging
                 Trends and Applications - 2019",
}

@Article{Giti:2020:SCA,
  author =       "J. E. Giti and A. Sakzad and B. Srinivasan and J.
                 Kamruzzaman and R. Gaire",
  title =        "Secrecy capacity against adaptive eavesdroppers in a
                 random wireless network using friendly jammers and
                 protected zone",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "165",
  number =       "??",
  pages =        "??--??",
  day =          "1",
  month =        sep,
  year =         "2020",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2020.102698",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:37 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804520301727",
  acknowledgement = ack-nhfb,
  articleno =    "102698",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Gomez-Barrero:2020:RIS,
  author =       "Marta Gomez-Barrero and Javier Galbally",
  title =        "Reversing the irreversible: a survey on inverse
                 biometrics",
  journal =      j-COMPUT-SECUR,
  volume =       "90",
  number =       "??",
  pages =        "Article 101700",
  month =        mar,
  year =         "2020",
  CODEN =        "CPSEDU",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Sat Mar 14 18:49:57 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167404819302378",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Article{Guerar:2020:CNA,
  author =       "Meriem Guerar and Luca Verderame and Alessio Merlo and
                 Francesco Palmieri and Mauro Migliardi and Luca
                 Vallerini",
  title =        "{CirclePIN}: a Novel Authentication Mechanism for
                 Smartwatches to Prevent Unauthorized Access to {IoT}
                 Devices",
  journal =      j-TCPS,
  volume =       "4",
  number =       "3",
  pages =        "34:1--34:19",
  month =        mar,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3365995",
  ISSN =         "2378-962X (print), 2378-9638 (electronic)",
  ISSN-L =       "2378-962X",
  bibdate =      "Tue Apr 7 14:51:07 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcps.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3365995",
  abstract =     "In the last months, the market for personal wearable
                 devices has been booming significantly, and, in
                 particular, smartwatches are starting to assume a
                 fundamental role in the Bring Your Own Device (BYOD)
                 arena as well as in the more general Internet of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Transactions on Cyber-Physical Systems",
  journal-URL =  "https://dl.acm.org/loi/tcps",
}

@Article{Guo:2020:AAS,
  author =       "Nan Guo and Cong Zhao and Tianhan Gao",
  title =        "An anonymous authentication scheme for edge
                 computing-based car--home connectivity services in
                 vehicular networks",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "106",
  number =       "??",
  pages =        "659--671",
  month =        may,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2020.01.028",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:13 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X19323179",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Guo:2020:ABE,
  author =       "Rui Guo and Xiong Li and Dong Zheng and Yinghui
                 Zhang",
  title =        "An attribute-based encryption scheme with multiple
                 authorities on hierarchical personal health record in
                 cloud",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "7",
  pages =        "4884--4903",
  month =        jul,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-018-2644-7",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Sat Jul 25 07:17:59 MDT 2020",
  bibsource =    "http://link.springer.com/journal/11227/76/7;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Guo:2020:MSC,
  author =       "Shaoyong Guo and Fengning Wang and Neng Zhang and Feng
                 Qi and Xuesong Qiu",
  title =        "Master-slave chain based trusted cross-domain
                 authentication mechanism in {IoT}",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "172",
  number =       "??",
  pages =        "??--??",
  day =          "15",
  month =        dec,
  year =         "2020",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2020.102812",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:40 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804520302836",
  acknowledgement = ack-nhfb,
  articleno =    "102812",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Guo:2020:RDS,
  author =       "Cheng Guo and Xueru Jiang and Kim-Kwang Raymond Choo
                 and Yingmo Jie",
  title =        "{R-Dedup}: {Secure} client-side deduplication for
                 encrypted data without involving a third-party entity",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "162",
  number =       "??",
  pages =        "??--??",
  day =          "15",
  month =        jul,
  year =         "2020",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2020.102664",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:36 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804520301387",
  acknowledgement = ack-nhfb,
  articleno =    "102664",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Gupta:2020:ABS,
  author =       "Nishu Gupta and Ravikanti Manaswini and Bongaram
                 Saikrishna and Francisco Silva and Ariel Teles",
  title =        "Authentication-Based Secure Data Dissemination
                 Protocol and Framework for {5G}-Enabled {VANET}",
  journal =      j-FUTURE-INTERNET,
  volume =       "12",
  number =       "4",
  pages =        "63",
  day =          "01",
  month =        apr,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi12040063",
  ISSN =         "1999-5903",
  bibdate =      "Thu May 28 15:16:57 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/12/4/63",
  abstract =     "The amalgamation of Vehicular Ad hoc Network (VANET)
                 with the Internet of Things (IoT) leads to the concept
                 of the Internet of Vehicles (IoV). IoV forms a solid
                 backbone for Intelligent Transportation Systems (ITS),
                 which paves the way for technologies that better
                 explain about traffic efficiency and their management
                 applications. IoV architecture is seen as a big player
                 in different areas such as the automobile industry,
                 research organizations, smart cities and intelligent
                 transportation for various commercial and scientific
                 applications. However, as VANET is vulnerable to
                 various types of security attacks, the IoV structure
                 should ensure security and efficient performance for
                 vehicular communications. To address these issues, in
                 this article, an authentication-based protocol (A-MAC)
                 for smart vehicular communication is proposed along
                 with a novel framework towards an IoV architecture
                 model. The scheme requires hash operations and uses
                 cryptographic concepts to transfer messages between
                 vehicles to maintain the required security. Performance
                 evaluation helps analyzing its strength in withstanding
                 various types of security attacks. Simulation results
                 demonstrate that A-MAC outshines other protocols in
                 terms of communication cost, execution time, storage
                 cost, and overhead.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/1999-5903/",
  remark =       "Special Issue Advances in Internet of Vehicles
                 (IoV).",
}

@Article{Gutterman:2020:RRT,
  author =       "Craig Gutterman and Katherine Guo and Sarthak Arora
                 and Trey Gilliland and Xiaoyang Wang and Les Wu and
                 Ethan Katz-Bassett and Gil Zussman",
  title =        "{Requet}: Real-Time {QoE} Metric Detection for
                 Encrypted {YouTube} Traffic",
  journal =      j-TOMM,
  volume =       "16",
  number =       "2s",
  pages =        "71:1--71:28",
  month =        jul,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3394498",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Sun Jul 19 08:56:56 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3394498",
  abstract =     "As video traffic dominates the Internet, it is
                 important for operators to detect video quality of
                 experience (QoE) to ensure adequate support for video
                 traffic. With wide deployment of end-to-end encryption,
                 traditional deep packet inspection-based traffic
                 monitoring approaches are becoming ineffective. This
                 poses a challenge for network operators to monitor user
                 QoE and improve upon their experience. To resolve this
                 issue, we develop and present a system for REal-time
                 QUality of experience metric detection for Encrypted
                 Traffic --- Requet --- which is suitable for network
                 middlebox deployment. Requet uses a detection algorithm
                 that we develop to identify video and audio chunks from
                 the IP headers of encrypted traffic. Features extracted
                 from the chunk statistics are used as input to a
                 machine learning algorithm to predict QoE metrics,
                 specifically buffer warning (low buffer, high buffer),
                 video state (buffer increase, buffer decay, steady,
                 stall), and video resolution. We collect a large
                 YouTube dataset consisting of diverse video assets
                 delivered over various WiFi and LTE network conditions
                 to evaluate the performance. We compare Requet with a
                 baseline system based on previous work and show that
                 Requet outperforms the baseline system in accuracy of
                 predicting buffer low warning, video state, and video
                 resolution by $ 1.12 \times $, $ 1.53 \times $, and $
                 3.14 \times $, respectively.",
  acknowledgement = ack-nhfb,
  articleno =    "71",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Gyongyosi:2020:SVD,
  author =       "Laszlo Gyongyosi",
  title =        "Singular value decomposition assisted multicarrier
                 continuous-variable quantum key distribution",
  journal =      j-THEOR-COMP-SCI,
  volume =       "801",
  number =       "??",
  pages =        "35--63",
  day =          "1",
  month =        jan,
  year =         "2020",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Tue Nov 19 09:30:01 MST 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397519304645",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Hameed:2020:LCE,
  author =       "Mustafa Emad Hameed and Masrullizam Mat Ibrahim and
                 Nurulfajar Abd Manap and Ali A. Mohammed",
  title =        "A lossless compression and encryption mechanism for
                 remote monitoring of {ECG} data using {Huffman} coding
                 and {CBC--AES}",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "111",
  number =       "??",
  pages =        "829--840",
  month =        oct,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2019.10.010",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:21 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X19313950",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Han:2020:CSA,
  author =       "Jiawei Han and Yanheng Liu and Xin Sun and Aiping
                 Chen",
  title =        "Correction to: {A self-adjusting quantum key renewal
                 management scheme in classical network symmetric
                 cryptography}",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "6",
  pages =        "4231--4231",
  month =        jun,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-018-2373-y",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Sat Jul 25 07:17:58 MDT 2020",
  bibsource =    "http://link.springer.com/journal/11227/76/6;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  note =         "See \cite{Han:2020:SAQ}.",
  URL =          "http://link.springer.com/content/pdf/10.1007/s11227-018-2373-y.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Han:2020:SAQ,
  author =       "Jiawei Han and Yanheng Liu and Xin Sun and Aiping
                 Chen",
  title =        "A self-adjusting quantum key renewal management scheme
                 in classical network symmetric cryptography",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "6",
  pages =        "4212--4230",
  month =        jun,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-018-2276-y",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Sat Jul 25 07:17:58 MDT 2020",
  bibsource =    "http://link.springer.com/journal/11227/76/6;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  note =         "See correction \cite{Han:2020:CSA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Han:2020:SMF,
  author =       "Juhyeng Han and Seongmin Kim and Daeyang Cho and
                 Byungkwon Choi and Jaehyeong Ha and Dongsu Han",
  title =        "A Secure Middlebox Framework for Enabling Visibility
                 Over Multiple Encryption Protocols",
  journal =      j-IEEE-TRANS-NETWORKING,
  volume =       "28",
  number =       "6",
  pages =        "2727--2740",
  month =        dec,
  year =         "2020",
  CODEN =        "IEANEP",
  DOI =          "https://doi.org/10.1109/TNET.2020.3016785",
  ISSN =         "1063-6692 (print), 1558-2566 (electronic)",
  ISSN-L =       "1063-6692",
  bibdate =      "Tue Feb 23 08:45:31 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
  URL =          "https://dl.acm.org/doi/10.1109/TNET.2020.3016785",
  abstract =     "Network middleboxes provide the first line of defense
                 for enterprise networks. Many of them typically inspect
                 packet payload to filter malicious attack patterns.
                 However, the widespread use of end-to-end cryptographic
                 protocols designed to promote \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE\slash ACM Transactions on Networking",
  journal-URL =  "https://dl.acm.org/loi/ton",
}

@Article{Heuser:2020:LCT,
  author =       "A. Heuser and S. Picek and S. Guilley and N. Mentens",
  title =        "Lightweight Ciphers and Their Side-Channel
                 Resilience",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "10",
  pages =        "1434--1448",
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Sep 10 08:32:07 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Heydari:2020:KUI,
  author =       "Mohammad Heydari and Alexios Mylonas and Vahid Heydari
                 Fami Tafreshi and Elhadj Benkhelifa and Surjit Singh",
  title =        "Known unknowns: Indeterminacy in authentication in
                 {IoT}",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "111",
  number =       "??",
  pages =        "278--287",
  month =        oct,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2020.03.005",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:21 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X1931982X",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Hoque:2020:HPO,
  author =       "Tamzidul Hoque and Kai Yang and Robert Karam and
                 Shahin Tajik and Domenic Forte and Mark Tehranipoor and
                 Swarup Bhunia",
  title =        "Hidden in Plaintext: an Obfuscation-based
                 Countermeasure against {FPGA} Bitstream Tampering
                 Attacks",
  journal =      j-TODAES,
  volume =       "25",
  number =       "1",
  pages =        "4:1--4:32",
  month =        jan,
  year =         "2020",
  CODEN =        "ATASFO",
  DOI =          "https://doi.org/10.1145/3361147",
  ISSN =         "1084-4309 (print), 1557-7309 (electronic)",
  ISSN-L =       "1084-4309",
  bibdate =      "Thu Jan 30 09:00:33 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/todaes.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3361147",
  abstract =     "Field Programmable Gate Arrays (FPGAs) have become an
                 attractive choice for diverse applications due to their
                 reconfigurability and unique security features.
                 However, designs mapped to FPGAs are prone to malicious
                 modifications or tampering of critical \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Transactions on Design Automation of Electronic
                 Systems",
  journal-URL =  "https://dl.acm.org/loi/todaes",
}

@Article{Howard:2020:BCF,
  author =       "J. P. Howard and M. E. Vachino",
  title =        "Blockchain Compliance With Federal Cryptographic
                 Information-Processing Standards",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "18",
  number =       "1",
  pages =        "65--70",
  month =        jan,
  year =         "2020",
  DOI =          "https://doi.org/10.1109/MSEC.2019.2944290",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Fri Feb 21 14:45:55 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
  keywords =     "Blockchain; blockchain technologies; cryptography;
                 Cryptography; Digital signatures; distributed
                 databases; Distributed ledger; Ethereum technologies;
                 Federal cryptographic Information-processing Standards;
                 Federal Information Security Management Act; FISMA;
                 Government policies; Hyperledger Fabric technologies;
                 multichain technologies; National Institute of
                 Standards and Technology cryptographic standards; NIST;
                 NIST compliance; R3s Corda technologies",
}

@Article{Hu:2020:LKE,
  author =       "J. Hu and M. Baldi and P. Santini and N. Zeng and S.
                 Ling and H. Wang",
  title =        "Lightweight Key Encapsulation Using {LDPC} Codes on
                 {FPGAs}",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "3",
  pages =        "327--341",
  month =        mar,
  year =         "2020",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2019.2948323",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Mar 5 13:54:11 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
  keywords =     "Encapsulation; Field programmable gate arrays; FPGA
                 implementation; Hardware; key encapsulation mechanism;
                 Parity check codes; Post-quantum cryptography; Public
                 key; QC-LDPC code",
}

@Article{Hu:2020:TEC,
  author =       "Yang Hu and John C. S. Lui and Wenjun Hu and Xiaobo Ma
                 and Jianfeng Li and Xiao Liang",
  title =        "Taming energy cost of disk encryption software on
                 data-intensive mobile devices",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "107",
  number =       "??",
  pages =        "681--691",
  month =        jun,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2017.09.025",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:14 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X17320113",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Huaman:2020:AIS,
  author =       "Carlos Quinto Huam{\'a}n and Ana Lucila Sandoval
                 Orozco and Luis Javier Garc{\'\i}a Villalba",
  title =        "Authentication and integrity of smartphone videos
                 through multimedia container structure analysis",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "108",
  number =       "??",
  pages =        "15--33",
  month =        jul,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2020.02.044",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:16 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X20300078",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Huang:2020:GCC,
  author =       "Meijuan Huang and Bo Yang and Yi Zhao and Xin Wang and
                 Yanwei Zhou and Zhe Xia",
  title =        "A generic construction of {CCA}-secure deterministic
                 encryption",
  journal =      j-INFO-PROC-LETT,
  volume =       "154",
  number =       "??",
  pages =        "Article 105865",
  month =        feb,
  year =         "2020",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/j.ipl.2019.105865",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Mar 24 11:59:22 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/infoproc2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0020019019301486",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Huang:2020:ULT,
  author =       "Meijuan Huang and Bo Yang and Mingwu Zhang and Lina
                 Zhang and Hongxia Hou",
  title =        "Updatable Lossy Trapdoor Functions Under Consecutive
                 Leakage",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "4",
  pages =        "648--656",
  month =        apr,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz119",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri May 8 08:50:40 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/4/648/5667451",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Hubacek:2020:HCL,
  author =       "Pavel Hub{\'a}cek and Eylon Yogev",
  title =        "Hardness of Continuous Local Search: Query Complexity
                 and Cryptographic Lower Bounds",
  journal =      j-SIAM-J-COMPUT,
  volume =       "49",
  number =       "6",
  pages =        "1128--1172",
  month =        "????",
  year =         "2020",
  CODEN =        "SMJCAT",
  DOI =          "https://doi.org/10.1137/17M1118014",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  bibdate =      "Fri Mar 12 11:30:52 MST 2021",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/49/6;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
  onlinedate =   "January 2020",
}

@Article{Hurley-Smith:2020:QLC,
  author =       "Darren Hurley-Smith and Julio Hernandez-Castro",
  title =        "Quantum Leap and Crash: Searching and Finding Bias in
                 Quantum Random Number Generators",
  journal =      j-TOPS,
  volume =       "23",
  number =       "3",
  pages =        "16:1--16:25",
  month =        jul,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3398726",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Fri Jul 10 09:15:30 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3398726",
  abstract =     "Random numbers are essential for cryptography and
                 scientific simulation. Generating truly random numbers
                 for cryptography can be a slow and expensive process.
                 Quantum physics offers a variety of promising solutions
                 to this challenge, proposing sources of entropy that
                 may be genuinely unpredictable, based on the inherent
                 randomness of certain physical phenomena. These
                 properties have been employed to design Quantum Random
                 Number Generators (QRNGs), some of which are
                 commercially available. In this work, we present the
                 first published analysis of the Quantis family of QRNGs
                 (excluding AIS-31 models), designed and manufactured by
                 ID Quantique (IDQ). Our study also includes Comscire's
                 PQ32MU QRNG, and two online services: the Australian
                 National University's (ANU) QRNG, and the Humboldt
                 Physik generator.\par

                 Each QRNG is analysed using five batteries of
                 statistical tests: Dieharder, National Institute of
                 Standards and Technology (NIST) SP800-22, Ent, Tuftests
                 and TestU01, as part of our thorough examination of
                 their output. Our analysis highlights issues with
                 current certification schemes, which largely rely on
                 NIST SP800-22 and Diehard tests of randomness. We find
                 that more recent tests of randomness identify issues in
                 the output of QRNG, highlighting the need for mandatory
                 post-processing even for low-security usage of random
                 numbers sourced from QRNGs.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Jahanshahi:2020:NFO,
  author =       "Hadi Jahanshahi and Amin Yousefpour and Jesus M.
                 Munoz-Pacheco and Sezgin Kacar and Viet-Thanh Pham and
                 Fawaz E. Alsaadi",
  title =        "A new fractional-order hyperchaotic memristor
                 oscillator: Dynamic analysis, robust adaptive
                 synchronization, and its application to voice
                 encryption",
  journal =      j-APPL-MATH-COMP,
  volume =       "383",
  number =       "??",
  pages =        "Article 125310",
  day =          "15",
  month =        oct,
  year =         "2020",
  CODEN =        "AMHCBQ",
  DOI =          "https://doi.org/10.1016/j.amc.2020.125310",
  ISSN =         "0096-3003 (print), 1873-5649 (electronic)",
  ISSN-L =       "0096-3003",
  bibdate =      "Sat Mar 13 06:39:44 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/applmathcomput2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0096300320302769",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Mathematics and Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00963003",
}

@Article{Jakobsson:2020:PP,
  author =       "M. Jakobsson",
  title =        "Permissions and Privacy",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "18",
  number =       "2",
  pages =        "46--55",
  month =        mar # "\slash " # apr,
  year =         "2020",
  DOI =          "https://doi.org/10.1109/MSEC.2019.2946330",
  ISSN =         "1558-4046",
  ISSN-L =       "1540-7993",
  bibdate =      "Wed May 27 17:52:17 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
  keywords =     "authentication; big data; brand management; companies;
                 data privacy; psychology; temperature sensors",
}

@Article{Jamshidpour:2020:SAD,
  author =       "Sadegh Jamshidpour and Zahra Ahmadian",
  title =        "Security analysis of a dynamic threshold secret
                 sharing scheme using linear subspace method",
  journal =      j-INFO-PROC-LETT,
  volume =       "163",
  number =       "??",
  pages =        "Article 105994",
  month =        nov,
  year =         "2020",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/j.ipl.2020.105994",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Mar 24 11:59:26 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/infoproc2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0020019020300818",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Jauernig:2020:TEE,
  author =       "P. Jauernig and A. Sadeghi and E. Stapf",
  title =        "Trusted Execution Environments: Properties,
                 Applications, and Challenges",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "18",
  number =       "2",
  pages =        "56--60",
  month =        mar # "\slash " # apr,
  year =         "2020",
  DOI =          "https://doi.org/10.1109/MSEC.2019.2947124",
  ISSN =         "1558-4046",
  ISSN-L =       "1540-7993",
  bibdate =      "Wed May 27 17:52:17 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
  keywords =     "computer architecture; computer hacking; encryption;
                 hardware; mobile handsets; operating systems",
}

@Article{Ji:2020:ASH,
  author =       "Xiaoyu Ji and Chaohao Li and Xinyan Zhou and Juchuan
                 Zhang and Yanmiao Zhang and Wenyuan Xu",
  title =        "Authenticating Smart Home Devices via Home Limited
                 Channels",
  journal =      j-TIOT,
  volume =       "1",
  number =       "4",
  pages =        "24:1--24:24",
  month =        oct,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3399432",
  ISSN =         "2691-1914 (print), 2577-6207 (electronic)",
  ISSN-L =       "2691-1914",
  bibdate =      "Thu Oct 8 07:14:58 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tiot.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3399432",
  abstract =     "Nowadays, most Internet of Things devices in smart
                 homes rely on radio frequency channels for
                 communication, making them exposed to various attacks
                 such as spoofing and eavesdropping attacks. Existing
                 methods using encryption keys may be inapplicable on
                 these resource-constrained devices that cannot afford
                 the computationally expensive encryption operations.
                 Thus, in this article, we design a key-free
                 communication method for such devices in a smart home.
                 In particular, we introduce the Home-limited Channel
                 (HLC) that can be accessed only within a house yet
                 inaccessible for outside-house attackers. Utilizing
                 HLCs, we propose HlcAuth, a challenge-response
                 mechanism to authenticate the communications between
                 smart devices without keys. The advantages of HlcAuth
                 are low cost, lightweight as well as key-free, and
                 requiring no human intervention. According to the
                 security analysis, HlcAuth can defeat replay attacks,
                 message-forgery attacks, and man-in-the-middle (MiTM)
                 attacks, among others. We further evaluate HlcAuth in
                 four different physical scenarios, and results show
                 that HlcAuth achieves 100\% true positive rate (TPR)
                 within 4.2m for in-house devices while 0\% false
                 positive rate (FPR) for outside attackers, i.e.,
                 guaranteeing a high-level usability and security for
                 in-house communications. Finally, we implement HlcAuth
                 in both single-room and multi-room scenarios.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Transactions on Internet of Things (TIOT)",
  journal-URL =  "https://dl.acm.org/loi/tiot",
}

@Article{Jiang:2020:EAP,
  author =       "Yan Jiang and Youwen Zhu and Jian Wang and Yong
                 Xiang",
  title =        "Efficient authentication protocol with anonymity and
                 key protection for mobile {Internet} users",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "137",
  number =       "??",
  pages =        "179--191",
  month =        mar,
  year =         "2020",
  CODEN =        "JPDCER",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Wed Mar 18 09:26:11 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0743731519303107",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
}

@Article{Jiang:2020:EBC,
  author =       "Zhen Hang Jiang and Yunsi Fei and David Kaeli",
  title =        "Exploiting Bank Conflict-based Side-channel Timing
                 Leakage of {GPUs}",
  journal =      j-TACO,
  volume =       "16",
  number =       "4",
  pages =        "1--24",
  month =        jan,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3361870",
  ISSN =         "1544-3566 (print), 1544-3973 (electronic)",
  ISSN-L =       "1544-3566",
  bibdate =      "Sat Jan 11 07:11:45 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/taco.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3361870",
  abstract =     "To prevent information leakage during program
                 execution, modern software cryptographic
                 implementations target constant-time function, where
                 the number of instructions executed remains the same
                 when program inputs change. However, the underlying
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Transactions on Architecture and Code Optimization
                 (TACO)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J924",
}

@Article{Jiang:2020:SCR,
  author =       "Jiafu Jiang and Linyu Tang and Ke Gu and WeiJia Jia",
  title =        "Secure Computing Resource Allocation Framework For
                 Open Fog Computing",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "4",
  pages =        "567--592",
  month =        apr,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz108",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri May 8 08:50:40 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/4/567/5717858",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Jiang:2020:SLW,
  author =       "Shunzhi Jiang and Dengpan Ye and Jiaqing Huang and
                 Yueyun Shang and Zhuoyuan Zheng",
  title =        "{SmartSteganogaphy}: {Light}-weight generative audio
                 steganography model for smart embedding application",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "165",
  number =       "??",
  pages =        "??--??",
  day =          "1",
  month =        sep,
  year =         "2020",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2020.102689",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:37 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804520301636",
  acknowledgement = ack-nhfb,
  articleno =    "102689",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{John:2020:SUT,
  author =       "B. John and S. J{\"o}rg and S. Koppal and E. Jain",
  title =        "The Security-Utility Trade-off for Iris Authentication
                 and Eye Animation for Social Virtual Avatars",
  journal =      j-IEEE-TRANS-VIS-COMPUT-GRAPH,
  volume =       "26",
  number =       "5",
  pages =        "1880--1890",
  year =         "2020",
  CODEN =        "ITVGEA",
  ISSN =         "1077-2626",
  ISSN-L =       "1077-2626",
  bibdate =      "Thu Apr 2 11:39:20 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransviscomputgraph.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Visualization and Computer
                 Graphics",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}

@Article{Jover:2020:SAS,
  author =       "Roger Piqueras Jover",
  title =        "Security Analysis of {SMS} as a Second Factor of
                 Authentication: The challenges of multifactor
                 authentication based on {SMS}, including cellular
                 security deficiencies, {SS7} exploits, and {SIM}
                 swapping",
  journal =      j-QUEUE,
  volume =       "18",
  number =       "4",
  pages =        "37--60",
  month =        aug,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3424302.3425909",
  bibdate =      "Fri Feb 5 11:33:26 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/queue.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3424302.3425909",
  abstract =     "Despite their popularity and ease of use, SMS-based
                 authentication tokens are arguably one of the least
                 secure forms of two-factor authentication. This does
                 not imply, however, that it is an invalid method for
                 securing an online account. The current \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Queue: Tomorrow's Computing Today",
  journal-URL =  "https://dl.acm.org/loi/queue",
}

@Article{Karacay:2020:IDE,
  author =       "Leyli Kara{\c{c}}ay and Erkay Sava{\c{s}} and Halit
                 Alptekin",
  title =        "Intrusion Detection Over Encrypted Network Data",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "4",
  pages =        "604--619",
  month =        apr,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz111",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri May 8 08:50:40 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/4/604/5618960",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Katsumata:2020:LBR,
  author =       "Shuichi Katsumata and Takahiro Matsuda and Atsushi
                 Takayasu",
  title =        "Lattice-based revocable (hierarchical) {IBE} with
                 decryption key exposure resistance",
  journal =      j-THEOR-COMP-SCI,
  volume =       "809",
  number =       "??",
  pages =        "103--136",
  day =          "24",
  month =        feb,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2019.12.003",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Thu Apr 23 07:41:38 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397519307650",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Kaur:2020:CIE,
  author =       "Manjit Kaur and Dilbag Singh and Kehui Sun and
                 Umashankar Rawat",
  title =        "Color image encryption using non-dominated sorting
                 genetic algorithm with local chaotic search based
                 {$5$D} chaotic map",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "107",
  number =       "??",
  pages =        "333--350",
  month =        jun,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2020.02.029",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:14 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X19324707",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Kaur:2020:PPR,
  author =       "Harkeerat Kaur and Pritee Khanna",
  title =        "Privacy preserving remote multi-server biometric
                 authentication using cancelable biometrics and secret
                 sharing",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "102",
  number =       "??",
  pages =        "30--41",
  month =        jan,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2019.07.023",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Mon Feb 10 12:55:04 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X18330553",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Khadem:2020:IAP,
  author =       "Behrooz Khadem and Reza Ghasemi",
  title =        "Improved algorithms in parallel evaluation of large
                 cryptographic {S-boxes}",
  journal =      j-INT-J-PAR-EMER-DIST-SYS,
  volume =       "35",
  number =       "4",
  pages =        "461--472",
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/17445760.2020.1760863",
  ISSN =         "1744-5760 (print), 1744-5779 (electronic)",
  ISSN-L =       "1744-5760",
  bibdate =      "Tue May 18 09:32:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/intjparemerdistsys.bib;
                 http://www.tandfonline.com/toc/gpaa20/35/4",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Parallel, Emergent and
                 Distributed Systems: IJPEDS",
  journal-URL =  "http://www.tandfonline.com/loi/gpaa20",
  onlinedate =   "18 Jun 2020",
}

@Article{Khan:2020:BSU,
  author =       "Saad Khan and Simon Parkinson and Liam Grant and Na
                 Liu and Stephen Mcguire",
  title =        "Biometric Systems Utilising Health Data from Wearable
                 Devices: Applications and Future Challenges in Computer
                 Security",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "85:1--85:29",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3400030",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3400030",
  abstract =     "Health data are being increasingly sensed from the
                 health-based wearable Internet of Things (IoT) devices,
                 providing much-needed fitness and health tracking.
                 However, data generated also present opportunities
                 within computer security, specifically with \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "85",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Khan:2020:MAS,
  author =       "Hassan Khan and Urs Hengartner and Daniel Vogel",
  title =        "Mimicry Attacks on Smartphone Keystroke
                 Authentication",
  journal =      j-TOPS,
  volume =       "23",
  number =       "1",
  pages =        "2:1--2:34",
  month =        feb,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3372420",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Sat Feb 15 07:50:03 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3372420",
  abstract =     "Keystroke behaviour-based authentication employs the
                 unique typing behaviour of users to authenticate them.
                 Recent such proposals for virtual keyboards on
                 smartphones employ diverse temporal, contact, and
                 spatial features to achieve over 95\% accuracy.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Kim:2020:RAA,
  author =       "Hokeun Kim and Eunsuk Kang and David Broman and Edward
                 A. Lee",
  title =        "Resilient Authentication and Authorization for the
                 {Internet of Things (IoT)} Using Edge Computing",
  journal =      j-TIOT,
  volume =       "1",
  number =       "1",
  pages =        "4:1--4:27",
  month =        feb,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3375837",
  ISSN =         "2691-1914 (print), 2577-6207 (electronic)",
  ISSN-L =       "2691-1914",
  bibdate =      "Tue Apr 7 08:06:52 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tiot.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3375837",
  abstract =     "An emerging type of network architecture called edge
                 computing has the potential to improve the availability
                 and resilience of IoT services under anomalous
                 situations such as network failures or
                 denial-of-service (DoS) attacks. However, relatively
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Transactions on Internet of Things (TIOT)",
  journal-URL =  "https://dl.acm.org/loi/tiot",
}

@Article{Kim:2020:TRO,
  author =       "Eunkyung Kim and Hyang-Sook Lee and Jeongeun Park",
  title =        "Towards Round-Optimal Secure Multiparty Computations:
                 Multikey {FHE} Without a {CRS}",
  journal =      j-INT-J-FOUND-COMP-SCI,
  volume =       "31",
  number =       "2",
  pages =        "157--174",
  month =        feb,
  year =         "2020",
  CODEN =        "IFCSEN",
  DOI =          "https://doi.org/10.1142/S012905412050001X",
  ISSN =         "0129-0541",
  ISSN-L =       "0129-0541",
  bibdate =      "10 March 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
                 http://www.worldscientific.com/loi/ijfcs",
  URL =          "https://www.worldscientific.com/doi/10.1142/S012905412050001X",
  abstract =     "Multikey fully homomorphic encryption (MFHE) allows
                 homomorphic operations between ciphertexts encrypted
                 under different keys. In applications for secure
                 multiparty computation (MPC) protocols, MFHE can be
                 more advantageous than usual fully homomorphic
                 encryption (FHE) since users do not need to agree with
                 a common public key before the computation when using
                 MFHE. In EUROCRYPT 2016, Mukherjee and Wichs
                 constructed a secure MPC protocol in only two rounds
                 via MFHE which deals with a common random/reference
                 string (CRS) in key generation. After then, Brakerski
                 et al. replaced the role of CRS with the distributed
                 setup for CRS calculation to form a four round secure
                 MPC protocol. Thus, recent improvements in round
                 complexity of MPC protocols have been made using MFHE.
                 In this paper, we go further to obtain round-efficient
                 and secure MPC protocols. The underlying MFHE schemes
                 in previous works still involve the common value, CRS,
                 it seems to weaken the power of using MFHE to allow
                 users to independently generate their own keys.
                 Therefore, we resolve the issue by constructing an MFHE
                 scheme without CRS based on LWE assumption, and then we
                 obtain a secure MPC protocol against semi-malicious
                 security in three rounds. We also define a new security
                 notion ``multikey-CPA security'' to prove that a
                 multikey ciphertext cannot be decrypted unless all the
                 secret keys are gathered and our scheme is multikey-CPA
                 secure.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Foundations of Computer
                 Science (IJFCS)",
  journal-URL =  "http://www.worldscientific.com/loi/ijfcs",
}

@Article{Ko:2020:DWB,
  author =       "Woo-Hyun Ko and Bharadwaj Satchidanandan and P. R.
                 Kumar",
  title =        "Dynamic Watermarking-based Defense of Transportation
                 Cyber-physical Systems",
  journal =      j-TCPS,
  volume =       "4",
  number =       "1",
  pages =        "12:1--12:21",
  month =        jan,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3361700",
  ISSN =         "2378-962X (print), 2378-9638 (electronic)",
  ISSN-L =       "2378-962X",
  bibdate =      "Tue Apr 7 14:51:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcps.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3361700",
  abstract =     "The transportation sector is on the threshold of a
                 revolution as advances in real-time communication,
                 real-time computing, and sensing technologies have
                 brought to fruition the capability to build
                 Transportation Cyber-Physical Systems (TCPS) such as
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Transactions on Cyber-Physical Systems",
  journal-URL =  "https://dl.acm.org/loi/tcps",
}

@Article{Ko:2020:PBN,
  author =       "Kyi Thar Ko and Htet Htet Hlaing and Masahiro Mambo",
  title =        "A {PEKS}-Based {NDN} Strategy for Name Privacy",
  journal =      j-FUTURE-INTERNET,
  volume =       "12",
  number =       "8",
  pages =        "130",
  day =          "31",
  month =        jul,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi12080130",
  ISSN =         "1999-5903",
  bibdate =      "Fri Aug 28 12:33:08 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/12/8/130",
  abstract =     "Named Data Networking (NDN), where addressable content
                 name is used, is considered as a candidate of
                 next-generation Internet architectures. NDN routers use
                 In-Network cache to replicate and store passing packets
                 to make faster content delivery. Because NDN uses a
                 human-readable name, it is easy for an adversary to
                 guess what kind of content is requested. To solve this
                 issue, we develop a PEKS-based strategy for forwarding
                 packets, where PEKS stands for public key encryption
                 with keyword search. We implement the PEKS-based
                 strategy based on the best route strategy and multicast
                 strategy of NDN and show the performance of the
                 PEKS-based NDN strategy. We also discuss the issues of
                 the PEKS-based NDN strategy.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/1999-5903/",
  remark =       "Special Issue Information and Future Internet
                 Security, Trust and Privacy.",
}

@Article{Koot:2020:FNC,
  author =       "Matthijs Koot",
  title =        "Field Note on {CVE-2019-11510}: Pulse Connect Secure
                 {SSL-VPN} in {The Netherlands}",
  journal =      j-DTRAP,
  volume =       "1",
  number =       "2",
  pages =        "13:1--13:7",
  month =        jul,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3382765",
  ISSN =         "????",
  ISSN-L =       "????",
  bibdate =      "Sun Jul 12 11:50:01 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/dtrap.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3382765",
  abstract =     "This Field Note describes the case of a critical
                 unauthenticated RCE vulnerability in an SSL-VPN product
                 that remained unpatched at a large scale-up and until
                 after exploits became public. Approximately 14,500
                 systems worldwide were reportedly unpatched at the end
                 of August 2019. Two weeks after exploits emerged in
                 public, both GCHQ and NSA released notices that the
                 vulnerability was being exploited by APT actors. The
                 present Field Note describes observations from the
                 Netherlands and includes reflections in an attempt to
                 stimulate thinking on how to improve the status quo,
                 such as through coordinated proactive measures by
                 CSIRTs.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "Digital Threats: Research and Practice (DTRAP)",
  journal-URL =  "https://dl.acm.org/loi/dtrap",
}

@Article{Koziol:2020:NES,
  author =       "M. Koziol",
  title =        "New encryption strategy passes early test: Ghost
                 polarization harnesses ultrafast fluctuations that
                 occur in a light wave",
  journal =      j-IEEE-SPECTRUM,
  volume =       "57",
  number =       "7",
  pages =        "11--11",
  year =         "2020",
  CODEN =        "IEESAM",
  ISSN =         "0018-9235 (print), 1939-9340 (electronic)",
  ISSN-L =       "0018-9235",
  bibdate =      "Fri Jul 24 08:02:32 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeespectrum2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Spectrum",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
}

@Article{Krishnankutty:2020:ISI,
  author =       "D. Krishnankutty and Z. Li and R. Robucci and N.
                 Banerjee and C. Patel",
  title =        "Instruction Sequence Identification and Disassembly
                 Using Power Supply Side-Channel Analysis",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "11",
  pages =        "1639--1653",
  month =        nov,
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Oct 8 20:31:08 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Ku-Cauich:2020:LCB,
  author =       "Juan Carlos Ku-Cauich and Guillermo Morales-Luna",
  title =        "A linear code based on resilient {Boolean} maps whose
                 dual is a platform for a robust secret sharing scheme",
  journal =      j-LINEAR-ALGEBRA-APPL,
  volume =       "596",
  number =       "??",
  pages =        "216--229",
  day =          "1",
  month =        jul,
  year =         "2020",
  CODEN =        "LAAPAW",
  DOI =          "https://doi.org/10.1016/j.laa.2020.03.010",
  ISSN =         "0024-3795 (print), 1873-1856 (electronic)",
  ISSN-L =       "0024-3795",
  bibdate =      "Wed Apr 22 11:44:54 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/linala2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0024379520301312",
  acknowledgement = ack-nhfb,
  fjournal =     "Linear Algebra and its Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00243795",
}

@Article{Kumar:2020:EDC,
  author =       "Priyan Malarvizhi Kumar and Usha Devi Gandhi",
  title =        "Enhanced {DTLS} with {CoAP}-based authentication
                 scheme for the {Internet of Things} in healthcare
                 application",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "6",
  pages =        "3963--3983",
  month =        jun,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-017-2169-5",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Sat Jul 25 07:17:58 MDT 2020",
  bibsource =    "http://link.springer.com/journal/11227/76/6;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Kumaravelu:2020:CES,
  author =       "Ramesh Kumaravelu and Rajakumar Sadaiyandi and
                 Anandamurugan Selvaraj and Jeeva Selvaraj and Gayathiri
                 Karthick",
  title =        "Computationally efficient and secure anonymous
                 authentication scheme for {IoT}-based mobile pay-{TV}
                 systems",
  journal =      j-COMPUT-INTELL,
  volume =       "36",
  number =       "3",
  pages =        "994--1009",
  month =        aug,
  year =         "2020",
  CODEN =        "COMIE6",
  DOI =          "https://doi.org/10.1111/coin.12295",
  ISSN =         "0824-7935 (print), 1467-8640 (electronic)",
  ISSN-L =       "0824-7935",
  bibdate =      "Fri Apr 1 07:46:59 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computintell.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Comput. Intell.",
  fjournal =     "Computational Intelligence",
  journal-URL =  "https://onlinelibrary.wiley.com/journal/14678640",
  onlinedate =   "21 February 2020",
}

@Article{Kumaresan:2020:TVA,
  author =       "S. Kumaresan and Vijayaragavan Shanmugam",
  title =        "Time-variant attribute-based multitype encryption
                 algorithm for improved cloud data security using user
                 profile",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "8",
  pages =        "6094--6112",
  month =        aug,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-019-03118-8",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Sat Jul 25 07:17:59 MDT 2020",
  bibsource =    "http://link.springer.com/journal/11227/76/8;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Lachtar:2020:CSA,
  author =       "Nada Lachtar and Abdulrahman Abu Elkhail and Anys
                 Bacha and Hafiz Malik",
  title =        "A Cross-Stack Approach Towards Defending Against
                 Cryptojacking",
  journal =      j-IEEE-COMPUT-ARCHIT-LETT,
  volume =       "19",
  number =       "2",
  pages =        "126--129",
  year =         "2020",
  DOI =          "https://doi.org/10.1109/LCA.2020.3017457",
  ISSN =         "1556-6056 (print), 1556-6064 (electronic)",
  ISSN-L =       "1556-6056",
  bibdate =      "Thu May 27 16:19:32 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Computer Architecture Letters",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
}

@Article{Lai:2020:CSC,
  author =       "Junzuo Lai and Zhengan Huang and Man Ho Au and
                 Xianping Mao",
  title =        "Constant-size {CCA-secure} multi-hop unidirectional
                 proxy re-encryption from indistinguishability
                 obfuscation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "847",
  number =       "??",
  pages =        "1--16",
  day =          "22",
  month =        dec,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2020.09.031",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Mar 12 06:53:48 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397520305302",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Larrucea:2020:AEM,
  author =       "Xabier Larrucea and Pablo Gonz{\'a}lez-Nalda and
                 Ismael Etxeberria-Agiriano and Mari Carmen Otero",
  title =        "Analysing encryption mechanisms and functional safety
                 in a {ROS}-based architecture",
  journal =      j-J-SOFTW-EVOL-PROC,
  volume =       "32",
  number =       "2",
  pages =        "e2224:1--e2224:??",
  month =        feb,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1002/smr.2224",
  ISSN =         "2047-7473 (print), 2047-7481 (electronic)",
  ISSN-L =       "2047-7473",
  bibdate =      "Mon May 17 08:20:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsoftwevolproc.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "",
  fjournal =     "Journal of Software: Evolution and Process",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2047-7481",
  onlinedate =   "31 July 2019",
}

@Article{Le:2020:CCM,
  author =       "Minh Ha Le and Vinh Duc Tran and Van Anh Trinh and
                 Viet Cuong Trinh",
  title =        "Compacting ciphertext in multi-channel broadcast
                 encryption and attribute-based encryption",
  journal =      j-THEOR-COMP-SCI,
  volume =       "804",
  number =       "??",
  pages =        "219--235",
  day =          "12",
  month =        jan,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2019.11.034",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Thu Apr 23 07:41:36 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397519307601",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Lee:2020:SBP,
  author =       "Jaekyu Lee and Yasuo Ishii and Dam Sunwoo",
  title =        "Securing Branch Predictors with Two-Level Encryption",
  journal =      j-TACO,
  volume =       "17",
  number =       "3",
  pages =        "21:1--21:25",
  month =        aug,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3404189",
  ISSN =         "1544-3566 (print), 1544-3973 (electronic)",
  ISSN-L =       "1544-3566",
  bibdate =      "Fri Aug 28 12:02:00 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/taco.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3404189",
  abstract =     "Modern processors rely on various speculative
                 mechanisms to meet performance demand. Branch
                 predictors are one of the most important
                 micro-architecture components to deliver performance.
                 However, they have been under heavy scrutiny because of
                 recent \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Transactions on Architecture and Code Optimization
                 (TACO)",
  journal-URL =  "https://dl.acm.org/loi/taco",
}

@Article{Lee:2020:TSG,
  author =       "Youngkyung Lee and Jong Hwan Park and Kwangsu Lee and
                 Dong Hoon Lee",
  title =        "Tight security for the generic construction of
                 identity-based signature (in the multi-instance
                 setting)",
  journal =      j-THEOR-COMP-SCI,
  volume =       "847",
  number =       "??",
  pages =        "122--133",
  day =          "22",
  month =        dec,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2020.09.044",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Mar 12 06:53:48 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397520305557",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@TechReport{Leurent:2020:SSF,
  author =       "Ga{\"e}tan Leurent and Thomas Peyrin",
  title =        "{SHA-1} is a Shambles --- First Chosen-Prefix
                 Collision on {SHA}-1and Application to the {PGP Web of
                 Trust}",
  type =         "Report",
  institution =  "Inria and Nanyang Technological University and Temasek
                 Laboratories",
  address =      "France and Singapore",
  day =          "26",
  month =        jul,
  year =         "2020",
  bibdate =      "Thu Sep 09 13:55:20 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://eprint.iacr.org/2020/014.pdf",
  abstract =     "The SHA-1 hash function was designed in 1995 and has
                 been widely used during two decades. A theoretical
                 collision attack was first proposed in 2004 [29],but
                 due to its high complexity it was only implemented in
                 practice in 2017, using a large GPU cluster [23]. More
                 recently, an almost practical chosen-prefix collision
                 attack against SHA-1 has been proposed [12]. This more
                 powerful attack allows to build colliding messages with
                 two arbitrary prefixes, which is much more threatening
                 for real protocols.\par

                 In this paper, we report the first practical
                 implementation of this attack, and its impact on
                 real-world security with a PGP/GnuPG impersonation
                 attack. We managed to significantly reduce the
                 complexity of collision attacks against SHA-1: on an
                 Nvidia GTX 970, identical-prefix collisions can now be
                 computed with a complexity (expressed in terms of SHA-1
                 equivalents on this GPU) of $ 2^{61.2} $ rather than $
                 2^{64.7} $, and chosen-prefix collisions with a
                 complexity of $ 2^{63.4} $ rather than $ 2^{67.1} $.
                 When renting cheap GPUs,this translates to a cost of
                 US\$11k for a collision, and US\$45k for a
                 chosen-prefix collision, within the means of academic
                 researchers. Our actual attack required two months of
                 computations using 900 Nvidia GTX 1060 GPUs (we paid
                 US\$75k because GPU prices were higher, and we wasted
                 some time preparing the attack).\par

                 Therefore, the same attacks that have been practical on
                 MD5 since 2009 are now practical on SHA-1. In
                 particular, chosen-prefix collisions can break
                 signature schemes and handshake security in secure
                 channel protocols (TLS, SSH), if generated extremely
                 quickly. We strongly advise to remove SHA-1 from those
                 type of applications as soon as possible.\par

                 We exemplify our cryptanalysis by creating a pair of
                 PGP/GnuPG keys with different identities, but colliding
                 SHA-1 certificates. A SHA-1 certification of the first
                 key can therefore be transferred to the second key,
                 leading to an impersonation attack. This proves that
                 SHA-1 signatures now offer virtually no security in
                 practice. The legacy branch of GnuPG still uses SHA-1
                 by default for identity certifications, but after
                 notifying the authors, the modern branch now rejects
                 SHA-1 signatures (the issue is tracked as
                 CVE-2019-14855).",
  acknowledgement = ack-nhfb,
  remark =       "Full version of a paper published in the proceedings
                 of USENIX Security '20.",
}

@Article{Lewis:2020:MHP,
  author =       "P. Lewis",
  title =        "Make a hack-proof garage door opener: A new breakout
                 board offers cryptographic security --- [Hands On]",
  journal =      j-IEEE-SPECTRUM,
  volume =       "57",
  number =       "3",
  pages =        "16--18",
  month =        mar,
  year =         "2020",
  CODEN =        "IEESAM",
  DOI =          "https://doi.org/10.1109/MSPEC.2020.9014451",
  ISSN =         "0018-9235 (print), 1939-9340 (electronic)",
  ISSN-L =       "0018-9235",
  bibdate =      "Thu Mar 05 14:00:51 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeespectrum2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Spectrum",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
}

@Article{Li:2020:DIS,
  author =       "Kai Li and Wei Ni and Yousef Emami and Yiran Shen and
                 Ricardo Severino and David Pereira and Eduardo Tovar",
  title =        "Design and Implementation of Secret Key Agreement for
                 Platoon-based Vehicular Cyber-physical Systems",
  journal =      j-TCPS,
  volume =       "4",
  number =       "2",
  pages =        "22:1--22:20",
  month =        feb,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3365996",
  ISSN =         "2378-962X (print), 2378-9638 (electronic)",
  ISSN-L =       "2378-962X",
  bibdate =      "Tue Apr 7 14:51:07 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcps.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3365996",
  abstract =     "In a platoon-based vehicular cyber-physical system
                 (PVCPS), a lead vehicle that is responsible for
                 managing the platoon's moving directions and velocity
                 periodically disseminates control messages to the
                 vehicles that follow. Securing wireless \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Transactions on Cyber-Physical Systems",
  journal-URL =  "https://dl.acm.org/loi/tcps",
}

@Article{Li:2020:EAI,
  author =       "Liandeng Li and Jiarui Fang and Jinlei Jiang and Lin
                 Gan and Weijie Zheng and Haohuan Fu and Guangwen Yang",
  title =        "Efficient {AES} implementation on {Sunway TaihuLight}
                 supercomputer: a systematic approach",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "138",
  number =       "??",
  pages =        "178--189",
  month =        apr,
  year =         "2020",
  CODEN =        "JPDCER",
  DOI =          "https://doi.org/10.1016/j.jpdc.2019.12.013",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Wed Mar 18 09:26:11 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib;
                 https://www.math.utah.edu/pub/tex/bib/super.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0743731519301108",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
}

@Article{Li:2020:ILE,
  author =       "Jingwei Li and Patrick P. C. Lee and Chufeng Tan and
                 Chuan Qin and Xiaosong Zhang",
  title =        "Information Leakage in Encrypted Deduplication via
                 Frequency Analysis: Attacks and Defenses",
  journal =      j-TOS,
  volume =       "16",
  number =       "1",
  pages =        "4:1--4:30",
  month =        apr,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3365840",
  ISSN =         "1553-3077 (print), 1553-3093 (electronic)",
  ISSN-L =       "1553-3077",
  bibdate =      "Wed Apr 8 11:43:49 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tos.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3365840",
  abstract =     "Encrypted deduplication combines encryption and
                 deduplication to simultaneously achieve both data
                 security and storage efficiency. State-of-the-art
                 encrypted deduplication systems mainly build on
                 deterministic encryption to preserve deduplication
                 effectiveness. However, such deterministic encryption
                 reveals the underlying frequency distribution of the
                 original plaintext chunks. This allows an adversary to
                 launch frequency analysis against the ciphertext chunks
                 and infer the content of the original plaintext chunks.
                 In this article, we study how frequency analysis
                 affects information leakage in encrypted deduplication,
                 from both attack and defense perspectives.
                 Specifically, we target backup workloads and propose a
                 new inference attack that exploits chunk locality to
                 increase the coverage of inferred chunks. We further
                 combine the new inference attack with the knowledge of
                 chunk sizes and show its attack effectiveness against
                 variable-size chunks. We conduct trace-driven
                 evaluation on both real-world and synthetic datasets
                 and show that our proposed attacks infer a significant
                 fraction of plaintext chunks under backup workloads. To
                 defend against frequency analysis, we present two
                 defense approaches, namely MinHash encryption and
                 scrambling. Our trace-driven evaluation shows that our
                 combined MinHash encryption and scrambling scheme
                 effectively mitigates the severity of the inference
                 attacks, while maintaining high storage efficiency and
                 incurring limited metadata access overhead.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Transactions on Storage",
  journal-URL =  "https://dl.acm.org/loi/tos",
}

@Article{Li:2020:MUD,
  author =       "Juyan Li and Chunguang Ma and Zhen Gu",
  title =        "Multi-use Deterministic Public Key Proxy Re-Encryption
                 from Lattices in the Auxiliary-Input Setting",
  journal =      j-INT-J-FOUND-COMP-SCI,
  volume =       "31",
  number =       "05",
  pages =        "551--567",
  month =        aug,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0129054120500252",
  ISSN =         "0129-0541",
  ISSN-L =       "0129-0541",
  bibdate =      "Sun Sep 13 09:54:18 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
                 http://www.worldscientific.com/loi/ijfcs",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0129054120500252",
  abstract =     "Proxy Re-Encryption (PRE) is a cryptographic primitive
                 that allows a proxy to turn an Alice's ciphertext into
                 a Bob's ciphertext on the same plaintext. All of the
                 PRE schemes are public key encryption and semantic
                 security. Deterministic Public Key Encryption (D-PKE)
                 provides an alternative to randomized public key
                 encryption in various scenarios where the latter
                 exhibits inherent drawbacks. In this paper, we
                 construct the first multi-use unidirectional D-PRE
                 scheme from Lattices in the auxiliary-input setting. We
                 also prove that it is PRIV1-INDr secure in the standard
                 model based on the LWR. Finally, an identity-based
                 D-PRE is obtained from the basic construction.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Foundations of Computer
                 Science (IJFCS)",
  journal-URL =  "http://www.worldscientific.com/loi/ijfcs",
}

@Article{Li:2020:PPS,
  author =       "Dong Li and Xiaofeng Liao and Tao Xiang and Jiahui Wu
                 and Junqing Le",
  title =        "Privacy-preserving self-serviced medical diagnosis
                 scheme based on secure multi-party computation",
  journal =      j-COMPUT-SECUR,
  volume =       "90",
  number =       "??",
  pages =        "Article 101701",
  month =        mar,
  year =         "2020",
  CODEN =        "CPSEDU",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Sat Mar 14 18:49:57 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S016740481930238X",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Article{Li:2020:SSB,
  author =       "Yantao Li and Hailong Hu and Zhangqian Zhu and Gang
                 Zhou",
  title =        "{SCANet}: Sensor-based Continuous Authentication with
                 Two-stream Convolutional Neural Networks",
  journal =      j-TOSN,
  volume =       "16",
  number =       "3",
  pages =        "29:1--29:27",
  month =        aug,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3397179",
  ISSN =         "1550-4859 (print), 1550-4867 (electronic)",
  ISSN-L =       "1550-4859",
  bibdate =      "Sat Aug 15 07:04:17 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tosn.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3397179",
  abstract =     "Continuous authentication monitors the security of a
                 system throughout the login session on mobile devices.
                 In this article, we present SCANet, a two-stream
                 convolutional neural network--based continuous
                 authentication system that leverages the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Transactions on Sensor Networks (TOSN)",
  journal-URL =  "https://dl.acm.org/loi/tosn",
}

@Article{Lin:2020:LFI,
  author =       "Xi-Jun Lin and Lin Sun and Haipeng Qu",
  title =        "Leakage-free {ID}-Based Signature, Revisited",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "8",
  pages =        "1263--1270",
  month =        aug,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz160",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Aug 25 18:11:58 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/8/1263/5716157",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Lin:2020:SCS,
  author =       "Xi-Jun Lin and Lin Sun and Zhen Yan and Xiaoshuai
                 Zhang and Haipeng Qu",
  title =        "On the Security Of A Certificateless Signcryption With
                 Known Session-Specific Temporary Information Security
                 In The Standard Model",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "8",
  pages =        "1259--1262",
  month =        aug,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz157",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Aug 25 18:11:58 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/8/1259/5699818",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Lindner:2020:IDA,
  author =       "Sebastian Lindner and Laurent Imbert and Michael J.
                 Jacobson",
  title =        "Improved divisor arithmetic on generic hyperelliptic
                 curves",
  journal =      j-ACM-COMM-COMP-ALGEBRA,
  volume =       "54",
  number =       "3",
  pages =        "95--99",
  month =        sep,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3457341.3457345",
  ISSN =         "1932-2232 (print), 1932-2240 (electronic)",
  ISSN-L =       "1932-2232",
  bibdate =      "Tue May 11 15:38:43 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457341.3457345",
  abstract =     "The divisor class group of a hyperelliptic curve
                 defined over a finite field is a finite abelian group
                 at the center of a number of important open questions
                 in algebraic geometry, number theory and cryptography.
                 Many of these problems lend themselves to \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Communications in Computer Algebra",
  journal-URL =  "https://dl.acm.org/loi/sigsam-cca",
}

@Article{Liu:2020:ASF,
  author =       "Muhua Liu and Ping Zhang",
  title =        "An Adaptively Secure Functional Encryption for
                 Randomized Functions",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "8",
  pages =        "1247--1258",
  month =        aug,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz154",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Aug 25 18:11:58 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/8/1247/5699816",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Liu:2020:BBI,
  author =       "Yang Liu and Debiao He and Mohammad S. Obaidat and
                 Neeraj Kumar and Muhammad Khurram Khan and Kim-Kwang
                 Raymond Choo",
  title =        "Blockchain-based identity management systems: a
                 review",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "166",
  number =       "??",
  pages =        "??--??",
  day =          "15",
  month =        sep,
  year =         "2020",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2020.102731",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:38 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804520302058",
  acknowledgement = ack-nhfb,
  articleno =    "102731",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Liu:2020:CCB,
  author =       "Hongjun Liu and Abdurahman Kadir and Chengbo Xu",
  title =        "Cryptanalysis and constructing {S-Box} based on
                 chaotic map and backtracking",
  journal =      j-APPL-MATH-COMP,
  volume =       "376",
  number =       "??",
  pages =        "Article 125153",
  day =          "1",
  month =        jul,
  year =         "2020",
  CODEN =        "AMHCBQ",
  DOI =          "https://doi.org/10.1016/j.amc.2020.125153",
  ISSN =         "0096-3003 (print), 1873-5649 (electronic)",
  ISSN-L =       "0096-3003",
  bibdate =      "Wed May 27 10:52:24 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/applmathcomput2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0096300320301223",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Mathematics and Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00963003",
}

@Article{Liu:2020:DPS,
  author =       "Yue Liu and Qinghua Lu and Hye-Young Paik and Xiwei Xu
                 and Shiping Chen and Liming Zhu",
  title =        "Design Pattern as a Service for Blockchain-Based
                 Self-Sovereign Identity",
  journal =      j-IEEE-SOFTWARE,
  volume =       "37",
  number =       "5",
  pages =        "30--36",
  month =        sep # "\slash " # oct,
  year =         "2020",
  CODEN =        "IESOEG",
  DOI =          "https://doi.org/10.1109/MS.2020.2992783",
  ISSN =         "0740-7459 (print), 1937-4194 (electronic)",
  ISSN-L =       "0740-7459",
  bibdate =      "Thu May 27 17:14:52 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesoft.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Software",
  journal-URL =  "http://www.computer.org/portal/web/csdl/magazines/software",
}

@Article{Liu:2020:ESI,
  author =       "Z. Liu and R. Azarderakhsh and H. Kim and H. Seo",
  title =        "Efficient Software Implementation of Ring-{LWE}
                 Encryption on {IoT} Processors",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "10",
  pages =        "1424--1433",
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Sep 10 08:32:07 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Lu:2020:VSV,
  author =       "Li Lu and Jiadi Yu and Yingying Chen and Yan Wang",
  title =        "{VocalLock}: Sensing Vocal Tract for
                 Passphrase-Independent User Authentication Leveraging
                 Acoustic Signals on Smartphones",
  journal =      j-IMWUT,
  volume =       "4",
  number =       "2",
  pages =        "51:1--51:24",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3397320",
  ISSN =         "2474-9567 (electronic)",
  ISSN-L =       "2474-9567",
  bibdate =      "Sun Jul 12 11:33:41 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/imwut.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3397320",
  abstract =     "Recent years have witnessed the surge of
                 biometric-based user authentication for mobile devices
                 due to its promising security and convenience. As a
                 natural and widely-existed behavior, human speaking has
                 been exploited for user authentication. Existing
                 voice-based user authentication explores the unique
                 characteristics from either the voiceprint or mouth
                 movements, which is vulnerable to replay attacks and
                 mimic attacks. During speaking, the vocal tract,
                 including the static shape and dynamic movements, also
                 exhibits the individual uniqueness, and they are hardly
                 eavesdropped and imitated by adversaries. Hence, our
                 work aims to employ the individual uniqueness of vocal
                 tract to realize user authentication on mobile devices.
                 Moreover, most voice-based user authentications are
                 passphrase-dependent, which significantly degrade the
                 user experience. Thus, such user authentications are
                 pressed to be implemented in a passphrase-independent
                 manner while being able to resist various attacks. In
                 this paper, we propose a user authentication system,
                 VocalLock, which senses the whole vocal tract during
                 speaking to identify different individuals in a
                 passphrase-independent manner on smartphones leveraging
                 acoustic signals. VocalLock first utilizes FMCW on
                 acoustic signals to characterize both the static shape
                 and dynamic movements of the vocal tract during
                 speaking, and then constructs a passphrase-independent
                 user authentication model based on the unique
                 characteristics of vocal tract through GMM-UBM. The
                 proposed VocalLock can resist various spoofing attacks,
                 while achieving a satisfactory user experience.
                 Extensive experiments in real environments demonstrate
                 VocalLock can accurately authenticate user identity in
                 a passphrase-independent manner and successfully resist
                 various attacks.",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "",
  journal-URL =  "https://dl.acm.org/loi/imwut",
}

@Article{Luo:2020:HTI,
  author =       "Entao Luo and Kehua Guo and Yayuan Tang and Xiangdong
                 Ying and Wen Huang",
  title =        "Hidden the true identity and dating characteristics
                 based on quick private matching in mobile social
                 networks",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "109",
  number =       "??",
  pages =        "633--641",
  month =        aug,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2018.04.088",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:18 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X17320149",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Lv:2020:SAP,
  author =       "Jiaxian Lv and Yi Wang and Jinshu Su and Rongmao Chen
                 and Wenjun Wu",
  title =        "Security of Auditing Protocols Against Subversion
                 Attacks",
  journal =      j-INT-J-FOUND-COMP-SCI,
  volume =       "31",
  number =       "2",
  pages =        "193--206",
  month =        feb,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0129054120500033",
  ISSN =         "0129-0541",
  ISSN-L =       "0129-0541",
  bibdate =      "Tue Mar 10 07:39:25 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
                 http://www.worldscientific.com/loi/ijfcs",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0129054120500033",
  abstract =     "In 2013, the revelation of Edward Snowden rekindled
                 cryptographic researchers' interest in subversion
                 attacks. Since then, many works have been carried out
                 to explore the power of subversion attacks and feasible
                 effective countermeasures as well. In this work, we
                 investigate the study of subversion attacks against
                 cloud auditing protocol, which has been well-known as
                 useful primitive for secure cloud storage. We
                 demonstrate that subverted auditing protocol enables
                 the cloud server to recover secret information stored
                 on the data owner side. Particularly, we first define
                 an asymmetric subversion attack model for auditing
                 protocol. This model serves as the principle for
                 analyzing the undetectability and key recovery of
                 subversion attacks against auditing protocols. We then
                 show a general framework of asymmetric subversion
                 attacks against auditing protocols with
                 index-coefficient challenge. To illustrate the
                 feasibility of our paradigm, several concrete auditing
                 protocols are provided. As a feasible countermeasure,
                 we propose a subversion-resilient auditing protocol
                 with index-coefficient challenge.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Foundations of Computer
                 Science (IJFCS)",
  journal-URL =  "http://www.worldscientific.com/loi/ijfcs",
}

@Article{Ma:2020:SAR,
  author =       "Xuecheng Ma and Dongdai Lin",
  title =        "Server-aided Revocable {IBE} with Identity Reuse",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "4",
  pages =        "620--632",
  month =        apr,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz114",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri May 8 08:50:40 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/4/620/5625927",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Mabodi:2020:MLT,
  author =       "Kobra Mabodi and Mehdi Yusefi and Reza Fotohi",
  title =        "Multi-level trust-based intelligence schema for
                 securing of {Internet of Things} {(IoT)} against
                 security threats using cryptographic authentication",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "9",
  pages =        "7081--7106",
  month =        sep,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-019-03137-5",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri May 14 09:19:58 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-019-03137-5",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  online-date =  "Published: 10 January 2020 Pages: 7081 - 7106",
}

@Article{Marsh:2020:HFB,
  author =       "Allison Marsh",
  title =        "The Hidden Figures Behind {Bletchley Park}'s
                 Code-Breaking {Colossus}",
  journal =      j-IEEE-SPECTRUM,
  volume =       "57",
  number =       "1",
  pages =        "??--??",
  month =        jan,
  year =         "2020",
  CODEN =        "IEESAM",
  ISSN =         "0018-9235 (print), 1939-9340 (electronic)",
  ISSN-L =       "0018-9235",
  bibdate =      "Fri Jan 17 13:48:26 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  note =         "Online supplement to 1-page story.",
  URL =          "https://spectrum.ieee.org/tech-history/dawn-of-electronics/the-hidden-figures-behind-bletchley-parks-codebreaking-colossus",
  abstract =     "This top-secret project recruited 273 women to operate
                 the world's first digital electronic computer.",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Spectrum",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
}

@Article{Marsh:2020:HFC,
  author =       "Allison Marsh",
  title =        "The hidden figures of {Colossus}",
  journal =      j-IEEE-SPECTRUM,
  volume =       "57",
  number =       "1",
  pages =        "64--64",
  month =        jan,
  year =         "2020",
  CODEN =        "IEESAM",
  DOI =          "https://doi.org/10.1109/MSPEC.2020.8946318",
  ISSN =         "0018-9235 (print), 1939-9340 (electronic)",
  ISSN-L =       "0018-9235",
  bibdate =      "Fri Jan 17 09:23:28 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeespectrum2020.bib",
  URL =          "https://spectrum.ieee.org/tech-history/dawn-of-electronics/the-hidden-figures-behind-bletchley-parks-codebreaking-colossus",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Spectrum",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
}

@Misc{Mclaughlin:2020:BPC,
  author =       "Martyn Mclaughlin",
  title =        "{Bletchley Park} codebreaker who helped change course
                 of {World War II} dies aged 97",
  howpublished = "Web site",
  day =          "17",
  month =        may,
  year =         "2020",
  bibdate =      "Tue Jun 16 10:19:37 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://www.scotsman.com/news/people/bletchley-park-codebreaker-who-helped-change-course-world-war-ii-dies-aged-97-2855511",
  abstract =     "Tributes have been paid to Ann Mitchell, one of the
                 last remaining Bletchley Park codebreakers, whose
                 mathematical prowess helped change the course of World
                 War II.",
  acknowledgement = ack-nhfb,
  remark =       "From the story: ``The average age of Bletchley's
                 veterans now stands at 97, and a reunion held last
                 September to mark the 80th anniversary of the beginning
                 of the war was attended by just 95 former staff.''",
}

@Article{Mehic:2020:QKD,
  author =       "Miralem Mehic and Marcin Niemiec and Stefan Rass and
                 Jiajun Ma and Momtchil Peev and Alejandro Aguado and
                 Vicente Martin and Stefan Schauer and Andreas Poppe and
                 Christoph Pacher and Miroslav Voznak",
  title =        "Quantum Key Distribution: a Networking Perspective",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "5",
  pages =        "96:1--96:41",
  month =        oct,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3402192",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Oct 16 10:09:59 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3402192",
  abstract =     "The convergence of quantum cryptography with
                 applications used in everyday life is a topic drawing
                 attention from the industrial and academic worlds. The
                 development of quantum electronics has led to the
                 practical achievement of quantum devices that are
                 already available on the market and waiting for their
                 first application on a broader scale. A major aspect of
                 quantum cryptography is the methodology of Quantum Key
                 Distribution (QKD), which is used to generate and
                 distribute symmetric cryptographic keys between two
                 geographically separate users using the principles of
                 quantum physics. In previous years, several successful
                 QKD networks have been created to test the
                 implementation and interoperability of different
                 practical solutions. This article surveys previously
                 applied methods, showing techniques for deploying QKD
                 networks and current challenges of QKD networking.
                 Unlike studies focusing on optical channels and optical
                 equipment, this survey focuses on the network aspect by
                 considering network organization, routing and signaling
                 protocols, simulation techniques, and a
                 software-defined QKD networking approach.",
  acknowledgement = ack-nhfb,
  articleno =    "96",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mehrabi:2020:ECC,
  author =       "M. A. Mehrabi and C. Doche and A. Jolfaei",
  title =        "Elliptic Curve Cryptography Point Multiplication Core
                 for Hardware Security Module",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "11",
  pages =        "1707--1718",
  month =        nov,
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Oct 8 20:31:08 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Mehrotra:2020:PPD,
  author =       "Sharad Mehrotra and Shantanu Sharma and Jeffrey D.
                 Ullman and Dhrubajyoti Ghosh and Peeyush Gupta and
                 Anurag Mishra",
  title =        "{PANDA}: Partitioned Data Security on Outsourced
                 Sensitive and Non-sensitive Data",
  journal =      j-TMIS,
  volume =       "11",
  number =       "4",
  pages =        "23:1--23:41",
  month =        dec,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3397521",
  ISSN =         "2158-656X (print), 2158-6578 (electronic)",
  ISSN-L =       "2158-656X",
  bibdate =      "Sat Mar 20 18:13:57 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tmis.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3397521",
  abstract =     "Despite extensive research on cryptography, secure and
                 efficient query processing over outsourced data remains
                 an open challenge. This article continues along with
                 the emerging trend in secure data processing that
                 recognizes that the entire dataset may \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Transactions on Management Information Systems
                 (TMIS)",
  journal-URL =  "https://dl.acm.org/loi/tmis",
}

@Article{Meng:2020:BSC,
  author =       "D. Meng and R. Hou and G. Shi and B. Tu and A. Yu and
                 Z. Zhu and X. Jia and Y. Wen and Y. Yang",
  title =        "Built-in Security Computer: Deploying Security-First
                 Architecture Using Active Security Processor",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "11",
  pages =        "1571--1583",
  month =        nov,
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Oct 8 20:31:08 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Meng:2020:TCS,
  author =       "Keju Meng and Fuyou Miao and Wenchao Huang and Yan
                 Xiong",
  title =        "Threshold changeable secret sharing with secure secret
                 reconstruction",
  journal =      j-INFO-PROC-LETT,
  volume =       "157",
  number =       "??",
  pages =        "Article 105928",
  month =        may,
  year =         "2020",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/j.ipl.2020.105928",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Mar 24 11:59:23 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/infoproc2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0020019020300156",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Mone:2020:NQT,
  author =       "Gregory Mone",
  title =        "News: The quantum threat",
  journal =      j-CACM,
  volume =       "63",
  number =       "7",
  pages =        "12--14",
  month =        jul,
  year =         "2020",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/3398388",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jun 22 06:05:31 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3398388",
  abstract =     "Cryptographers are developing algorithms to ensure
                 security in a world of quantum computing.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Article{Nabeel:2020:RTS,
  author =       "M. Nabeel and M. Ashraf and S. Patnaik and V. Soteriou
                 and O. Sinano{\u{g}}lu and J. Knechtel",
  title =        "{$ 2.5 $D} Root of Trust: Secure System-Level
                 Integration of Untrusted Chiplets",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "11",
  pages =        "1611--1625",
  month =        nov,
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Oct 8 20:31:08 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Nahiyan:2020:SCF,
  author =       "Adib Nahiyan and Jungmin Park and Miao He and Yousef
                 Iskander and Farimah Farahmandi and Domenic Forte and
                 Mark Tehranipoor",
  title =        "{SCRIPT}: a {CAD} Framework for Power Side-channel
                 Vulnerability Assessment Using Information Flow
                 Tracking and Pattern Generation",
  journal =      j-TODAES,
  volume =       "25",
  number =       "3",
  pages =        "26:1--26:27",
  month =        may,
  year =         "2020",
  CODEN =        "ATASFO",
  DOI =          "https://doi.org/10.1145/3383445",
  ISSN =         "1084-4309 (print), 1557-7309 (electronic)",
  ISSN-L =       "1084-4309",
  bibdate =      "Tue May 19 10:15:25 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/todaes.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3383445",
  abstract =     "Power side-channel attacks (SCAs) have been proven to
                 be effective at extracting secret keys from hardware
                 implementations of cryptographic algorithms. Ideally,
                 the power side-channel leakage (PSCL) of hardware
                 designs of a cryptographic algorithm \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Transactions on Design Automation of Electronic
                 Systems",
  journal-URL =  "https://dl.acm.org/loi/todaes",
}

@Article{Nanda:2020:HET,
  author =       "Ashish Nanda and Priyadarsi Nanda and Xiangjian He and
                 Aruna Jamdagni and Deepak Puthal",
  title =        "A hybrid encryption technique for {Secure-GLOR}: the
                 adaptive secure routing protocol for dynamic wireless
                 mesh networks",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "109",
  number =       "??",
  pages =        "521--530",
  month =        aug,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2018.05.065",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:18 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X17322409",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Naor:2020:SLU,
  author =       "Moni Naor and Lior Rotem and Gil Segev",
  title =        "The Security of Lazy Users in Out-of-Band
                 Authentication",
  journal =      j-TOPS,
  volume =       "23",
  number =       "2",
  pages =        "9:1--9:32",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3377849",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Wed May 27 08:04:28 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3377849",
  abstract =     "Faced with the threats posed by man-in-the-middle
                 attacks, messaging platforms rely on ``out-of-band''
                 authentication, assuming that users have access to an
                 external channel for authenticating one short value.
                 For example, assuming that users recognizing \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Narasimhan:2020:BPM,
  author =       "Sivasankari Narasimhan and Muthukumar Arunachalam",
  title =        "{Bio-Puf-Mac} authenticated encryption for iris
                 biometrics",
  journal =      j-COMPUT-INTELL,
  volume =       "36",
  number =       "3",
  pages =        "1221--1241",
  month =        aug,
  year =         "2020",
  CODEN =        "COMIE6",
  DOI =          "https://doi.org/10.1111/coin.12332",
  ISSN =         "0824-7935 (print), 1467-8640 (electronic)",
  ISSN-L =       "0824-7935",
  bibdate =      "Fri Apr 1 07:46:59 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computintell.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Comput. Intell.",
  fjournal =     "Computational Intelligence",
  journal-URL =  "https://onlinelibrary.wiley.com/journal/14678640",
  onlinedate =   "27 May 2020",
}

@Article{Nejatollahi:2020:SFA,
  author =       "Hamid Nejatollahi and Felipe Valencia and Subhadeep
                 Banik and Francesco Regazzoni and Rosario Cammarota and
                 Nikil Dutt",
  title =        "Synthesis of Flexible Accelerators for Early Adoption
                 of Ring-{LWE} Post-quantum Cryptography",
  journal =      j-TECS,
  volume =       "19",
  number =       "2",
  pages =        "11:1--11:17",
  month =        mar,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3378164",
  ISSN =         "1539-9087 (print), 1558-3465 (electronic)",
  ISSN-L =       "1539-9087",
  bibdate =      "Wed Mar 18 07:47:52 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tecs.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3378164",
  abstract =     "The advent of the quantum computer makes current
                 public-key infrastructure insecure. Cryptography
                 community is addressing this problem by designing,
                 efficiently implementing, and evaluating novel
                 public-key algorithms capable of withstanding quantum
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Transactions on Embedded Computing Systems",
  journal-URL =  "https://dl.acm.org/loi/tecs",
}

@Article{Nikooghadam:2020:PFS,
  author =       "Mahdi Nikooghadam and Haleh Amintoosi",
  title =        "Perfect forward secrecy via an {ECC}-based
                 authentication scheme for {SIP} in {VoIP}",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "4",
  pages =        "3086--3104",
  month =        apr,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-019-03086-z",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Sat Jul 25 07:17:55 MDT 2020",
  bibsource =    "http://link.springer.com/journal/11227/76/4;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Omar:2020:OSC,
  author =       "H. Omar and B. D'Agostino and O. Khan",
  title =        "{OPTIMUS}: A Security-Centric Dynamic Hardware
                 Partitioning Scheme for Processors that Prevent
                 Microarchitecture State Attacks",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "11",
  pages =        "1558--1570",
  month =        nov,
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Oct 8 20:31:08 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Ou:2020:LDA,
  author =       "C. Ou and S. -K. Lam and C. Zhou and G. Jiang and F.
                 Zhang",
  title =        "A Lightweight Detection Algorithm For
                 Collision-Optimized Divide-and-Conquer Attacks",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "11",
  pages =        "1694--1706",
  month =        nov,
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Oct 8 20:31:08 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Paez:2020:ABE,
  author =       "Rafael P{\'a}ez and Manuel P{\'e}rez and Gustavo
                 Ram{\'\i}rez and Juan Montes and Lucas Bouvarel",
  title =        "An Architecture for Biometric Electronic
                 Identification Document System Based on Blockchain",
  journal =      j-FUTURE-INTERNET,
  volume =       "12",
  number =       "1",
  pages =        "10",
  day =          "11",
  month =        jan,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi12010010",
  ISSN =         "1999-5903",
  bibdate =      "Mon Mar 2 12:22:41 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/12/1/10",
  abstract =     "This paper proposes an architecture for biometric
                 electronic identification document (e-ID) system based
                 on Blockchain for citizens identity verification in
                 transactions corresponding to the notary, registration,
                 tax declaration and payment, basic health services and
                 registration of economic activities, among others. To
                 validate the user authentication, a biometric e-ID
                 system is used to avoid spoofing and related attacks.
                 Also, to validate the document a digital certificate is
                 used with the corresponding public and private key for
                 each citizen by using a user's PIN. The proposed
                 transaction validation process was implemented on a
                 Blockchain system in order to record and verify the
                 transactions made by all citizens registered in the
                 electoral census, which guarantees security, integrity,
                 scalability, traceability, and no-ambiguity.
                 Additionally, a Blockchain network architecture is
                 presented in a distributed and decentralized way
                 including all the nodes of the network, database and
                 government entities such as national register and
                 notary offices. The results of the application of a new
                 consensus algorithm to our Blockchain network are also
                 presented showing mining time, memory and CPU usage
                 when the number of transactions scales up.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
  remark =       "Special Issue Smart Cities, Innovation, and
                 Multi-Dimensionality.",
}

@Article{Pandey:2020:SMD,
  author =       "Hari Mohan Pandey",
  title =        "Secure medical data transmission using a fusion of bit
                 mask oriented genetic algorithm, encryption and
                 steganography",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "111",
  number =       "??",
  pages =        "213--225",
  month =        oct,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2020.04.034",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:21 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X20303848",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Paskin-Cherniavsky:2020:CAU,
  author =       "Anat Paskin-Cherniavsky and Ruxandra F. Olimid",
  title =        "On cryptographic anonymity and unpredictability in
                 secret sharing",
  journal =      j-INFO-PROC-LETT,
  volume =       "161",
  number =       "??",
  pages =        "Article 105965",
  month =        sep,
  year =         "2020",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/j.ipl.2020.105965",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Mar 24 11:59:25 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/infoproc2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0020019020300521",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Patsakis:2020:ECD,
  author =       "Constantinos Patsakis and Fran Casino and Vasilios
                 Katos",
  title =        "Encrypted and covert {DNS} queries for botnets:
                 Challenges and countermeasures",
  journal =      j-COMPUT-SECUR,
  volume =       "88",
  number =       "??",
  pages =        "Article 101614",
  month =        jan,
  year =         "2020",
  CODEN =        "CPSEDU",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Tue Oct 22 14:36:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://www.sciencedirect.com/science/article/pii/S016740481831321X",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Article{Payeras-Capella:2020:IEM,
  author =       "M Magdalena Payeras-Capella and Macia Mut-Puigserver
                 and Pau Conejero-Alberola and Jordi Castella-Roca and
                 Lloren{\c{c}} Huguet-Rotger",
  title =        "Implementation And Evaluation Of The {mCityPASS}
                 Protocol For Secure And Private Access To Associated
                 Touristic Services",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "8",
  pages =        "1168--1193",
  month =        aug,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz126",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Aug 25 18:11:58 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/8/1168/5670506",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@TechReport{Peyrin:2020:SSF,
  author =       "Ga{\"e}tan Leurent and Thomas Peyrin",
  title =        "{SHA-1} is a Shambles: First Chosen-Prefix Collision
                 on {SHA-1} and Application to the {PGP Web of Trust}",
  type =         "Report",
  institution =  "Inria and Nanyang Technological University and Temasek
                 Laboratories",
  address =      "France and Singapore",
  day =          "7",
  month =        jan,
  year =         "2020",
  bibdate =      "Wed Jan 15 07:07:23 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  abstract =     "The SHA-1 hash function was designed in 1995 and has
                 been widely used during two decades. A theoretical
                 collision attack was first proposed in 2004 [WYY05],
                 but due to its high complexity it was only implemented
                 in practice in 2017, using a large GPU cluster
                 [SBK+17]. More recently, an almost practical
                 chosen-prefix collision attack against SHA-1 has been
                 proposed [LP19]. This more powerful attack allows to
                 build colliding messages with two arbitrary prefixes,
                 which is much more threatening for real protocols. In
                 this paper, we report the first practical
                 implementation of this attack, and its impact on
                 real-world security with a PGP/GnuPG impersonation
                 attack. We managed to significantly reduce the
                 complexity of collisions attack against SHA-1: on an
                 NvidiaGTX 970, identical-prefix collisions can now be
                 computed with a complexity of $ 2^{61. 2} $ rather than
                 $ 2^{64. 7} $, and chosen-prefix collisions with a
                 complexity of $ 2^{63. 4} $ rather than $ 2^{67. 1} $.
                 When renting cheap GPUs, this translates to a cost of
                 11k USD for a collision, and 45k USD for a
                 chosen-prefix collision, within the means of academic
                 researchers. Our actual attack required two months of
                 computations using 900 Nvidia GTX 1060 GPUs (we paid
                 75k USD because GPU prices were higher, and we wasted
                 some time preparing the attack). Therefore, the same
                 attacks that have been practical on MD5 since 2009 are
                 now practical on SHA-1. In particular, chosen-prefix
                 collisions can break signature schemes and handshake
                 security in secure channel protocols (TLS, SSH). We
                 strongly advise to remove SHA-1 from those type of
                 applications as soon as possible. We exemplify our
                 cryptanalysis by creating a pair of PGP/GnuPG keys with
                 different identities, but colliding SHA-1 certificates.
                 A SHA-1 certification of the first key can therefore be
                 transferred to the second key, leading to a forgery.
                 This proves that SHA-1 signatures now offers virtually
                 no security in practice. The legacy branch of GnuPG
                 still uses SHA-1 by default for identity
                 certifications, but after notifying the authors, the
                 modern branch now rejects SHA-1 signatures (the issue
                 is tracked as CVE-2019-14855).",
  acknowledgement = ack-nhfb,
  keywords =     "Chosen-prefix collision; Cryptanalysis; GnuPG; GPU;
                 HPC; PGP; SHA-1",
  remark =       "This is the first entry in cryptography2020.bib.",
}

@Article{Poulter:2020:ESU,
  author =       "Andrew John Poulter and Steven J. Ossont and Simon J.
                 Cox",
  title =        "Enabling the Secure Use of Dynamic Identity for the
                 {Internet of Things} --- Using the {Secure Remote
                 Update Protocol (SRUP)}",
  journal =      j-FUTURE-INTERNET,
  volume =       "12",
  number =       "8",
  pages =        "138",
  day =          "18",
  month =        aug,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi12080138",
  ISSN =         "1999-5903",
  bibdate =      "Fri Aug 28 12:33:08 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/12/8/138",
  abstract =     "This paper examines dynamic identity, as it pertains
                 to the Internet of Things (IoT), and explores the
                 practical implementation of a mitigation technique for
                 some of the key weaknesses of a conventional dynamic
                 identity model. This paper explores human-centric and
                 machine-based observer approaches for confirming device
                 identity, permitting automated identity confirmation
                 for deployed systems. It also assesses the advantages
                 of dynamic identity in the context of identity
                 revocation permitting secure change of ownership for
                 IoT devices. The paper explores use-cases for human and
                 machine-based observation for authentication of device
                 identity when devices join a Command and Control(C2)
                 network, and considers the relative merits for these
                 two approaches for different types of system.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/1999-5903/",
  remark =       "Special Issue Feature Papers for Future
                 Internet-Internet of Things Section.",
}

@Article{Raja:2020:CPB,
  author =       "J. Raja and M. Ramakrishnan",
  title =        "Confidentiality-preserving based on attribute
                 encryption using auditable access during encrypted
                 records in cloud location",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "8",
  pages =        "6026--6039",
  month =        aug,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-019-03111-1",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Sat Jul 25 07:17:59 MDT 2020",
  bibsource =    "http://link.springer.com/journal/11227/76/8;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Ramezanpour:2020:SPS,
  author =       "K. Ramezanpour and P. Ampadu and W. Diehl",
  title =        "{SCAUL}: Power Side-Channel Analysis With Unsupervised
                 Learning",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "11",
  pages =        "1626--1638",
  month =        nov,
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Oct 8 20:31:08 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Rashid:2020:FED,
  author =       "F. Y. Rashid",
  title =        "The fight over encrypted {DNS} --- [News]",
  journal =      j-IEEE-SPECTRUM,
  volume =       "57",
  number =       "1",
  pages =        "11--12",
  month =        jan,
  year =         "2020",
  CODEN =        "IEESAM",
  DOI =          "https://doi.org/10.1109/MSPEC.2020.8946294",
  ISSN =         "0018-9235 (print), 1939-9340 (electronic)",
  ISSN-L =       "0018-9235",
  bibdate =      "Fri Jan 17 09:23:28 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeespectrum2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Spectrum",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
}

@Article{Rawal:2020:PRE,
  author =       "Bharat S. Rawal",
  title =        "Proxy re-encryption architect for storing and sharing
                 of cloud contents",
  journal =      j-INT-J-PAR-EMER-DIST-SYS,
  volume =       "35",
  number =       "3",
  pages =        "219--235",
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/17445760.2018.1439491",
  ISSN =         "1744-5760 (print), 1744-5779 (electronic)",
  ISSN-L =       "1744-5760",
  bibdate =      "Tue May 18 09:32:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/intjparemerdistsys.bib;
                 http://www.tandfonline.com/toc/gpaa20/35/3",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Parallel, Emergent and
                 Distributed Systems: IJPEDS",
  journal-URL =  "http://www.tandfonline.com/loi/gpaa20",
  onlinedate =   "14 May 2020",
}

@Article{Raza:2020:ESI,
  author =       "Abdur Rehman Raza and Khawir Mahmood and Muhammad
                 Faisal Amjad and Haider Abbas and Mehreen Afzal",
  title =        "On the efficiency of software implementations of
                 lightweight block ciphers from the perspective of
                 programming languages",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "104",
  number =       "??",
  pages =        "43--59",
  month =        mar,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2019.09.058",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Mon Feb 10 12:55:06 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X19310519",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Rjaibi:2020:ESD,
  author =       "Walid Rjaibi and Mohammad Hammoudeh",
  title =        "Enhancing and simplifying data security and privacy
                 for multitiered applications",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "139",
  number =       "??",
  pages =        "53--64",
  month =        may,
  year =         "2020",
  CODEN =        "JPDCER",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Wed Mar 18 09:26:12 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S074373151930632X",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
}

@Article{S:2020:SMB,
  author =       "Anguraj S and Shantharajah S P and Jeba Emilyn J",
  title =        "A steganographic method based on optimized audio
                 embedding technique for secure data communication in
                 the {Internet of Things}",
  journal =      j-COMPUT-INTELL,
  volume =       "36",
  number =       "2",
  pages =        "557--573",
  month =        may,
  year =         "2020",
  CODEN =        "COMIE6",
  DOI =          "https://doi.org/10.1111/coin.12253",
  ISSN =         "0824-7935 (print), 1467-8640 (electronic)",
  ISSN-L =       "0824-7935",
  bibdate =      "Fri Apr 1 07:46:58 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/computintell.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Comput. Intell.",
  fjournal =     "Computational Intelligence",
  journal-URL =  "https://onlinelibrary.wiley.com/journal/14678640",
  onlinedate =   "13 November 2019",
}

@Article{S:2020:SPE,
  author =       "Ajish S. and K. S. Anil Kumar",
  title =        "Security and performance enhancement of fingerprint
                 biometric template using symmetric hashing",
  journal =      j-COMPUT-SECUR,
  volume =       "90",
  number =       "??",
  pages =        "Article 101714",
  month =        mar,
  year =         "2020",
  CODEN =        "CPSEDU",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Sat Mar 14 18:49:57 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S016740482030002X",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Article{Sainani:2020:IRS,
  author =       "Henanksha Sainani and Josephine M. Namayanja and
                 Guneeti Sharma and Vasundhara Misal and Vandana P.
                 Janeja",
  title =        "{IP} Reputation Scoring with Geo-Contextual Feature
                 Augmentation",
  journal =      j-TMIS,
  volume =       "11",
  number =       "4",
  pages =        "26:1--26:29",
  month =        dec,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3419373",
  ISSN =         "2158-656X (print), 2158-6578 (electronic)",
  ISSN-L =       "2158-656X",
  bibdate =      "Sat Mar 20 18:13:57 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tmis.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3419373",
  abstract =     "The focus of this article is to present an effective
                 anomaly detection model for an encrypted network
                 session by developing a novel IP reputation scoring
                 model that labels the incoming session IP address based
                 on the most similar IP addresses in terms \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Transactions on Management Information Systems
                 (TMIS)",
  journal-URL =  "https://dl.acm.org/loi/tmis",
}

@Article{Sakalis:2020:USD,
  author =       "C. Sakalis and S. Kaxiras and A. Ros and A. Jimborean
                 and M. Sj{\"a}lander",
  title =        "Understanding Selective Delay as a Method for
                 Efficient Secure Speculative Execution",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "11",
  pages =        "1584--1595",
  month =        nov,
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Oct 8 20:31:08 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Sakib:2020:RDB,
  author =       "Mohammad Nazmus Sakib and Shuvashis Das Gupta and
                 Satyendra N. Biswas",
  title =        "A Robust {DWT}-Based Compressed Domain Video
                 Watermarking Technique",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "20",
  number =       "01",
  pages =        "??--??",
  month =        jan,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0219467820500047",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Thu Feb 6 07:43:16 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0219467820500047",
  abstract =     "To achieve robustness and imperceptibility, an
                 adaptive compressed domain blind video watermarking
                 method based on Discrete Wavelet Transform (DWT) is
                 proposed in this research. In this technique, multiple
                 binary images derived from a single watermark image are
                 first embedded in a video sequence. The spatial spread
                 spectrum watermark is directly incorporated in the
                 compressed bit streams by modifying the four sets of
                 discrete wavelet coefficients. Comprehensive simulation
                 experiments demonstrate that the developed approach is
                 efficient and also robust against spatial attacks such
                 as scaling and frame averaging, noise attacks such as
                 Gaussian and salt pepper noise, and temporal attacks
                 like frame dropping and shifting. Moreover, the
                 proposed approach can also withstand against rotation
                 attacks of arbitrary angle.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Salem:2020:ELB,
  author =       "Fatima K. Abu Salem and Mira {Al Arab} and Laurence T.
                 Yang",
  title =        "Extending the limits for big data {RSA} cracking:
                 Towards cache-oblivious {TU} decomposition",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "138",
  number =       "??",
  pages =        "65--77",
  month =        apr,
  year =         "2020",
  CODEN =        "JPDCER",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Wed Mar 18 09:26:11 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0743731519300425",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
}

@Article{Savvides:2020:ECP,
  author =       "Savvas Savvides and Darshika Khandelwal and Patrick
                 Eugster",
  title =        "Efficient confidentiality-preserving data analytics
                 over symmetrically encrypted datasets",
  journal =      j-PROC-VLDB-ENDOWMENT,
  volume =       "13",
  number =       "8",
  pages =        "1290--1303",
  month =        apr,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.14778/3389133.3389144",
  ISSN =         "2150-8097",
  bibdate =      "Tue May 5 14:01:14 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
  URL =          "https://dl.acm.org/doi/abs/10.14778/3389133.3389144",
  abstract =     "In the past decade, cloud computing has emerged as an
                 economical and practical alternative to in-house
                 datacenters. But due to security concerns, many
                 enterprises are still averse to adopting third party
                 clouds. To mitigate these concerns, several \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the VLDB Endowment",
  journal-URL =  "https://dl.acm.org/loi/pvldb",
}

@Article{Saxena:2020:PBC,
  author =       "Neetesh Saxena and Ieuan Thomas and Prosante Gope and
                 Pete Burnap and Neeraj Kumar",
  title =        "{PharmaCrypt}: Blockchain for Critical Pharmaceutical
                 Industry to Counterfeit Drugs",
  journal =      j-COMPUTER,
  volume =       "53",
  number =       "7",
  pages =        "29--44",
  month =        jul,
  year =         "2020",
  CODEN =        "CPTRB4",
  DOI =          "https://doi.org/10.1109/MC.2020.2989238",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Thu Jul 16 15:14:43 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/computer2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Article{Schneider:2020:CPP,
  author =       "T. Schneider and A. Treiber",
  title =        "A Comment on Privacy-Preserving Scalar Product
                 Protocols as Proposed in {SPOC}",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  volume =       "31",
  number =       "3",
  pages =        "543--546",
  month =        mar,
  year =         "2020",
  CODEN =        "ITDSEO",
  DOI =          "https://doi.org/10.1109/TPDS.2019.2939313",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Wed Jan 22 06:09:50 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  keywords =     "Encryption; oblivious transfer; Privacy;
                 Privacy-preserving scalar product protocols; Protocols;
                 Public key cryptography; secure computation; Task
                 analysis",
}

@Article{Schneier:2020:TVP,
  author =       "B. Schneier",
  title =        "Technologists vs. Policy Makers",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "18",
  number =       "1",
  pages =        "72--71",
  month =        jan,
  year =         "2020",
  DOI =          "https://doi.org/10.1109/MSEC.2019.2951825",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Fri Feb 21 14:45:55 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
  keywords =     "Computer security; Cryptography; Encryption;
                 Government policies; Law; Technology",
}

@Article{Sciarretta:2020:FAM,
  author =       "Giada Sciarretta and Roberto Carbone and Silvio Ranise
                 and Luca Vigan{\`o}",
  title =        "Formal Analysis of Mobile Multi-Factor Authentication
                 with Single Sign-On Login",
  journal =      j-TOPS,
  volume =       "23",
  number =       "3",
  pages =        "13:1--13:37",
  month =        jul,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3386685",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Fri Jul 10 09:15:30 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3386685",
  abstract =     "Over the last few years, there has been an almost
                 exponential increase in the number of mobile
                 applications that deal with sensitive data, such as
                 applications for e-commerce or health. When dealing
                 with sensitive data, classical authentication solutions
                 based on username-password pairs are not enough, and
                 multi-factor authentication solutions that combine two
                 or more authentication factors of different categories
                 are required instead. Even if several solutions are
                 currently used, their security analyses have been
                 performed informally or semiformally at best, and
                 without a reference model and a precise definition of
                 the multi-factor authentication property. This makes a
                 comparison among the different solutions both complex
                 and potentially misleading. In this article, we first
                 present the design of two reference models for native
                 applications based on the requirements of two
                 real-world use-case scenarios. Common features between
                 them are the use of one-time password approaches and
                 the support of a single sign-on experience. Then, we
                 provide a formal specification of our threat model and
                 the security goals, and discuss the automated security
                 analysis that we performed. Our formal analysis
                 validates the security goals of the two reference
                 models we propose and provides an important building
                 block for the formal analysis of different multi-factor
                 authentication solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Seo:2020:MMP,
  author =       "Hwajeong Seo and Kyuhwang An and Hyeokdong Kwon and
                 Zhi Hu",
  title =        "{Montgomery} Multiplication for Public Key
                 Cryptography on {MSP430X}",
  journal =      j-TECS,
  volume =       "19",
  number =       "3",
  pages =        "20:1--20:15",
  month =        jul,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3387919",
  ISSN =         "1539-9087 (print), 1558-3465 (electronic)",
  ISSN-L =       "1539-9087",
  bibdate =      "Wed Jul 8 17:07:32 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tecs.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3387919",
  abstract =     "For traditional public key cryptography and
                 post-quantum cryptography, such as elliptic curve
                 cryptography and supersingular isogeny key
                 encapsulation, modular multiplication is the most
                 performance-critical operation among basic arithmetic
                 of these cryptographic schemes. For this reason, the
                 execution timing of such cryptographic schemes, which
                 may highly determine the service availability for
                 low-end microprocessors (e.g., 8-bit AVR, 16-bit
                 MSP430X, and 32-bit ARM Cortex-M), mainly relies on the
                 efficiency of modular multiplication on target embedded
                 processors.

                 In this article, we present new optimal modular
                 multiplication techniques based on the interleaved
                 Montgomery multiplication on 16-bit MSP430X
                 microprocessors, where the multiplication part is
                 performed in a hardware multiplier and the reduction
                 part is performed in a basic arithmetic logic unit
                 (ALU) with the optimal modular multiplication routine,
                 respectively. This two-step approach is effective for
                 the special modulus of NIST curves, SM2 curves, and
                 supersingular isogeny key encapsulation. We further
                 optimized the Montgomery reduction by using techniques
                 for Montgomery-friendly prime. This technique
                 significantly reduces the number of partial products.
                 To demonstrate the superiority of the proposed
                 implementation of Montgomery multiplication, we applied
                 the proposed method to the NIST P-256 curve, of which
                 the implementation improves the previous modular
                 multiplication operation by 23.6\% on 16-bit MSP430X
                 microprocessors and to the SM2 curve as well (first
                 implementation on 16-bit MSP430X
                 microcontrollers).

                 Moreover, secure countermeasures against timing attack
                 and simple power analysis are also applied to the
                 scalar multiplication of NIST P-256 and SM2 curves,
                 which achieve the 8,582,338 clock cycles (0.53 seconds
                 at 16 MHz) and 10,027,086 clock cycles (0.62 seconds at
                 16 MHz), respectively. The proposed Montgomery
                 multiplication is a generic method that can be applied
                 to other cryptographic schemes and microprocessors with
                 minor modifications.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Transactions on Embedded Computing Systems",
  journal-URL =  "https://dl.acm.org/loi/tecs",
}

@Article{Setty:2020:VSM,
  author =       "Srinath Setty and Sebastian Angel and Jonathan Lee",
  title =        "Verifiable state machines: Proofs that untrusted
                 services operate correctly",
  journal =      j-OPER-SYS-REV,
  volume =       "54",
  number =       "1",
  pages =        "40--46",
  month =        aug,
  year =         "2020",
  CODEN =        "OSRED8",
  DOI =          "https://doi.org/10.1145/3421473.3421479",
  ISSN =         "0163-5980 (print), 1943-586X (electronic)",
  ISSN-L =       "0163-5980",
  bibdate =      "Tue Sep 1 12:58:05 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3421473.3421479",
  abstract =     "This article describes recent progress in realizing
                 verifiable state machines, a primitive that enables
                 untrusted services to provide cryptographic proofs that
                 they operate correctly. Applications of this primitive
                 range from proving the correct operation of distributed
                 and concurrent cloud services to reducing blockchain
                 transaction costs by leveraging inexpensive off-chain
                 computation without trust.",
  acknowledgement = ack-nhfb,
  fjournal =     "Operating Systems Review",
  journal-URL =  "https://dl.acm.org/loi/sigops",
}

@Article{Shahid:2020:SDS,
  author =       "Furqan Shahid and Abid Khan",
  title =        "{Smart Digital Signatures (SDS)}: a post-quantum
                 digital signature scheme for distributed ledgers",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "111",
  number =       "??",
  pages =        "241--253",
  month =        oct,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2020.04.042",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:21 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X19319892",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Shanmugam:2020:TLA,
  author =       "Anitha Shanmugam and Jayanthi Paramasivam",
  title =        "A two-level authentication scheme for clone node
                 detection in smart cities using {Internet of Things}",
  journal =      j-COMPUT-INTELL,
  volume =       "36",
  number =       "3",
  pages =        "1200--1220",
  month =        aug,
  year =         "2020",
  CODEN =        "COMIE6",
  DOI =          "https://doi.org/10.1111/coin.12330",
  ISSN =         "0824-7935 (print), 1467-8640 (electronic)",
  ISSN-L =       "0824-7935",
  bibdate =      "Fri Apr 1 07:46:59 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computintell.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Comput. Intell.",
  fjournal =     "Computational Intelligence",
  journal-URL =  "https://onlinelibrary.wiley.com/journal/14678640",
  onlinedate =   "17 May 2020",
}

@Article{Shen:2020:CBM,
  author =       "Meng Shen and Guohua Cheng and Liehuang Zhu and
                 Xiaojiang Du and Jiankun Hu",
  title =        "Content-based multi-source encrypted image retrieval
                 in clouds with privacy preservation",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "109",
  number =       "??",
  pages =        "621--632",
  month =        aug,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2018.04.089",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:18 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X17321969",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Shen:2020:ECA,
  author =       "Jian Shen and Dengzhi Liu and Xingming Sun and Fushan
                 Wei and Yang Xiang",
  title =        "Efficient cloud-aided verifiable secret sharing scheme
                 with batch verification for smart cities",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "109",
  number =       "??",
  pages =        "450--456",
  month =        aug,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2018.10.049",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:18 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X17318629",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Shuaieb:2020:RRF,
  author =       "Wafa Shuaieb and George Oguntala and Ali AlAbdullah
                 and Huthaifa Obeidat and Rameez Asif and Raed A.
                 Abd-Alhameed and Mohammed S. Bin-Melha and Chakib
                 Kara-Za{\"\i}tri",
  title =        "{RFID} {RSS} Fingerprinting System for Wearable Human
                 Activity Recognition",
  journal =      j-FUTURE-INTERNET,
  volume =       "12",
  number =       "2",
  pages =        "33",
  day =          "12",
  month =        feb,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi12020033",
  ISSN =         "1999-5903",
  bibdate =      "Mon Mar 2 12:22:42 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/12/2/33",
  abstract =     "Alternative healthcare solutions have been identified
                 as a viable approach to ameliorate the increasing
                 demand for telehealth and prompt healthcare delivery.
                 Moreover, indoor localization using different
                 technologies and approaches have greatly contributed to
                 alternative healthcare solutions. In this paper, a
                 cost-effective, radio frequency identification
                 (RFID)-based indoor location system that employs
                 received signal strength (RSS) information of passive
                 RFID tags is presented. The proposed system uses RFID
                 tags placed at different positions on the target body.
                 The mapping of the analysed data against a set of
                 reference position datasets is used to accurately track
                 the vertical and horizontal positioning of a patient
                 within a confined space in real-time. The Euclidean
                 distance model achieves an accuracy of 98\% for all
                 sampled activities. However, the accuracy of the
                 activity recognition algorithm performs below the
                 threshold performance for walking and standing, which
                 is due to similarities in the target height, weight and
                 body density for both activities. The obtained results
                 from the proposed system indicate significant
                 potentials to provide reliable health measurement tool
                 for patients at risk.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Singh:2020:IBB,
  author =       "Sonika Singh and Sahadeo Padhye",
  title =        "Identity based blind signature scheme over {NTRU}
                 lattices",
  journal =      j-INFO-PROC-LETT,
  volume =       "155",
  number =       "??",
  pages =        "Article 105898",
  month =        mar,
  year =         "2020",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/j.ipl.2019.105898",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Mar 24 11:59:23 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/infoproc2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0020019019301814",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Souvignet:2020:LLL,
  author =       "T. R. Souvignet and T. Heckmann and T. Bolle",
  title =        "From {Lucky Luke} to Lock Bits",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "18",
  number =       "2",
  pages =        "61--66",
  month =        mar # "\slash " # apr,
  year =         "2020",
  DOI =          "https://doi.org/10.1109/MSEC.2019.2944385",
  ISSN =         "1558-4046",
  ISSN-L =       "1540-7993",
  bibdate =      "Wed May 27 17:52:17 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
  keywords =     "bluetooth; encryption; microcontrollers; monitoring;
                 online banking",
}

@Article{Su:2020:SOA,
  author =       "Qianqian Su and Rui Zhang and Rui Xue",
  title =        "Secure Outsourcing Algorithms for Composite Modular
                 Exponentiation Based on Single Untrusted Cloud",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "8",
  pages =        "1271--1271",
  month =        aug,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz165",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Aug 25 18:11:58 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/8/1271/5823571",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Sun:2020:CSR,
  author =       "Yinxia Sun and Futai Zhang and Anmin Fu and Zhe Xia",
  title =        "{CCA}-Secure and Revocable Certificateless Encryption
                 with Ciphertext Evolution",
  journal =      j-INT-J-FOUND-COMP-SCI,
  volume =       "31",
  number =       "2",
  pages =        "175--191",
  month =        feb,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0129054120500021",
  ISSN =         "0129-0541",
  ISSN-L =       "0129-0541",
  bibdate =      "Tue Mar 10 07:39:25 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
                 http://www.worldscientific.com/loi/ijfcs",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0129054120500021",
  abstract =     "Certificateless cryptosystems have attracted great
                 interests in cryptographic research since its
                 invention. Because compared with traditional public key
                 cryptosystems or identity-based cryptosystems, they
                 could not only simplify the certificate management, but
                 also alleviate the key escrow problem. In
                 certificateless cryptosystems, user revocation is a
                 challenging issue. To address this issue, one popular
                 method is to update the key via public channels.
                 However, most of the existing schemes in this approach
                 are impractical because of the following two
                 shortcomings. Firstly, the user needs to maintain a
                 list of decryption keys, but the size of the list will
                 keep increasing. Secondly, the revoked user can still
                 recover the plaintexts of the encrypted data prior to
                 revocation, and this is a particular threat in some
                 applications. To solve these problems, this paper
                 presents revocable certificateless encryption with
                 ciphertext evolution. We give a generic construction
                 and then describe how it can be initialized concretely.
                 In our proposed scheme, the user only needs to keep one
                 decryption key, and once a user is revoked, it can no
                 longer decrypt any ciphertext in the server. Moreover,
                 the IND-CCA security model is defined against three
                 types of attacks. And our schemes are formally proved
                 to satisfy these security requirements.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Foundations of Computer
                 Science (IJFCS)",
  journal-URL =  "http://www.worldscientific.com/loi/ijfcs",
}

@Article{Sun:2020:DAS,
  author =       "Jianguo Sun and Wenshan Wang and Liang Kou and Yun Lin
                 and Liguo Zhang and Qingan Da and Lei Chen",
  title =        "A data authentication scheme for {UAV} ad hoc network
                 communication",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "6",
  pages =        "4041--4056",
  month =        jun,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-017-2179-3",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Sat Jul 25 07:17:58 MDT 2020",
  bibsource =    "http://link.springer.com/journal/11227/76/6;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Sun:2020:NAC,
  author =       "Yu-jie Sun and Hao Zhang and Xing-yuan Wang and
                 Xiao-qing Wang and Peng-fei Yan",
  title =        "{$2$D} Non-adjacent coupled map lattice with $q$ and
                 its applications in image encryption",
  journal =      j-APPL-MATH-COMP,
  volume =       "373",
  number =       "??",
  pages =        "Article 125039",
  day =          "15",
  month =        may,
  year =         "2020",
  CODEN =        "AMHCBQ",
  DOI =          "https://doi.org/10.1016/j.amc.2020.125039",
  ISSN =         "0096-3003 (print), 1873-5649 (electronic)",
  ISSN-L =       "0096-3003",
  bibdate =      "Wed May 27 10:52:22 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/applmathcomput2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0096300320300084",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Mathematics and Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00963003",
}

@Article{Sun:2020:RIB,
  author =       "Yinxia Sun and Yi Mu and Willy Susilo and Futai Zhang
                 and Anmin Fu",
  title =        "Revocable identity-based encryption with server-aided
                 ciphertext evolution",
  journal =      j-THEOR-COMP-SCI,
  volume =       "815",
  number =       "??",
  pages =        "11--24",
  day =          "2",
  month =        may,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2020.02.031",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Thu Apr 23 07:41:41 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397520301298",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Suzuki:2020:EPK,
  author =       "Kaichi Suzuki and Atsushi Takayasu and Noboru
                 Kunihiro",
  title =        "Extended partial key exposure attacks on {RSA}:
                 Improvement up to full size decryption exponents",
  journal =      j-THEOR-COMP-SCI,
  volume =       "841",
  number =       "??",
  pages =        "62--83",
  day =          "12",
  month =        nov,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2020.07.004",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Mar 12 06:53:45 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397520303820",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Szigeti:2020:PCH,
  author =       "Jen{\H{o}} Szigeti and Szilvia Szil{\'a}gyi and Leon
                 van Wyk",
  title =        "A power {Cayley--Hamilton} identity for $ n \times n $
                 matrices over a {Lie} nilpotent ring of index $k$",
  journal =      j-LINEAR-ALGEBRA-APPL,
  volume =       "584",
  number =       "??",
  pages =        "153--163",
  day =          "1",
  month =        jan,
  year =         "2020",
  CODEN =        "LAAPAW",
  DOI =          "https://doi.org/10.1016/j.laa.2019.09.016",
  ISSN =         "0024-3795 (print), 1873-1856 (electronic)",
  ISSN-L =       "0024-3795",
  bibdate =      "Wed Apr 22 11:44:49 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/linala2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0024379519303994",
  acknowledgement = ack-nhfb,
  fjournal =     "Linear Algebra and its Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00243795",
}

@Article{Tahir:2020:PDQ,
  author =       "Shahzaib Tahir and Liutauras Steponkus and Sushmita
                 Ruj and Muttukrishnan Rajarajan and Ali Sajjad",
  title =        "A parallelized disjunctive query based searchable
                 encryption scheme for big data",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "109",
  number =       "??",
  pages =        "583--592",
  month =        aug,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2018.05.048",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:18 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X17321842",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Talamo:2020:BBP,
  author =       "Maurizio Talamo and Franco Arcieri and Andrea Dimitri
                 and Christian H. Schunck",
  title =        "A Blockchain based {PKI} Validation System based on
                 Rare Events Management",
  journal =      j-FUTURE-INTERNET,
  volume =       "12",
  number =       "2",
  pages =        "40",
  day =          "14",
  month =        feb,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi12020040",
  ISSN =         "1999-5903",
  bibdate =      "Mon Mar 2 12:22:42 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/12/2/40",
  abstract =     "Public key infrastructures (PKIs) are the cornerstone
                 for the security of the communication layer of online
                 services relying on certificate-based authentication,
                 such as e-commerce, e-government, online banking, cloud
                 services, and many others. A PKI is an infrastructure
                 based on a hierarchical model, but the use of PKIs in
                 non-hierarchical contexts has exposed them to many
                 types of attacks. Here, we discuss weaknesses exploited
                 in past attacks and we propose a solution based on an
                 original consensus algorithm developed for use on
                 blockchain technology. In this implementation we retain
                 the full functionality around X.509 certificates, i.e.,
                 for the triad (server name, server address, X.509
                 server certificate), and demonstrate a mechanism for
                 obtaining fast consensus. The main properties of the
                 solution are that a consensus may be reached even when
                 not all members of the involved PKI participate in a
                 transaction, and that no advanced trust agreement among
                 PKIs is needed. The proposed solution is able to detect
                 PKI attacks and can distinguish errors from attacks,
                 allowing precise management of anomalies.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
  remark =       "Special Issue Blockchain: Current Challenges and
                 Future Prospects/Applications.",
}

@Article{Tanwar:2020:CPP,
  author =       "Vishesh Kumar Tanwar and Balasubramanian Raman and
                 Amitesh Singh Rajput and Rama Bhargava",
  title =        "{CryptoLesion}: a Privacy-preserving Model for Lesion
                 Segmentation Using Whale Optimization over Cloud",
  journal =      j-TOMM,
  volume =       "16",
  number =       "2",
  pages =        "50:1--50:23",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3380743",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Tue Jun 16 10:45:32 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3380743",
  abstract =     "The low-cost, accessing flexibility, agility, and
                 mobility of cloud infrastructures have attracted
                 medical organizations to store their high-resolution
                 data in encrypted form. Besides storage, these
                 infrastructures provide various image processing
                 services for plain (non-encrypted) images. Meanwhile,
                 the privacy and security of uploaded data depend upon
                 the reliability of the service provider(s). The
                 enforcement of laws towards privacy policies in
                 health-care organizations, for not disclosing their
                 patient's sensitive and private medical information,
                 restrict them to utilize these services. To address
                 these privacy concerns for melanoma detection, we
                 propose CryptoLesion, a privacy-preserving model for
                 segmenting lesion region using whale optimization
                 algorithm (WOA) over the cloud in the encrypted domain
                 (ED). The user's image is encrypted using a permutation
                 ordered binary number system and a random stumble
                 matrix. The task of segmentation is accomplished by
                 dividing an encrypted image into a pre-defined number
                 of clusters whose optimal centroids are obtained by WOA
                 in ED, followed by the assignment of each pixel of an
                 encrypted image to the unique centroid. The qualitative
                 and quantitative analysis of CryptoLesion is evaluated
                 over publicly available datasets provided in The
                 International Skin Imaging Collaboration Challenges in
                 2016, 2017, 2018, and PH2 dataset. The segmented
                 results obtained by CryptoLesion are found to be
                 comparable with the winners of respective challenges.
                 CryptoLesion is proved to be secure from a
                 probabilistic viewpoint and various cryptographic
                 attacks. To the best of our knowledge, CryptoLesion is
                 first moving towards the direction of lesion
                 segmentation in ED.",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Theofanos:2020:USO,
  author =       "M. Theofanos",
  title =        "Is Usable Security an Oxymoron?",
  journal =      j-COMPUTER,
  volume =       "53",
  number =       "2",
  pages =        "71--74",
  month =        feb,
  year =         "2020",
  CODEN =        "CPTRB4",
  DOI =          "https://doi.org/10.1109/MC.2019.2954075",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Thu Mar 05 14:33:46 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computer2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
  keywords =     "Authentication; Encryption; Password; Privacy;
                 Usability",
}

@Article{Tian:2020:LRB,
  author =       "Yangguang Tian and Yingjiu Li and Binanda Sengupta and
                 Nan Li and Chunhua Su",
  title =        "Leakage-resilient biometric-based remote user
                 authentication with fuzzy extractors",
  journal =      j-THEOR-COMP-SCI,
  volume =       "814",
  number =       "??",
  pages =        "223--233",
  day =          "24",
  month =        apr,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2020.02.001",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Thu Apr 23 07:41:40 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397520300785",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Tian:2020:NCL,
  author =       "Yangguang Tian and Yingjiu Li and Robert H. Deng and
                 Nan Li and Guomin Yang and Zheng Yang",
  title =        "A New Construction for Linkable Secret Handshake",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "4",
  pages =        "536--548",
  month =        apr,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz095",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri May 8 08:50:40 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/4/536/5612724",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Tioura:2020:HPS,
  author =       "Abdelhamid Tioura and Hamouma Moumen and Hamoudi Kalla
                 and Ahmed Ait Saidi",
  title =        "A Hybrid Protocol to Solve Authenticated {Byzantine}
                 Consensus",
  journal =      j-FUND-INFO,
  volume =       "173",
  number =       "1",
  pages =        "73--89",
  month =        "????",
  year =         "2020",
  CODEN =        "FUMAAJ",
  DOI =          "https://doi.org/10.3233/FI-2020-1916",
  ISSN =         "0169-2968 (print), 1875-8681 (electronic)",
  ISSN-L =       "0169-2968",
  bibdate =      "Wed Mar 24 12:52:04 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/fundinfo2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Fundamenta Informaticae",
  journal-URL =  "http://content.iospress.com/journals/fundamenta-informaticae",
}

@Article{Tiplea:2020:DQR,
  author =       "Ferucio Laurentiu Tiplea and Sorin Iftene and George
                 Teseleanu and Anca-Maria Nica",
  title =        "On the distribution of quadratic residues and
                 non-residues modulo composite integers and applications
                 to cryptography",
  journal =      j-APPL-MATH-COMP,
  volume =       "372",
  number =       "??",
  pages =        "Article 124993",
  day =          "1",
  month =        may,
  year =         "2020",
  CODEN =        "AMHCBQ",
  DOI =          "https://doi.org/10.1016/j.amc.2019.124993",
  ISSN =         "0096-3003 (print), 1873-5649 (electronic)",
  ISSN-L =       "0096-3003",
  bibdate =      "Wed May 27 10:52:22 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/applmathcomput2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0096300319309853",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Mathematics and Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00963003",
}

@Article{Tomar:2020:MTV,
  author =       "Ravi Tomar and Sarishma",
  title =        "Maintaining Trust in {VANETs} using Blockchain",
  journal =      j-SIGADA-LETTERS,
  volume =       "40",
  number =       "1",
  pages =        "91--96",
  month =        oct,
  year =         "2020",
  CODEN =        "AALEE5",
  DOI =          "https://doi.org/10.1145/3431235.3431244",
  ISSN =         "1094-3641 (print), 1557-9476 (electronic)",
  ISSN-L =       "0736-721X",
  bibdate =      "Thu Mar 11 06:32:11 MST 2021",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigada.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3431235.3431244",
  abstract =     "Vehicular ad-hoc networks are networks formed by fast
                 moving vehicles which come in contact momentarily and
                 exchange information. Since it's an ad-hoc network, it
                 becomes difficult to maintain trust, security and
                 authenticity of information being exchanged in the
                 network. In this paper, we leverage the concepts of
                 blockchain to maintain trust in the network. Since
                 blockchain provides a tamper-proof, decentralized
                 mechanism to store data, we use it to store information
                 related to events such as collision, accident, SOS etc.
                 The information stored on blockchain can be used to
                 validate it at later points of time so as to minimize
                 the false benefit cases by use of Proof of Location
                 certificates. The proposed system has the potential to
                 increase the trust of end users in VANETs. It can also
                 be integrated into the design of future vehicles
                 because of its ease of implementation. The paper also
                 discusses the benefits and constraints of the proposed
                 model along with the related future work.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGADA Ada Letters",
  journal-URL =  "http://portal.acm.org/citation.cfm?id=J32",
}

@Article{Tomida:2020:TSI,
  author =       "Junichi Tomida",
  title =        "Tightly secure inner product functional encryption:
                 Multi-input and function-hiding constructions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "833",
  number =       "??",
  pages =        "56--86",
  day =          "12",
  month =        sep,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2020.05.008",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Mar 12 06:53:41 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397520302711",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Trivedi:2020:NIC,
  author =       "Amit Kumar Trivedi and Dalton Meitei Thounaojam and
                 Shyamosree Pal",
  title =        "Non-Invertible cancellable fingerprint template for
                 fingerprint biometric",
  journal =      j-COMPUT-SECUR,
  volume =       "90",
  number =       "??",
  pages =        "Article 101690",
  month =        mar,
  year =         "2020",
  CODEN =        "CPSEDU",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Sat Mar 14 18:49:57 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167404819302275",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Article{Tu:2020:LGI,
  author =       "Xiaoguang Tu and Zheng Ma and Jian Zhao and Guodong Du
                 and Mei Xie and Jiashi Feng",
  title =        "Learning Generalizable and Identity-Discriminative
                 Representations for Face Anti-Spoofing",
  journal =      j-TIST,
  volume =       "11",
  number =       "5",
  pages =        "60:1--60:19",
  month =        sep,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3402446",
  ISSN =         "2157-6904 (print), 2157-6912 (electronic)",
  ISSN-L =       "2157-6904",
  bibdate =      "Mon Sep 7 06:54:29 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tist.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3402446",
  abstract =     "Face anti-spoofing aims to detect presentation attack
                 to face recognition--based authentication systems. It
                 has drawn growing attention due to the high security
                 demand. The widely adopted CNN-based methods usually
                 well recognize the spoofing faces when \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Transactions on Intelligent Systems and Technology
                 (TIST)",
  journal-URL =  "https://dl.acm.org/loi/tist",
}

@Article{Turan:2020:HAH,
  author =       "F. Turan and S. S. Roy and I. Verbauwhede",
  title =        "{HEAWS}: An Accelerator for Homomorphic Encryption on
                 the {Amazon AWS FPGA}",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "8",
  pages =        "1185--1196",
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Jul 23 16:03:24 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Book{Turing:2020:CBP,
  author =       "Dermot Turing",
  title =        "The Codebreakers of {Bletchley Park}: the Secret
                 Intelligence Station That Helped Defeat the {Nazis}",
  publisher =    "Arcturus Publishing Limited",
  address =      "London, UK",
  pages =        "256",
  year =         "2020",
  ISBN =         "1-78950-621-2, 1-83857-650-9 (paperback)",
  ISBN-13 =      "978-1-78950-621-1, 978-1-83857-650-9 (paperback)",
  LCCN =         "????",
  bibdate =      "Fri Feb 4 16:16:43 MST 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With an introduction by Christopher M. Andrew.",
  abstract =     "At Bletchley Park, some of Britain's most talented
                 mathematicians, linguists, and intellectuals were
                 assembled to break Nazi codes. Kept secret for nearly
                 thirty years, we have now come to realise the crucial
                 role that these codebreakers played in the Allied
                 victory in World War II. Written by Dermot Turing, the
                 nephew of famous codebreaker Alan Turing, this
                 illustrated account provides unique insight into the
                 behind-the-scenes action at Bletchley Park. Discover
                 how brilliant and eccentric individuals such as Dilly
                 Knox, Alan Turing and Joan Clarke were recruited, the
                 social life that grew up around the park, and how they
                 dealt with the ever-present burden of secrecy.
                 Including a foreword by Professor Christopher Andrew of
                 Cambridge University, author of MI5's official history
                 The Secret World, this book brings to life the stories
                 of the men and women who toiled day and night to crack
                 the seemingly unbreakable Enigma code.",
  acknowledgement = ack-nhfb,
  subject =      "World War, 1939--1945; Secret service; Great Britain;
                 Electronic intelligence; England; Bletchley
                 (Buckinghamshire); Electronic intelligence.; Secret
                 service.",
}

@Article{Ueno:2020:HTG,
  author =       "R. Ueno and S. Morioka and N. Miura and K. Matsuda and
                 M. Nagata and S. Bhasin and Y. Mathieu and T. Graba and
                 J. Danger and N. Homma",
  title =        "High Throughput\slash Gate {AES} Hardware
                 Architectures Based on Datapath Compression",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "4",
  pages =        "534--548",
  month =        apr,
  year =         "2020",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2019.2957355",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Mar 12 16:58:27 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
  keywords =     "AES; Computer architecture; Delays; Encryption;
                 Hardware; hardware architectures; Logic gates; Poles
                 and towers; round-based encryption architecture;
                 unified encryption/decryption architecture",
}

@Article{ulHaq:2020:STF,
  author =       "Inam ul Haq and Jian Wang and Youwen Zhu",
  title =        "Secure two-factor lightweight authentication protocol
                 using self-certified public key cryptography for
                 multi-server {5G} networks",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "161",
  number =       "??",
  pages =        "??--??",
  day =          "1",
  month =        jul,
  year =         "2020",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2020.102660",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:36 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S108480452030134X",
  acknowledgement = ack-nhfb,
  articleno =    "102660",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Vachon:2020:IEP,
  author =       "Phil Vachon",
  title =        "The Identity in Everyone's Pocket: Keeping users
                 secure through their smartphones",
  journal =      j-QUEUE,
  volume =       "18",
  number =       "4",
  pages =        "61--94",
  month =        aug,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3424302.3428660",
  bibdate =      "Fri Feb 5 11:33:26 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/queue.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3424302.3428660",
  abstract =     "Newer phones use security features in many different
                 ways and combinations. As with any security technology,
                 however, using a feature incorrectly can create a false
                 sense of security. As such, many app developers and
                 service providers today do not use \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Queue: Tomorrow's Computing Today",
  journal-URL =  "https://dl.acm.org/loi/queue",
}

@Book{vanOorschot:2020:CSI,
  author =       "Paul C. van Oorschot",
  title =        "Computer Security and the {Internet}: Tools and
                 Jewels",
  publisher =    pub-SPRINGER-INTERNATIONAL,
  address =      pub-SPRINGER-INTERNATIONAL:adr,
  pages =        "xxi + 365",
  year =         "2020",
  DOI =          "https://doi.org/10.1007/978-3-030-33649-3",
  ISBN =         "3-030-33648-4 (hardcover), 3-030-33649-2 (e-book),
                 3-030-33650-6",
  ISBN-13 =      "978-3-030-33648-6 (hardcover), 978-3-030-33649-3
                 (e-book), 978-3-030-33650-9 (print)",
  LCCN =         "QA76.9.A25",
  bibdate =      "Thu Jul 15 06:50:48 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  series =       "Information Security and Cryptography Series",
  URL =          "https://people.scs.carleton.ca/~paulv/toolsjewels.html",
  abstract =     "This book provides a concise yet comprehensive
                 overview of computer and Internet security, suitable
                 for a one-term introductory course for junior/senior
                 undergrad or first-year graduate students. It is also
                 suitable for self-study by anyone seeking a solid
                 footing in security --- including software developers
                 and computing professionals, technical managers and
                 government staff. An overriding focus is on brevity,
                 without sacrificing breadth of core topics or technical
                 detail within them. The aim is to enable a broad
                 understanding in roughly 350 pages. Further
                 prioritization is supported by designating as optional
                 selected content within this. Fundamental academic
                 concepts are reinforced by specifics and examples, and
                 related to applied problems and real-world incidents.
                 The first chapter provides a gentle overview and 20
                 design principles for security. The ten chapters that
                 follow provide a framework for understanding computer
                 and Internet security. They regularly refer back to the
                 principles, with supporting examples. These principles
                 are the conceptual counterparts of security-related
                 error patterns that have been recurring in software and
                 system designs for over 50 years. The book is
                 ``elementary'' in that it assumes no background in
                 security, but unlike ``soft'' high-level texts it does
                 not avoid low-level details, instead it selectively
                 dives into fine points for exemplary topics to
                 concretely illustrate concepts and principles. The book
                 is rigorous in the sense of being technically sound,
                 but avoids both mathematical proofs and lengthy
                 source-code examples that typically make books
                 inaccessible to general audiences. Knowledge of
                 elementary operating system and networking concepts is
                 helpful, but review sections summarize the essential
                 background. For graduate students, inline exercises and
                 supplemental references provided in per-chapter
                 endnotes provide a bridge to further topics and a
                 springboard to the research literature; for those in
                 industry and government, pointers are provided to
                 helpful surveys and relevant standards, e.g., documents
                 from the Internet Engineering Task Force (IETF), and
                 the U.S. National Institute of Standards and
                 Technology.",
  acknowledgement = ack-nhfb,
  remark =       "Description based upon print version of record. 5.1
                 Memory protection, supervisor mode, and
                 accountability.",
  shorttableofcontents = "1: Basic Concepts and Principles \\
                 2: Cryptographic Building Blocks \\
                 3: User Authentication: Passwords, Biometrics and
                 Alternatives \\
                 4: Authentication Protocols and Key Establishment \\
                 5: Operating System Security and Access Control \\
                 6: Software Security: Exploits and Privilege Escalation
                 \\
                 7: Malicious Software \\
                 8: Public-Key Certificate Management and Use Cases \\
                 9: Web and Browser Security \\
                 10: Firewalls and Tunnels \\
                 11: Intrusion Detection and Network-Based Attacks \\
                 12: Wireless LAN Security: 802.11 and Wi-Fi \\
                 13: Bitcoin, Blockchains and Ethereum \\
                 Epilogue \\
                 Index",
  subject =      "Computer security; Internet; Security measures;
                 Computer security.; Security measures.",
  tableofcontents = "Intro \\
                 Contents in Brief \\
                 Table of Contents \\
                 Foreword \\
                 Preface \\
                 Why this book, approach and target audience \\
                 Selection of topics \\
                 Framework and systematization \\
                 Length, prioritization and optional sections \\
                 Order of chapters, and relationships between them \\
                 Cryptography vs. security course \\
                 Helpful background \\
                 Trendy topics vs. foundational concepts \\
                 Acknowledgements \\
                 Typesetting Conventions \\
                 1: Basic Concepts and Principles \\
                 1.1 Fundamental goals of computer security \\
                 1.2 Computer security policies and attacks \\
                 1.3 Risk, risk assessment, and modeling expected losses
                 \\
                 1.4 Adversary modeling and security analysis \\
                 1.5 Threat modeling: diagrams, trees, lists and STRIDE
                 \\
                 1.5.1 Diagram-driven threat modeling \\
                 1.5.2 Attack trees for threat modeling \\
                 1.5.3 Other threat modeling approaches: checklists and
                 STRIDE \\
                 1.6 Model-reality gaps and real-world outcomes \\
                 1.6.1 Threat modeling and model-reality gaps \\
                 1.6.2 Tying security policy back to real outcomes and
                 security analysis \\
                 1.7 Design principles for computer security \\
                 1.8 Why computer security is hard \\
                 1.9 End notes and further reading \\
                 References \\
                 2: Cryptographic Building Blocks \\
                 2.1 Encryption and decryption (generic concepts) \\
                 2.2 Symmetric-key encryption and decryption \\
                 2.3 Public-key encryption and decryption \\
                 2.4 Digital signatures and verification using public
                 keys \\
                 2.5 Cryptographic hash functions \\
                 2.6 Message authentication (data origin authentication)
                 \\
                 2.7 Authenticated encryption and further modes of
                 operation \\
                 2.8 Certificates, elliptic curves, and equivalent
                 keylengths \\
                 2.9 End notes and further reading \\
                 References \\
                 3: User Authentication-Passwords, Biometrics and
                 Alternatives \\
                 3.1 Password authentication \\
                 3.2 Password-guessing strategies and defenses \\
                 3.3 Account recovery and secret questions \\
                 3.4 One-time password generators and hardware tokens
                 \\
                 3.5 Biometric authentication \\
                 3.6 Password managers and graphical passwords \\
                 3.7 CAPTCHAs (humans-in-the-loop) vs. automated attacks
                 \\
                 3.8 Entropy, passwords, and partial-guessing metrics
                 \\
                 3.9 End notes and further reading \\
                 References \\
                 4: Authentication Protocols and Key Establishment \\
                 4.1 Entity authentication and key establishment
                 (context) \\
                 4.2 Authentication protocols: concepts and mistakes \\
                 4.3 Establishing shared keys by public agreement (DH)
                 \\
                 4.4 Key authentication properties and goals \\
                 4.5 Password-authenticated key exchange: EKE and SPEKE
                 \\
                 4.6 Weak secrets and forward search in authentication
                 \\
                 4.7 Single sign-on (SSO) and federated identity systems
                 \\
                 4.8 Cyclic groups and subgroup attacks on
                 Diffie--Hellman \\
                 4.9 End notes and further reading \\
                 References \\
                 5: Operating System Security and Access Control \\
                 \ldots{}",
}

@TechReport{vanSchaik:2020:CLD,
  author =       "Stephan van Schaik and Marina Minkin and Andrew Kwong
                 and Daniel Genkin and Yuval Yarom",
  title =        "{CacheOut}: Leaking Data on {Intel CPUs} via Cache
                 Evictions",
  type =         "Report",
  institution =  "University of Michigan and University of Adelaide and
                 Data61",
  address =      "Ann Arbor, MI, USA and Adelaide, Australia",
  pages =        "16",
  day =          "27",
  month =        jan,
  year =         "2020",
  bibdate =      "Tue Jan 28 08:58:45 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://cacheoutattack.com/CacheOut.pdf",
  abstract =     "Recent speculative execution attacks, such as RIDL,
                 Fallout, and ZombieLoad, demonstrated that attackers
                 can leak information while it transits through various
                 microarchitectural buffers. Named Microarchitectural
                 Data Sampling (MDS) by Intel, these attacks are likened
                 to ``drinking from the firehose'', as the attacker has
                 little control over what data is observed and from what
                 origin. Unable to prevent these buffers from leaking,
                 Intel issued countermeasures via microcode updates that
                 overwrite the buffers when the CPU changes security
                 domains. In this work we present CacheOut, a new
                 microarchitectural attack that is capable of bypassing
                 Intel's buffer overwrite counter measures. We observe
                 that as data is being evicted from the CPU L1 cache, it
                 is often transferred back to the leaky CPU buffers
                 where it can be recovered by the attacker. CacheOut
                 improves over previous MDS attacks by allowing the
                 attacker to choose which data to leak from the CPU's L1
                 cache, as well as which part of a cache line to leak.
                 We demonstrate that CacheOut can leak information
                 across multiple security boundaries, including those
                 between hyperthreads, processes, and virtual machines,
                 and between user space and the operating system kernel,
                 and from SGX enclaves.",
  acknowledgement = ack-nhfb,
}

@Article{vanSchaik:2020:RAA,
  author =       "Paul van Schaik and Karen Renaud and Christopher
                 Wilson and Jurjen Jansen and Joseph Onibokun",
  title =        "Risk as affect: the affect heuristic in
                 cybersecurity",
  journal =      j-COMPUT-SECUR,
  volume =       "90",
  number =       "??",
  pages =        "Article 101651",
  month =        mar,
  year =         "2020",
  CODEN =        "CPSEDU",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Sat Mar 14 18:49:57 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167404819301956",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Article{Varri:2020:SRS,
  author =       "Umasankararao Varri and Syamkumar Pasupuleti and K. V.
                 Kadambari",
  title =        "A scoping review of searchable encryption schemes in
                 cloud computing: taxonomy, methods, and recent
                 developments",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "4",
  pages =        "3013--3042",
  month =        apr,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-019-03087-y",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Sat Jul 25 07:17:55 MDT 2020",
  bibsource =    "http://link.springer.com/journal/11227/76/4;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Vasan:2020:MCA,
  author =       "D. Vasan and M. Alazab and S. Venkatraman and J. Akram
                 and Z. Qin",
  title =        "{MTHAEL}: Cross-Architecture {IoT} Malware Detection
                 Based on Neural Network Advanced Ensemble Learning",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "11",
  pages =        "1654--1667",
  month =        nov,
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Oct 8 20:31:08 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Wang:2020:CSH,
  author =       "Y. Wang and Y. Shen and C. Su and J. Ma and L. Liu and
                 X. Dong",
  title =        "{CryptSQLite}: {SQLite} With High Data Security",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "5",
  pages =        "666--678",
  year =         "2020",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2019.2963303",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Apr 9 11:05:24 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/sqlbooks.bib",
  URL =          "https://ieeexplore.ieee.org/document/8946540",
  abstract =     "SQLite, one of the most popular light-weighted
                 database system, has been widely used in various
                 systems. However, the compact design of SQLite did not
                 make enough consideration on user data security.
                 Specifically, anyone who has obtained the access to the
                 database file will be able to read or tamper the data.
                 Existing encryption-based solutions can only protect
                 data on storage, while still exposing data when in
                 computation. In this article, we combine the Trusted
                 Execution Environment ( TEE ) technology and the
                 authenticated encryption scheme, proposed and developed
                 the CryptSQLite , a high security SQLite database
                 system, which protects both the confidentiality and
                 integrity of users data. Our security analysis proves
                 that CryptSQLite can protect data confidentiality and
                 integrity. Our implementation and experiments indicate
                 that CryptSQLite incurs an average of 21 percent of
                 extra time for SQL statement executions, compared with
                 traditional encryption-based solutions that failed to
                 offer rigorous security guarantees.",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Wang:2020:DVP,
  author =       "Huaqun Wang and Debiao He and Yimu Ji",
  title =        "Designated-verifier proof of assets for bitcoin
                 exchange using elliptic curve cryptography",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "107",
  number =       "??",
  pages =        "854--862",
  month =        jun,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2017.06.028",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:14 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X1731350X",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Wang:2020:EMF,
  author =       "Ding Wang and Ping Wang and Chenyu Wang",
  title =        "Efficient Multi-Factor User Authentication Protocol
                 with Forward Secrecy for Real-Time Data Access in
                 {WSNs}",
  journal =      j-TCPS,
  volume =       "4",
  number =       "3",
  pages =        "30:1--30:26",
  month =        mar,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3325130",
  ISSN =         "2378-962X (print), 2378-9638 (electronic)",
  ISSN-L =       "2378-962X",
  bibdate =      "Tue Apr 7 14:51:07 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcps.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3325130",
  abstract =     "It is challenging to design a secure and efficient
                 multi-factor authentication scheme for real-time data
                 access in wireless sensor networks. On the one hand,
                 such real-time applications are generally security
                 critical, and various security goals need to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Transactions on Cyber-Physical Systems",
  journal-URL =  "https://dl.acm.org/loi/tcps",
}

@Article{Wang:2020:EWR,
  author =       "Ziyu Wang and Hui Yu and Zongyang Zhang and Jiaming
                 Piao and Jianwei Liu",
  title =        "{ECDSA} weak randomness in {Bitcoin}",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "102",
  number =       "??",
  pages =        "507--513",
  month =        jan,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2019.08.034",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Mon Feb 10 12:55:04 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X17330030",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Wang:2020:GLA,
  author =       "Danxin Wang and Chuanhe Huang and Xieyang Shen and
                 Naixue Xiong",
  title =        "A general location-authentication based secure
                 participant recruitment scheme for vehicular
                 crowdsensing",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "171",
  number =       "??",
  pages =        "Article 107152",
  day =          "22",
  month =        apr,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2020.107152",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Fri Aug 14 10:03:46 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128619310618",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Wang:2020:HCA,
  author =       "Baocheng Wang and Zetao Li and Haibin Li",
  title =        "Hybrid Consensus Algorithm Based on Modified
                 Proof-of-Probability and {DPoS}",
  journal =      j-FUTURE-INTERNET,
  volume =       "12",
  number =       "8",
  pages =        "122",
  day =          "24",
  month =        jul,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi12080122",
  ISSN =         "1999-5903",
  bibdate =      "Fri Aug 28 12:33:08 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/12/8/122",
  abstract =     "As the core of blockchain technology, the consensus
                 algorithm plays an important role in determining the
                 security, data consistency, and efficiency of
                 blockchain systems. The existing mainstream consensus
                 algorithm is experiencing difficulties satisfying the
                 needs of efficiency, security, and decentralization in
                 real-world scenarios. This paper proposes a hybrid
                 consensus algorithm based on modified
                 Proof-of-Probability and Delegated Proof-of-Stake. In
                 this method, the work of block generation and
                 validation is, respectively, completed by the nodes
                 using the modified Proof-of-Probability consensus
                 algorithm and Delegated Proof-of-Stake consensus
                 algorithm. When a transaction occurs, the system sends
                 several target hash values to the whole network. Each
                 modified Proof-of-Probability node has a different
                 sorting algorithm, so they have different mining
                 priorities. Every time a hash is decrypted by a
                 modified Proof-of-Probability node, the modulo
                 operation is done to the value of nonce, which is then
                 compared with the expected value given by the supernode
                 selected by the Delegated Proof-of-Stake nodes. If they
                 are not the same, the Proof-of-Probability node enters
                 the waiting time and the other Proof-of-Probability
                 nodes continue to mine. By adopting two consensus
                 algorithms, the malicious nodes must control more than
                 51\% of the nodes that adopt the two consensus
                 algorithms, at the same time, to effectively attack the
                 system, that is, they must have more than 51\% of the
                 computing power and more than 51\% of the tokens. This
                 not only increases the cost of malicious attacks, but
                 also reduces waste of computing power. In addition, the
                 efficiency of the DPoS algorithm makes up for the
                 deficiency of the PoP algorithm in system efficiency,
                 and the mining behavior based on probability in the PoP
                 algorithm also significantly weakens the ability of
                 supernodes in the DPoS algorithm to conduct monopoly
                 behavior or other malicious behaviors. In a word, the
                 combination of the two algorithms makes the system
                 perform better in terms of security, system efficiency,
                 and decentralization.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/1999-5903/",
  remark =       "Special Issue Special Issue on Cyber Physical Systems:
                 Prospects, Challenges, and Role in Software Defined
                 Networking and Blockchain.",
}

@Article{Wang:2020:HFR,
  author =       "Ge Wang and Haofan Cai and Chen Qian and Jinsong Han
                 and Shouqian Shi and Xin Li and Han Ding and Wei Xi and
                 Jizhong Zhao",
  title =        "{Hu-Fu}: Replay-Resilient {RFID} Authentication",
  journal =      j-IEEE-TRANS-NETWORKING,
  volume =       "28",
  number =       "2",
  pages =        "547--560",
  month =        apr,
  year =         "2020",
  CODEN =        "IEANEP",
  DOI =          "https://doi.org/10.1109/TNET.2020.2964290",
  ISSN =         "1063-6692 (print), 1558-2566 (electronic)",
  ISSN-L =       "1063-6692",
  bibdate =      "Sat Aug 15 14:18:14 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2964290",
  abstract =     "We provide the first solution to an important
                 question, &\#x201C;how a physical-layer authentication
                 method can defend against signal replay
                 attacks&\#x201D;. It was believed that if an attacker
                 can replay the exact same reply signal of a legitimate
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE\slash ACM Transactions on Networking",
  journal-URL =  "https://dl.acm.org/loi/ton",
}

@Article{Wang:2020:LMB,
  author =       "Junchao Wang and Kaining Han and Shengwen Fan and Ying
                 Zhang and Honghao Tan and Gwanggil Jeon and Yu Pang and
                 Jinzhao Lin",
  title =        "A logistic mapping-based encryption scheme for
                 Wireless Body Area Networks",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "110",
  number =       "??",
  pages =        "57--67",
  month =        sep,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2020.04.002",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:19 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X19335617",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Wang:2020:PQH,
  author =       "Luping Wang and Jie Chen and Kai Zhang and Haifeng
                 Qian",
  title =        "A post-quantum hybrid encryption based on {QC-LDPC}
                 codes in the multi-user setting",
  journal =      j-THEOR-COMP-SCI,
  volume =       "835",
  number =       "??",
  pages =        "82--96",
  day =          "2",
  month =        oct,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2020.06.013",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Mar 12 06:53:42 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397520303558",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Wang:2020:RIN,
  author =       "Hao Wang and Kaiju Li",
  title =        "Resistance of {IID} Noise in Differentially Private
                 Schemes for Trajectory Publishing",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "4",
  pages =        "549--566",
  month =        apr,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz097",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri May 8 08:50:40 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/4/549/5625061",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Wang:2020:SEC,
  author =       "X. Wang and F. Huang and H. Chen",
  title =        "Secure and Efficient Control Data Isolation with
                 Register-Based Data Cloaking",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "2",
  pages =        "226--238",
  month =        feb,
  year =         "2020",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2019.2946770",
  ISSN =         "2326-3814",
  ISSN-L =       "0018-9340",
  bibdate =      "Wed Jan 22 06:44:09 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
  keywords =     "C++ languages; Computers; Control data isolation;
                 Cryptography; Instruments; Kernel; memory error;
                 processor registers; Registers",
}

@Article{Wang:2020:UAM,
  author =       "Chen Wang and Yan Wang and Yingying Chen and Hongbo
                 Liu and Jian Liu",
  title =        "User authentication on mobile devices: {Approaches},
                 threats and trends",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "170",
  number =       "??",
  pages =        "Article 107118",
  day =          "7",
  month =        apr,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2020.107118",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Fri Aug 14 10:03:46 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128618312799",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Wang:2020:UNC,
  author =       "Xueping Wang and Yunhong Wang and Weixin Li",
  title =        "{U-Net} Conditional {GANs} for Photo-Realistic and
                 Identity-Preserving Facial Expression Synthesis",
  journal =      j-TOMM,
  volume =       "15",
  number =       "3s",
  pages =        "1--23",
  month =        jan,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3355397",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Thu Jan 23 07:04:18 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3355397",
  abstract =     "Facial expression synthesis (FES) is a challenging
                 task since the expression changes are highly non-linear
                 and depend on the facial appearance. Person identity
                 should also be well preserved in the synthesized face.
                 In this article, we present a novel U- \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "88",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Wang:2020:USF,
  author =       "Ding Wang and Xizhe Zhang and Zijian Zhang and Ping
                 Wang",
  title =        "Understanding security failures of multi-factor
                 authentication schemes for multi-server environments",
  journal =      j-COMPUT-SECUR,
  volume =       "88",
  number =       "??",
  pages =        "Article 101619",
  month =        jan,
  year =         "2020",
  CODEN =        "CPSEDU",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Tue Oct 22 14:36:57 MDT 2019",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://www.sciencedirect.com/science/article/pii/S016740481930166X",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Article{Wang:2020:ZKV,
  author =       "Qiang Wang and Fucai Zhou and Jian Xu and Zifeng Xu",
  title =        "A (Zero-Knowledge) Vector Commitment with Sum Binding
                 and its Applications",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "4",
  pages =        "633--647",
  month =        apr,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz115",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri May 8 08:50:40 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/4/633/5627774",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Wazid:2020:LCL,
  author =       "Mohammad Wazid and Ashok Kumar Das and Vivekananda
                 Bhat K. and Athanasios V. Vasilakos",
  title =        "{LAM-CIoT}: {Lightweight} authentication mechanism in
                 cloud-based {IoT} environment",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "150",
  number =       "??",
  pages =        "??--??",
  day =          "15",
  month =        jan,
  year =         "2020",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2019.102496",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:32 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S108480451930356X",
  acknowledgement = ack-nhfb,
  articleno =    "102496",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Wood:2020:HEM,
  author =       "Alexander Wood and Kayvan Najarian and Delaram
                 Kahrobaei",
  title =        "Homomorphic Encryption for Machine Learning in
                 Medicine and Bioinformatics",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "70:1--70:35",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3394658",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3394658",
  abstract =     "Machine learning and statistical techniques are
                 powerful tools for analyzing large amounts of medical
                 and genomic data. On the other hand, ethical concerns
                 and privacy regulations prevent free sharing of this
                 data. Encryption techniques such as fully \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "70",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Wu:2020:BLS,
  author =       "Pin Wu and Xuting Chang and Yang Yang and Xiaoqiang
                 Li",
  title =        "{BASN}-Learning Steganography with a Binary Attention
                 Mechanism",
  journal =      j-FUTURE-INTERNET,
  volume =       "12",
  number =       "3",
  pages =        "43",
  day =          "27",
  month =        feb,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi12030043",
  ISSN =         "1999-5903",
  bibdate =      "Mon Mar 2 12:22:42 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/12/3/43",
  abstract =     "Secret information sharing through image carriers has
                 aroused much research attention in recent years with
                 images' growing domination on the Internet and mobile
                 applications. The technique of embedding secret
                 information in images without being detected is called
                 image steganography. With the booming trend of
                 convolutional neural networks (CNN),
                 neural-network-automated tasks have been embedded more
                 deeply in our daily lives. However, a series of wrong
                 labeling or bad captioning on the embedded images has
                 left a trace of skepticism and finally leads to a
                 self-confession like exposure. To improve the security
                 of image steganography and minimize task result
                 distortion, models must maintain the feature maps
                 generated by task-specific networks being irrelative to
                 any hidden information embedded in the carrier. This
                 paper introduces a binary attention mechanism into
                 image steganography to help alleviate the security
                 issue, and, in the meantime, increase embedding payload
                 capacity. The experimental results show that our method
                 has the advantage of high payload capacity with little
                 feature map distortion and still resist detection by
                 state-of-the-art image steganalysis algorithms.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Wu:2020:MAR,
  author =       "Zhijun Wu and Yun Zhang and Enzhong Xu",
  title =        "Multi-Authority Revocable Access Control Method Based
                 on {CP-ABE} in {NDN}",
  journal =      j-FUTURE-INTERNET,
  volume =       "12",
  number =       "1",
  pages =        "15",
  day =          "16",
  month =        jan,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi12010015",
  ISSN =         "1999-5903",
  bibdate =      "Mon Mar 2 12:22:41 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/12/1/15",
  abstract =     "For the future of the Internet, because
                 information-centric network (ICN) have natural
                 advantages in terms of content distribution, mobility,
                 and security, it is regarded as a potential solution,
                 or even the key, to solve many current problems. Named
                 Data Network (NDN) is one of the research projects
                 initiated by the United States for network
                 architecture. NDN is a more popular project than ICN.
                 The information cache in the NDN separates content from
                 content publishers, but content security is threatened
                 because of the lack of security controls. Therefore, a
                 multi-authority revocable access control method based
                 on CP-ABE needs to be proposed. This method constructs
                 a proxy-assisted access control scheme, which can
                 implement effective data access control in NDN
                 networks, and the scheme has high security. Because of
                 the partial decryption on the NDN node, the decryption
                 burden of the consumer client in the solution is
                 reduced, and effective user and attribute revocation is
                 achieved, and forward security and backward security
                 are ensured, and collusion attacks are prevented.
                 Finally, through the other security and performance
                 analysis of the scheme of this paper, it proves that
                 the scheme is safe and efficient.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
  remark =       "Special Issue Named Data Networking Architecture.",
}

@Article{Wu:2020:SQI,
  author =       "Zhijun Wu and Rong Li and Panpan Yin and Changliang
                 Li",
  title =        "Steganalysis of Quantization Index Modulation
                 Steganography in {G.723.1} Codec",
  journal =      j-FUTURE-INTERNET,
  volume =       "12",
  number =       "1",
  pages =        "17",
  day =          "19",
  month =        jan,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi12010017",
  ISSN =         "1999-5903",
  bibdate =      "Mon Mar 2 12:22:41 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/12/1/17",
  abstract =     "Steganalysis is used for preventing the illegal use of
                 steganography to ensure the security of network
                 communication through detecting whether or not secret
                 information is hidden in the carrier. This paper
                 presents an approach to detect the quantization index
                 modulation (QIM) of steganography in G.723.1 based on
                 the analysis of the probability of occurrence of index
                 values before and after steganography and studying the
                 influence of adjacent index values in voice over
                 internet protocol (VoIP). According to the change of
                 index value distribution characteristics, this approach
                 extracts the distribution probability matrix and the
                 transition probability matrix as feature vectors, and
                 uses principal component analysis (PCA) to reduce the
                 dimensionality. Through a large amount of sample
                 training, the support vector machine (SVM) is designed
                 as a classifier to detect the QIM steganography. The
                 speech samples with different embedding rates and
                 different durations were tested to verify their impact
                 on the accuracy of the steganalysis. The experimental
                 results show that the proposed approach improves the
                 accuracy and reliability of the steganalysis.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
  remark =       "Special Issue Cyber Security of the Continuous Digital
                 Environment: Challenges, Solutions and Future
                 Directions.",
}

@Article{Xie:2020:PLA,
  author =       "Ning Xie and Shengli Zhang and Alex X. Liu",
  title =        "Physical-Layer Authentication in Non-Orthogonal
                 Multiple Access Systems",
  journal =      j-IEEE-TRANS-NETWORKING,
  volume =       "28",
  number =       "3",
  pages =        "1144--1157",
  month =        jun,
  year =         "2020",
  CODEN =        "IEANEP",
  DOI =          "https://doi.org/10.1109/TNET.2020.2979058",
  ISSN =         "1063-6692 (print), 1558-2566 (electronic)",
  ISSN-L =       "1063-6692",
  bibdate =      "Tue Feb 23 08:45:26 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
  URL =          "https://dl.acm.org/doi/10.1109/TNET.2020.2979058",
  abstract =     "This paper concerns the problem of authenticating the
                 transmitter device in non-orthogonal multiple access
                 (NOMA) systems. This problem is important because of
                 high vulnerabilities in wireless communications and an
                 additional security vulnerability when \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE\slash ACM Transactions on Networking",
  journal-URL =  "https://dl.acm.org/loi/ton",
}

@Article{Xiong:2020:SDD,
  author =       "Jinbo Xiong and Lei Chen and Md Zakirul Alam Bhuiyan
                 and Chunjie Cao and Minshen Wang and Entao Luo and
                 Ximeng Liu",
  title =        "A secure data deletion scheme for {IoT} devices
                 through key derivation encryption and data analysis",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "111",
  number =       "??",
  pages =        "741--753",
  month =        oct,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2019.10.017",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:21 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X19314499",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Xu:2020:PPD,
  author =       "Jian Xu and Laiwen Wei and Wei Wu and Andi Wang and Yu
                 Zhang and Fucai Zhou",
  title =        "Privacy-preserving data integrity verification by
                 using lightweight streaming authenticated data
                 structures for healthcare cyber-physical system",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "108",
  number =       "??",
  pages =        "1287--1296",
  month =        jul,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2018.04.018",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:16 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X17326067",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Xu:2020:SQK,
  author =       "Feihu Xu and Xiongfeng Ma and Qiang Zhang and
                 Hoi-Kwong Lo and Jian-Wei Pan",
  title =        "Secure quantum key distribution with realistic
                 devices",
  journal =      j-REV-MOD-PHYS,
  volume =       "92",
  number =       "2",
  pages =        "025002--??",
  month =        feb,
  year =         "2020",
  CODEN =        "RMPHAT",
  DOI =          "https://doi.org/10.1103/RevModPhys.92.025002",
  ISSN =         "0034-6861 (print), 1538-4527 (electronic), 1539-0756",
  ISSN-L =       "0034-6861",
  bibdate =      "Fri May 29 13:27:30 MDT 2020",
  bibsource =    "http://rmp.aps.org/toc/RMP/v92/i2;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/revmodphys2020.bib",
  URL =          "http://journals.aps.org/rmp/abstract/10.1103/RevModPhys.92.025002",
  acknowledgement = ack-nhfb,
  fjournal =     "Reviews of Modern Physics",
  journal-URL =  "http://rmp.aps.org/browse",
  onlinedate =   "26 May 2020",
}

@Article{Xu:2020:TTT,
  author =       "Runhua Xu and James Joshi",
  title =        "Trustworthy and Transparent Third-party Authority",
  journal =      j-TOIT,
  volume =       "20",
  number =       "4",
  pages =        "31:1--31:23",
  month =        nov,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3386262",
  ISSN =         "1533-5399 (print), 1557-6051 (electronic)",
  ISSN-L =       "1533-5399",
  bibdate =      "Fri Feb 5 18:12:52 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toit.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3386262",
  abstract =     "Recent advances in cryptographic approaches, such as
                 Functional Encryption and Attribute-based Encryption
                 and their variants, have shown significant promise for
                 enabling public clouds to provide secure computation
                 and storage services for users' \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Transactions on Internet Technology (TOIT)",
  journal-URL =  "https://dl.acm.org/loi/toit",
}

@Article{Yadav:2020:EIA,
  author =       "Navneet Yadav and Navdeep Goel",
  title =        "An Effective Image-Adaptive Hybrid Watermarking Scheme
                 with Transform Coefficients",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "20",
  number =       "01",
  pages =        "??--??",
  month =        jan,
  year =         "2020",
  DOI =          "https://doi.org/10.1142/S0219467820500023",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Thu Feb 6 07:43:16 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0219467820500023",
  abstract =     "Robust and invisible watermarking provides a feasible
                 solution to prove the ownership of the genuine content
                 owner. Different watermarking algorithms have been
                 presented by the researchers in the past but no
                 algorithm could be termed as perfect. Proposed work
                 puts forward a novel image-adaptive method of embedding
                 a binary watermark in the image in a transparent
                 manner. Discrete wavelet transform (DWT), singular
                 value decomposition (SVD) and discrete cosine transform
                 (DCT) are used together in the proposed hybrid
                 watermarking scheme. Image-adaptive nature of the
                 scheme is reflected in the usage of only high entropy
                 8{\texttimes}8 blocks for the watermark embedding.
                 Binary watermark is embedded in the DCT coefficients
                 using a flexible strength derived from the means of the
                 DCT coefficients. This flexible strength factor (SF)
                 has different value for the DCT coefficients originated
                 from different 8{\texttimes}8 blocks. Any desired level
                 of visual quality could be obtained by varying the
                 adjusting parameter of the flexible SF. Side
                 information generated in the watermark embedding is
                 used in the detection of watermark. The presented
                 watermarking technique shows better robustness in
                 comparison to the three contemporary watermarking
                 techniques.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Yang:2020:AMD,
  author =       "Ta-Wei Yang and Yu-Han Ho and Cheng-Fu Chou",
  title =        "Achieving {M2M}-device authentication through
                 heterogeneous information bound with {USIM} card",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "110",
  number =       "??",
  pages =        "629--637",
  month =        sep,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2019.10.042",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:19 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X19307228",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Yang:2020:ESM,
  author =       "Jing Yang and Mingyu Fan and Guangwei Wang",
  title =        "Encryption scheme with mixed homomorphic signature
                 based on message authentication for digital image",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "76",
  number =       "2",
  pages =        "1201--1211",
  month =        feb,
  year =         "2020",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-018-2528-x",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Sat Jul 25 07:17:53 MDT 2020",
  bibsource =    "http://link.springer.com/journal/11227/76/2;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Yang:2020:HIB,
  author =       "Zhichao Yang and Dung H Duong and Willy Susilo and
                 Guomin Yang and Chao Li and Rongmao Chen",
  title =        "Hierarchical Identity-Based Signature in Polynomial
                 Rings",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "10",
  pages =        "1490--1499",
  month =        oct,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa033",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Mon Oct 19 08:41:03 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/10/1490/5826091",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Yang:2020:SEF,
  author =       "Fan Yang and Youmin Chen and Haiyu Mao and Youyou Lu
                 and Jiwu Shu",
  title =        "{ShieldNVM}: an Efficient and Fast Recoverable System
                 for Secure Non-Volatile Memory",
  journal =      j-TOS,
  volume =       "16",
  number =       "2",
  pages =        "12:1--12:31",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3381835",
  ISSN =         "1553-3077 (print), 1553-3093 (electronic)",
  ISSN-L =       "1553-3077",
  bibdate =      "Sun Jun 14 08:20:04 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tos.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3381835",
  abstract =     "Data encryption and authentication are essential for
                 secure non-volatile memory (NVM). However, the
                 introduced security metadata needs to be atomically
                 written back to NVM along with data, so as to provide
                 crash consistency, which unfortunately incurs high
                 overhead. To support fine-grained data protection and
                 fast recovery for a secure NVM system without
                 compromising the performance, we propose ShieldNVM. It
                 first proposes an epoch-based mechanism to aggressively
                 cache the security metadata in the metadata cache while
                 retaining the consistency of them in NVM. Deferred
                 spreading is also introduced to reduce the calculating
                 overhead for data authentication. Leveraging the
                 ability of data hash message authentication codes, we
                 can always recover the consistent but old security
                 metadata to its newest version. By recording a limited
                 number of dirty addresses of the security metadata,
                 ShieldNVM achieves fast recovering the secure NVM
                 system after crashes. Compared to Osiris, a
                 state-of-the-art secure NVM, ShieldNVM reduces system
                 runtime by 39.1\% and hash message authentication code
                 computation overhead by 80.5\% on average over NVM
                 workloads. When system crashes happen, ShieldNVM s
                 recovery time is orders of magnitude faster than
                 Osiris. In addition, ShieldNVM also recovers faster
                 than AGIT, which is the Osiris-based state-of-the-art
                 mechanism addressing the recovery time of the secure
                 NVM system. Once the recovery process fails, instead of
                 dropping all data due to malicious attacks, ShieldNVM
                 is able to detect and locate the area of the tampered
                 data with the help of the tracked addresses.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Transactions on Storage",
  journal-URL =  "https://dl.acm.org/loi/tos",
}

@Article{Yang:2020:SLC,
  author =       "Zhichao Yang and Rongmao Chen and Chao Li and
                 Longjiang Qu and Guomin Yang",
  title =        "On the Security of {LWE} Cryptosystem against
                 Subversion Attacks",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "4",
  pages =        "495--507",
  month =        apr,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz084",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri May 8 08:50:40 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/4/495/5560305",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Yao:2020:ETC,
  author =       "Zhongjiang Yao and Jingguo Ge and Yulei Wu and
                 Xiaosheng Lin and Runkang He and Yuxiang Ma",
  title =        "Encrypted traffic classification based on {Gaussian}
                 mixture models and {Hidden Markov Models}",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "166",
  number =       "??",
  pages =        "??--??",
  day =          "15",
  month =        sep,
  year =         "2020",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2020.102711",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:38 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804520301855",
  acknowledgement = ack-nhfb,
  articleno =    "102711",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Yuan:2020:EEB,
  author =       "X. Yuan and X. Yuan and Y. Zhang and B. Li and C.
                 Wang",
  title =        "Enabling Encrypted {Boolean} Queries in Geographically
                 Distributed Databases",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  volume =       "31",
  number =       "3",
  pages =        "634--646",
  month =        mar,
  year =         "2020",
  CODEN =        "ITDSEO",
  DOI =          "https://doi.org/10.1109/TPDS.2019.2940945",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Wed Jan 22 06:09:50 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journal-URL =  "http://www.computer.org/portal/web/csdl/transactions/tpds",
  keywords =     "Boolean query; Cloud computing; Data privacy;
                 Distributed databases; Encryption; Indexes; key-value
                 stores; multi-client data access; Searchable symmetric
                 encryption; Servers",
}

@Article{Zhang:2020:ABE,
  author =       "Yinghui Zhang and Robert H. Deng and Shengmin Xu and
                 Jianfei Sun and Qi Li and Dong Zheng",
  title =        "Attribute-based Encryption for Cloud Computing Access
                 Control: a Survey",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "4",
  pages =        "83:1--83:41",
  month =        sep,
  year =         "2020",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3398036",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sun Sep 27 07:06:06 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3398036",
  abstract =     "Attribute-based encryption (ABE) for cloud computing
                 access control is reviewed in this article. A taxonomy
                 and comprehensive assessment criteria of ABE are first
                 proposed. In the taxonomy, ABE schemes are assorted
                 into key-policy ABE (KP-ABE) schemes, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "83",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Zhang:2020:DMB,
  author =       "Xiang Zhang and Lina Yao and Chaoran Huang and Tao Gu
                 and Zheng Yang and Yunhao Liu",
  title =        "{DeepKey}: a Multimodal Biometric Authentication
                 System via Deep Decoding Gaits and Brainwaves",
  journal =      j-TIST,
  volume =       "11",
  number =       "4",
  pages =        "49:1--49:24",
  month =        jul,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3393619",
  ISSN =         "2157-6904 (print), 2157-6912 (electronic)",
  ISSN-L =       "2157-6904",
  bibdate =      "Wed Jul 8 17:19:20 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tist.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3393619",
  abstract =     "Biometric authentication involves various technologies
                 to identify individuals by exploiting their unique,
                 measurable physiological and behavioral
                 characteristics. However, traditional biometric
                 authentication systems (e.g., face recognition, iris,
                 \ldots{})",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Transactions on Intelligent Systems and Technology
                 (TIST)",
  journal-URL =  "https://dl.acm.org/loi/tist",
}

@Article{Zhang:2020:EPC,
  author =       "F. Zhang and W. He and R. Cheng and J. Kos and N.
                 Hynes and N. Johnson and A. Juels and A. Miller and D.
                 Song",
  title =        "The {Ekiden} Platform for Confidentiality-Preserving,
                 Trustworthy, and Performant Smart Contracts",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "18",
  number =       "3",
  pages =        "17--27",
  month =        may # "\slash " # jun,
  year =         "2020",
  DOI =          "https://doi.org/10.1109/MSEC.2020.2976984",
  ISSN =         "1558-4046",
  ISSN-L =       "1540-7993",
  bibdate =      "Wed May 27 17:52:17 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
  keywords =     "blockchain; cryptography; privacy; smart contracts",
}

@Article{Zhang:2020:FEA,
  author =       "Lyuye Zhang and Maode Ma",
  title =        "{FKR}: an efficient authentication scheme for {IEEE
                 802.11ah} networks",
  journal =      j-COMPUT-SECUR,
  volume =       "88",
  number =       "??",
  pages =        "Article 101633",
  month =        jan,
  year =         "2020",
  CODEN =        "CPSEDU",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Sat Mar 14 18:49:56 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167404818313373",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Article{Zhang:2020:IIF,
  author =       "Diming Zhang and Shaodi You",
  title =        "{iFlask}: Isolate flask security system from dangerous
                 execution environment by using {ARM TrustZone}",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "109",
  number =       "??",
  pages =        "531--537",
  month =        aug,
  year =         "2020",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2018.05.064",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 19 07:44:18 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X17322239",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Zhang:2020:NAE,
  author =       "N. Zhang and Q. Qin and H. Yuan and C. Zhou and S. Yin
                 and S. Wei and L. Liu",
  title =        "{NTTU}: An Area-Efficient Low-Power {NTT}-Uncoupled
                 Architecture for {NTT}-Based Multiplication",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "4",
  pages =        "520--533",
  month =        apr,
  year =         "2020",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2019.2958334",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Mar 12 16:58:27 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
  keywords =     "Clocks; Cloud computing; Complexity theory; Computer
                 architecture; Encryption; Fully homomorphic encryption;
                 large integer multiplication; number theoretical
                 conversion; polynomial multiplication; Random access
                 memory; Transforms",
}

@Article{Zhang:2020:SCA,
  author =       "F. Zhang and B. Yang and X. Dong and S. Guilley and Z.
                 Liu and W. He and F. Zhang and K. Ren",
  title =        "Side-Channel Analysis and Countermeasure Design on
                 ARM-Based Quantum-Resistant {SIKE}",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "11",
  pages =        "1681--1693",
  month =        nov,
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Oct 8 20:31:08 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Zhang:2020:STH,
  author =       "Xiao Zhang and Lijia Xie and Wang Yao",
  title =        "Spatio-temporal heterogeneous bandwidth allocation
                 mechanism against {DDoS} attack",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "162",
  number =       "??",
  pages =        "??--??",
  day =          "15",
  month =        jul,
  year =         "2020",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2020.102658",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:36 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804520301326",
  acknowledgement = ack-nhfb,
  articleno =    "102658",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Zhao:2020:AAI,
  author =       "Zhen Zhao and Fuchun Guo and Jianchang Lai and Willy
                 Susilo and Baocang Wang and Yupu Hu",
  title =        "Accountable authority identity-based broadcast
                 encryption with constant-size private keys and
                 ciphertexts",
  journal =      j-THEOR-COMP-SCI,
  volume =       "809",
  number =       "??",
  pages =        "73--87",
  day =          "24",
  month =        feb,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2019.11.035",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Thu Apr 23 07:41:38 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397519307613",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Zhao:2020:BBA,
  author =       "Zhen Zhao and Ge Wu and Fuchun Guo and Willy Susilo
                 and Yi Mu and Baocang Wang and Yupu Hu",
  title =        "Black-Box Accountable Authority Identity-Based
                 Revocation System",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "4",
  pages =        "525--535",
  month =        apr,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz092",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri May 8 08:50:40 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/4/525/5618849",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Zhao:2020:FFC,
  author =       "R. K. Zhao and R. Steinfeld and A. Sakzad",
  title =        "{FACCT}: {FAst, Compact, and Constant-Time} Discrete
                 {Gaussian} Sampler over Integers",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "1",
  pages =        "126--137",
  month =        jan,
  year =         "2020",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2019.2940949",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Jan 9 07:48:57 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
  keywords =     "Approximation algorithms; constant-time; Convolution;
                 Cryptography; discrete Gaussian sampling; efficiency;
                 implementation; Lattice-based crypto; Lattices; Memory
                 management; Sampling methods; Standards",
}

@Article{Zhong:2020:EDM,
  author =       "Hong Zhong and Zhanfei Li and Jie Cui and Yue Sun and
                 Lu Liu",
  title =        "Efficient dynamic multi-keyword fuzzy search over
                 encrypted cloud data",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "149",
  number =       "??",
  pages =        "??--??",
  day =          "1",
  month =        jan,
  year =         "2020",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2019.102469",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:31 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804519303297",
  acknowledgement = ack-nhfb,
  articleno =    "102469",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Zhong:2020:SDM,
  author =       "Sheng-Hua Zhong and Yuantian Wang and Tongwei Ren and
                 Mingjie Zheng and Yan Liu and Gangshan Wu",
  title =        "Steganographer Detection via Multi-Scale Embedding
                 Probability Estimation",
  journal =      j-TOMM,
  volume =       "15",
  number =       "4",
  pages =        "1--23",
  month =        jan,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3352691",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Sat Jan 11 08:35:19 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3352691",
  abstract =     "Steganographer detection aims to identify the guilty
                 user who utilizes steganographic methods to hide secret
                 information in the spread of multimedia data,
                 especially image data, from a large amount of innocent
                 users on social networks. A true embedding \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "103",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J961",
}

@Article{Zhou:2020:BBT,
  author =       "Jia Zhou and Prachi Joshi and Haibo Zeng and Renfa
                 Li",
  title =        "{BTMonitor}: Bit-time-based Intrusion Detection and
                 Attacker Identification in Controller Area Network",
  journal =      j-TECS,
  volume =       "18",
  number =       "6",
  pages =        "1--23",
  month =        jan,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3362034",
  ISSN =         "1539-9087 (print), 1558-3465 (electronic)",
  ISSN-L =       "1539-9087",
  bibdate =      "Thu Jan 23 06:51:29 MST 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tecs.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3362034",
  abstract =     "With the rapid growth of connectivity and autonomy for
                 today's automobiles, their security vulnerabilities are
                 becoming one of the most urgent concerns in the
                 automotive industry. The lack of message authentication
                 in Controller Area Network (CAN), ...",
  acknowledgement = ack-nhfb,
  articleno =    "117",
  fjournal =     "ACM Transactions on Embedded Computing Systems",
  journal-URL =  "https://dl.acm.org/loi/tecs",
}

@Article{Zhou:2020:CLR,
  author =       "Yanwei Zhou and Bo Yang and Tao Wang and Zhe Xia and
                 Hongxia Hou",
  title =        "Continuous Leakage-Resilient Certificate-Based
                 Encryption Scheme Without Bilinear Pairings",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "4",
  pages =        "508--524",
  month =        apr,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz085",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri May 8 08:50:40 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/4/508/5614856",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Zhou:2020:HBA,
  author =       "L. Zhou and Y. Hu and Y. Makris",
  title =        "A Hardware-Based Architecture-Neutral Framework for
                 Real-Time {IoT} Workload Forensics",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "69",
  number =       "11",
  pages =        "1668--1680",
  month =        nov,
  year =         "2020",
  CODEN =        "ITCOB4",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Oct 8 20:31:08 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Zhou:2020:IBE,
  author =       "Yanwei Zhou and Bo Yang and Zhe Xia and Mingwu Zhang
                 and Yi Mu",
  title =        "Identity-based encryption with leakage-amplified
                 chosen-ciphertext attacks security",
  journal =      j-THEOR-COMP-SCI,
  volume =       "809",
  number =       "??",
  pages =        "277--295",
  day =          "24",
  month =        feb,
  year =         "2020",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2019.12.018",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Thu Apr 23 07:41:38 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397519307935",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Zhou:2020:PKR,
  author =       "Haibo Zhou and Zheng Li and Xiaoyang Dong and Keting
                 Jia and Willi Meier",
  title =        "Practical Key-Recovery Attacks On Round-Reduced {Ketje
                 Jr}, {Xoodoo-AE} And {Xoodyak}",
  journal =      j-COMP-J,
  volume =       "63",
  number =       "8",
  pages =        "1231--1246",
  month =        aug,
  year =         "2020",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxz152",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Aug 25 18:11:58 MDT 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/63/8/1231/5709729",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Abdullah:2021:HAL,
  author =       "Fatima Abdullah and Dragi Kimovski and Kashif Munir",
  title =        "Handover authentication latency reduction using mobile
                 edge computing and mobility patterns",
  journal =      j-COMPUTING,
  volume =       "103",
  number =       "11",
  pages =        "2667--2686",
  month =        nov,
  year =         "2021",
  CODEN =        "CMPTA2",
  DOI =          "https://doi.org/10.1007/s00607-021-00969-z",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Mon May 9 09:55:42 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/computing.bib",
  URL =          "https://link.springer.com/article/10.1007/s00607-021-00969-z",
  acknowledgement = ack-nhfb,
  ajournal =     "Computing",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
}

@Article{Acar:2021:LPA,
  author =       "Abbas Acar and Shoukat Ali and Koray Karabina and
                 Cengiz Kaygusuz and Hidayet Aksu and Kemal Akkaya and
                 Selcuk Uluagac",
  title =        "A Lightweight {Privacy-Aware Continuous Authentication
                 Protocol} --- {PACA}",
  journal =      j-TOPS,
  volume =       "24",
  number =       "4",
  pages =        "24:1--24:28",
  month =        nov,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3464690",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Fri Oct 1 08:22:18 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3464690",
  abstract =     "As many vulnerabilities of one-time authentication
                 systems have already been uncovered, there is a growing
                 need and trend to adopt continuous authentication
                 systems. Biometrics provides an excellent means for
                 periodic verification of the authenticated \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Aceto:2021:DET,
  author =       "Giuseppe Aceto and Domenico Ciuonzo and Antonio
                 Montieri and Antonio Pescap{\'e}",
  title =        "{DISTILLER}: {Encrypted} traffic classification via
                 multimodal multitask deep learning",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "??",
  number =       "??",
  pages =        "??--??",
  month =        "????",
  year =         "2021",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2021.102985",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:44 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804521000126",
  acknowledgement = ack-nhfb,
  articleno =    "102985",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Akbari:2021:LBC,
  author =       "Iman Akbari and Mohammad A. Salahuddin and Leni Ven
                 and Noura Limam and Raouf Boutaba and Bertrand Mathieu
                 and Stephanie Moteau and Stephane Tuffin",
  title =        "A Look Behind the Curtain: Traffic Classification in
                 an Increasingly Encrypted {Web}",
  journal =      j-SIGMETRICS,
  volume =       "49",
  number =       "1",
  pages =        "23--24",
  month =        jun,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3543516.3453921",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Wed Jun 8 06:42:40 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3543516.3453921",
  abstract =     "Traffic classification is essential in network
                 management for operations ranging from capacity
                 planning, performance monitoring, volumetry, and
                 resource provisioning, to anomaly detection and
                 security. Recently, it has \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "https://dl.acm.org/loi/sigmetrics",
}

@Article{Akidau:2021:WSP,
  author =       "Tyler Akidau and Edmon Begoli and Slava Chernyak and
                 Fabian Hueske and Kathryn Knight and Kenneth Knowles
                 and Daniel Mills and Dan Sotolongo",
  title =        "Watermarks in stream processing systems: semantics and
                 comparative analysis of {Apache Flink} and {Google}
                 cloud dataflow",
  journal =      j-PROC-VLDB-ENDOWMENT,
  volume =       "14",
  number =       "12",
  pages =        "3135--3147",
  month =        jul,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.14778/3476311.3476389",
  ISSN =         "2150-8097",
  bibdate =      "Fri Oct 29 16:41:16 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
  URL =          "https://dl.acm.org/doi/10.14778/3476311.3476389",
  abstract =     "Streaming data processing is an exercise in taming
                 disorder: from oftentimes huge torrents of information,
                 we hope to extract powerful and timely analyses. But
                 when dealing with streaming data, the unbounded and
                 temporally disordered nature of real-. \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the VLDB Endowment",
  journal-URL =  "https://dl.acm.org/loi/pvldb",
}

@Article{Akmandor:2021:SSE,
  author =       "A. O. Akmandor and J. Ortiz and I. Manotas and B. Ko
                 and N. K. Jha",
  title =        "{SECRET}: Semantically Enhanced Classification of
                 Real-World Tasks",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "70",
  number =       "3",
  pages =        "440--456",
  year =         "2021",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2020.2989642",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Tue Feb 23 12:51:19 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Alam:2021:NNB,
  author =       "Manaar Alam and Arnab Bag and Debapriya Basu Roy and
                 Dirmanto Jap and Jakub Breier and Shivam Bhasin and
                 Debdeep Mukhopadhyay",
  title =        "Neural Network-based Inherently Fault-tolerant
                 Hardware Cryptographic Primitives without Explicit
                 Redundancy Checks",
  journal =      j-JETC,
  volume =       "17",
  number =       "1",
  pages =        "3:1--3:30",
  month =        jan,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3409594",
  ISSN =         "1550-4832",
  ISSN-L =       "1550-4832",
  bibdate =      "Fri Apr 30 06:39:29 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jetc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3409594",
  abstract =     "Fault injection-based cryptanalysis is one of the most
                 powerful practical threats to modern cryptographic
                 primitives. Popular countermeasures to such fault-based
                 attacks generally use some form of redundant
                 computation to detect and react/correct the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Journal on Emerging Technologies in Computing
                 Systems (JETC)",
  journal-URL =  "https://dl.acm.org/loi/jetc",
}

@Article{Alam:2021:VCS,
  author =       "Manaar Alam and Sarani Bhattacharya and Debdeep
                 Mukhopadhyay",
  title =        "Victims Can Be Saviors: a Machine Learning--based
                 Detection for Micro-Architectural Side-Channel
                 Attacks",
  journal =      j-JETC,
  volume =       "17",
  number =       "2",
  pages =        "14:1--14:31",
  month =        apr,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3439189",
  ISSN =         "1550-4832",
  ISSN-L =       "1550-4832",
  bibdate =      "Fri Apr 30 06:39:29 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jetc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3439189",
  abstract =     "Micro-architectural side-channel attacks are major
                 threats to the most mathematically sophisticated
                 encryption algorithms. In spite of the fact that there
                 exist several defense techniques, the overhead of
                 implementing the countermeasures remains a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Journal on Emerging Technologies in Computing
                 Systems (JETC)",
  journal-URL =  "https://dl.acm.org/loi/jetc",
}

@Article{Albeshri:2021:IHB,
  author =       "Aiiad Albeshri",
  title =        "An Image Hashing-Based Authentication and Secure Group
                 Communication Scheme for {IoT}-Enabled {MANETs}",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "7",
  pages =        "166",
  day =          "27",
  month =        jun,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13070166",
  ISSN =         "1999-5903",
  bibdate =      "Fri Jul 23 15:16:13 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/7/166",
  abstract =     "Mobile ad hoc networks (MANETs) play a highly
                 significant role in the Internet of Things (IoT) for
                 managing node mobility. MANET opens the pathway for
                 different IoT-based communication systems with
                 effective abilities for a variety of applications in
                 several domains. In IoT-based systems, it provides the
                 self-formation and self-connection of networks. A key
                 advantage of MANETs is that any device or node can
                 freely join or leave the network; however, this makes
                 the networks and applications vulnerable to security
                 attacks. Thus, authentication plays an essential role
                 in protecting the network or system from several
                 security attacks. Consequently, secure communication is
                 an important prerequisite for nodes in MANETs. The main
                 problem is that the node moving from one group to
                 another may be attacked on the way by misleading the
                 device to join the neighboring group. To address this,
                 in this paper, we present an authentication mechanism
                 based on image hashing where the network administrator
                 allows the crosschecking of the identity image of a
                 soldier (i.e., a node) in the joining group. We propose
                 the node joining and node migration algorithms where
                 authentication is involved to ensure secure
                 identification. The simulation tool NS-2 is employed to
                 conduct extensive simulations for extracting the
                 results from the trace files. The results demonstrate
                 the effectiveness of the proposed scheme based on the
                 memory storage communication overhead and computational
                 cost. In our scheme, the attack can be detected
                 effectively and also provides a highly robust
                 assurance.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/1999-5903/",
}

@Article{Alharbi:2021:SMI,
  author =       "Ahmed Alharbi and Hai Dong and Xun Yi and Zahir Tari
                 and Ibrahim Khalil",
  title =        "Social Media Identity Deception Detection: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "69:1--69:35",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3446372",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3446372",
  abstract =     "Social media have been growing rapidly and become
                 essential elements of many people's lives. Meanwhile,
                 social media have also come to be a popular source for
                 identity deception. Many social media identity
                 deception cases have arisen over the past few
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "69",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ali:2021:SEM,
  author =       "Guma Ali and Mussa Ally Dida and Anael Elikana Sam",
  title =        "A Secure and Efficient Multi-Factor Authentication
                 Algorithm for Mobile Money Applications",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "12",
  pages =        "299",
  day =          "25",
  month =        nov,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13120299",
  ISSN =         "1999-5903",
  bibdate =      "Wed Jan 19 05:45:14 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/12/299",
  abstract =     "With the expansion of smartphone and financial
                 technologies (FinTech), mobile money emerged to improve
                 financial inclusion in many developing nations. The
                 majority of the mobile money schemes used in these
                 nations implement two-factor authentication (2FA) as
                 the only means of verifying mobile money users. These
                 2FA schemes are vulnerable to numerous security attacks
                 because they only use a personal identification number
                 (PIN) and subscriber identity module (SIM). This study
                 aims to develop a secure and efficient multi-factor
                 authentication algorithm for mobile money applications.
                 It uses a novel approach combining PIN, a one-time
                 password (OTP), and a biometric fingerprint to enforce
                 extra security during mobile money authentication. It
                 also uses a biometric fingerprint and quick response
                 (QR) code to confirm mobile money withdrawal. The
                 security of the PIN and OTP is enforced by using secure
                 hashing algorithm-256 (SHA-256), a biometric
                 fingerprint by Fast IDentity Online (FIDO) that uses a
                 standard public key cryptography technique (RSA), and
                 Fernet encryption to secure a QR code and the records
                 in the databases. The evolutionary prototyping model
                 was adopted when developing the native mobile money
                 application prototypes to prove that the algorithm is
                 feasible and provides a higher degree of security. The
                 developed applications were tested, and a detailed
                 security analysis was conducted. The results show that
                 the proposed algorithm is secure, efficient, and highly
                 effective against the various threat models. It also
                 offers secure and efficient authentication and ensures
                 data confidentiality, integrity, non-repudiation, user
                 anonymity, and privacy. The performance analysis
                 indicates that it achieves better overall performance
                 compared with the existing mobile money systems.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Alizadeh:2021:STB,
  author =       "Mojtaba Alizadeh and Mohammad Hesam Tadayon and
                 Kouichi Sakurai and Hiroaki Anada and Alireza Jolfaei",
  title =        "A Secure Ticket-Based Authentication Mechanism for
                 Proxy Mobile {IPv6} Networks in Volunteer Computing",
  journal =      j-TOIT,
  volume =       "21",
  number =       "4",
  pages =        "82:1--82:16",
  month =        jul,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3407189",
  ISSN =         "1533-5399 (print), 1557-6051 (electronic)",
  ISSN-L =       "1533-5399",
  bibdate =      "Wed Sep 29 06:52:50 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toit.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3407189",
  abstract =     "Technology advances-such as improving processing
                 power, battery life, and communication
                 functionalities-contribute to making mobile devices an
                 attractive research area. In 2008, in order to manage
                 mobility, the Internet Engineering Task Force (IETF)
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "82",
  fjournal =     "ACM Transactions on Internet Technology (TOIT)",
  journal-URL =  "https://dl.acm.org/loi/toit",
}

@Article{Alkasasbeh:2021:WSH,
  author =       "Anas Ali Alkasasbeh and Fotios Spyridonis and
                 Gheorghita Ghinea",
  title =        "When Scents Help Me Remember My Password",
  journal =      j-TAP,
  volume =       "18",
  number =       "3",
  pages =        "16:1--16:18",
  month =        jul,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3469889",
  ISSN =         "1544-3558 (print), 1544-3965 (electronic)",
  ISSN-L =       "1544-3558",
  bibdate =      "Sat Aug 21 07:46:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3469889",
  abstract =     "Current authentication processes overwhelmingly rely
                 on audiovisual data, comprising images, text or audio.
                 However, the use of olfactory data (scents) has
                 remained unexploited in the authentication process,
                 notwithstanding their verified potential to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Transactions on Applied Perception (TAP)",
  journal-URL =  "https://dl.acm.org/loi/tap",
}

@Article{Alsahlani:2021:LIL,
  author =       "Ahmed Yaser Fahad Alsahlani and Alexandru Popa",
  title =        "{LMAAS-IoT}: {Lightweight} multi-factor authentication
                 and authorization scheme for real-time data access in
                 {IoT} cloud-based environment",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "192",
  number =       "??",
  pages =        "??--??",
  day =          "15",
  month =        oct,
  year =         "2021",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2021.103177",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Thu Jan 20 08:06:56 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804521001879",
  acknowledgement = ack-nhfb,
  articleno =    "103177",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Amanlou:2021:LSA,
  author =       "Sanaz Amanlou and Mohammad Kamrul Hasan and Khairul
                 Azmi Abu Bakar",
  title =        "Lightweight and secure authentication scheme for {IoT}
                 network based on publish-subscribe fog computing
                 model",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "199",
  number =       "??",
  pages =        "??--??",
  day =          "9",
  month =        nov,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108465",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:05 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621004175",
  acknowledgement = ack-nhfb,
  articleno =    "108465",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@TechReport{Andrysco:2021:SFP,
  author =       "Marc Andrysco and David Kohlbrenner and Keaton Mowery
                 and Ranjit Jhala and Sorin Lerner and Hovav Shacham",
  title =        "On Subnormal Floating Point and Abnormal Timing",
  type =         "Report",
  institution =  "Department of Computer Science and Engineering
                 University of California, San Diego",
  address =      "La Jolla, California, USA",
  pages =        "17",
  day =          "2",
  month =        jan,
  year =         "2021",
  bibdate =      "Fri Sep 06 10:04:19 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  abstract =     "We identify a timing channel in the floating point
                 instructions of modern x86 processors: the running time
                 of floating point addition and multiplication
                 instructions can vary by two orders of magnitude
                 depending on their operands. We develop a benchmark
                 measuring the timing variability of floating point
                 operations and report on its results. We use floating
                 point data timing variability to demonstrate practical
                 attacks on the security of the Firefox browser
                 (versions 23 through 27) and the Fuzz differentially
                 private database. Finally, we initiate the study of
                 mitigations to floating point data timing channels with
                 libfixedtimefixedpoint, a new fixed-point,
                 constant-time math library.\par

                 Modern floating point standards and implementations are
                 sophisticated, complex, and subtle, a fact that has not
                 been sufficiently recognized by the security community.
                 More work is needed to assess the implications of the
                 use of floating point instructions in security-relevant
                 software.",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:2021:BAB,
  author =       "Anonymous",
  title =        "Blockchain applications beyond the cryptocurrency
                 casino: The Punishment not Reward blockchain
                 architecture",
  journal =      j-CCPE,
  volume =       "33",
  number =       "1",
  pages =        "e5749:1--e5749:??",
  day =          "10",
  month =        jan,
  year =         "2021",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.5749",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Tue May 18 08:31:19 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
  onlinedate =   "03 April 2020",
}

@Article{Anonymous:2021:BPBa,
  author =       "Anonymous",
  title =        "The Big Picture: a Big Bet on Crypto",
  journal =      j-IEEE-SPECTRUM,
  volume =       "58",
  number =       "8",
  pages =        "12--13",
  month =        aug,
  year =         "2021",
  CODEN =        "IEESAM",
  DOI =          "https://doi.org/10.1109/MSPEC.2021.9502956",
  ISSN =         "0018-9235 (print), 1939-9340 (electronic)",
  ISSN-L =       "0018-9235",
  bibdate =      "Sat Aug 14 05:40:19 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeespectrum2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Spectrum",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
}

@Article{Anonymous:2021:DES,
  author =       "Anonymous",
  title =        "A Discussion of Election Security, Cryptography, and
                 Exceptional Access With {Michael Alan Specter}",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "19",
  number =       "6",
  pages =        "15--22",
  month =        nov # "\slash " # dec,
  year =         "2021",
  DOI =          "https://doi.org/10.1109/MSEC.2021.3107769",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Mon Jan 31 15:37:00 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
}

@Article{Applebaum:2021:CDS,
  author =       "Benny Applebaum and Barak Arkis and Pavel Raykov and
                 Prashant Nalini Vasudevan",
  title =        "Conditional Disclosure of Secrets: Amplification,
                 Closure, Amortization, Lower-bounds, and Separations",
  journal =      j-SIAM-J-COMPUT,
  volume =       "50",
  number =       "1",
  pages =        "32--67",
  month =        "????",
  year =         "2021",
  CODEN =        "SMJCAT",
  DOI =          "https://doi.org/10.1137/18M1217097",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  bibdate =      "Fri Mar 12 11:30:54 MST 2021",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/50/1;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
  onlinedate =   "January 2021",
}

@Article{Arapinis:2021:DSQ,
  author =       "Myrto Arapinis and Nikolaos Lamprou and Elham Kashefi
                 and Anna Pappa",
  title =        "Definitions and Security of Quantum Electronic
                 Voting",
  journal =      j-TQC,
  volume =       "2",
  number =       "1",
  pages =        "4:1--4:33",
  month =        apr,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3450144",
  ISSN =         "????",
  ISSN-L =       "????",
  bibdate =      "Thu Apr 15 14:54:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tqc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3450144",
  abstract =     "Recent advances indicate that quantum computers will
                 soon be reality. Motivated by this ever more realistic
                 threat for existing classical cryptographic protocols,
                 researchers have developed several schemes to resist
                 ``quantum attacks.'' In particular, for electronic
                 voting (e-voting), several schemes relying on
                 properties of quantum mechanics have been proposed.
                 However, each of these proposals comes with a different
                 and often not well-articulated corruption model, has
                 different objectives, and is accompanied by security
                 claims that are never formalized and are at best
                 justified only against specific attacks. To address
                 this, we propose the first formal security definitions
                 for quantum e-voting protocols. With these at hand, we
                 systematize and evaluate the security of previously
                 proposed quantum e-voting protocols; we examine the
                 claims of these works concerning privacy, correctness,
                 and verifiability, and if they are correctly attributed
                 to the proposed protocols. In all non-trivial cases, we
                 identify specific quantum attacks that violate these
                 properties. We argue that the cause of these failures
                 lies in the absence of formal security models and
                 references to the existing cryptographic literature.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Transactions on Quantum Computing (TQC)",
  journal-URL =  "https://dl.acm.org/loi/tqc",
}

@Article{Asharov:2021:SSE,
  author =       "Gilad Asharov and Moni Naor and Gil Segev and Ido
                 Shahaf",
  title =        "Searchable Symmetric Encryption: Optimal Locality in
                 Linear Space via Two-Dimensional Balanced Allocations",
  journal =      j-SIAM-J-COMPUT,
  volume =       "50",
  number =       "5",
  pages =        "1501--1536",
  month =        "????",
  year =         "2021",
  CODEN =        "SMJCAT",
  DOI =          "https://doi.org/10.1137/19M1303186",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  bibdate =      "Wed Jan 19 08:07:49 MST 2022",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/50/5;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
  onlinedate =   "January 2021",
}

@Article{Aydin:2021:HSC,
  author =       "Furkan Aydin and Aydin Aysu and Mohit Tiwari and
                 Andreas Gerstlauer and Michael Orshansky",
  title =        "Horizontal Side-Channel Vulnerabilities of
                 Post-Quantum Key Exchange and Encapsulation Protocols",
  journal =      j-TECS,
  volume =       "20",
  number =       "6",
  pages =        "110:1--110:22",
  month =        nov,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3476799",
  ISSN =         "1539-9087 (print), 1558-3465 (electronic)",
  ISSN-L =       "1539-9087",
  bibdate =      "Fri Dec 10 11:17:19 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tecs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3476799",
  abstract =     "Key exchange protocols and key encapsulation
                 mechanisms establish secret keys to communicate digital
                 information confidentially over public channels.
                 Lattice-based cryptography variants of these protocols
                 are promising alternatives given their quantum-.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "110",
  fjournal =     "ACM Transactions on Embedded Computing Systems",
  journal-URL =  "https://dl.acm.org/loi/tecs",
}

@Book{Bauer:2021:SHS,
  author =       "Craig P. Bauer",
  title =        "Secret History: the Story of Cryptology",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  edition =      "Second",
  pages =        "xxv + 614",
  year =         "2021",
  DOI =          "https://doi.org/10.1201/9781315162539",
  ISBN =         "1-315-16253-9 (e-book), 1-351-66848-X (e-book),
                 1-351-66849-8 (e-book), 1-351-66850-1 (e-book)",
  ISBN-13 =      "978-1-138-06123-1 (hardcover), 978-1-315-16253-9
                 (e-book), 978-1-351-66848-4 (e-book), 978-1-351-66849-1
                 (e-book), 978-1-351-66850-7 (e-book)",
  LCCN =         "QA76.9.A25 B38 2021",
  bibdate =      "Sat Jan 25 13:35:36 MST 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  series =       "Discrete mathematics and its applications",
  URL =          "https://api.pageplace.de/preview/DT0400.9781351668507_A40887288/preview-9781351668507_A40887288.pdf",
  abstract =     "The first edition of this award-winning book attracted
                 a wide audience. This second edition is both a joy to
                 read and a useful classroom tool. Unlike traditional
                 textbooks, it requires no mathematical prerequisites
                 and can be read around the mathematics presented. If
                 used as a textbook, the mathematics can be prioritized,
                 with a book both students and instructors will enjoy
                 reading. Secret History: The Story of Cryptology,
                 Second Edition incorporates new material concerning
                 various eras in the long history of cryptology. Much
                 has happened concerning the political aspects of
                 cryptology since the first edition appeared. The still
                 unfolding story is updated here. The first edition of
                 this book contained chapters devoted to the cracking of
                 German and Japanese systems during World War II. Now
                 the other side of this cipher war is also told, that
                 is, how the United States was able to come up with
                 systems that were never broken. The text is in two
                 parts. Part I presents classic cryptology from ancient
                 times through World War II. Part II examines modern
                 computer cryptology. With numerous real-world examples
                 and extensive references, the author skillfully
                 balances the history with mathematical details,
                 providing readers with a sound foundation in this
                 dynamic field.\par

                 Presents a chronological development of key concepts.
                 Includes the Vigen{\`e}re cipher, the one-time pad,
                 transposition ciphers, Jefferson's wheel cipher,
                 Playfair cipher, ADFGX, matrix encryption, Enigma,
                 Purple, and other classic methods. Looks at the work of
                 Claude Shannon, the origin of the National Security
                 Agency, elliptic curve cryptography, the Data
                 Encryption Standard, the Advanced Encryption Standard,
                 public-key cryptography, and many other topics. New
                 chapters detail SIGABA and SIGSALY, successful systems
                 used during World War II for text and speech,
                 respectively. Includes quantum cryptography and the
                 impact of quantum computers.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Part I Classical Cryptology \\
                 1 Monoalphabetic Substitution Ciphers, or MASCs:
                 Disguises for Messages / 3 \\
                 3 Transposition Ciphers / 107 \\
                 4 Shakespeare, Jefferson, and JFK / 129 \\
                 5 World War I and Herbert O. Yardley / 163 \\
                 7 World War II: The Enigma of Germany / 217 \\
                 8 Cryptologic War against Japan / 261 \\
                 9 SIGABA: World War II Defense / 291 \\
                 10 Enciphering Speech / 309 \\
                 \\
                 Part II Modern Cryptology \\
                 11 Claude Shannon / 327 \\
                 12 National Security Agency / 345 \\
                 13 The Data Encryption Standard / 379 \\
                 14 The Birth of Public Key Cryptography / 413 \\
                 15 Attacking RSA / 435 \\
                 16 Primality Testing and Complexity Theory / 465 \\
                 17 Authenticity / 493 \\
                 18 Pretty Good Privacy and Bad Politics / 509 \\
                 19 Stream Ciphers / 533 \\
                 20 Suite B All-Stars / 545 \\
                 21 Toward Tomorrow / 569 \\
                 \\
                 Index / 589",
  subject =      "Data encryption (Computer science); Computer security;
                 Cryptography; History; Ciphers; Chiffrement
                 (Informatique); S{\'e}curit{\'e} informatique;
                 Cryptographie; Histoire; Chiffres (Cryptographie);
                 ciphers (codes); COMPUTERS; Cryptography; MATHEMATICS;
                 General; Recreations and Games; Ciphers; Computer
                 security; Cryptography; Data encryption (Computer
                 science)",
  tableofcontents = "Part I Classical Cryptology \\
                 1 Monoalphabetic Substitution Ciphers, or MASCs:
                 Disguises for Messages / 3 \\
                 1.1 Caveman Crypto / 3 \\
                 1.2 Greek Cryptography / 4 \\
                 1.2.1 The Skytale Cipher / 4 \\
                 1.2.2 The Polybius Cipher / 5 \\
                 1.3 Viking Cryptography / 6 \\
                 1.4 Early Steganography / 7 \\
                 1.5 Caesar Cipher / 7 \\
                 1.6 Other MASC Systems / 8 \\
                 1.7 Edgar Allan Poe / 11 \\
                 1.8 Arthur Conan Doyle / 14 \\
                 1.9 Frequency Analysis / 17 \\
                 1.10 Biblical Cryptology / 19 \\
                 1.11 More Frequencies and Pattern Words / 20 \\
                 1.12 Vowel Recognition Algorithms / 23 \\
                 1.12.1 Sukhotin's Method / 24 \\
                 1.13 More MASCs / 26 \\
                 1.14 Cryptanalysis of a MASC / 29 \\
                 1.15 Ciphers by a Killer and a Composer / 31 \\
                 1.16 Affine Ciphers / 33 \\
                 1.17 Morse Code and Huffman Coding / 37 \\
                 1.18 MASC Miscellanea / 42 \\
                 1.19 Nomenclators / 44 \\
                 1.20 Cryptanalysis of Nomenclators / 47 \\
                 1.21 Book Codes / 48 \\
                 References and Further Reading / 51 \\
                 2 Simple Progression to an Unbreakable Cipher / 59 \\
                 2.1 The Vigen{\`e}re Cipher / 59 \\
                 2.2 History of the Vigen{\`e}re Cipher / 61 \\
                 2.3 Cryptanalysis of the Vigen{\`e}re Cipher / 66 \\
                 2.4 Kryptos / 75 \\
                 2.5 Autokeys / 79 \\
                 2.6 The Running Key Cipher and Its Cryptanalysis / 80
                 \\
                 2.7 The One-Time Pad or Vernam Cipher / 92 \\
                 2.8 Breaking the Unbreakable / 96 \\
                 2.9 Faking Randomness / 98 \\
                 2.10 An Unsolved Cipher from 1915 / 101 \\
                 2.11 OTPs and the SOE / 101 \\
                 2.12 History Rewritten! / 102 \\
                 References and Further Reading / 103 \\
                 3 Transposition Ciphers / 107 \\
                 3.1 Simple Rearrangements and Columnar Transposition /
                 107 \\
                 3.1.1 Rail-Fence Transposition / 107 \\
                 3.1.2 Rectangular Transposition / 108 \\
                 3.1.3 More Transposition Paths / 110 \\
                 3.2 Cryptanalysis of Columnar Transposition / 111 \\
                 3.3 Historic Uses / 114 \\
                 3.4 Anagrams / 117 \\
                 3.5 Double Transposition / 119 \\
                 3.6 Word Transposition / 120 \\
                 3.6.1 Civil War Reenactors / 122 \\
                 3.7 Transposition Devices / 122 \\
                 References and Further Reading / 126 \\
                 4 Shakespeare, Jefferson, and JFK / 129 \\
                 4.1 Shakespeare vs. Bacon / 129 \\
                 4.2 Thomas Jefferson: President, Cryptographer / 134
                 \\
                 4.3 Wheel Cipher Cryptanalysis / 138 \\
                 4.4 The Playfair Cipher / 147 \\
                 4.5 Playfair Cryptanalysis / 152 \\
                 4.5.1 Computer Cryptanalysis / 156 \\
                 4.6 Kerckhoffs's Rules / 157 \\
                 References and Further Reading / 158 \\
                 5 World War I and Herbert O. Yardley / 163 \\
                 5.1 The Zimmermann Telegram / 163 \\
                 5.2 ADFGX: A New Kind of Cipher / 166 \\
                 5.3 Cryptanalysis of ADFGX / 168 \\
                 5.4 Herbert O. Yardley / 182 \\
                 5.5 Peacetime Victory and a Tell-All Book / 185 \\
                 5.6 The Case of the Seized Manuscript / 187 \\
                 5.7 Cashing In, Again / 188 \\
                 5.8 Herbert O. Yardley --- Traitor? / 190 \\
                 5.9 Censorship / 192 \\
                 References and Further Reading / 195 \\
                 6 Matrix Encryption / 199 \\
                 6.1 Levine and Hill / 199 \\
                 6.2 How Matrix Encryption Works / 201 \\
                 6.3 Levine's Attacks / 204 \\
                 6.4 Bauer and Millward's Attack / 207 \\
                 6.5 More Stories Left to Tell / 212 \\
                 References and Further Reading / 213 \\
                 7 World War II: The Enigma of Germany / 217 \\
                 7.1 Rise of the Machines / 217 \\
                 7.2 How Enigma Works / 220 \\
                 7.3 Calculating the Keyspace / 225 \\
                 7.4 Cryptanalysis Part 1: Recovering the Rotor Wirings
                 / 226 \\
                 7.5 Cryptanalysis Part 2: Recovering the Daily Keys /
                 243 \\
                 7.6 After the Break / 246 \\
                 7.7 Alan Turing and Bletchley Park / 247 \\
                 7.8 The Lorenz Cipher and Colossus / 252 \\
                 7.9 What If Enigma Had Never Been Broken? / 253 \\
                 7.10 Endings and New Beginnings / 255 \\
                 References and Further Reading / 257 \\
                 8 Cryptologic War against Japan / 261 \\
                 8.1 Forewarning of Pearl Harbor? / 261 \\
                 8.2 Friedman's Team Assembles / 263 \\
                 8.3 Cryptanalysis of Red, a Japanese Diplomatic Cipher
                 / 264 \\
                 8.3.1 Orange / 267 \\
                 8.4 Purple --- How It Works / 268 \\
                 8.5 Purple Cryptanalysis / 270 \\
                 8.6 Practical Magic / 273 \\
                 8.7 Code Talkers / 276 \\
                 8.8 Code Talkers in Hollywood / 283 \\
                 8.9 Use of Languages as Oral Codes / 285 \\
                 References and Further Reading / 286 \\
                 9 SIGABA: World War II Defense / 291 \\
                 9.1 The Mother of Invention / 291 \\
                 9.2 Making the Rotors / 294 \\
                 9.3 Anatomy of a Success / 297 \\
                 9.4 SIGABA Production / 301 \\
                 9.5 Keyspace and Modern Cryptanalysis / 302 \\
                 9.6 Missing or Captured Machines? / 304 \\
                 9.7 The End of SIGABA / 305 \\
                 References and Further Reading / 307 \\
                 10 Enciphering Speech / 309 \\
                 10.1 Early Voice Encryption / 309 \\
                 10.2 The Cost of Insecurity / 311 \\
                 10.3 SIGSALY --- A Solution from the Past Applied to
                 Speech / 311 \\
                 10.4 Plan B / 319 \\
                 10.5 SIGSALY in Action / 320 \\
                 10.6 SIGSALY Retires / 322 \\
                 10.7 Voice vs. Text / 323 \\
                 References and Further Reading / 324 \\
                 \\
                 Part II Modern Cryptology \\
                 11 Claude Shannon / 327 \\
                 11.1 About Claude Shannon / 327 \\
                 11.2 Measuring Information / 327 \\
                 11.3 One More Time / 332 \\
                 11.4 Unicity Points / 335 \\
                 11.5 Dazed and Confused / 335 \\
                 11.6 Entropy in Religion / 336 \\
                 11.7 Entropy in Literature / 337 \\
                 References and Further Reading / 339 \\
                 12 National Security Agency / 345 \\
                 12.1 Origins of NSA / 346 \\
                 12.2 TEMPEST / 347 \\
                 12.3 Size and Budget / 348 \\
                 12.4 The Liberty and the Pueblo / 349 \\
                 12.5 The Church Committee Investigations / 352 \\
                 12.6 Post Cold War Downsizing / 355 \\
                 12.7 The Crypto AG Connection / 356 \\
                 12.8 2000 and Beyond / 360 \\
                 12.9 Interviewing with NSA / 362 \\
                 12.10 Another Betrayal / 364 \\
                 12.11 NSA and the Media / 370 \\
                 12.12 BRUSA, UKUSA, and Echelon / 372 \\
                 References and Further Reading / 374 \\
                 13 The Data Encryption Standard / 379 \\
                 13.1 How DES Works / 379 \\
                 13.2 Reactions to and Cryptanalysis of DES / 390 \\
                 13.2.1 Objection 1: Key Size Matters / 390 \\
                 13.2.2 Objection 2: S-Box Secrecy / 393 \\
                 13.2.3 S-Boxes Revealed! / 394 \\
                 13.3 EFF vs. DES / 395 \\
                 13.4 A Second Chance / 397 \\
                 13.5 An Interesting Feature / 399 \\
                 13.5.1 Cryptologic Humor / 401 \\
                 13.6 Modes of Encryption / 401 \\
                 13.6.1 Levine's Methods / 402 \\
                 13.6.2 Modern Modes / 403 \\
                 13.6.2.1 Electronic Code Book Mode / 403 \\
                 13.6.2.2 Cipher Block Chaining Mode / 403 \\
                 13.6.2.3 Cipher Feedback Mode / 404 \\
                 13.6.2.4 Output Feedback Mode / 405 \\
                 13.6.2.5 Counter Mode / 406 \\
                 13.6.2.6 Offset Codebook Mode / 406 \\
                 References and Further Reading / 409 \\
                 14 The Birth of Public Key Cryptography / 413 \\
                 14.1 A Revolutionary Cryptologist / 413 \\
                 14.2 Diffie--Hellman Key Exchange / 414 \\
                 14.3 RSA: A Solution from MIT / 417 \\
                 14.3.1 Fermat's Little Theorem (1640) / 418 \\
                 14.3.2 The Euclidean Algorithm / 419 \\
                 14.4 Government Control of Cryptologic Research / 423
                 \\
                 14.5 RSA Patented; Alice and Bob Born Free / 430 \\
                 14.6 History Rewritten / 432 \\
                 References and Further Reading / 433 \\
                 15 Attacking RSA / 435 \\
                 15.1 A Dozen Non-Factoring Attacks / 435 \\
                 15.1.1 Attack 1. Common Modulus Attack / 435 \\
                 15.1.2 Attack 2. Man-in-the-Middle / 436 \\
                 15.1.3 Attack 3. Low Decryption Exponent / 437 \\
                 15.1.4 Attack 4. Partial Knowledge of p or q / 439 \\
                 15.1.5 Attack 5. Partial Knowledge of d / 439 \\
                 15.1.6 Attack 6. Low Encryption Exponent Attack / 439
                 \\
                 15.1.7 Attack 7. Common Enciphering Exponent Attack /
                 439 \\
                 15.1.7.1 The Chinese Remainder Theorem / 440 \\
                 15.1.8 Attack 8. Searching the Message Space / 442 \\
                 15.1.9 Attack 9. Adaptive Chosen Ciphertext Attacks /
                 442 \\
                 15.1.10 Attack 10. Timing Attack / 443 \\
                 15.1.11 Attack 11. Textbook RSA Attack / 444 \\
                 15.1.12 Attack 12. Ron Was Wrong, Whit Is Right Attack
                 / 444 \\
                 15.2 A Factoring Challenge / 446 \\
                 15.2.1 An Old Problem / 447 \\
                 15.3 Trial Division and the Sieve of Eratosthenes (c.
                 284--204 BCE) / 447 \\
                 15.4 Fermat's Factorization Method / 450 \\
                 15.5 Euler's Factorization Method / 451 \\
                 15.6 Pollard's $p - 1$ Algorithm / 453 \\
                 15.7 Dixon's Algorithm / 454 \\
                 15.7.1 The Quadratic Sieve / 459 \\
                 15.8 Pollard's Number Field Sieve / 461 \\
                 15.8.1 Other Methods / 461 \\
                 15.8.2 Cryptological Humor / 462 \\
                 References and Further Reading / 462 \\
                 16 Primality Testing and Complexity Theory / 465 \\
                 16.1 Some Facts about Primes / 465 \\
                 16.2 The Fermat Test / 468 \\
                 16.3 The Miller--Rabin Test / 470 \\
                 16.3.1 Generating Primes / 473 \\
                 16.4 Deterministic Tests for Primality / 473 \\
                 16.4.1 The AKS Primality Test (2002) / 473 \\
                 16.4.2 GIMPS / 476 \\
                 16.5 Complexity Classes, P vs. NP, and Probabilistic
                 vs. Deterministic / 477 \\
                 16.5.1 Cryptologic Humor / 479 \\
                 16.6 Ralph Merkle's Public Key Systems / 479 \\
                 16.7 Knapsack Encryption / 483 \\
                 16.8 Elgamal Encryption / 486 \\
                 References and Further Reading / 488 \\
                 17 Authenticity / 493 \\
                 17.1 A Problem from World War II / 493 \\
                 17.2 Digital Signatures (and Some Attacks) / 495 \\
                 17.2.1 Attack 13. Chosen Ciphertext Attack / 495 \\
                 17.2.2 Attack 14. Insider's Factoring Attack on the
                 Common Modulus / 496 \\
                 17.2.3 Attack 15. Insider's Nonfactoring Attack / 497
                 \\
                 17.2.4 Elgamal Signatures / 497 \\
                 17.3 Hash Functions: Speeding Things Up / 498 \\
                 17.3.1 Rivest's MD5 and NIST's SHA-1, SHA-2, and SHA-3
                 / 499 \\
                 17.3.2 Hash Functions and Passwords / 500 \\
                 17.4 The Digital Signature Algorithm / 504 \\
                 References and Further Reading / 506 \\
                 18 Pretty Good Privacy and Bad Politics / 509 \\
                 18.1 The Best of Both Worlds / 509 \\
                 18.2 The Birth of PGP / 510 \\
                 18.3 In Zimmermann's Own Words / 514 \\
                 18.4 The Impact of PGP / 518 \\
                 18.5 Password Issues / 518 \\
                 18.6 History Repeats Itself / 520 \\
                 18.7 A Terrorist and an iPhone / 521 \\
                 18.8 Another Terrorist and Another iPhone / 528 \\
                 18.9 Yet Another Attempt at Anti-Crypto Legislation /
                 530 \\
                 References and Further Reading / 531 \\
                 19 Stream Ciphers / 533 \\
                 19.1 Congruential Generators / 533 \\
                 19.2 Linear Feedback Shift Registers / 535 \\
                 19.3 LFSR Attack / 537 \\
                 19.4 Cell Phone Stream Cipher A5/1 / 538 \\
                 19.5 RC4 / 539 \\
                 References and Further Reading / 541 \\
                 20 Suite B All-Stars / 545 \\
                 20.1 Elliptic Curve Cryptography / 545 \\
                 20.1.1 Elgamal, ECC Style / 551 \\
                 20.2 Personalities behind ECC / 552 \\
                 20.3 The Advanced Encryption Standard (AES) / 554 \\
                 20.3.1 SubBytes / 556 \\
                 20.3.2 ShiftRows / 559 \\
                 20.3.3 MixColumns / 560 \\
                 20.3.4 AddRoundKey / 561 \\
                 20.3.5 Putting It All Together: How AES-128 Works / 563
                 \\
                 20.4 AES Attacks / 563 \\
                 20.5 Security Guru Bruce Schneier / 564 \\
                 References and Further Reading / 565 \\
                 21 Toward Tomorrow / 569 \\
                 21.1 Quantum Cryptography: How It Works / 569 \\
                 21.2 Quantum Cryptography: Historical Background / 571
                 \\
                 21.3 Quantum Computers and Quantum Distributed Key
                 Networks / 576 \\
                 21.4 NSA Weighs In / 577 \\
                 21.5 NIST Responds / 578 \\
                 21.6 Predictions / 579 \\
                 21.7 DNA Computing / 579 \\
                 References and Further Reading / 584 \\
                 Index / 589",
}

@Article{Begum:2021:UAB,
  author =       "Nasima Begum and Md Azim Hossain Akash and Sayma
                 Rahman and Jungpil Shin and Md Rashedul Islam and Md
                 Ezharul Islam",
  title =        "User Authentication Based on Handwriting Analysis of
                 Pen-Tablet Sensor Data Using Optimal Feature Selection
                 Model",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "9",
  pages =        "231",
  day =          "06",
  month =        sep,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13090231",
  ISSN =         "1999-5903",
  bibdate =      "Tue Sep 28 10:43:54 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/9/231",
  abstract =     "Handwriting analysis is playing an important role in
                 user authentication or online writer identification for
                 more than a decade. It has a significant role in
                 different applications such as e-security, signature
                 biometrics, e-health, gesture analysis, diagnosis
                 system of Parkinson's disease,
                 Attention-deficit/hyperactivity disorders, analysis of
                 vulnerable people (stressed, elderly, or drugged),
                 prediction of gender, handedness and so on. Classical
                 authentication systems are image-based, text-dependent,
                 and password or fingerprint-based where the former one
                 has the risk of information leakage. Alternatively,
                 image processing and pattern-analysis-based systems are
                 vulnerable to camera attributes, camera frames, light
                 effect, and the quality of the image or pattern. Thus,
                 in this paper, we concentrate on real-time and
                 context-free handwriting data analysis for robust user
                 authentication systems using digital pen-tablet sensor
                 data. Most of the state-of-the-art authentication
                 models show suboptimal performance for improper
                 features. This research proposed a robust and efficient
                 user identification system using an optimal feature
                 selection technique based on the features from the
                 sensor's signal of pen and tablet devices. The proposed
                 system includes more genuine and accurate numerical
                 data which are used for features extraction model based
                 on both the kinematic and statistical features of
                 individual handwritings. Sensor data of digital
                 pen-tablet devices generate high dimensional feature
                 vectors for user identification. However, all the
                 features do not play equal contribution to identify a
                 user. Hence, to find out the optimal features, we
                 utilized a hybrid feature selection model. Extracted
                 features are then fed to the popular machine learning
                 (ML) algorithms to generate a nonlinear classifier
                 through training and testing phases. The experimental
                 result analysis shows that the proposed model achieves
                 more accurate and satisfactory results which ensure the
                 practicality of our system for user identification with
                 low computational cost.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Beierle:2021:CGE,
  author =       "Christof Beierle and Patrick Derbez and Gregor Leander
                 and Ga{\"e}tan Leurent and H{\aa}vard Raddum and Yann
                 Rotella and David Rupprecht and Lukas Stennes",
  title =        "Cryptanalysis of the {GPRS} Encryption Algorithms
                 {GEA-1} and {GEA-2}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "12697",
  pages =        "155--183",
  year =         "2021",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/978-3-030-77886-6_6",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Jun 22 16:23:55 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://ia.cr/2021/819",
  abstract =     "This paper presents the first publicly available
                 cryptanalytic attacks on the GEA-1 and GEA-2
                 algorithms. Instead of providing full 64-bit security,
                 we show that the initial state of GEA-1 can be
                 recovered from as little as 65 bits of known keystream
                 (with at least 24 bits coming from one frame) in time $
                 2^{40} $ GEA-1 evaluations and using 44.5 GiB of
                 memory. The attack on GEA-1 is based on an exceptional
                 interaction of the deployed LFSRs and the key
                 initialization, which is highly unlikely to occur by
                 chance. This unusual pattern indicates that the
                 weakness is intentionally hidden to limit the security
                 level to 40 bit by design.

                 In contrast, for GEA-2 we did not discover the same
                 intentional weakness. However, using a combination of
                 algebraic techniques and list merging algorithms we are
                 still able to break GEA-2 in time $ 2^{45.1} $ GEA-2
                 evaluations. The main practical hurdle is the required
                 knowledge of 1600 bytes of keystream.",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "IACR-EUROCRYPT-2021 conference",
  remark =       "The GEA-1 encryption algorithm used in European mobile
                 phones in 2G networks from the 1990s was intentionally
                 weakened, ostensibly because of ``export regulations''.
                 Algorithm fallback to GEA-1 in some modern mobile
                 phones reintroduces the weakness.",
}

@Article{Beirendonck:2021:SCR,
  author =       "Michiel {Van Beirendonck} and Jan-Pieter D'anvers and
                 Angshuman Karmakar and Josep Balasch and Ingrid
                 Verbauwhede",
  title =        "A Side-Channel-Resistant Implementation of {SABER}",
  journal =      j-JETC,
  volume =       "17",
  number =       "2",
  pages =        "10:1--10:26",
  month =        apr,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3429983",
  ISSN =         "1550-4832",
  ISSN-L =       "1550-4832",
  bibdate =      "Fri Apr 30 06:39:29 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jetc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3429983",
  abstract =     "The candidates for the NIST Post-Quantum Cryptography
                 standardization have undergone extensive studies on
                 efficiency and theoretical security, but research on
                 their side-channel security is largely lacking. This
                 remains a considerable obstacle for their \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Journal on Emerging Technologies in Computing
                 Systems (JETC)",
  journal-URL =  "https://dl.acm.org/loi/jetc",
}

@Article{Bellini:2021:GLA,
  author =       "Emanuele Bellini and Nadir Murru and Antonio J. {Di
                 Scala} and Michele Elia",
  title =        "Group law on affine conics and applications to
                 cryptography",
  journal =      j-APPL-MATH-COMP,
  volume =       "409",
  number =       "??",
  pages =        "Article 125537",
  day =          "15",
  month =        nov,
  year =         "2021",
  CODEN =        "AMHCBQ",
  DOI =          "https://doi.org/10.1016/j.amc.2020.125537",
  ISSN =         "0096-3003 (print), 1873-5649 (electronic)",
  ISSN-L =       "0096-3003",
  bibdate =      "Mon Jan 31 07:58:57 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/applmathcomput2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0096300320304938",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Mathematics and Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00963003",
}

@Article{Binbeshr:2021:SRH,
  author =       "Farid Binbeshr and Amirrudin Kamsin and Manal
                 Mohammed",
  title =        "A Systematic Review on Hadith Authentication and
                 Classification Methods",
  journal =      j-TALLIP,
  volume =       "20",
  number =       "2",
  pages =        "34:1--34:17",
  month =        apr,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3434236",
  ISSN =         "2375-4699 (print), 2375-4702 (electronic)",
  ISSN-L =       "2375-4699",
  bibdate =      "Thu May 6 07:32:43 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tallip.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3434236",
  abstract =     "Background: A hadith refers to sayings, actions, and
                 characteristics of the Prophet Muhammad peace be upon
                 him. The authenticity of hadiths is crucial, because
                 they constitute the source of legislation for Muslims
                 with the Holy Quran. Classifying hadiths \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Transactions on Asian and Low-Resource Language
                 Information Processing (TALLIP)",
  journal-URL =  "https://dl.acm.org/loi/tallip",
}

@Article{Biswas:2021:CSI,
  author =       "Arnab Kumar Biswas",
  title =        "Cryptographic Software {IP} Protection without
                 Compromising Performance or Timing Side-channel
                 Leakage",
  journal =      j-TACO,
  volume =       "18",
  number =       "2",
  pages =        "20:1--20:20",
  month =        mar,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3443707",
  ISSN =         "1544-3566 (print), 1544-3973 (electronic)",
  ISSN-L =       "1544-3566",
  bibdate =      "Sat Mar 20 17:25:10 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/taco.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3443707",
  abstract =     "Program obfuscation is a widely used cryptographic
                 software intellectual property (IP) protection
                 technique against reverse engineering attacks in
                 embedded systems. However, very few works have studied
                 the impact of combining various obfuscation techniques
                 on the obscurity (difficulty of reverse engineering)
                 and performance (execution time) of obfuscated
                 programs. In this article, we propose a Genetic
                 Algorithm (GA)-based framework that not only optimizes
                 obscurity and performance of obfuscated cryptographic
                 programs, but it also ensures very low timing
                 side-channel leakage. Our proposed Timing Side Channel
                 Sensitive Program Obfuscation Optimization Framework
                 (TSC-SPOOF) determines the combination of obfuscation
                 transformation functions that produce optimized
                 obfuscated programs with preferred optimization
                 parameters. In particular, TSC-SPOOF employs normalized
                 compression distance (NCD) and channel capacity to
                 measure obscurity and timing side-channel leakage,
                 respectively. We also use RISC-V rocket core running on
                 a Xilinx Zynq FPGA device as part of our framework to
                 obtain realistic results. The experimental results
                 clearly show that our proposed solution leads to
                 cryptographic programs with lower execution time,
                 higher obscurity, and lower timing side-channel leakage
                 than unguided obfuscation.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Transactions on Architecture and Code Optimization
                 (TACO)",
  journal-URL =  "https://dl.acm.org/loi/taco",
}

@Article{Blazy:2021:HSS,
  author =       "Olivier Blazy and Laura Brouilhet and Celine Chevalier
                 and Patrick Towa and Ida Tucker and Damien Vergnaud",
  title =        "Hardware security without secure hardware: {How} to
                 decrypt with a password and a server",
  journal =      j-THEOR-COMP-SCI,
  volume =       "895",
  number =       "??",
  pages =        "178--211",
  day =          "4",
  month =        dec,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.09.042",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Jan 26 14:23:24 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521005776",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Book{Bos:2021:CCA,
  editor =       "Joppe W. Bos and Martijn Stam",
  title =        "Computational Cryptography: Algorithmic Aspects of
                 Cryptology",
  volume =       "469",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xii + 387",
  year =         "2021",
  DOI =          "https://doi.org/10.1017/9781108854207",
  ISBN =         "1-108-79593-5 (paperback), 1-108-85420-6",
  ISBN-13 =      "978-1-108-79593-7 (paperback), 978-1-108-85420-7",
  LCCN =         "QA268 .C693 2021",
  bibdate =      "Thu Jan 6 11:01:22 MST 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  series =       "London Mathematical Society lecture note series",
  abstract =     "The area of computational cryptography is dedicated to
                 the development of effective methods in algorithmic
                 number theory that improve implementation of
                 cryptosystems or further their cryptanalysis. This book
                 is a tribute to Arjen K. Lenstra, one of the key
                 contributors to the field, on the occasion of his 65th
                 birthday, covering his best-known scientific
                 achievements in the field. Students and security
                 engineers will appreciate this no-nonsense introduction
                 to the hard mathematical problems used in cryptography
                 and on which cybersecurity is built, as well as the
                 overview of recent advances on how to solve these
                 problems from both theoretical and practical applied
                 perspectives. Beginning with polynomials, the book
                 moves on to the celebrated Lenstra--Lenstra--Lov{\'a}sz
                 lattice reduction algorithm, and then progresses to
                 integer factorization and the impact of these methods
                 to the selection of strong cryptographic keys for usage
                 in widely used standards.",
  acknowledgement = ack-nhfb,
  remark =       "Title from publisher's bibliographic system (viewed on
                 11 Nov 2021).",
  subject =      "Cryptography",
  tableofcontents = "List of Contributors / x--x \\
                 Preface \\
                 Preface / xi--xii \\
                 1: Introduction / 1--12 \\
                 Part I: Cryptanalysis / 13--14 \\
                 2: Lattice Attacks on NTRU and LWE: A History of
                 Refinements / 15--40 \\
                 3: History of Integer Factorisation / 41--77 \\
                 4: Lattice--Based Integer Factorisation: An
                 Introduction to Coppersmith's Method / 78--105 \\
                 5: Computing Discrete Logarithms / 106--139 \\
                 6: RSA, DH and DSA in the Wild / 140--181 \\
                 7: A Survey of Chosen-Prefix Collision Attacks /
                 182--220 \\
                 Part II: Implementations / 221--222 \\
                 8: Efficient Modular Arithmetic / 223--250 \\
                 9: Arithmetic Software Libraries / 251--292 \\
                 10: XTR and Tori / 293--313 \\
                 11: History of Cryptographic Key Sizes / 314--334 \\
                 References / 335--382 \\
                 Index / 383--388",
}

@Article{Boyd:2021:MVF,
  author =       "Colin Boyd and Kai Gellert",
  title =        "A Modern View on Forward Security",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "4",
  pages =        "639--652",
  month =        apr,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa104",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Apr 23 10:21:15 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/4/639/5896207",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Braeken:2021:DDG,
  author =       "An Braeken",
  title =        "Device-to-device group authentication compatible with
                 {5G} {AKA} protocol",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "201",
  number =       "??",
  pages =        "??--??",
  day =          "24",
  month =        dec,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108575",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:06 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621004850",
  acknowledgement = ack-nhfb,
  articleno =    "108575",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Brakerski:2021:CTQ,
  author =       "Zvika Brakerski and Paul Christiano and Urmila Mahadev
                 and Umesh Vazirani and Thomas Vidick",
  title =        "A Cryptographic Test of Quantumness and Certifiable
                 Randomness from a Single Quantum Device",
  journal =      j-J-ACM,
  volume =       "68",
  number =       "5",
  pages =        "31:1--31:47",
  month =        oct,
  year =         "2021",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/3441309",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Jan 27 06:13:15 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3441309",
  abstract =     "We consider a new model for the testing of untrusted
                 quantum devices, consisting of a single polynomial time
                 bounded quantum device interacting with a classical
                 polynomial time verifier. In this model, we propose
                 solutions to two tasks-a protocol for \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Butler:2021:FVP,
  author =       "D. Butler and A. Lochbihler and A. Gasc{\'o}n",
  title =        "Formalising {$ \Sigma $}-Protocols and Commitment
                 Schemes Using {CryptHOL}",
  journal =      j-J-AUTOM-REASON,
  volume =       "65",
  number =       "4",
  pages =        "521--567",
  month =        apr,
  year =         "2021",
  CODEN =        "JAREEW",
  DOI =          "https://doi.org/10.1007/s10817-020-09581-w",
  ISSN =         "0168-7433 (print), 1573-0670 (electronic)",
  ISSN-L =       "0168-7433",
  bibdate =      "Fri May 14 09:58:05 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jautomreason.bib",
  URL =          "https://link.springer.com/article/10.1007/s10817-020-09581-w",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Automated Reasoning",
  journal-URL =  "http://link.springer.com/journal/10817",
  online-date =  "Published: 09 September 2020 Pages: 521 - 567",
}

@Article{Camacho-Ruiz:2021:TOH,
  author =       "Eros Camacho-Ruiz and Santiago S{\'a}nchez-Solano and
                 Piedad Brox and Macarena C.
                 Mart{\'\i}nez-Rodr{\'\i}guez",
  title =        "Timing-Optimized Hardware Implementation to Accelerate
                 Polynomial Multiplication in the {NTRU} Algorithm",
  journal =      j-JETC,
  volume =       "17",
  number =       "3",
  pages =        "35:1--35:16",
  month =        jul,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3445979",
  ISSN =         "1550-4832",
  ISSN-L =       "1550-4832",
  bibdate =      "Sat Aug 14 05:29:37 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jetc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3445979",
  abstract =     "Post-quantum cryptographic algorithms have emerged to
                 secure communication channels between electronic
                 devices faced with the advent of quantum computers. The
                 performance of post-quantum cryptographic algorithms on
                 embedded systems has to be evaluated to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Journal on Emerging Technologies in Computing
                 Systems (JETC)",
  journal-URL =  "https://dl.acm.org/loi/jetc",
}

@Article{Cao:2021:CED,
  author =       "Xinle Cao and Jian Liu and Hao Lu and Kui Ren",
  title =        "Cryptanalysis of an encrypted database in {SIGMOD
                 '14}",
  journal =      j-PROC-VLDB-ENDOWMENT,
  volume =       "14",
  number =       "10",
  pages =        "1743--1755",
  month =        jun,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.14778/3467861.3467865",
  ISSN =         "2150-8097",
  bibdate =      "Wed Oct 27 15:40:22 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
  URL =          "https://dl.acm.org/doi/10.14778/3467861.3467865",
  abstract =     "Encrypted database is an innovative technology
                 proposed to solve the data confidentiality issue in
                 cloud-based DB systems. It allows a data owner to
                 encrypt its database before uploading it to the service
                 provider; and it allows the service provider to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the VLDB Endowment",
  journal-URL =  "https://dl.acm.org/loi/pvldb",
}

@Article{Caviglione:2021:KLT,
  author =       "Luca Caviglione and Wojciech Mazurczyk and Matteo
                 Repetto and Andreas Schaffhauser and Marco Zuppelli",
  title =        "Kernel-level tracing for detecting stegomalware and
                 covert channels in {Linux} environments",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "191",
  number =       "??",
  pages =        "??--??",
  day =          "22",
  month =        may,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108010",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621001249",
  acknowledgement = ack-nhfb,
  articleno =    "108010",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Celenk:2021:MLB,
  author =       "{\"O}zge Celenk and Thomas Bauschert and Marcus
                 Eckert",
  title =        "Machine Learning based {KPI} Monitoring of Video
                 Streaming Traffic for {QoE} Estimation",
  journal =      j-SIGMETRICS,
  volume =       "48",
  number =       "4",
  pages =        "33--36",
  month =        may,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3466826.3466839",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu May 20 08:57:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3466826.3466839",
  abstract =     "Quality of Experience (QoE) monitoring of video
                 streaming traffic is crucial task for service
                 providers. Nowadays it is challenging due to the
                 increased usage of end-to-end encryption. In order to
                 overcome this issue, machine learning (ML) approaches
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "https://dl.acm.org/loi/sigmetrics",
}

@Article{Chan:2021:CAC,
  author =       "Hei-chi Chan",
  title =        "Chasing after cancellations: Revisiting a classic
                 identity that implies the {Rogers--Ramanujan}
                 identities",
  journal =      j-INT-J-NUMBER-THEORY,
  volume =       "17",
  number =       "02",
  pages =        "297--310",
  month =        mar,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S1793042120400266",
  ISSN =         "1793-0421 (print), 1793-7310 (electronic)",
  ISSN-L =       "1793-0421",
  bibdate =      "Tue May 18 16:16:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijnt.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S1793042120400266",
  abstract =     "In this paper, we revisit an identity which was proven
                 by Ramanujan and from which he deduced the famous
                 identities that are named after him and L. J. Rogers.
                 Unlike Ramanujan's proof (which uses the method of q
                 -difference equations), we examine directly the q
                 -coefficients involved. We isolate and identify terms
                 that cancel each other. Once these terms are paired up
                 and canceled, we only need the geometric series to
                 complete the proof.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Number Theory (IJNT)",
  journal-URL =  "https://www.worldscientific.com/worldscinet/ijnt",
  remark =       "Special Issue I: In Honor of Bruce Berndt's 80th
                 Birthday",
}

@Article{Chan:2021:MTF,
  author =       "Song Heng Chan and Nankun Hong and Jerry and Jeremy
                 Lovejoy",
  title =        "A mock theta function identity related to the
                 partition rank modulo 3 and 9",
  journal =      j-INT-J-NUMBER-THEORY,
  volume =       "17",
  number =       "02",
  pages =        "311--327",
  month =        mar,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S1793042120400254",
  ISSN =         "1793-0421 (print), 1793-7310 (electronic)",
  ISSN-L =       "1793-0421",
  bibdate =      "Tue May 18 16:16:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijnt.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S1793042120400254",
  abstract =     "We prove a new mock theta function identity related to
                 the partition rank modulo 3 and 9. As a consequence, we
                 obtain the 3 -dissection of the rank generating
                 function modulo 9 . We also evaluate all of the
                 components of the rank--crank differences modulo 9 .
                 These are analogous to conjectures of Lewis [The
                 generating functions of the rank and crank modulo 8,
                 {\em Ramanujan J.\/} 18 (2009) 121--146] on rank--crank
                 differences modulo 8 , first proved by Mortenson [On
                 ranks and cranks of partitions modulo 4 and 8, {\em J.
                 Combin. Theory Ser. A\/} 161 (2019) 51--80].",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Number Theory (IJNT)",
  journal-URL =  "https://www.worldscientific.com/worldscinet/ijnt",
  remark =       "Special Issue I: In Honor of Bruce Berndt's 80th
                 Birthday",
}

@Article{Chang:2021:TLR,
  author =       "Chin-Chen Chang and Jui-Feng Chang and Wei-Jiun Kao
                 and Ji-Hwei Horng",
  title =        "Two-Layer Reversible Data Hiding for {VQ}-Compressed
                 Images Based on {De}-Clustering and Indicator-Free
                 Search-Order Coding",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "8",
  pages =        "215",
  day =          "20",
  month =        aug,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13080215",
  ISSN =         "1999-5903",
  bibdate =      "Thu Aug 26 10:44:38 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/8/215",
  abstract =     "During transmission of digital images, secret messages
                 can be embedded using data hiding techniques. Such
                 techniques can transfer private secrets without drawing
                 the attention of eavesdroppers. To reduce the amount of
                 transmitted data, image compression methods are widely
                 applied. Hiding secret data in compressed images is a
                 hot issue recently. In this paper, we apply the
                 de-clustering concept and the indicator-free
                 search-order coding (IFSOC) technique to hide
                 information into vector quantization (VQ) compressed
                 images. Experimental results show that the proposed
                 two-layer reversible data hiding scheme for
                 IFSOC-encoded VQ index table can hide a large amount of
                 secret data among state-of-the-art methods with a
                 relatively lower bit rate and high security.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Chaudhry:2021:RBP,
  author =       "Shehzad Ashraf Chaudhry and Azeem Irshad and Khalid
                 Yahya and Neeraj Kumar and Mamoun Alazab and Yousaf Bin
                 Zikria",
  title =        "Rotating behind Privacy: an Improved Lightweight
                 Authentication Scheme for Cloud-based {IoT}
                 Environment",
  journal =      j-TOIT,
  volume =       "21",
  number =       "3",
  pages =        "78:1--78:19",
  month =        jun,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3425707",
  ISSN =         "1533-5399 (print), 1557-6051 (electronic)",
  ISSN-L =       "1533-5399",
  bibdate =      "Sat Aug 7 15:54:18 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toit.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3425707",
  abstract =     "The advancements in the internet of things (IoT)
                 require specialized security protocols to provide
                 unbreakable security along with computation and
                 communication efficiencies. Moreover, user privacy and
                 anonymity has emerged as an integral part, along with
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "78",
  fjournal =     "ACM Transactions on Internet Technology (TOIT)",
  journal-URL =  "https://dl.acm.org/loi/toit",
}

@Article{Chen:2021:CFV,
  author =       "Yanjiao Chen and Meng Xue and Jian Zhang and Qianyun
                 Guan and Zhiyuan Wang and Qian Zhang and Wei Wang",
  title =        "{ChestLive}: Fortifying Voice-based Authentication
                 with Chest Motion Biometric on Smart Devices",
  journal =      j-IMWUT,
  volume =       "5",
  number =       "4",
  pages =        "148:1--148:25",
  month =        dec,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3494962",
  ISSN =         "2474-9567 (electronic)",
  ISSN-L =       "2474-9567",
  bibdate =      "Wed May 25 15:22:25 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/imwut.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494962",
  abstract =     "Voice-based authentication is prevalent on smart
                 devices to verify the legitimacy of users, but is
                 vulnerable to replay attacks. In this paper, we propose
                 to leverage the distinctive chest motions during
                 speaking to establish a secure multi-factor \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "148",
  fjournal =     "Proceedings of the ACM on Interactive, Mobile,
                 Wearable and Ubiquitous Technologies (IMWUT)",
  journal-URL =  "https://dl.acm.org/loi/imwut",
}

@Article{Chen:2021:LBU,
  author =       "Wenbin Chen and Jin Li and Zhengan Huang and Chongzhi
                 Gao and Siuming Yiu and Zoe L. Jiang",
  title =        "Lattice-based unidirectional infinite-use proxy
                 re-signatures with private re-signature key",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "120",
  number =       "??",
  pages =        "137--148",
  month =        sep,
  year =         "2021",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1016/j.jcss.2021.03.008",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  bibdate =      "Wed May 26 15:41:30 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0022000021000398",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
}

@Article{Chen:2021:PAI,
  author =       "Haixia Chen and Xinyi Huang and Wei Wu and Yi Mu",
  title =        "Privacy-Aware Image Authentication from Cryptographic
                 Primitives",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "8",
  pages =        "1178--1192",
  month =        aug,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa127",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat Aug 28 14:54:07 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/8/1178/5943716",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Chen:2021:STF,
  author =       "Yulei Chen and Jianhua Chen",
  title =        "A secure three-factor-based authentication with key
                 agreement protocol for e-Health clouds",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "77",
  number =       "4",
  pages =        "3359--3380",
  month =        apr,
  year =         "2021",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-020-03395-8",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri May 14 09:20:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-020-03395-8",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  online-date =  "Published: 18 August 2020 Pages: 3359 - 3380",
}

@Article{Cheng:2021:MLN,
  author =       "Jin Cheng and Yulei Wu and Yuepeng E and Junling You
                 and Tong Li and Hui Li and Jingguo Ge",
  title =        "{MATEC}: a lightweight neural network for online
                 encrypted traffic classification",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "199",
  number =       "??",
  pages =        "??--??",
  day =          "9",
  month =        nov,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108472",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:05 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621004217",
  acknowledgement = ack-nhfb,
  articleno =    "108472",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Cheng:2021:SNQ,
  author =       "Ke Cheng and Liangmin Wang and Yulong Shen and Hua
                 Wang and Yongzhi Wang and Xiaohong Jiang and Hong
                 Zhong",
  title =        "Secure $k$-{NN} Query on Encrypted Cloud Data with
                 Multiple Keys",
  journal =      j-IEEE-TRANS-BIG-DATA,
  volume =       "7",
  number =       "4",
  pages =        "689--702",
  year =         "2021",
  DOI =          "https://doi.org/10.1109/TBDATA.2017.2707552",
  ISSN =         "2332-7790",
  bibdate =      "Fri Aug 13 08:39:03 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransbigdata.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Big Data",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6687317",
}

@Article{Chi:2021:DAM,
  author =       "Po-Wen Chi and Yu-Lun Chang",
  title =        "Do not ask me what {I} am looking for: Index deniable
                 encryption",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "122",
  number =       "??",
  pages =        "28--39",
  month =        sep,
  year =         "2021",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2021.04.004",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Wed Feb 9 09:07:17 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X21001199",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Chicha:2021:UCM,
  author =       "Elie Chicha and Bechara {Al Bouna} and Mohamed Nassar
                 and Richard Chbeir and Ramzi A. Haraty and Mourad
                 Oussalah and Djamal Benslimane and Mansour Naser
                 Alraja",
  title =        "A User-Centric Mechanism for Sequentially Releasing
                 Graph Datasets under {Blowfish} Privacy",
  journal =      j-TOIT,
  volume =       "21",
  number =       "1",
  pages =        "20:1--20:25",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3431501",
  ISSN =         "1533-5399 (print), 1557-6051 (electronic)",
  ISSN-L =       "1533-5399",
  bibdate =      "Wed Feb 24 21:53:14 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toit.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3431501",
  abstract =     "In this article, we present a privacy-preserving
                 technique for user-centric multi-release graphs. Our
                 technique consists of sequentially releasing anonymized
                 versions of these graphs under Blowfish Privacy. To do
                 so, we introduce a graph model that is \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Transactions on Internet Technology (TOIT)",
  journal-URL =  "https://dl.acm.org/loi/toit",
}

@Article{Choudhary:2021:MBB,
  author =       "Swati K. Choudhary and Ameya K. Naik",
  title =        "Multimodal Biometric-Based Authentication with Secured
                 Templates",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "21",
  number =       "02",
  pages =        "??--??",
  month =        apr,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0219467821500182",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Wed May 5 11:23:13 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0219467821500182",
  abstract =     "This paper proposes a multimodal biometric based
                 authentication (verification and identification) with
                 secured templates. Multimodal biometric systems provide
                 improved authentication rate over unimodal systems at
                 the cost of increased concern for memory requirement
                 and template security. The proposed framework performs
                 person authentication using face and fingerprint.
                 Biometric templates are protected by hiding fingerprint
                 into face at secret locations, through blind and
                 key-based watermarking. Face features are extracted
                 from approximation sub-band of Discrete Wavelet
                 Transform, which reduces the overall working plane. The
                 proposed method also shows high robustness of biometric
                 templates against common channel attacks. Verification
                 and identification performances are evaluated using two
                 chimeric and one real multimodal dataset. The same
                 systems, working with compressed templates provides
                 considerable reduction in overall memory requirement
                 with negligible loss of authentication accuracies.
                 Thus, the proposed framework offers positive balance
                 between authentication performance, template robustness
                 and memory resource utilization.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Cocco:2021:BSS,
  author =       "Luisanna Cocco and Roberto Tonelli and Michele
                 Marchesi",
  title =        "Blockchain and Self Sovereign Identity to Support
                 Quality in the Food Supply Chain",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "12",
  pages =        "301",
  day =          "26",
  month =        nov,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13120301",
  ISSN =         "1999-5903",
  bibdate =      "Wed Jan 19 05:45:14 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/12/301",
  abstract =     "This work presents how a digital identity management
                 system can support food supply chains in guaranteeing
                 the quality of the products marketed and the compliance
                 of the several supply-chain's nodes to standards and
                 technical regulations. Specific goal of this work is to
                 present a system that provides full visibility of
                 process/food certifications, which nowadays are issued
                 by accredited and approved certification bodies
                 (issuers) and delivered and stored in paper version by
                 the several participants (holders) of the supply chain.
                 The system is designed and implemented by combining the
                 latest most innovative and disruptive technologies in
                 the market-Self Sovereign Identity system, Blockchain,
                 and Inter Planetary File System. The crucial aspects
                 that it aims to hit are the storage and access of
                 food/process certifications, and the proper eligibility
                 verification of these certifications exploiting the
                 concepts of the Self Sovereign Identity-based models.
                 The proposed system, realized by using standards that
                 are WWW Consortium-compatible and the Ethereum
                 Blockchain, ensures eligibility, transparency, and
                 traceability of the certifications along a food supply
                 chain, and could be an innovation model/idea that the
                 companies that adopt the Open Innovation paradigm might
                 want to pursue.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Coppolino:2021:VCI,
  author =       "L. Coppolino and S. {D Antonio} and V. Formicola and
                 G. Mazzeo and L. Romano",
  title =        "{VISE}: Combining {Intel SGX} and Homomorphic
                 Encryption for Cloud Industrial Control Systems",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "70",
  number =       "5",
  pages =        "711--724",
  year =         "2021",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2020.2995638",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Apr 8 06:29:24 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Cui:2021:PPD,
  author =       "Shujie Cui and Xiangfu Song and Muhammad Rizwan Asghar
                 and Steven D. Galbraith and Giovanni Russello",
  title =        "Privacy-preserving Dynamic Symmetric Searchable
                 Encryption with Controllable Leakage",
  journal =      j-TOPS,
  volume =       "24",
  number =       "3",
  pages =        "18:1--18:35",
  month =        apr,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3446920",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Thu Apr 29 09:49:38 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3446920",
  abstract =     "Searchable Encryption (SE) is a technique that allows
                 Cloud Service Providers to search over encrypted
                 datasets without learning the content of queries and
                 records. In recent years, many SE schemes have been
                 proposed to protect outsourced data. However,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Cui:2021:TFD,
  author =       "Hui Cui and Russell Paulet and Surya Nepal and Xun Yi
                 and Butrus Mbimbi",
  title =        "Two-Factor Decryption: a Better Way to Protect Data
                 Security and Privacy",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "4",
  pages =        "550--563",
  month =        apr,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa080",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Apr 23 10:21:15 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/4/550/5868155",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{DArco:2021:SSS,
  author =       "Paolo D'Arco and Roberto {De Prisco} and Alfredo {De
                 Santis}",
  title =        "Secret sharing schemes for infinite sets of
                 participants: a new design technique",
  journal =      j-THEOR-COMP-SCI,
  volume =       "859",
  number =       "??",
  pages =        "149--161",
  day =          "6",
  month =        mar,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.01.019",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Mar 12 06:53:55 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521000347",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Devi:2021:HCW,
  author =       "V. Anusuya Devi and V. Kalaivani",
  title =        "Hybrid cryptosystem in wireless body area networks
                 using message authentication code and modified and
                 enhanced lattice-based cryptography {(MAC-MELBC)} in
                 healthcare applications",
  journal =      j-CCPE,
  volume =       "33",
  number =       "9",
  pages =        "e6132:1--e6132:??",
  day =          "10",
  month =        may,
  year =         "2021",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.6132",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Tue May 18 08:31:24 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
  onlinedate =   "11 December 2020",
}

@InCollection{Diffie:2021:HCW,
  author =       "Whitfield Diffie and Martin Hellman",
  title =        "New Directions in Cryptography (1976)",
  crossref =     "Lewis:2021:ICF",
  chapter =      "42",
  pages =        "421--440",
  year =         "2021",
  DOI =          "https://doi.org/10.7551/mitpress/12274.003.0044",
  bibdate =      "Tue Feb 01 07:39:53 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
}

@Article{Ding:2021:MSA,
  author =       "Yaoling Ding and Liehuang Zhu and An Wang and Yuan Li
                 and Yongjuan Wang and Siu Ming Yiu and Keke Gai",
  title =        "A Multiple Sieve Approach Based on Artificial
                 Intelligent Techniques and Correlation Power Analysis",
  journal =      j-TOMM,
  volume =       "17",
  number =       "2s",
  pages =        "71:1--71:21",
  month =        jun,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3433165",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Tue Jun 22 08:33:16 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3433165",
  abstract =     "Side-channel analysis achieves key recovery by
                 analyzing physical signals generated during the
                 operation of cryptographic devices. Power consumption
                 is one kind of these signals and can be regarded as a
                 \ldots{} (More)",
  acknowledgement = ack-nhfb,
  articleno =    "71",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Dong:2021:SCL,
  author =       "Xingbo Dong and Soohyong Kim and Zhe Jin and Jung Yeon
                 Hwang and Sangrae Cho and Andrew Beng Jin Teoh",
  title =        "Secure Chaff-less Fuzzy Vault for Face Identification
                 Systems",
  journal =      j-TOMM,
  volume =       "17",
  number =       "3",
  pages =        "79:1--79:22",
  month =        aug,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3442198",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Thu Aug 19 08:56:09 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3442198",
  abstract =     "Biometric cryptosystems such as fuzzy vaults represent
                 one of the most popular approaches for secret and
                 biometric template protection. However, they are solely
                 designed for biometric verification, where the user is
                 required to input both identity \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "79",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Dottling:2021:IBE,
  author =       "Nico D{\"o}ttling and Sanjam Garg",
  title =        "Identity-based Encryption from the {Diffie--Hellman}
                 Assumption",
  journal =      j-J-ACM,
  volume =       "68",
  number =       "3",
  pages =        "14:1--14:46",
  month =        may,
  year =         "2021",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/3422370",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Jun 4 15:35:42 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3422370",
  abstract =     "We provide the first constructions of identity-based
                 encryption and hierarchical identity-based encryption
                 based on the hardness of the (Computational)
                 Diffie-Hellman Problem (without use of groups with
                 pairings) or Factoring. Our construction achieves the
                 standard notion of identity-based encryption as
                 considered by Boneh and Franklin [CRYPTO 2001]. We
                 bypass known impossibility results using garbled
                 circuits that make a non-black-box use of the
                 underlying cryptographic primitives.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Drusinsky:2021:WAM,
  author =       "D. Drusinsky",
  title =        "Who Is Authenticating My E-Commerce Logins?",
  journal =      j-COMPUTER,
  volume =       "54",
  number =       "4",
  pages =        "49--54",
  month =        apr,
  year =         "2021",
  CODEN =        "CPTRB4",
  DOI =          "https://doi.org/10.1109/MC.2021.3055684",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Sun Apr 18 06:59:03 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computer2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Article{Dutta:2021:CRI,
  author =       "Priyanka Dutta and Willy Susilo and Dung Hoang Duong
                 and Partha Sarathi Roy",
  title =        "Collusion-resistant identity-based {Proxy
                 Re-encryption}: Lattice-based constructions in
                 {Standard Model}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "871",
  number =       "??",
  pages =        "16--29",
  day =          "6",
  month =        jun,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.04.008",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Sep 4 11:08:16 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521002127",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{ElGhanam:2021:ABD,
  author =       "Eiman ElGhanam and Ibtihal Ahmed and Mohamed Hassan
                 and Ahmed Osman",
  title =        "Authentication and Billing for Dynamic Wireless {EV}
                 Charging in an {Internet of Electric Vehicles}",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "10",
  pages =        "257",
  day =          "08",
  month =        oct,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13100257",
  ISSN =         "1999-5903",
  bibdate =      "Fri Oct 22 11:19:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/10/257",
  abstract =     "Dynamic wireless charging (DWC) is a promising
                 technology to charge Electric Vehicles (EV) using
                 on-road charging segments (CS), also known as DWC pads.
                 In order to ensure effective utilization of this
                 on-the-road charging service, communication and
                 coordination need to be established between the EVs and
                 the different network entities, thereby forming an
                 Internet of Electric Vehicles (IoEV). In an IoEV, EVs
                 can utilize different V2X communication modes to enable
                 charging scheduling, load management, and reliable
                 authentication and billing services. Yet, designing an
                 authentication scheme for dynamic EV charging presents
                 significant challenges given the mobility of the EVs
                 and the short contact time between the EVs and the
                 charging segments. Accordingly, this work proposes a
                 fast, secure and lightweight authentication scheme that
                 allows only authentic EVs with valid credentials to
                 charge their batteries while ensuring secure and fair
                 payments. The presented scheme starts with a key
                 pre-distribution phase between the charging service
                 company (CSC) and the charging pad owner (PO), followed
                 by a hash chain and digital signature-based
                 registration and authentication phase between the EV
                 and the CSC, before the EV reaches the beginning of the
                 charging lane. These preliminary authentication phases
                 allow the authentication between the EVs and the
                 charging segments to be performed using simple hash key
                 verification operations prior to charging activation,
                 which reduces the computational cost of the EVs and the
                 CS. Symmetric and asymmetric key cryptography are
                 utilized to secure the communication between the
                 different network entities. Analysis of the
                 computational and transmission time requirements of the
                 proposed authentication scheme shows that, for an EV
                 traveling at 60 km/h to start charging at the beginning
                 of the charging lane, the authentication process must
                 be initiated at least 1.35 m ahead of the starting
                 point of the lane as it requires $ \approx 81 $ ms to
                 be completed.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Emura:2021:ERI,
  author =       "Keita Emura and Jae Hong Seo and Yohei Watanabe",
  title =        "Efficient revocable identity-based encryption with
                 short public parameters",
  journal =      j-THEOR-COMP-SCI,
  volume =       "863",
  number =       "??",
  pages =        "127--155",
  day =          "8",
  month =        apr,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.02.024",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Thu May 6 16:06:52 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521001134",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Esfahani:2021:ECA,
  author =       "Mahdi Esfahani and Hadi Soleimany and Mohammad Reza
                 Aref",
  title =        "Enhanced cache attack on {AES} applicable on
                 {ARM}-based devices with new operating systems",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "198",
  number =       "??",
  pages =        "??--??",
  day =          "24",
  month =        oct,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108407",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621003790",
  acknowledgement = ack-nhfb,
  articleno =    "108407",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Eyyunni:2021:IBF,
  author =       "Pramod Eyyunni and Bibekananda Maji and Garima Sood",
  title =        "An inequality between finite analogues of rank and
                 crank moments",
  journal =      j-INT-J-NUMBER-THEORY,
  volume =       "17",
  number =       "02",
  pages =        "405--423",
  month =        mar,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S1793042120400217",
  ISSN =         "1793-0421 (print), 1793-7310 (electronic)",
  ISSN-L =       "1793-0421",
  bibdate =      "Tue May 18 16:16:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijnt.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S1793042120400217",
  abstract =     "The inequality between rank and crank moments was
                 conjectured and later proved by Garvan himself in 2011.
                 Recently, Dixit and the authors introduced finite
                 analogues of rank and crank moments for vector
                 partitions while deriving a finite analogue of Andrews'
                 famous identity for smallest parts function. In the
                 same paper, they also conjectured an inequality between
                 finite analogues of rank and crank moments, analogous
                 to Garvan's conjecture. In this paper, we give a proof
                 of this conjecture.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Number Theory (IJNT)",
  journal-URL =  "https://www.worldscientific.com/worldscinet/ijnt",
  remark =       "Special Issue I: In Honor of Bruce Berndt's 80th
                 Birthday",
}

@Article{Faghihi:2021:RDC,
  author =       "Farnood Faghihi and Mohammad Zulkernine",
  title =        "{RansomCare}: Data-centric detection and mitigation
                 against smartphone crypto-ransomware",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "191",
  number =       "??",
  pages =        "??--??",
  day =          "22",
  month =        may,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108011",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621001250",
  acknowledgement = ack-nhfb,
  articleno =    "108011",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Fang:2021:CCE,
  author =       "Yong Fang and Yuchi Zhang and Cheng Huang",
  title =        "{CyberEyes}: Cybersecurity Entity Recognition Model
                 Based on Graph Convolutional Network",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "8",
  pages =        "1215--1225",
  month =        aug,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa141",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat Aug 28 14:54:07 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/8/1215/6012869",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Fang:2021:PPM,
  author =       "Haokun Fang",
  title =        "Privacy Preserving Machine Learning with Homomorphic
                 Encryption and Federated Learning",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "4",
  pages =        "94",
  day =          "08",
  month =        apr,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13040094",
  ISSN =         "1999-5903",
  bibdate =      "Fri Apr 23 17:52:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/4/94",
  abstract =     "Privacy protection has been an important concern with
                 the great success of machine learning. In this paper,
                 it proposes a multi-party privacy preserving machine
                 learning framework, named PFMLP, based on partially
                 homomorphic encryption and federated learning. The core
                 idea is all learning parties just transmitting the
                 encrypted gradients by homomorphic encryption. From
                 experiments, the model trained by PFMLP has almost the
                 same accuracy, and the deviation is less than 1\%.
                 Considering the computational overhead of homomorphic
                 encryption, we use an improved Paillier algorithm which
                 can speed up the training by 25-28\%. Moreover,
                 comparisons on encryption key length, the learning
                 network structure, number of learning clients, etc. are
                 also discussed in detail in the paper.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/1999-5903/",
}

@Article{Farzadnia:2021:NID,
  author =       "Ehsan Farzadnia and Hossein Shirazi and Alireza
                 Nowroozi",
  title =        "A New Intrusion Detection System Using the Improved
                 Dendritic Cell Algorithm",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "8",
  pages =        "1193--1214",
  month =        aug,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa140",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat Aug 28 14:54:07 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/8/1193/6015901",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Fei:2021:SVS,
  author =       "Shufan Fei and Zheng Yan and Wenxiu Ding and Haomeng
                 Xie",
  title =        "Security Vulnerabilities of {SGX} and Countermeasures:
                 a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "126:1--126:36",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3456631",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3456631",
  abstract =     "Trusted Execution Environments (TEEs) have been widely
                 used in many security-critical applications. The
                 popularity of TEEs derives from its high security and
                 trustworthiness supported by secure hardware. Intel
                 Software Guard Extensions (SGX) is one of the most
                 representative TEEs that creates an isolated
                 environment on an untrusted operating system, thus
                 providing run-time protection for the execution of
                 security-critical code and data. However, Intel SGX is
                 far from the acme of perfection. It has become a target
                 of various attacks due to its security vulnerabilities.
                 Researchers and practitioners have paid attention to
                 the security vulnerabilities of SGX and investigated
                 optimization solutions in real applications.
                 Unfortunately, existing literature lacks a thorough
                 review of security vulnerabilities of SGX and their
                 countermeasures. In this article, we fill this gap.
                 Specifically, we propose two sets of criteria for
                 estimating security risks of existing attacks and
                 evaluating defense effects brought by attack
                 countermeasures. Furthermore, we propose a taxonomy of
                 SGX security vulnerabilities and shed light on
                 corresponding attack vectors. After that, we review
                 published attacks and existing countermeasures, as well
                 as evaluate them by employing our proposed criteria. At
                 last, on the strength of our survey, we propose some
                 open challenges and future directions in the research
                 of SGX security.",
  acknowledgement = ack-nhfb,
  articleno =    "126",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Fei:2021:VAP,
  author =       "Xiongwei Fei and Kenli Li and Wangdong Yang and Keqin
                 Li",
  title =        "Velocity-Aware Parallel Encryption Algorithm with Low
                 Energy Consumption for Streams",
  journal =      j-IEEE-TRANS-BIG-DATA,
  volume =       "7",
  number =       "4",
  pages =        "619--631",
  year =         "2021",
  DOI =          "https://doi.org/10.1109/TBDATA.2017.2697446",
  ISSN =         "2332-7790",
  bibdate =      "Fri Aug 13 08:39:03 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransbigdata.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Big Data",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6687317",
}

@Article{Ferdous:2021:SCA,
  author =       "Md Sadek Ferdous and Mohammad Jabed Morshed Chowdhury
                 and Mohammad A. Hoque",
  title =        "A survey of consensus algorithms in public blockchain
                 systems for crypto-currencies",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "182",
  number =       "??",
  pages =        "??--??",
  day =          "15",
  month =        may,
  year =         "2021",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2021.103035",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:43 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804521000618",
  acknowledgement = ack-nhfb,
  articleno =    "103035",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Ferretti:2021:HSI,
  author =       "Marco Ferretti",
  title =        "{H2O}: Secure Interactions in {IoT} via Behavioral
                 Fingerprinting",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "5",
  pages =        "117",
  day =          "30",
  month =        apr,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13050117",
  ISSN =         "1999-5903",
  bibdate =      "Fri May 28 20:44:52 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/5/117",
  abstract =     "Sharing data and services in the Internet of Things
                 (IoT) can give rise to significant security concerns
                 with information being sensitive and vulnerable to
                 attacks. In such an environment, objects can be either
                 public resources or owned by humans. For this reason,
                 the need of monitoring the reliability of all involved
                 actors, both persons and smart objects, assuring that
                 they really are who they claim to be, is becoming an
                 essential property of the IoT, with the increase in the
                 pervasive adoption of such a paradigm. In this paper,
                 we tackle this problem by proposing a new framework,
                 called H2O (Human to Object). Our solution is able to
                 continuously authenticate an entity in the network,
                 providing a reliability assessment mechanism based on
                 behavioral fingerprinting. A detailed security analysis
                 evaluates the robustness of the proposed protocol;
                 furthermore, a performance analysis shows the
                 feasibility of our approach.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/1999-5903/",
}

@Article{Fotohi:2021:SCB,
  author =       "Reza Fotohi and Fereidoon Shams Aliee",
  title =        "Securing communication between things using blockchain
                 technology based on authentication and {SHA-256} to
                 improving scalability in large-scale {IoT}",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "197",
  number =       "??",
  pages =        "??--??",
  day =          "9",
  month =        oct,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108331",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621003303",
  acknowledgement = ack-nhfb,
  articleno =    "108331",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Freeman:2021:FAP,
  author =       "Peter E. Freeman",
  title =        "Facilitating Authentic Practice for Early
                 Undergraduate Statistics Students",
  journal =      j-AMER-STAT,
  volume =       "75",
  number =       "4",
  pages =        "433--444",
  year =         "2021",
  CODEN =        "ASTAAJ",
  DOI =          "https://doi.org/10.1080/00031305.2020.1844293",
  ISSN =         "0003-1305 (print), 1537-2731 (electronic)",
  ISSN-L =       "0003-1305",
  bibdate =      "Mon Feb 7 07:35:06 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/amstat2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 http://www.tandfonline.com/toc/utas20/75/4",
  URL =          "http://www.tandfonline.com/doi/full/10.1080/00031305.2020.1844293",
  acknowledgement = ack-nhfb,
  fjournal =     "The American Statistician",
  journal-URL =  "http://amstat.tandfonline.com/loi/utas20",
}

@Article{Fu:2021:FAA,
  author =       "Yunfei Fu and Hongchuan Yu and Chih-Kuo Yeh and
                 Tong-Yee Lee and Jian J. Zhang",
  title =        "Fast Accurate and Automatic Brushstroke Extraction",
  journal =      j-TOMM,
  volume =       "17",
  number =       "2",
  pages =        "44:1--44:24",
  month =        jun,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3429742",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Sat Jun 5 07:35:45 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3429742",
  abstract =     "Brushstrokes are viewed as the artist's
                 ``handwriting'' in a painting. In many applications
                 such as style learning and transfer, mimicking
                 painting, and painting authentication, it is highly
                 desired to quantitatively and accurately identify
                 brushstroke \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Gai:2021:PPD,
  author =       "Keke Gai and Meikang Qiu and Hui Zhao",
  title =        "Privacy-Preserving Data Encryption Strategy for Big
                 Data in Mobile Cloud Computing",
  journal =      j-IEEE-TRANS-BIG-DATA,
  volume =       "7",
  number =       "4",
  pages =        "678--688",
  year =         "2021",
  DOI =          "https://doi.org/10.1109/TBDATA.2017.2705807",
  ISSN =         "2332-7790",
  bibdate =      "Fri Aug 13 08:39:03 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransbigdata.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Big Data",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6687317",
}

@Article{Ganesh:2021:CRF,
  author =       "Chaya Ganesh and Bernardo Magri and Daniele Venturi",
  title =        "Cryptographic reverse firewalls for interactive proof
                 systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "855",
  number =       "??",
  pages =        "104--132",
  day =          "6",
  month =        feb,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2020.11.043",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Mar 12 06:53:52 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397520306927",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Gangwani:2021:SEI,
  author =       "Pranav Gangwani and Alexander Perez-Pons and Tushar
                 Bhardwaj and Himanshu Upadhyay and Santosh Joshi and
                 Leonel Lagos",
  title =        "Securing Environmental {IoT} Data Using Masked
                 Authentication Messaging Protocol in a {DAG}-Based
                 Blockchain: {IOTA} Tangle",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "12",
  pages =        "312",
  day =          "06",
  month =        dec,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13120312",
  ISSN =         "1999-5903",
  bibdate =      "Wed Jan 19 05:45:14 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/12/312",
  abstract =     "The demand for the digital monitoring of environmental
                 ecosystems is high and growing rapidly as a means of
                 protecting the public and managing the environment.
                 However, before data, algorithms, and models can be
                 mobilized at scale, there are considerable concerns
                 associated with privacy and security that can
                 negatively affect the adoption of technology within
                 this domain. In this paper, we propose the advancement
                 of electronic environmental monitoring through the
                 capability provided by the blockchain. The blockchain's
                 use of a distributed ledger as its underlying
                 infrastructure is an attractive approach to counter
                 these privacy and security issues, although its
                 performance and ability to manage sensor data must be
                 assessed. We focus on a new distributed ledger
                 technology for the IoT, called IOTA, that is based on a
                 directed acyclic graph. IOTA overcomes the current
                 limitations of the blockchain and offers a data
                 communication protocol called masked authenticated
                 messaging for secure data sharing among Internet of
                 Things (IoT) devices. We show how the application layer
                 employing the data communication protocol, MAM, can
                 support the secure transmission, storage, and retrieval
                 of encrypted environmental sensor data by using an
                 immutable distributed ledger such as that shown in
                 IOTA. Finally, we evaluate, compare, and analyze the
                 performance of the MAM protocol against a non-protocol
                 approach.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Gao:2021:HAF,
  author =       "Pengfei Gao and Hongyi Xie and Fu Song and Taolue
                 Chen",
  title =        "A Hybrid Approach to Formal Verification of
                 Higher-Order Masked Arithmetic Programs",
  journal =      j-TOSEM,
  volume =       "30",
  number =       "3",
  pages =        "26:1--26:42",
  month =        may,
  year =         "2021",
  CODEN =        "ATSMER",
  DOI =          "https://doi.org/10.1145/3428015",
  ISSN =         "1049-331X (print), 1557-7392 (electronic)",
  ISSN-L =       "1049-331X",
  bibdate =      "Sun May 9 12:13:25 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tosem.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428015",
  abstract =     "Side-channel attacks, which are capable of breaking
                 secrecy via side-channel information, pose a growing
                 threat to the implementation of cryptographic
                 algorithms. Masking is an effective countermeasure
                 against side-channel attacks by removing the
                 statistical dependence between secrecy and power
                 consumption via randomization. However, designing
                 efficient and effective masked implementations turns
                 out to be an error-prone task. Current techniques for
                 verifying whether masked programs are secure are
                 limited in their applicability and accuracy, especially
                 when they are applied. To bridge this gap, in this
                 article, we first propose a sound type system, equipped
                 with an efficient type inference algorithm, for
                 verifying masked arithmetic programs against
                 higher-order attacks. We then give novel
                 model-counting-based and pattern-matching-based methods
                 that are able to precisely determine whether the
                 potential leaky observable sets detected by the type
                 system are genuine or simply spurious. We evaluate our
                 approach on various implementations of arithmetic
                 cryptographic programs. The experiments confirm that
                 our approach outperforms the state-of-the-art baselines
                 in terms of applicability, accuracy, and efficiency.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Transactions on Software Engineering and
                 Methodology",
  journal-URL =  "https://dl.acm.org/loi/tosem",
}

@Article{Garcia:2021:DRT,
  author =       "Norberto Garcia and Tomas Alcaniz and Aurora
                 Gonz{\'a}lez-Vidal and Jorge Bernal Bernabe and Diego
                 Rivera and Antonio Skarmeta",
  title =        "Distributed real-time {SlowDoS} attacks detection over
                 encrypted traffic using {Artificial Intelligence}",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "173",
  number =       "??",
  pages =        "??--??",
  day =          "1",
  month =        jan,
  year =         "2021",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2020.102871",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:40 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804520303362",
  acknowledgement = ack-nhfb,
  articleno =    "102871",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Garriga:2021:BCC,
  author =       "Martin Garriga and Stefano {Dalla Palma} and
                 Maxmiliano Arias and Alan {De Renzis} and Remo Pareschi
                 and Damian Andrew Tamburri",
  title =        "Blockchain and cryptocurrencies: a classification and
                 comparison of architecture drivers",
  journal =      j-CCPE,
  volume =       "33",
  number =       "8",
  pages =        "e5992:1--e5992:??",
  day =          "25",
  month =        apr,
  year =         "2021",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.5992",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Tue May 18 08:31:23 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
  onlinedate =   "02 October 2020",
}

@Misc{Garske:2021:DCL,
  author =       "D. Garske",
  title =        "Deprecate {CyaSSL} library \#151",
  howpublished = "GitHub document",
  year =         "2021",
  bibdate =      "Fri Jul 29 07:52:18 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://github.com/cyassl/cyassl/pull/151",
  acknowledgement = ack-nhfb,
}

@Article{Gnad:2021:VBC,
  author =       "Dennis R. E. Gnad and Cong Dang Khoa Nguyen and Syed
                 Hashim Gillani and Mehdi B. Tahoori",
  title =        "Voltage-Based Covert Channels Using {FPGAs}",
  journal =      j-TODAES,
  volume =       "26",
  number =       "6",
  pages =        "43:1--43:25",
  month =        nov,
  year =         "2021",
  CODEN =        "ATASFO",
  DOI =          "https://doi.org/10.1145/3460229",
  ISSN =         "1084-4309 (print), 1557-7309 (electronic)",
  ISSN-L =       "1084-4309",
  bibdate =      "Thu Aug 19 08:44:49 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/todaes.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3460229",
  abstract =     "Field Programmable Gate Arrays (FPGAs) are
                 increasingly used in cloud applications and being
                 integrated into Systems-on-Chip. For these systems,
                 various side-channel attacks on cryptographic
                 implementations have been reported, motivating one to
                 apply \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Transactions on Design Automation of Electronic
                 Systems",
  journal-URL =  "https://dl.acm.org/loi/todaes",
}

@Article{Goey:2021:ANT,
  author =       "Jia-Zheng Goey and Wai-Kong Lee and Wun-She Yap",
  title =        "Accelerating number theoretic transform in {GPU}
                 platform for fully homomorphic encryption",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "77",
  number =       "2",
  pages =        "1455--1474",
  month =        feb,
  year =         "2021",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-020-03156-7",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri May 14 09:19:59 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-020-03156-7",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  online-date =  "Published: 18 May 2020 Pages: 1455 - 1474",
}

@Article{Goodell:2021:DCA,
  author =       "Geoffrey Goodell",
  title =        "A Digital Currency Architecture for Privacy and
                 Owner-Custodianship",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "5",
  pages =        "130",
  day =          "14",
  month =        may,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13050130",
  ISSN =         "1999-5903",
  bibdate =      "Fri May 28 20:44:52 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/5/130",
  abstract =     "In recent years, electronic retail payment mechanisms,
                 especially e-commerce and card payments at the point of
                 sale, have increasingly replaced cash in many developed
                 countries. As a result, societies are losing a critical
                 public retail payment option, and retail consumers are
                 losing important rights associated with using cash. To
                 address this concern, we propose an approach to digital
                 currency that would allow people without banking
                 relationships to transact electronically and privately,
                 including both e-commerce purchases and point-of-sale
                 purchases that are required to be cashless. Our
                 proposal introduces a government-backed,
                 privately-operated digital currency infrastructure to
                 ensure that every transaction is registered by a bank
                 or money services business, and it relies upon
                 non-custodial wallets backed by privacy-enhancing
                 technology, such as blind signatures or zero-knowledge
                 proofs, to ensure that transaction counterparties are
                 not revealed. Our approach to digital currency can also
                 facilitate more efficient and transparent clearing,
                 settlement, and management of systemic risk. We argue
                 that our system can restore and preserve the salient
                 features of cash, including privacy,
                 owner-custodianship, fungibility, and accessibility,
                 while also preserving fractional reserve banking and
                 the existing two-tiered banking system. We also show
                 that it is possible to introduce regulation of digital
                 currency transactions involving non-custodial wallets
                 that unconditionally protect the privacy of
                 end-users.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/1999-5903/",
}

@Article{Goudosis:2021:AOR,
  author =       "Athanasios Goudosis",
  title =        "{ARIBC}: Online Reporting Based on Identity-Based
                 Cryptography",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "2",
  pages =        "53",
  day =          "21",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13020053",
  ISSN =         "1999-5903",
  bibdate =      "Fri Feb 26 10:54:58 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/2/53",
  abstract =     "The reporting of incidents of misconduct, violence,
                 sexual assault, harassment, and other types of crime
                 that constitute a major concern in modern society is of
                 significant value when investigating such incidents.
                 Unfortunately, people involved in such incidents,
                 either as witnesses or victims, are often reluctant to
                 report them when such reporting demands revealing the
                 reporter's true identity. In this paper, we propose an
                 online reporting system that leverages Identity-Based
                 Cryptography (IBC) and offers data authentication, data
                 integrity, and data confidentiality services to both
                 eponymous and anonymous users. The system, called
                 ARIBC, is founded on a certificate-less, public-key,
                 IBC infrastructure, implemented by employing the
                 Sakai-Kasahara approach and by following the IEEE
                 1363.3-2013 standard. We develop a proof-of-concept
                 implementation of the proposed scheme, and demonstrate
                 its applicability in environments with constrained
                 human, organizational and/or computational resources.
                 The computational overheads imposed by the scheme are
                 found to be well within the capabilities of modern
                 fixed or mobile devices.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/1999-5903/",
  remark =       "Special Issue Feature Papers for Future
                 Internet---Cybersecurity Section.",
}

@Article{Guan:2021:ASS,
  author =       "Zhitao Guan and Naiyu Wang and Xunfeng Fan and Xueyan
                 Liu and Longfei Wu and Shaohua Wan",
  title =        "Achieving Secure Search over Encrypted Data for
                 e-Commerce: a Blockchain Approach",
  journal =      j-TOIT,
  volume =       "21",
  number =       "1",
  pages =        "12:1--12:17",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3408309",
  ISSN =         "1533-5399 (print), 1557-6051 (electronic)",
  ISSN-L =       "1533-5399",
  bibdate =      "Wed Feb 24 21:53:14 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toit.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3408309",
  abstract =     "The advances of Internet technology has resulted in
                 the rapid and pervasive development of e-commerce,
                 which has not only changed the production and operation
                 mode of many enterprises, but also affected the
                 economic development mode of the whole \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Transactions on Internet Technology (TOIT)",
  journal-URL =  "https://dl.acm.org/loi/toit",
}

@Article{Guan:2021:LKA,
  author =       "Albert Guan",
  title =        "A Lightweight Key Agreement Protocol with
                 Authentication Capability",
  journal =      j-INT-J-FOUND-COMP-SCI,
  volume =       "32",
  number =       "04",
  pages =        "389--404",
  month =        jun,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0129054121500222",
  ISSN =         "0129-0541",
  ISSN-L =       "0129-0541",
  bibdate =      "Wed Jun 23 06:51:09 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
                 http://www.worldscientific.com/loi/ijfcs",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0129054121500222",
  abstract =     "Computationally lightweight and unconditionally secure
                 key agreement protocols are very useful for secure
                 communication in public networks. Recently, Guan et al.
                 proposed a key agreement protocol whose security is
                 based on the unpredictability of channel noise rather
                 than computationally hard problems. These protocols are
                 efficient, computationally lightweight, and
                 unconditionally secure. However, authentication was not
                 integrated into these protocols. In this article, we
                 propose a new protocol with authentication capability
                 that enables two nodes in the network to establish a
                 secret session key for secure communication. It is more
                 efficient, and it also preserves the lightweight and
                 unconditional secure features of the key agreement
                 protocols proposed by Guan et al. Therefore, it is more
                 suitable for devices with limited computing power, such
                 as sensors in Internet of Things (IoT).",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Foundations of Computer
                 Science (IJFCS)",
  journal-URL =  "http://www.worldscientific.com/loi/ijfcs",
}

@Article{Guo:2021:PSE,
  author =       "Junyan Guo and Ye Du and Yahang Zhang and Meihong Li",
  title =        "A provably secure {ECC}-based access and handover
                 authentication protocol for space information
                 networks",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "193",
  number =       "??",
  pages =        "??--??",
  day =          "1",
  month =        nov,
  year =         "2021",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2021.103183",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Thu Jan 20 08:06:56 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804521001922",
  acknowledgement = ack-nhfb,
  articleno =    "103183",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Gwyn:2021:FRU,
  author =       "Tony Gwyn and Kaushik Roy and Mustafa Atay",
  title =        "Face Recognition Using Popular Deep Net Architectures:
                 a Brief Comparative Study",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "7",
  pages =        "164",
  day =          "25",
  month =        jun,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13070164",
  ISSN =         "1999-5903",
  bibdate =      "Fri Jul 23 15:16:13 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/7/164",
  abstract =     "In the realm of computer security, the
                 username/password standard is becoming increasingly
                 antiquated. Usage of the same username and password
                 across various accounts can leave a user open to
                 potential vulnerabilities. Authentication methods of
                 the future need to maintain the ability to provide
                 secure access without a reduction in speed. Facial
                 recognition technologies are quickly becoming integral
                 parts of user security, allowing for a secondary level
                 of user authentication. Augmenting traditional username
                 and password security with facial biometrics has
                 already seen impressive results; however, studying
                 these techniques is necessary to determine how
                 effective these methods are within various parameters.
                 A Convolutional Neural Network (CNN) is a powerful
                 classification approach which is often used for image
                 identification and verification. Quite recently, CNNs
                 have shown great promise in the area of facial image
                 recognition. The comparative study proposed in this
                 paper offers an in-depth analysis of several
                 state-of-the-art deep learning based-facial recognition
                 technologies, to determine via accuracy and other
                 metrics which of those are most effective. In our
                 study, VGG-16 and VGG-19 showed the highest levels of
                 image recognition accuracy, as well as F1-Score. The
                 most favorable configurations of CNN should be
                 documented as an effective way to potentially augment
                 the current username/password standard by increasing
                 the current method's security with additional facial
                 biometrics.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Hamada:2021:SCL,
  author =       "Louiza Hamada and Pascal Lorenz and Marc Gilg",
  title =        "Security Challenges for Light Emitting Systems",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "11",
  pages =        "276",
  day =          "28",
  month =        oct,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13110276",
  ISSN =         "1999-5903",
  bibdate =      "Wed Jan 19 05:45:13 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/11/276",
  abstract =     "Although visible light communication (VLC) channels
                 are more secure than radio frequency channels, the
                 broadcast nature of VLC links renders them open to
                 eavesdropping. As a result, VLC networks must provide
                 security in order to safeguard the user's data from
                 eavesdroppers. In the literature, keyless security
                 techniques have been developed to offer security for
                 VLC. Even though these techniques provide strong
                 security against eavesdroppers, they are difficult to
                 deploy. Key generation algorithms are critical for
                 securing wireless connections. Nonetheless, in many
                 situations, the typical key generation methods may be
                 quite complicated and costly. They consume scarce
                 resources, such as bandwidth. In this paper, we propose
                 a novel key extraction procedure that uses
                 error-correcting coding and one time pad (OTP) to
                 improve the security of VLC networks and the validity
                 of data. This system will not have any interference
                 problems with other devices. We also explain error
                 correction while sending a message across a network,
                 and suggest a change to the Berlekamp--Massey (BM)
                 algorithm for error identification and assessment.
                 Because each OOK signal frame is encrypted by a
                 different key, the proposed protocol provides high
                 physical layer security; it allows for key extraction
                 based on the messages sent, so an intruder can never
                 break the encryption system, even if the latter knows
                 the protocol with which we encrypted the message; our
                 protocol also enables for error transmission rate
                 correction and bit mismatch rates with on-the-fly key
                 fetch. The results presented in this paper were
                 performed using MATLAB.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Hammami:2021:LAA,
  author =       "Hamza Hammami and Sadok {Ben Yahia} and Mohammad S.
                 Obaidat",
  title =        "A lightweight anonymous authentication scheme for
                 secure cloud computing services",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "77",
  number =       "2",
  pages =        "1693--1713",
  month =        feb,
  year =         "2021",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-020-03313-y",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri May 14 09:19:59 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-020-03313-y",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  online-date =  "Published: 24 May 2020 Pages: 1693 - 1713",
}

@Article{Hao:2021:ACF,
  author =       "Xiaohan Hao and Wei Ren and Ruoting Xiong and Tianqing
                 Zhu and Kim-Kwang Raymond Choo",
  title =        "Asymmetric cryptographic functions based on generative
                 adversarial neural networks for {Internet of Things}",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "124",
  number =       "??",
  pages =        "243--253",
  month =        nov,
  year =         "2021",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2021.05.030",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Wed Feb 9 09:07:20 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X21001801",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Hayouni:2021:NEE,
  author =       "Haythem Hayouni and Mohamed Hamdi",
  title =        "A novel energy-efficient encryption algorithm for
                 secure data in {WSNs}",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "77",
  number =       "5",
  pages =        "4754--4777",
  month =        may,
  year =         "2021",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-020-03465-x",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri May 14 09:20:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-020-03465-x",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  online-date =  "Published: 26 October 2020 Pages: 4754 - 4777",
}

@Article{Hazari:2021:MLV,
  author =       "Noor Ahmad Hazari and Ahmed Oun and Mohammed Niamat",
  title =        "Machine Learning Vulnerability Analysis of
                 {FPGA}-based Ring Oscillator {PUFs} and Counter
                 Measures",
  journal =      j-JETC,
  volume =       "17",
  number =       "3",
  pages =        "36:1--36:20",
  month =        jul,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3445978",
  ISSN =         "1550-4832",
  ISSN-L =       "1550-4832",
  bibdate =      "Sat Aug 14 05:29:37 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jetc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3445978",
  abstract =     "Physical Unclonable Functions (PUFs) exploit the
                 manufacturing process variations inherent in
                 silicon-based chips to generate unique secret keys.
                 Although PUFs are supposed to be unclonable or
                 unbreakable, researchers have found that they are
                 vulnerable \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Journal on Emerging Technologies in Computing
                 Systems (JETC)",
  journal-URL =  "https://dl.acm.org/loi/jetc",
}

@Article{He:2021:GCF,
  author =       "Jiaji He and Haocheng Ma and Yanjiang Liu and Yiqiang
                 Zhao",
  title =        "Golden Chip-Free {Trojan} Detection Leveraging {Trojan
                 Trigger}'s Side-Channel Fingerprinting",
  journal =      j-TECS,
  volume =       "20",
  number =       "1",
  pages =        "6:1--6:18",
  month =        jan,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3419105",
  ISSN =         "1539-9087 (print), 1558-3465 (electronic)",
  ISSN-L =       "1539-9087",
  bibdate =      "Sat Jan 16 06:52:20 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tecs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3419105",
  abstract =     "Hardware Trojans (HTs) have become a major threat for
                 the integrated circuit industry and supply chain and
                 have motivated numerous developments of HT detection
                 schemes. Although the side-channel HT detection
                 approach is among the most promising \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Transactions on Embedded Computing Systems",
  journal-URL =  "https://dl.acm.org/loi/tecs",
}

@Article{Herzberg:2021:SMA,
  author =       "Amir Herzberg and Hemi Leibowitz and Kent Seamons and
                 Elham Vaziripour and Justin Wu and Daniel Zappala",
  title =        "Secure Messaging Authentication Ceremonies Are
                 Broken",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "19",
  number =       "2",
  pages =        "29--37",
  year =         "2021",
  DOI =          "https://doi.org/10.1109/MSEC.2020.3039727",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Wed May 26 13:03:32 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
}

@Article{Hu:2021:FSM,
  author =       "Zhi Hu and Dongdai Lin and Chang-An Zhao",
  title =        "Fast scalar multiplication of degenerate divisors for
                 hyperelliptic curve cryptosystems",
  journal =      j-APPL-MATH-COMP,
  volume =       "404",
  number =       "??",
  pages =        "Article 126239",
  day =          "1",
  month =        sep,
  year =         "2021",
  CODEN =        "AMHCBQ",
  DOI =          "https://doi.org/10.1016/j.amc.2021.126239",
  ISSN =         "0096-3003 (print), 1873-5649 (electronic)",
  ISSN-L =       "0096-3003",
  bibdate =      "Wed Jun 9 09:19:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/applmathcomput2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0096300321003295",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Mathematics and Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00963003",
}

@Article{Huang:2021:ABT,
  author =       "Jun Huang and Debiao He and Mohammad S. Obaidat and
                 Pandi Vijayakumar and Min Luo and Kim-Kwang Raymond
                 Choo",
  title =        "The Application of the Blockchain Technology in Voting
                 Systems: a Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "60:1--60:28",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3439725",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3439725",
  abstract =     "Voting is a formal expression of opinion or choice,
                 either positive or negative, made by an individual or a
                 group of individuals. However, conventional voting
                 systems tend to be centralized, which are known to
                 suffer from security and efficiency limitations. Hence,
                 there has been a trend of moving to decentralized
                 voting systems, such as those based on blockchain. The
                 latter is a decentralized digital ledger in a
                 peer-to-peer network, where a copy of the append-only
                 ledger of digitally signed and encrypted transactions
                 is maintained by each participant. Therefore, in this
                 article, we perform a comprehensive review of
                 blockchain-based voting systems and classify them based
                 on a number of features (e.g., the types of blockchain
                 used, the consensus approaches used, and the scale of
                 participants). By systematically analyzing and
                 comparing the different blockchain-based voting
                 systems, we also identify a number of limitations and
                 research opportunities. Hopefully, this survey will
                 provide an in-depth insight into the potential utility
                 of blockchain in voting systems and device future
                 research agenda.",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@PhdThesis{Hughes:2021:BEM,
  author =       "James Prescott Hughes",
  title =        "{BadRandom}: the effect and mitigations for low
                 entropy random numbers in {TLS}",
  type =         "{Ph.D.} dissertation",
  school =       "University of California, Santa Cruz",
  address =      "Santa Cruz, CA",
  pages =        "xv + 101",
  year =         "2021",
  bibdate =      "Fri Jul 29 07:58:28 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://escholarship.org/uc/item/9528885m",
  acknowledgement = ack-nhfb,
  advisor =      "Darrell Long",
}

@Article{Ibrahim:2021:MFU,
  author =       "Omar Adel Ibrahim and Savio Sciancalepore and Gabriele
                 Oligeri and Roberto {Di Pietro}",
  title =        "{MAGNETO}: Fingerprinting {USB} Flash Drives via
                 Unintentional Magnetic Emissions",
  journal =      j-TECS,
  volume =       "20",
  number =       "1",
  pages =        "8:1--8:26",
  month =        jan,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3422308",
  ISSN =         "1539-9087 (print), 1558-3465 (electronic)",
  ISSN-L =       "1539-9087",
  bibdate =      "Sat Jan 16 06:52:20 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tecs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3422308",
  abstract =     "Universal Serial Bus (USB) Flash Drives are nowadays
                 one of the most convenient and diffused means to
                 transfer files, especially when no Internet connection
                 is available. However, USB flash drives are also one of
                 the most common attack vectors used to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Transactions on Embedded Computing Systems",
  journal-URL =  "https://dl.acm.org/loi/tecs",
}

@Article{Islam:2021:HLS,
  author =       "Sheikh Ariful Islam and Love Kumar Sah and Srinivas
                 Katkoori",
  title =        "High-Level Synthesis of Key-Obfuscated {RTL IP} with
                 Design Lockout and Camouflaging",
  journal =      j-TODAES,
  volume =       "26",
  number =       "1",
  pages =        "6:1--6:35",
  month =        jan,
  year =         "2021",
  CODEN =        "ATASFO",
  DOI =          "https://doi.org/10.1145/3410337",
  ISSN =         "1084-4309 (print), 1557-7309 (electronic)",
  ISSN-L =       "1084-4309",
  bibdate =      "Thu Feb 25 10:17:13 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/todaes.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3410337",
  abstract =     "We propose three orthogonal techniques to secure
                 Register-Transfer-Level (RTL) Intellectual Property
                 (IP). In the first technique, the key-based RTL
                 obfuscation scheme is proposed at an early design phase
                 during High-Level Synthesis (HLS). Given a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Transactions on Design Automation of Electronic
                 Systems",
  journal-URL =  "https://dl.acm.org/loi/todaes",
}

@Article{Jacomme:2021:EFA,
  author =       "Charlie Jacomme and Steve Kremer",
  title =        "An Extensive Formal Analysis of Multi-factor
                 Authentication Protocols",
  journal =      j-TOPS,
  volume =       "24",
  number =       "2",
  pages =        "13:1--13:34",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3440712",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Fri Feb 5 09:05:32 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3440712",
  abstract =     "Passwords are still the most widespread means for
                 authenticating users, even though they have been shown
                 to create huge security problems. This motivated the
                 use of additional authentication mechanisms in
                 so-called multi-factor authentication protocols.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Jarecki:2021:TFP,
  author =       "Stanislaw Jarecki and Mohammed Jubur and Hugo Krawczyk
                 and Nitesh Saxena and Maliheh Shirvanian",
  title =        "Two-factor Password-authenticated Key Exchange with
                 End-to-end Security",
  journal =      j-TOPS,
  volume =       "24",
  number =       "3",
  pages =        "17:1--17:37",
  month =        apr,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3446807",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Thu Apr 29 09:49:38 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3446807",
  abstract =     "We present a secure two-factor authentication (TFA)
                 scheme based on the user's possession of a password and
                 a crypto-capable device. Security is ``end-to-end'' in
                 the sense that the attacker can attack all parts of the
                 system, including all communication \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Jayasinghe:2021:QQB,
  author =       "Darshana Jayasinghe and Aleksandar Ignjatovic and
                 Roshan Ragel and Jude Angelo Ambrose and Sri
                 Parameswaran",
  title =        "{QuadSeal}: Quadruple Balancing to Mitigate Power
                 Analysis Attacks with Variability Effects and
                 Electromagnetic Fault Injection Attacks",
  journal =      j-TODAES,
  volume =       "26",
  number =       "5",
  pages =        "33:1--33:36",
  month =        jun,
  year =         "2021",
  CODEN =        "ATASFO",
  DOI =          "https://doi.org/10.1145/3443706",
  ISSN =         "1084-4309 (print), 1557-7309 (electronic)",
  ISSN-L =       "1084-4309",
  bibdate =      "Tue Jun 22 08:18:59 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/todaes.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3443706",
  abstract =     "Side channel analysis attacks employ the emanated side
                 channel information to deduce the secret keys from
                 cryptographic implementations by analyzing the power
                 traces during execution or scrutinizing faulty outputs.
                 To be effective, a countermeasure must \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Transactions on Design Automation of Electronic
                 Systems",
  journal-URL =  "https://dl.acm.org/loi/todaes",
}

@Article{Jeong:2021:MPP,
  author =       "Junho Jeong and Donghyo Kim and Sun-Young Ihm and
                 Yangsun Lee and Yunsik Son",
  title =        "Multilateral Personal Portfolio Authentication System
                 Based on Hyperledger Fabric",
  journal =      j-TOIT,
  volume =       "21",
  number =       "1",
  pages =        "14:1--14:17",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3423554",
  ISSN =         "1533-5399 (print), 1557-6051 (electronic)",
  ISSN-L =       "1533-5399",
  bibdate =      "Wed Feb 24 21:53:14 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toit.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3423554",
  abstract =     "Korean education-related evaluation agencies utilize a
                 centralized system that directly manages learner data.
                 This leaves the intellectual property of the
                 organizations and the personal information of the
                 students vulnerable to leakage should the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Transactions on Internet Technology (TOIT)",
  journal-URL =  "https://dl.acm.org/loi/toit",
}

@Article{Jha:2021:DED,
  author =       "Nandan Kumar Jha and Sparsh Mittal and Binod Kumar and
                 Govardhan Mattela",
  title =        "{DeepPeep}: Exploiting Design Ramifications to
                 Decipher the Architecture of Compact {DNNs}",
  journal =      j-JETC,
  volume =       "17",
  number =       "1",
  pages =        "5:1--5:25",
  month =        jan,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3414552",
  ISSN =         "1550-4832",
  ISSN-L =       "1550-4832",
  bibdate =      "Fri Apr 30 06:39:29 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jetc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3414552",
  abstract =     "The remarkable predictive performance of deep neural
                 networks (DNNs) has led to their adoption in service
                 domains of unprecedented scale and scope. However, the
                 widespread adoption and growing commercialization of
                 DNNs have underscored the importance of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Journal on Emerging Technologies in Computing
                 Systems (JETC)",
  journal-URL =  "https://dl.acm.org/loi/jetc",
}

@Article{Ji:2021:CSS,
  author =       "Sai Ji and Rui Huang and Jian Shen and Xin Jin and
                 Youngju Cho",
  title =        "A certificateless signcryption scheme for smart home
                 networks",
  journal =      j-CCPE,
  volume =       "33",
  number =       "7",
  pages =        "1--1",
  day =          "10",
  month =        apr,
  year =         "2021",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.5081",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Tue May 18 08:31:22 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
  onlinedate =   "13 November 2018",
}

@Article{Ji:2021:IMS,
  author =       "Fulei Ji and Wentao Zhang and Tianyou Ding",
  title =        "Improving {Matsui}'s Search Algorithm For The Best
                 Differential\slash Linear Trails And Its Applications
                 For {DES}, {DESL} And {GIFT}",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "4",
  pages =        "610--627",
  month =        apr,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa090",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Apr 23 10:21:15 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/4/610/5880463",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Jin:2021:FSL,
  author =       "Xin Jin and Yuwei Duan and Ying Zhang and Yating Huang
                 and Mengdong Li and Ming Mao and Amit Kumar Singh and
                 Yujie Li",
  title =        "Fast Search of Lightweight Block Cipher Primitives via
                 Swarm-like Metaheuristics for Cyber Security",
  journal =      j-TOIT,
  volume =       "21",
  number =       "4",
  pages =        "93:1--93:15",
  month =        jul,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3417296",
  ISSN =         "1533-5399 (print), 1557-6051 (electronic)",
  ISSN-L =       "1533-5399",
  bibdate =      "Wed Sep 29 06:52:50 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toit.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3417296",
  abstract =     "With the construction and improvement of 5G
                 infrastructure, more devices choose to access the
                 Internet to achieve some functions. People are paying
                 more attention to information security in the use of
                 network devices. This makes lightweight block ciphers
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "93",
  fjournal =     "ACM Transactions on Internet Technology (TOIT)",
  journal-URL =  "https://dl.acm.org/loi/toit",
}

@Article{Joshi:2021:SDI,
  author =       "Anand B. Joshi and Dhanesh Kumar and D. C. Mishra",
  title =        "Security of Digital Images Based on {$3$D} {Arnold}
                 Cat Map and Elliptic Curve",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "21",
  number =       "01",
  pages =        "??--??",
  month =        jan,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0219467821500066",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Wed May 5 11:23:12 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0219467821500066",
  abstract =     "Security of digital data is an important task in the
                 present era. In this paper, we propose a new scheme of
                 digital image encryption and decryption method based on
                 three-dimensional (3D) Arnold cat map (ACM) and
                 elliptic curve. In this proposed encryption method, we
                 have applied 3D ACM on the digital color image which
                 performs the dual encryption first, it performs the
                 permutation and second, it performs the substitution of
                 image pixels. After that, elliptic curve cryptography
                 (ECC) is used to encrypt the image, for this a mapping
                 method is proposed to convert the pixels of the image
                 as points on the elliptic curve. Further, a mapping
                 inverting method is proposed for decryption and then 3D
                 inverse Arnold cat map (iACM) is applied to get the
                 original image. The statistical and security analyses
                 are done on various images and the experimental results
                 show the robustness of the proposed method.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Ju:2021:RNC,
  author =       "GwangSu Ju and UnGwang Ko",
  title =        "Research on a novel construction of probabilistic
                 visual cryptography scheme $ (k, n, 0, 1, 1)$-{PVCS}
                 for threshold access structures",
  journal =      j-THEOR-COMP-SCI,
  volume =       "863",
  number =       "??",
  pages =        "19--39",
  day =          "8",
  month =        apr,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.02.010",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Thu May 6 16:06:52 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521000840",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{K:2021:PPB,
  author =       "Reshma V. K and Vinod Kumar R. S",
  title =        "Pixel Prediction-Based Image Steganography by Support
                 Vector Neural Network",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "5",
  pages =        "731--748",
  month =        may,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa017",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Mon May 31 13:24:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/5/731/5819403",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Kaboli:2021:GCH,
  author =       "Reza Kaboli and Shahram Khazaei and Maghsoud Parviz",
  title =        "On group-characterizability of homomorphic secret
                 sharing schemes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "891",
  number =       "??",
  pages =        "116--130",
  day =          "4",
  month =        nov,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.08.032",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Jan 26 14:22:58 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521005090",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Kaddoura:2021:PDD,
  author =       "Sanaa Kaddoura",
  title =        "A Parallelized Database Damage Assessment Approach
                 after Cyberattack for Healthcare Systems",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "4",
  pages =        "90",
  day =          "31",
  month =        mar,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13040090",
  ISSN =         "1999-5903",
  bibdate =      "Fri Apr 23 17:52:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/4/90",
  abstract =     "In the current Internet of things era, all companies
                 shifted from paper-based data to the electronic format.
                 Although this shift increased the efficiency of data
                 processing, it has security drawbacks. Healthcare
                 databases are a precious target for attackers because
                 they facilitate identity theft and cybercrime. This
                 paper presents an approach for database damage
                 assessment for healthcare systems. Inspired by the
                 current behavior of COVID-19 infections, our approach
                 views the damage assessment problem the same way. The
                 malicious transactions will be viewed as if they are
                 COVID-19 viruses, taken from infection onward. The
                 challenge of this research is to discover the infected
                 transactions in a minimal time. The proposed parallel
                 algorithm is based on the transaction dependency
                 paradigm, with a time complexity O((M+NQ+N^3)/L) (M =
                 total number of transactions under scrutiny, N = number
                 of malicious and affected transactions in the testing
                 list, Q = time for dependency check, and L = number of
                 threads used). The memory complexity of the algorithm
                 is O(N+KL) (N = number of malicious and affected
                 transactions, K = number of transactions in one area
                 handled by one thread, and L = number of threads).
                 Since the damage assessment time is directly
                 proportional to the denial-of-service time, the
                 proposed algorithm provides a minimized execution time.
                 Our algorithm is a novel approach that outperforms
                 other existing algorithms in this domain in terms of
                 both time and memory, working up to four times faster
                 in terms of time and with 120,000 fewer bytes in terms
                 of memory.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/1999-5903/",
}

@Article{Kapassa:2021:BAI,
  author =       "Evgenia Kapassa and Marinos Themistocleous and Klitos
                 Christodoulou and Elias Iosif",
  title =        "Blockchain Application in {Internet of Vehicles}:
                 Challenges, Contributions and Current Limitations",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "12",
  pages =        "313",
  day =          "10",
  month =        dec,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13120313",
  ISSN =         "1999-5903",
  bibdate =      "Wed Jan 19 05:45:14 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/12/313",
  abstract =     "Blockchain technology is highly coupled with
                 cryptocurrencies; however, it provides several other
                 potential use cases, related to energy and
                 sustainability, Internet of Things (IoT), smart cities,
                 smart mobility and more. Blockchain can offer security
                 for Electric Vehicle (EV) transactions in the Internet
                 of Vehicles (IoV) concept, allowing electricity trading
                 to be performed in a decentralized, transparent and
                 secure way. Additionally, blockchain provides the
                 necessary functionalities for IoV decentralized
                 application development, such as data exchange,
                 personal digital identity, sharing economy and
                 optimized charging pattern. Moreover, blockchain
                 technology has the potential to significantly increase
                 energy efficiency, decrease management costs and
                 guarantee the effective use of the energy recourses.
                 Therefore, its application in the IoV concept provides
                 secure, autonomous and automated energy trading between
                 EVs. While several studies on blockchain technology in
                 smart grids have been conducted, insufficient attention
                 has been given to conducting a detailed review and
                 state-of-the-art analysis of blockchain application in
                 the IoV domain. To this end, this work provides a
                 systematic literature review of blockchain-based
                 applications in the IoV domain. The aim is to
                 investigate the current challenges of IoV and to
                 highlight how blockchain characteristics can contribute
                 to this emerging paradigm. In addition, limitations and
                 future research directions related to the integration
                 of blockchain technology within the IoV are discussed.
                 To this end, this study incorporates the theoretical
                 foundations of several research articles published in
                 scientific publications over the previous five years,
                 as a method of simplifying our assessment and capturing
                 the ever-expanding blockchain area. We present a
                 comprehensive taxonomy of blockchain-enabled
                 applications in the IoV domain, such as privacy and
                 security, data protection and management, vehicle
                 management, charging optimization and P2P energy
                 trading, based on a structured, systematic review and
                 content analysis of the discovered literature, and we
                 identify key trends and emerging areas for research.
                 The contribution of this article is two-fold: (a) we
                 highlight the limitations presented in the relevant
                 literature, particularly the barriers of blockchain
                 technology and how they influence its integration into
                 the IoV and (b) we present a number of research gaps
                 and suggest future exploratory areas.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Karbasi:2021:SLS,
  author =       "Amir Hassani Karbasi and Siyamak Shahpasand",
  title =        "{SINGLETON}: A lightweight and secure end-to-end
                 encryption protocol for the sensor networks in the
                 {Internet of Things} based on cryptographic ratchets",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "77",
  number =       "4",
  pages =        "3516--3554",
  month =        apr,
  year =         "2021",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-020-03411-x",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri May 14 09:20:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-020-03411-x",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  online-date =  "Published: 25 August 2020 Pages: 3516 - 3554",
}

@Article{Khan:2021:SCL,
  author =       "Shawal Khan",
  title =        "Security Challenges of Location Privacy in {VANETs}
                 and State-of-the-Art Solutions: a Survey",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "4",
  pages =        "96",
  day =          "10",
  month =        apr,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13040096",
  ISSN =         "1999-5903",
  bibdate =      "Fri Apr 23 17:52:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/4/96",
  abstract =     "A Vehicular Ad-hoc Network (VANET) comprises a group
                 of moving or stationary vehicles connected by a
                 wireless network. VANETs play a vital role in providing
                 safety and comfort to drivers in vehicular
                 environments. They provide smart traffic control and
                 real-time information, event allocation. VANETs have
                 received attention in support of safe driving,
                 intelligent navigation, emergency and entertainment
                 applications in vehicles. Nevertheless, these
                 increasingly linked vehicles pose a range of new safety
                 and security risks to both the host and its associated
                 properties and may even have fatal consequences.
                 Violations of national privacy and vehicle identities
                 are a major obstacle to introducing forced contact
                 protocols in vehicles. Location privacy refers to the
                 privacy of the vehicle (driver) and the location of the
                 vehicle. Whenever a vehicle sends a message, no one but
                 authorized entities should know their real identity and
                 location of the vehicle. All the messages sent by the
                 vehicle must be authenticated before processing, hence
                 location privacy is an important design aspect to be
                 considered in VANETs operations. The novelty of this
                 paper is that it specifically reviews location privacy
                 in VANETs in terms of operational and safety concerns.
                 Furthermore, it presents a critical analysis of various
                 attacks, identity thefts, manipulation and other
                 techniques in vogue for location privacy protection
                 available in state-of-the-art solutions for VANETs. The
                 efforts in this paper will help researchers to develop
                 a great breadth of understanding pertaining to location
                 privacy issues and various security threats encountered
                 by VANETs and present the critical analysis of the
                 available state-of-the- art solutions to maintain
                 location privacy in VANETs.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/1999-5903/",
}

@Article{Kim:2021:TER,
  author =       "H. M. Kim and M. Laskowski and M. Zargham and H.
                 Turesson and M. Barlin and D. Kabanov",
  title =        "Token Economics in Real Life: Cryptocurrency and
                 Incentives Design for {Insolar}'s Blockchain Network",
  journal =      j-COMPUTER,
  volume =       "54",
  number =       "1",
  pages =        "70--80",
  year =         "2021",
  CODEN =        "CPTRB4",
  DOI =          "https://doi.org/10.1109/MC.2020.2996572",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Wed Mar 10 07:47:57 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/computer2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Article{Koutsos:2021:DSS,
  author =       "Adrien Koutsos",
  title =        "Decidability of a Sound Set of Inference Rules for
                 Computational Indistinguishability",
  journal =      j-TOCL,
  volume =       "22",
  number =       "1",
  pages =        "3:1--3:44",
  month =        jan,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3423169",
  ISSN =         "1529-3785 (print), 1557-945X (electronic)",
  ISSN-L =       "1529-3785",
  bibdate =      "Wed Feb 10 10:37:49 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tocl.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3423169",
  abstract =     "Computational indistinguishability is a key property
                 in cryptography and verification of security protocols.
                 Current tools for proving it rely on cryptographic game
                 transformations. We follow Bana and Comon's approach
                 [7, 8], axiomatizing what an adversary cannot
                 distinguish. We prove the decidability of a set of
                 first-order axioms that are computationally sound,
                 though incomplete, for protocols with a bounded number
                 of sessions whose security is based on an IND-CCA2
                 encryption scheme. Alternatively, our result can be
                 viewed as the decidability of a family of cryptographic
                 game transformations. Our proof relies on term
                 rewriting and automated deduction techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Transactions on Computational Logic",
  journal-URL =  "https://dl.acm.org/loi/tocl",
}

@Article{Krishnan:2021:SEQ,
  author =       "Prabhakar Krishnan and Kurunandan Jain and Pramod
                 George Jose and Krishnashree Achuthan and Rajkumar
                 Buyya",
  title =        "{SDN} Enabled {QoE} and Security Framework for
                 Multimedia Applications in {5G} Networks",
  journal =      j-TOMM,
  volume =       "17",
  number =       "2",
  pages =        "39:1--39:29",
  month =        jun,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3377390",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Sat Jun 5 07:35:45 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3377390",
  abstract =     "The technologies for real-time multimedia transmission
                 and immersive 3D gaming applications are rapidly
                 emerging, posing challenges in terms of performance,
                 security, authentication, data privacy, and encoding.
                 The communication channel for these \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Krol:2021:PPU,
  author =       "Micha{\l} Kr{\'o}l and Alberto Sonnino and Mustafa
                 Al-Bassam and Argyrios G. Tasiopoulos and Etienne
                 Rivi{\`e}re and Ioannis Psaras",
  title =        "Proof-of-Prestige: a Useful Work Reward System for
                 Unverifiable Tasks",
  journal =      j-TOIT,
  volume =       "21",
  number =       "2",
  pages =        "44:1--44:27",
  month =        jun,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3419483",
  ISSN =         "1533-5399 (print), 1557-6051 (electronic)",
  ISSN-L =       "1533-5399",
  bibdate =      "Wed Jun 23 06:35:35 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toit.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3419483",
  abstract =     "As cryptographic tokens and altcoins are increasingly
                 being built to serve as utility tokens, the notion of
                 useful work consensus protocols is becoming ever more
                 important. With useful work consensus protocols, users
                 get rewards after they have carried \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Transactions on Internet Technology (TOIT)",
  journal-URL =  "https://dl.acm.org/loi/toit",
}

@Article{Kruger:2021:CEA,
  author =       "Stefan Kr{\"u}ger and Johannes Sp{\"a}th and Karim Ali
                 and Eric Bodden and Mira Mezini",
  title =        "{CrySL}: An Extensible Approach to Validating the
                 Correct Usage of Cryptographic {APIs}",
  journal =      j-IEEE-TRANS-SOFTW-ENG,
  volume =       "47",
  number =       "11",
  pages =        "2382--2400",
  month =        nov,
  year =         "2021",
  CODEN =        "IESEDJ",
  DOI =          "https://doi.org/10.1109/TSE.2019.2948910",
  ISSN =         "0098-5589 (print), 1939-3520 (electronic)",
  ISSN-L =       "0098-5589",
  bibdate =      "Thu Dec 16 06:38:11 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Software Engineering",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}

@Article{Kubilay:2021:KEP,
  author =       "Murat Yasin Kubilay and Mehmet Sabir Kiraz and Haci
                 Ali Mantar",
  title =        "{KORGAN}: an Efficient {PKI} Architecture Based on
                 {PBFT} Through Dynamic Threshold Signatures",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "4",
  pages =        "564--574",
  month =        apr,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa081",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Apr 23 10:21:15 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/4/564/5890396",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Lee:2021:RHI,
  author =       "Kwangsu Lee",
  title =        "Revocable hierarchical identity-based encryption with
                 adaptive security",
  journal =      j-THEOR-COMP-SCI,
  volume =       "880",
  number =       "??",
  pages =        "37--68",
  day =          "3",
  month =        aug,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.05.034",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Sep 4 11:08:20 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521003376",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Li:2021:DMS,
  author =       "Songbin Li and Jingang Wang and Peng Liu and Miao Wei
                 and Qiandong Yan",
  title =        "Detection of Multiple Steganography Methods in
                 Compressed Speech Based on Code Element Embedding,
                 {Bi-LSTM} and {CNN} With Attention Mechanisms",
  journal =      j-IEEE-ACM-TASLP,
  volume =       "29",
  number =       "??",
  pages =        "1556--1569",
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1109/TASLP.2021.3074752",
  ISSN =         "2329-9290",
  ISSN-L =       "2329-9290",
  bibdate =      "Thu Apr 7 10:27:19 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeeacmtaslp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE\slash ACM Transactions on Audio, Speech, and
                 Language Processing",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6570655",
}

@Article{Li:2021:EPK,
  author =       "Qinyi Li and Xavier Boyen",
  title =        "Efficient public-key encryption with equality test
                 from lattices",
  journal =      j-THEOR-COMP-SCI,
  volume =       "892",
  number =       "??",
  pages =        "85--107",
  day =          "12",
  month =        nov,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.09.010",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Jan 26 14:23:05 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521005259",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Li:2021:FGA,
  author =       "Guangsong Li and Wei Chen and Bin Zhang and Siqi Lu",
  title =        "A fine-grained anonymous handover authentication
                 protocol based on consortium blockchain for wireless
                 networks",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "157",
  number =       "??",
  pages =        "157--167",
  month =        nov,
  year =         "2021",
  CODEN =        "JPDCER",
  DOI =          "https://doi.org/10.1016/j.jpdc.2021.06.007",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Thu Feb 10 06:39:21 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0743731521001362",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
}

@Article{Li:2021:FHO,
  author =       "Dongjie Li and Siyi Lv and Yanyu Huang and Yijing Liu
                 and Tong Li and Zheli Liu and Liang Guo",
  title =        "Frequency-hiding order-preserving encryption with
                 small client storage",
  journal =      j-PROC-VLDB-ENDOWMENT,
  volume =       "14",
  number =       "13",
  pages =        "3295--3307",
  month =        sep,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.14778/3484224.3484228",
  ISSN =         "2150-8097",
  bibdate =      "Fri Oct 29 16:38:15 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
  URL =          "https://dl.acm.org/doi/10.14778/3484224.3484228",
  abstract =     "The range query on encrypted databases is usually
                 implemented using the order-preserving encryption (OPE)
                 technique which preserves the order of plaintexts.
                 Since the frequency leakage of plaintexts makes OPE
                 vulnerable to frequency-analyzing attacks, \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the VLDB Endowment",
  journal-URL =  "https://dl.acm.org/loi/pvldb",
}

@Article{Li:2021:IEB,
  author =       "Yinghua Li and He Yu and Bin Song and Jinjun Chen",
  title =        "Image encryption based on a single-round dictionary
                 and chaotic sequences in cloud computing",
  journal =      j-CCPE,
  volume =       "33",
  number =       "7",
  pages =        "1--1",
  day =          "10",
  month =        apr,
  year =         "2021",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.5182",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Tue May 18 08:31:22 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
  onlinedate =   "05 March 2019",
}

@Article{Li:2021:LUC,
  author =       "Cong Li and Qingni Shen and Zhikang Xie and Xinyu Feng
                 and Yuejian Fang and Zhonghai Wu",
  title =        "Large Universe {CCA2 CP-ABE} With Equality and
                 Validity Test in the Standard Model",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "4",
  pages =        "509--533",
  month =        apr,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa075",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Apr 23 10:21:15 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/4/509/5872129",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Li:2021:SIB,
  author =       "Xiong Li and Shanpeng Liu and Rongxing Lu and Xiaosong
                 Zhang",
  title =        "On Security of an Identity-Based Dynamic Data Auditing
                 Protocol for Big Data Storage",
  journal =      j-IEEE-TRANS-BIG-DATA,
  volume =       "7",
  number =       "6",
  pages =        "975--977",
  month =        dec,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1109/TBDATA.2020.3026318",
  ISSN =         "2332-7790",
  ISSN-L =       "2332-7790",
  bibdate =      "Thu Apr 7 15:41:53 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransbigdata.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Big Data",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6687317",
}

@Article{Li:2021:TAN,
  author =       "Yamin Li and Jun Zhang and Zhongliang Yang and Ru
                 Zhang",
  title =        "Topic-aware Neural Linguistic Steganography Based on
                 Knowledge Graphs",
  journal =      j-TDS,
  volume =       "2",
  number =       "2",
  pages =        "10:1--10:13",
  month =        may,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3418598",
  ISSN =         "2691-1922",
  ISSN-L =       "2691-1922",
  bibdate =      "Thu Feb 17 07:13:14 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tds.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3418598",
  abstract =     "The core challenge of steganography is always how to
                 improve the hidden capacity and the concealment. Most
                 current generation-based linguistic steganography
                 methods only consider the probability distribution
                 between text characters, and the emotion and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Transactions on Data Science",
  journal-URL =  "https://dl.acm.org/loi/tds",
}

@Article{Liang:2021:IAH,
  author =       "X. Liang and Z. Yan and R. H. Deng and Q. Zheng",
  title =        "Investigating the Adoption of Hybrid Encrypted Cloud
                 Data Deduplication With Game Theory",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  volume =       "32",
  number =       "3",
  pages =        "587--600",
  month =        mar,
  year =         "2021",
  CODEN =        "ITDSEO",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Thu Oct 15 12:52:54 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71",
}

@Article{Lin:2021:IBE,
  author =       "Xi-Jun Lin and Qihui Wang and Lin Sun and Haipeng Qu",
  title =        "Identity-based encryption with equality test and
                 datestamp-based authorization mechanism",
  journal =      j-THEOR-COMP-SCI,
  volume =       "861",
  number =       "??",
  pages =        "117--132",
  day =          "12",
  month =        mar,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.02.015",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Mar 12 06:53:55 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521000815",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Lin:2021:LPK,
  author =       "Hao Lin and Zhen Zhao and Fei Gao and Willy Susilo and
                 Qiaoyan Wen and Fuchun Guo and Yijie Shi",
  title =        "Lightweight Public Key Encryption With Equality Test
                 Supporting Partial Authorization in Cloud Storage",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "8",
  pages =        "1226--1238",
  month =        aug,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa144",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat Aug 28 14:54:07 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/8/1226/6025507",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Lin:2021:SAF,
  author =       "Xi-Jun Lin and Qihui Wang and Lin Sun and Zhen Yan and
                 Peishun Liu",
  title =        "Security Analysis of the First Certificateless Proxy
                 Signature Scheme Against Malicious-But-Passive {KGC}
                 Attacks",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "4",
  pages =        "653--660",
  month =        apr,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa105",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Apr 23 10:21:15 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/4/653/5880730",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Lin:2021:TNC,
  author =       "Kunda Lin and Xiaolong Xu and Honghao Gao",
  title =        "{TSCRNN}: a novel classification scheme of encrypted
                 traffic based on flow spatiotemporal features for
                 efficient management of {IIoT}",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "190",
  number =       "??",
  pages =        "??--??",
  day =          "8",
  month =        may,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.107974",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:00 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621001067",
  acknowledgement = ack-nhfb,
  articleno =    "107974",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Ling:2021:EGI,
  author =       "Yunhao Ling and Sha Ma and Qiong Huang and Ximing Li
                 and Yijian Zhong and Yunzhi Ling",
  title =        "Efficient Group {ID}-Based Encryption With Equality
                 Test Against Insider Attack",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "4",
  pages =        "661--674",
  month =        apr,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa120",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Apr 23 10:21:15 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/4/661/5910102",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Liu:2021:CCS,
  author =       "Jinhui Liu and Yong Yu and Bo Yang and Jianwei Jia and
                 Qiqi Lai",
  title =        "Cryptanalysis of {Cramer--Shoup} Like Cryptosystems
                 Based on Index Exchangeable Family",
  journal =      j-INT-J-FOUND-COMP-SCI,
  volume =       "32",
  number =       "01",
  pages =        "73--91",
  month =        jan,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0129054121500040",
  ISSN =         "0129-0541",
  ISSN-L =       "0129-0541",
  bibdate =      "Tue Feb 23 10:25:28 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
                 http://www.worldscientific.com/loi/ijfcs",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0129054121500040",
  abstract =     "The Cramer--Shoup (CS) like cryptosystem based on
                 index exchangeable family (IEF) construction is a novel
                 scheme introduced in Asiaccs 2016 by Li et al. Its
                 versatility was illustrated by building two public key
                 encryption (PKE) schemes, a Cramer--Shoup encryption
                 scheme based on IEFs, as well as an outsourcing
                 technique based on non-abelian analog. However, the two
                 schemes are not secure over the recommended linear
                 group of Li et al. For them, we provide a new
                 key-recovery attack by solving a linear equation
                 respectively. Furthermore, we peel off complex
                 encryption and decryption processes and propose more
                 than three different attack methods. Finally, we give a
                 corresponding example to illustrate the correctness of
                 our attack methods. Our attack methods break an
                 instance of claiming 80 bit security less than one
                 minute under a personal computer.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Foundations of Computer
                 Science (IJFCS)",
  journal-URL =  "http://www.worldscientific.com/loi/ijfcs",
}

@Article{Liu:2021:DVV,
  author =       "Yanwei Liu and Jinxia Liu and Antonios Argyriou and
                 Siwei Ma and Liming Wang and Zhen Xu",
  title =        "$ 360$-Degree {VR} Video Watermarking Based on
                 Spherical Wavelet Transform",
  journal =      j-TOMM,
  volume =       "17",
  number =       "1",
  pages =        "38:1--38:23",
  month =        apr,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3425605",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Sat Apr 17 08:40:21 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3425605",
  abstract =     "Similar to conventional video, the increasingly
                 popular 360 virtual reality (VR) video requires
                 copyright protection mechanisms. The classic approach
                 for copyright protection is the introduction of a
                 digital watermark into the video sequence. Due to the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Liu:2021:EAB,
  author =       "Zhen Liu and Qiong Huang and Duncan S Wong",
  title =        "On Enabling Attribute-Based Encryption to Be Traceable
                 Against Traitors",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "4",
  pages =        "575--598",
  month =        apr,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa082",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Apr 23 10:21:15 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/4/575/5874143",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Liu:2021:FSC,
  author =       "Kunlin Liu and Ping Wang and Wenbo Zhou and Zhenyu
                 Zhang and Yanhao Ge and Honggu Liu and Weiming Zhang
                 and Nenghai Yu",
  title =        "Face Swapping Consistency Transfer with Neural
                 Identity Carrier",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "11",
  pages =        "298",
  day =          "22",
  month =        nov,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13110298",
  ISSN =         "1999-5903",
  bibdate =      "Wed Jan 19 05:45:13 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/11/298",
  abstract =     "Deepfake aims to swap a face of an image with someone
                 else's likeness in a reasonable manner. Existing
                 methods usually perform deepfake frame by frame, thus
                 ignoring video consistency and producing incoherent
                 results. To address such a problem, we propose a novel
                 framework Neural Identity Carrier (NICe), which learns
                 identity transformation from an arbitrary face-swapping
                 proxy via a U-Net. By modeling the incoherence between
                 frames as noise, NICe naturally suppresses its
                 disturbance and preserves primary identity information.
                 Concretely, NICe inputs the original frame and learns
                 transformation supervised by swapped pseudo labels. As
                 the temporal incoherence has an uncertain or stochastic
                 pattern, NICe can filter out such outliers and well
                 maintain the target content by uncertainty prediction.
                 With the predicted temporally stable appearance, NICe
                 enhances its details by constraining 3D geometry
                 consistency, making NICe learn fine-grained facial
                 structure across the poses. In this way, NICe
                 guarantees the temporal stableness of deepfake
                 approaches and predicts detailed results against
                 over-smoothness. Extensive experiments on benchmarks
                 demonstrate that NICe significantly improves the
                 quality of existing deepfake methods on video-level.
                 Besides, data generated by our methods can benefit
                 video-level deepfake detection methods.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Liu:2021:LFD,
  author =       "Jianghua Liu and Jingyu Hou and Wenjie Yang and Yang
                 Xiang and Wanlei Zhou and Wei Wu and Xinyi Huang",
  title =        "Leakage-Free Dissemination of Authenticated
                 Tree-Structured Data With Multi-Party Control",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "70",
  number =       "7",
  pages =        "1120--1131",
  year =         "2021",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2020.3006835",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Jun 10 15:51:57 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Liu:2021:NKT,
  author =       "Zuquan Liu and Guopu Zhu and Yuan-Gen Wang and
                 Jianquan Yang and Sam Kwong",
  title =        "A Novel $ (t, s, k, n)$-Threshold Visual Secret
                 Sharing Scheme Based on Access Structure Partition",
  journal =      j-TOMM,
  volume =       "16",
  number =       "4",
  pages =        "118:1--118:21",
  month =        jan,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3418212",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Wed Feb 10 10:15:11 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3418212",
  abstract =     "Visual secret sharing (VSS) is a new technique for
                 sharing a binary image into multiple shadows. For VSS,
                 the original image can be reconstructed from the
                 shadows in any qualified set, but cannot be
                 reconstructed from those in any forbidden set. In most
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "118",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Loffi:2021:MAM,
  author =       "Leandro Loffi and Carla Merkle Westphall and Lukas
                 Derner Gr{\"u}dtner and Carlos Becker Westphall",
  title =        "Mutual authentication with multi-factor in
                 {IoT--Fog--Cloud} environment",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "176",
  number =       "??",
  pages =        "??--??",
  day =          "15",
  month =        feb,
  year =         "2021",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2020.102932",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:41 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S108480452030391X",
  acknowledgement = ack-nhfb,
  articleno =    "102932",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Lou:2021:SMS,
  author =       "Xiaoxuan Lou and Tianwei Zhang and Jun Jiang and
                 Yinqian Zhang",
  title =        "A Survey of Microarchitectural Side-channel
                 Vulnerabilities, Attacks, and Defenses in
                 Cryptography",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "122:1--122:37",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3456629",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3456629",
  abstract =     "Side-channel attacks have become a severe threat to
                 the confidentiality of computer applications and
                 systems. One popular type of such attacks is the
                 microarchitectural attack, where the adversary exploits
                 the hardware features to break the protection enforced
                 by the operating system and steal the secrets from the
                 program. In this article, we systematize
                 microarchitectural side channels with a focus on
                 attacks and defenses in cryptographic applications. We
                 make three contributions. (1) We survey past research
                 literature to categorize microarchitectural
                 side-channel attacks. Since these are hardware attacks
                 targeting software, we summarize the vulnerable
                 implementations in software, as well as flawed designs
                 in hardware. (2) We identify common strategies to
                 mitigate microarchitectural attacks, from the
                 application, OS, and hardware levels. (3) We conduct a
                 large-scale evaluation on popular cryptographic
                 applications in the real world and analyze the
                 severity, practicality, and impact of side-channel
                 vulnerabilities. This survey is expected to inspire
                 side-channel research community to discover new
                 attacks, and more importantly, propose new defense
                 solutions against them.",
  acknowledgement = ack-nhfb,
  articleno =    "122",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Luengo:2021:RSR,
  author =       "Elena Almaraz Luengo and Luis Javier Garc{\'\i}a
                 Villalba",
  title =        "Recommendations on Statistical Randomness Test
                 Batteries for Cryptographic Purposes",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "4",
  pages =        "80:1--80:34",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447773",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Jul 3 10:00:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447773",
  abstract =     "Security in different applications is closely related
                 to the goodness of the sequences generated for such
                 purposes. Not only in Cryptography but also in other
                 areas, it is necessary to obtain long sequences of
                 random numbers or that, at least, behave as such. To
                 decide whether the generator used produces sequences
                 that are random, unpredictable and independent,
                 statistical checks are needed. Different batteries of
                 hypothesis tests have been proposed for this
                 purpose.\par

                 In this work, a survey of the main test batteries is
                 presented, indicating their pros and cons, giving some
                 guidelines for their use and presenting some practical
                 examples.",
  acknowledgement = ack-nhfb,
  articleno =    "80",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Luo:2021:ABP,
  author =       "Fucai Luo and Saif Al-Kuwari and Fuqun Wang and Kefei
                 Chen",
  title =        "Attribute-based proxy re-encryption from standard
                 lattices",
  journal =      j-THEOR-COMP-SCI,
  volume =       "865",
  number =       "??",
  pages =        "52--62",
  day =          "14",
  month =        apr,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.02.036",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Thu May 6 16:06:53 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521001201",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Ma:2021:CAF,
  author =       "Sha Ma and Qiong Huang",
  title =        "{CCA}-Almost-Full Anonymous Group Signature with
                 Verifier Local Revocation in the Standard Model",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "8",
  pages =        "1239--1252",
  month =        aug,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa153",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat Aug 28 14:54:07 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/8/1239/6029314",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Ma:2021:IKR,
  author =       "Sudong Ma and Jie Guan",
  title =        "Improved Key Recovery Attacks on Simplified Version of
                 {K2} Stream Cipher",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "8",
  pages =        "1253--1263",
  month =        aug,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa154",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat Aug 28 14:54:07 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/8/1253/6042244",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Mall:2021:CPB,
  author =       "Priyanka Mall and Ruhul Amin and Mohammad S. Obaidat
                 and Kuei-Fang Hsiao",
  title =        "{CoMSeC++}: {PUF}-based secured light-weight mutual
                 authentication protocol for Drone-enabled {WSN}",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "199",
  number =       "??",
  pages =        "??--??",
  day =          "9",
  month =        nov,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108476",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:05 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621004230",
  acknowledgement = ack-nhfb,
  articleno =    "108476",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Maniam:2021:AEH,
  author =       "Senthil Murugan Maniam and T. Sasilatha",
  title =        "Area-efficient and high-speed hardware structure of
                 hybrid cryptosystem {(AES-RC4)} for maximizing key
                 lifetime using parallel subpipeline architecture",
  journal =      j-CCPE,
  volume =       "33",
  number =       "3",
  pages =        "e5287:1--e5287:??",
  day =          "10",
  month =        feb,
  year =         "2021",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.5287",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Tue May 18 08:31:20 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
  onlinedate =   "23 April 2019",
}

@Article{Manzoor:2021:PRE,
  author =       "Ahsan Manzoor and An Braeken and Salil S. Kanhere and
                 Mika Ylianttila and Madhsanka Liyanage",
  title =        "Proxy re-encryption enabled secure and anonymous {IoT}
                 data sharing platform based on blockchain",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "176",
  number =       "??",
  pages =        "??--??",
  day =          "15",
  month =        feb,
  year =         "2021",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2020.102917",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:41 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804520303763",
  acknowledgement = ack-nhfb,
  articleno =    "102917",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Mathis:2021:FSA,
  author =       "Florian Mathis and John H. Williamson and Kami Vaniea
                 and Mohamed Khamis",
  title =        "Fast and Secure Authentication in Virtual Reality
                 Using Coordinated {$3$D} Manipulation and Pointing",
  journal =      j-TOCHI,
  volume =       "28",
  number =       "1",
  pages =        "6:1--6:44",
  month =        feb,
  year =         "2021",
  CODEN =        "ATCIF4",
  DOI =          "https://doi.org/10.1145/3428121",
  ISSN =         "1073-0516 (print), 1557-7325 (electronic)",
  ISSN-L =       "1073-0516",
  bibdate =      "Fri Feb 5 12:42:02 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tochi.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428121",
  abstract =     "There is a growing need for usable and secure
                 authentication in immersive virtual reality (VR).
                 Established concepts (e.g., 2D authentication schemes)
                 are vulnerable to observation attacks, and most
                 alternatives are relatively slow. We present RubikAuth,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Transactions on Computer-Human Interaction",
  journal-URL =  "https://dl.acm.org/loi/tochi",
}

@Article{Mayrhofer:2021:APS,
  author =       "Ren{\'e} Mayrhofer and Jeffrey {Vander Stoep} and Chad
                 Brubaker and Nick Kralevich",
  title =        "The {Android} Platform Security Model",
  journal =      j-TOPS,
  volume =       "24",
  number =       "3",
  pages =        "19:1--19:35",
  month =        apr,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3448609",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Thu Apr 29 09:49:38 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3448609",
  abstract =     "Android is the most widely deployed end-user focused
                 operating system. With its growing set of use cases
                 encompassing communication, navigation, media
                 consumption, entertainment, finance, health, and access
                 to sensors, actuators, cameras, or microphones,.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Mazza:2021:HEV,
  author =       "S. Mazza and D. Patel and I. Viola",
  title =        "Homomorphic-Encrypted Volume Rendering",
  journal =      j-IEEE-TRANS-VIS-COMPUT-GRAPH,
  volume =       "27",
  number =       "2",
  pages =        "635--644",
  year =         "2021",
  CODEN =        "ITVGEA",
  DOI =          "https://doi.org/10.1109/TVCG.2020.3030436",
  ISSN =         "1077-2626",
  ISSN-L =       "1077-2626",
  bibdate =      "Fri Feb 5 12:50:18 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransviscomputgraph2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Visualization and Computer
                 Graphics",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}

@Article{McIntire:2021:SCS,
  author =       "Brenda McIntire",
  title =        "The Secret Career of {Solomon Kullback}",
  journal =      j-CHANCE,
  volume =       "34",
  number =       "2",
  pages =        "18--23",
  year =         "2021",
  CODEN =        "CNDCE4",
  DOI =          "https://doi.org/10.1080/09332480.2021.1915029",
  ISSN =         "0933-2480 (print), 1867-2280 (electronic)",
  ISSN-L =       "0933-2480",
  bibdate =      "Mon May 17 16:10:57 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/chance.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Chance: a magazine for people interested in the
                 analysis of data",
  journal-URL =  "http://chance.amstat.org/;
                 http://link.springer.com/journal/144;
                 http://www.tandfonline.com/loi/ucha20",
  onlinedate =   "26 Apr 2021",
}

@Article{Menezes:2021:AES,
  author =       "Alfred Menezes and Douglas Stebila",
  title =        "The {Advanced Encryption Standard}: 20 Years Later",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "19",
  number =       "6",
  pages =        "98--102",
  month =        nov # "\slash " # dec,
  year =         "2021",
  DOI =          "https://doi.org/10.1109/MSEC.2021.3107078",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Mon Jan 31 15:37:00 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
}

@Article{Menezes:2021:CC,
  author =       "Alfred Menezes and Douglas Stebila",
  title =        "Challenges in Cryptography",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "19",
  number =       "2",
  pages =        "70--73",
  year =         "2021",
  DOI =          "https://doi.org/10.1109/MSEC.2021.3049730",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Wed May 26 13:03:32 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
}

@Article{Misra:2021:SSR,
  author =       "Sudip Misra and Tamoghna Ojha and Madhusoodhanan P.",
  title =        "{SecRET}: Secure Range-based Localization with
                 Evidence Theory for Underwater Sensor Networks",
  journal =      j-TAAS,
  volume =       "15",
  number =       "1",
  pages =        "2:1--2:26",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3431390",
  ISSN =         "1556-4665 (print), 1556-4703 (electronic)",
  ISSN-L =       "1556-4665",
  bibdate =      "Wed Feb 10 10:11:41 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/taas.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3431390",
  abstract =     "Node localization is a fundamental requirement in
                 underwater sensor networks (UWSNs) due to the ineptness
                 of GPS and other terrestrial localization techniques in
                 the underwater environment. In any UWSN monitoring
                 application, the sensed information \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Transactions on Autonomous and Adaptive Systems
                 (TAAS)",
  journal-URL =  "https://dl.acm.org/loi/taas",
}

@Article{Mitra:2021:CIA,
  author =       "Shyamali Mitra and Nibaran Das and Soumyajyoti Dey and
                 Sukanta Chakraborty and Mita Nasipuri and Mrinal Kanti
                 Naskar",
  title =        "Cytology Image Analysis Techniques Toward Automation:
                 Systematically Revisited",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "52:1--52:41",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3447238",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447238",
  abstract =     "Cytology is a branch of pathology that deals with the
                 microscopic examination of cells for diagnosis of
                 carcinoma or inflammatory conditions. In the present
                 work, the term cytology is used to indicate solid organ
                 cytology. Automation in cytology started \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Mouha:2021:AFM,
  author =       "N. Mouha and A. Hailane",
  title =        "The Application of Formal Methods to Real-World
                 Cryptographic Algorithms, Protocols, and Systems",
  journal =      j-COMPUTER,
  volume =       "54",
  number =       "1",
  pages =        "29--38",
  year =         "2021",
  CODEN =        "CPTRB4",
  DOI =          "https://doi.org/10.1109/MC.2020.3033613",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Wed Mar 10 07:47:57 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computer2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Article{Moussaileb:2021:SWB,
  author =       "Routa Moussaileb and Nora Cuppens and Jean-Louis Lanet
                 and H{\'e}l{\`e}ne {Le Bouder}",
  title =        "A Survey on {Windows}-based Ransomware Taxonomy and
                 Detection Mechanisms",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "117:1--117:36",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3453153",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453153",
  abstract =     "Ransomware remains an alarming threat in the 21st
                 century. It has evolved from being a simple scare
                 tactic into a complex malware capable of evasion.
                 Formerly, end-users were targeted via mass infection
                 campaigns. Nevertheless, in recent years, the attackers
                 have focused on targeted attacks, since the latter are
                 profitable and can induce severe damage. A vast number
                 of detection mechanisms have been proposed in the
                 literature. We provide a systematic review of
                 ransomware countermeasures starting from its deployment
                 on the victim machine until the ransom payment via
                 cryptocurrency. We define four stages of this malware
                 attack: Delivery, Deployment, Destruction, and Dealing.
                 Then, we assign the corresponding countermeasures for
                 each phase of the attack and cluster them by the
                 techniques used. Finally, we propose a roadmap for
                 researchers to fill the gaps found in the literature in
                 ransomware's battle.",
  acknowledgement = ack-nhfb,
  articleno =    "117",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Najafi:2021:FMO,
  author =       "Aniseh Najafi and Majid Bayat and Hamid Haj Seyyed
                 Javadi",
  title =        "Fair multi-owner search over encrypted data with
                 forward and backward privacy in cloud-assisted
                 {Internet of Things}",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "124",
  number =       "??",
  pages =        "285--294",
  month =        nov,
  year =         "2021",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2021.06.010",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Wed Feb 9 09:07:20 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X21002053",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Ogundoyin:2021:PPP,
  author =       "Sunday Oyinlola Ogundoyin and Ismaila Adeniyi Kamil",
  title =        "{PAASH}: a privacy-preserving authentication and
                 fine-grained access control of outsourced data for
                 secure smart health in smart cities",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "155",
  number =       "??",
  pages =        "101--119",
  month =        sep,
  year =         "2021",
  CODEN =        "JPDCER",
  DOI =          "https://doi.org/10.1016/j.jpdc.2021.05.001",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Thu Feb 10 06:39:18 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S074373152100099X",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
}

@Article{Oviatt:2021:KWY,
  author =       "Sharon Oviatt and Jionghao Lin and Abishek Sriramulu",
  title =        "{I} Know What You Know: What Hand Movements Reveal
                 about Domain Expertise",
  journal =      j-TIIS,
  volume =       "11",
  number =       "1",
  pages =        "4:1--4:26",
  month =        apr,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3423049",
  ISSN =         "2160-6455 (print), 2160-6463 (electronic)",
  ISSN-L =       "2160-6455",
  bibdate =      "Tue Apr 27 08:00:40 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tiis.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3423049",
  abstract =     "This research investigates whether students' level of
                 domain expertise can be detected during authentic
                 learning activities by analyzing their physical
                 activity patterns. More expert students reduced their
                 manual activity by a substantial 50\%, which was
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Transactions on Interactive Intelligent Systems
                 (TIIS)",
  journal-URL =  "https://dl.acm.org/loi/tiis",
}

@Article{Panwar:2021:FES,
  author =       "Kirtee Panwar and Ravindra Kumar Purwar and Garima
                 Srivastava",
  title =        "A Fast Encryption Scheme Suitable for Video
                 Surveillance Applications Using {SHA-256} Hash Function
                 and {$1$D} Sine--Sine Chaotic Map",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "21",
  number =       "02",
  pages =        "??--??",
  month =        apr,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0219467821500224",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Wed May 5 11:23:13 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0219467821500224",
  abstract =     "This paper proposes an image encryption technique
                 which is fast and secure. The encryption scheme is
                 designed for secure transmission of video surveillance
                 data (keyframes) over insecure network. The image
                 encryption technique employs 1D Sine--Sine system with
                 better chaotic properties than its seed map and faster
                 than higher-dimensional chaotic systems. Further,
                 design of encryption scheme is based on two permutation
                 rounds, which employs pixel swapping operation and
                 diffusion operation which is simple and provides
                 required security against plaintext, differential and
                 various other attacks. Three separate chaotic sequences
                 are generated using 1D Sine--Sine system which enhances
                 the key space of the encryption scheme. Secret keys are
                 updated dynamically with SHA-256 hash value obtained
                 from plain image. Hash values of plain image are
                 efficiently used without loss of any hash value
                 information. This makes the encryption scheme plaintext
                 sensitive and secure against plaintext attacks.
                 Performance and security aspects of encryption scheme
                 is analyzed both quantitatively using predefined
                 security metrics and qualitatively by scrutinizing the
                 internal working of encryption scheme. Computational
                 complexity of encrypting a plain image of size \(
                 rows{\texttimes} columns \) is {$ \mathcal {O} $} \(
                 rows{\texttimes}columns \) and is suitable for
                 encrypting keyframes of video for secure surveillance
                 applications.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Papadogiannaki:2021:SEN,
  author =       "Eva Papadogiannaki and Sotiris Ioannidis",
  title =        "A Survey on Encrypted Network Traffic Analysis
                 Applications, Techniques, and Countermeasures",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "6",
  pages =        "123:1--123:35",
  month =        jul,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3457904",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Sep 18 07:43:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457904",
  abstract =     "The adoption of network traffic encryption is
                 continually growing. Popular applications use
                 encryption protocols to secure communications and
                 protect the privacy of users. In addition, a large
                 portion of malware is spread through the network
                 traffic taking advantage of encryption protocols to
                 hide its presence and activity. Entering into the era
                 of completely encrypted communications over the
                 Internet, we must rapidly start reviewing the
                 state-of-the-art in the wide domain of network traffic
                 analysis and inspection, to conclude if traditional
                 traffic processing systems will be able to seamlessly
                 adapt to the upcoming full adoption of network
                 encryption. In this survey, we examine the literature
                 that deals with network traffic analysis and inspection
                 after the ascent of encryption in communication
                 channels. We notice that the research community has
                 already started proposing solutions on how to perform
                 inspection even when the network traffic is encrypted
                 and we demonstrate and review these works. In addition,
                 we present the techniques and methods that these works
                 use and their limitations. Finally, we examine the
                 countermeasures that have been proposed in the
                 literature in order to circumvent traffic analysis
                 techniques that aim to harm user privacy.",
  acknowledgement = ack-nhfb,
  articleno =    "123",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Park:2021:EIM,
  author =       "Dong-won Park and Seokhie Hong and Sung Min Cho",
  title =        "Efficient implementation of modular multiplication
                 over $ 192$-bit {NIST} prime for $8$-bit {AVR}-based
                 sensor node",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "77",
  number =       "5",
  pages =        "4852--4870",
  month =        may,
  year =         "2021",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-020-03441-5",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri May 14 09:20:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-020-03441-5",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  online-date =  "Published: 27 October 2020 Pages: 4852 - 4870",
}

@Article{Patel:2021:SLK,
  author =       "Chintan Patel and Nishant Doshi",
  title =        "Secure Lightweight Key Exchange Using {ECC} for
                 User-Gateway Paradigm",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "70",
  number =       "11",
  pages =        "1789--1803",
  month =        nov,
  year =         "2021",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2020.3026027",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Oct 14 10:04:00 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Paul:2021:SHL,
  author =       "Jon D. Paul",
  title =        "The Scandalous History of the Last Rotor Cipher
                 Machine: How this gadget figured in the shady {Rubicon}
                 spy case",
  journal =      j-IEEE-SPECTRUM,
  volume =       "58",
  number =       "??",
  pages =        "??--??",
  day =          "31",
  month =        aug,
  year =         "2021",
  DOI =          "https://doi.org/",
  bibdate =      "Fri Jul 29 08:12:02 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://spectrum.ieee.org/the-scandalous-history-of-the-last-rotor-cipher-machine",
  acknowledgement = ack-nhfb,
}

@Article{Paul:2021:TEE,
  author =       "Jon D. Paul",
  title =        "In the Twilight of Electromechanical Encryption, an
                 Exceptional Machine Figured in a Major Spy Scandal",
  journal =      j-IEEE-SPECTRUM,
  volume =       "58",
  number =       "9",
  pages =        "32--52",
  year =         "2021",
  CODEN =        "IEESAM",
  DOI =          "https://doi.org/10.1109/MSPEC.2021.9531013",
  ISSN =         "0018-9235 (print), 1939-9340 (electronic)",
  ISSN-L =       "0018-9235",
  bibdate =      "Fri Oct 1 10:27:41 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeespectrum2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Spectrum",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
  keywords =     "Hagelin HX-3 electromechanical encryption system",
}

@Article{Peng:2021:EDD,
  author =       "Cong Peng and Jianhua Chen and Pandi Vijayakumar and
                 Neeraj Kumar and Debiao He",
  title =        "Efficient Distributed Decryption Scheme for {IoT}
                 Gateway-based Applications",
  journal =      j-TOIT,
  volume =       "21",
  number =       "1",
  pages =        "19:1--19:23",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3414475",
  ISSN =         "1533-5399 (print), 1557-6051 (electronic)",
  ISSN-L =       "1533-5399",
  bibdate =      "Wed Feb 24 21:53:14 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toit.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3414475",
  abstract =     "With the evolvement of the Internet of things (IoT),
                 privacy and security have become the primary indicators
                 for users to deploy IoT applications. In the
                 gateway-based IoT architecture, gateways aggregate data
                 collected by perception-layer devices and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Transactions on Internet Technology (TOIT)",
  journal-URL =  "https://dl.acm.org/loi/toit",
}

@Article{Piao:2021:DSS,
  author =       "Yangheran Piao and Kai Ye and Xiaohui Cui",
  title =        "A Data Sharing Scheme for {GDPR}-Compliance Based on
                 Consortium Blockchain",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "8",
  pages =        "217",
  day =          "21",
  month =        aug,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13080217",
  ISSN =         "1999-5903",
  bibdate =      "Thu Aug 26 10:44:38 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/8/217",
  abstract =     "After the General Data Protection Regulation (GDPR)
                 was introduced, some organizations and big data
                 companies shared data without conducting any privacy
                 protection and compliance authentication, which
                 endangered user data security, and were punished
                 financially for this reason. This study proposes a
                 blockchain-based GDPR compliance data sharing scheme,
                 aiming to promote compliance with regulations and
                 provide a tool for interaction between users and
                 service providers to achieve data security sharing. The
                 zero-knowledge Succinct Non-Interactive Arguments of
                 Knowledge (zk-SNARK) algorithm is adopted for
                 protecting data and ensure that the user's private data
                 can satisfy the individual requirements of the service
                 provider without exposing user data. The proposed
                 scheme ensures mutual authentication through the Proof
                 of Authority consensus based on the Committee
                 Endorsement Mechanism (CEM-PoA), and prevents nodes
                 from doing evil using the reputation incentive
                 mechanism. Theoretical analysis and performance
                 comparison indicate that the scheme meets the
                 confidentiality, availability, and other indicators. It
                 has superiority in efficiency and privacy protection
                 compared with other schemes.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Platt:2021:SAI,
  author =       "Moritz Platt and Peter McBurney",
  title =        "{Sybil} attacks on identity-augmented Proof-of-Stake",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "199",
  number =       "??",
  pages =        "??--??",
  day =          "9",
  month =        nov,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108424",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:05 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621003893",
  acknowledgement = ack-nhfb,
  articleno =    "108424",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Prabhakaran:2021:IRC,
  author =       "Varun Prabhakaran and Ashokkumar Kulandasamy",
  title =        "Integration of recurrent convolutional neural network
                 and optimal encryption scheme for intrusion detection
                 with secure data storage in the cloud",
  journal =      j-COMPUT-INTELL,
  volume =       "37",
  number =       "1",
  pages =        "344--370",
  month =        feb,
  year =         "2021",
  CODEN =        "COMIE6",
  DOI =          "https://doi.org/10.1111/coin.12408",
  ISSN =         "0824-7935 (print), 1467-8640 (electronic)",
  ISSN-L =       "0824-7935",
  bibdate =      "Fri Apr 1 07:47:00 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computintell.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Comput. Intell.",
  fjournal =     "Computational Intelligence",
  journal-URL =  "https://onlinelibrary.wiley.com/journal/14678640",
  onlinedate =   "23 October 2020",
}

@Article{Pulagara:2021:IRC,
  author =       "Seshu Babu Pulagara and P. J. A. Alphonse",
  title =        "An intelligent and robust conditional privacy
                 preserving authentication and group-key management
                 scheme for vehicular ad hoc networks using elliptic
                 curve cryptosystem",
  journal =      j-CCPE,
  volume =       "33",
  number =       "3",
  pages =        "e5153:1--e5153:??",
  day =          "10",
  month =        feb,
  year =         "2021",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.5153",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Tue May 18 08:31:20 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
  onlinedate =   "03 February 2019",
}

@Article{Qasaimeh:2021:SDE,
  author =       "Malik Qasaimeh and Raad S. Al-Qassas and Mohammad
                 Ababneh",
  title =        "Software Design and Experimental Evaluation of a
                 Reduced {AES} for {IoT} Applications",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "11",
  pages =        "273",
  day =          "27",
  month =        oct,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13110273",
  ISSN =         "1999-5903",
  bibdate =      "Wed Jan 19 05:45:13 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/11/273",
  abstract =     "IoT devices include RFID tags, microprocessors,
                 sensors, readers, and actuators. Their main
                 characteristics are their limited resources and
                 computing capabilities, which pose critical challenges
                 to the reliability and security of their applications.
                 Encryption is necessary for security when using these
                 limited-resource devices, but conventional
                 cryptographic algorithms are too heavyweight and
                 resource-demanding to run on IoT infrastructures. This
                 paper presents a lightweight version of AES (called
                 LAES), which provides competitive results in terms of
                 randomness levels and processing time, operating on
                 GF(2 4 ). Detailed mathematical operations and proofs
                 are presented concerning LAES rounds design
                 fundamentals. The proposed LAES algorithm is evaluated
                 based on its randomness, performance, and power
                 consumption; it is then compared to other cryptographic
                 algorithm variants, namely Present, Clefia, and AES.
                 The design of the randomness and performance analysis
                 is based on six measures developed with the help of the
                 NIST test statistical suite of cryptographic
                 applications. The performance and power consumption of
                 LAES on a low-power, 8-bit microcontroller unit were
                 evaluated using an Arduino Uno board. LAES was found to
                 have competitive randomness levels, processing times,
                 and power consumption compared to Present, Clefia, and
                 AES.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Qiao:2021:NPK,
  author =       "Zirui Qiao and Qiliang Yang and Yanwei Zhou and Zhe
                 Xia and Mingwu Zhang",
  title =        "Novel Public-Key Encryption with Continuous Leakage
                 Amplification",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "8",
  pages =        "1163--1177",
  month =        aug,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa124",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat Aug 28 14:54:07 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/8/1163/5921729",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Rafiee:2021:PSO,
  author =       "Mojtaba Rafiee and Shahram Khazaei",
  title =        "Private Set Operations Over Encrypted Cloud Dataset
                 and Applications",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "8",
  pages =        "1145--1162",
  month =        aug,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa123",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat Aug 28 14:54:07 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/8/1145/5921321",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Rahman:2021:CGO,
  author =       "M. Tanjidur Rahman and Nusrat Farzana Dipu and Dhwani
                 Mehta and Shahin Tajik and Mark Tehranipoor and Navid
                 Asadizanjani",
  title =        "{CONCEALING-Gate}: Optical Contactless Probing
                 Resilient Design",
  journal =      j-JETC,
  volume =       "17",
  number =       "3",
  pages =        "39:1--39:25",
  month =        jul,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3446998",
  ISSN =         "1550-4832",
  ISSN-L =       "1550-4832",
  bibdate =      "Sat Aug 14 05:29:37 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jetc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3446998",
  abstract =     "Optical probing, though developed as silicon debugging
                 tools from the chip backside, has shown its capability
                 of extracting secret data, such as cryptographic keys
                 and user identifications, from modern system-on-chip
                 devices. Existing optical probing \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Journal on Emerging Technologies in Computing
                 Systems (JETC)",
  journal-URL =  "https://dl.acm.org/loi/jetc",
}

@Article{Rahman:2021:SAD,
  author =       "M. Sazadur Rahman and Adib Nahiyan and Fahim Rahman
                 and Saverio Fazzari and Kenneth Plaks and Farimah
                 Farahmandi and Domenic Forte and Mark Tehranipoor",
  title =        "Security Assessment of Dynamically Obfuscated Scan
                 Chain Against Oracle-guided Attacks",
  journal =      j-TODAES,
  volume =       "26",
  number =       "4",
  pages =        "29:1--29:27",
  month =        apr,
  year =         "2021",
  CODEN =        "ATASFO",
  DOI =          "https://doi.org/10.1145/3444960",
  ISSN =         "1084-4309 (print), 1557-7309 (electronic)",
  ISSN-L =       "1084-4309",
  bibdate =      "Tue Apr 27 08:06:34 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/todaes.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444960",
  abstract =     "Logic locking has emerged as a promising solution to
                 protect integrated circuits against piracy and
                 tampering. However, the security provided by existing
                 logic locking techniques is often thwarted by Boolean
                 satisfiability (SAT)-based oracle-guided \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Transactions on Design Automation of Electronic
                 Systems",
  journal-URL =  "https://dl.acm.org/loi/todaes",
}

@Article{Ranathunga:2021:MRM,
  author =       "Dinesha Ranathunga and Matthew Roughan and Hung
                 Nguyen",
  title =        "Mathematical Reconciliation of Medical Privacy
                 Policies",
  journal =      j-TMIS,
  volume =       "12",
  number =       "1",
  pages =        "5:1--5:18",
  month =        mar,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3397520",
  ISSN =         "2158-656X (print), 2158-6578 (electronic)",
  ISSN-L =       "2158-656X",
  bibdate =      "Sat Mar 20 18:13:58 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tmis.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3397520",
  abstract =     "Healthcare data are arguably the most private of
                 personal data. This very private information in the
                 wrong hands can lead to identity theft, prescription
                 fraud, insurance fraud, and an array of other crimes.
                 Electronic-health systems such as My Health Record in
                 Australia holds great promise in sharing medical data
                 and improving healthcare quality. But, a key privacy
                 issue in these systems is the misuse of healthcare data
                 by authorities. The recent General Data Protection
                 Regulation (GDPR) introduced in the EU aims to reduce
                 personal-data misuse. But, there are no tools currently
                 available to accurately reconcile a domestic E-health
                 policy against the GDPR to identify discrepancies.
                 Reconciling privacy policies is also non-trivial,
                 because policies are often written in free text, making
                 them subject to human interpretation.\par

                 In this article, we propose a tool that allows the
                 description of E-health privacy policies, represents
                 them using formal constructs making the policies
                 precise and explicit. Using this formal framework, our
                 tool can automatically reconcile a domestic E-health
                 policy against the GDPR to identify violations and
                 omissions. We use our prototype to illustrate several
                 critical flaws in Australia's My Health Record policy,
                 including a non-compliance with GDPR that allows
                 healthcare providers to access medical records by
                 default.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Transactions on Management Information Systems
                 (TMIS)",
  journal-URL =  "https://dl.acm.org/loi/tmis",
}

@Article{Rathore:2021:SHB,
  author =       "Aditya Singh Rathore and Zhengxiong Li and Weijin Zhu
                 and Zhanpeng Jin and Wenyao Xu",
  title =        "A Survey on Heart Biometrics",
  journal =      j-COMP-SURV,
  volume =       "53",
  number =       "6",
  pages =        "114:1--114:38",
  month =        feb,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3410158",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Feb 5 10:42:27 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3410158",
  abstract =     "In recent years, biometrics (e.g., fingerprint or face
                 recognition) has replaced traditional passwords and
                 PINs as a widely used method for user authentication,
                 particularly in personal or mobile devices. Differing
                 from state-of-the-art biometrics, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "114",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ravi:2021:LBK,
  author =       "Prasanna Ravi and James Howe and Anupam Chattopadhyay
                 and Shivam Bhasin",
  title =        "Lattice-based Key-sharing Schemes: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "9:1--9:39",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3422178",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3422178",
  abstract =     "Public-key cryptography is an indispensable component
                 used in almost all of our present-day digital
                 infrastructure. However, most if not all of it is
                 predominantly built upon hardness guarantees of number
                 theoretic problems that can be broken by large-.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Ravikumar:2021:PPB,
  author =       "K. P. Ravikumar and H. S. Manjunatha Reddy",
  title =        "Pixel Prediction-Based Image Steganography Using Crow
                 Search Algorithm-Based Deep Belief Network Approach",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "21",
  number =       "01",
  pages =        "??--??",
  month =        jan,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0219467821500029",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Wed May 5 11:23:12 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0219467821500029",
  abstract =     "Securing the confidentiality of patient information
                 using the image steganography process has gained more
                 attention in the research community. However, embedding
                 the patient information is a major task in the
                 steganography process due to the complexity in
                 identifying the pixel features. Thus, an effective Crow
                 Search Algorithm-based deep belief network (CSA-DBN) is
                 proposed for embedding the information in the medical
                 image. Initially, the appropriate pixels and the
                 features, like pixel coverage, wavelet energy, edge
                 information, and texture features, such as local binary
                 pattern (LBP) and local directional pattern (LDP), are
                 extracted from each pixel. The proposed CSA-DBN
                 utilizes the feature vector and identifies the suitable
                 pixels used for embedding. The patient information is
                 embedded into the image by using the embedding strength
                 and the DWT coefficient. Finally, the embedded
                 information is extracted using the DWT coefficient. The
                 analysis of the proposed CSA-DBN approach is done based
                 on the performance metrics, such as correlation
                 coefficient, peak signal-to-noise ratio (PSNR), and
                 structural similarity index (SSIM) that acquired the
                 average values as 0.9471, 24.836 dB, and 0.4916 in the
                 presence of salt and pepper noise and 0.9741, 57.832
                 dB, and 0.9766 in the absence of noise.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Ren:2021:AIB,
  author =       "Qiuning Ren and Chao Yang and Jianfeng Ma",
  title =        "App identification based on encrypted multi-smartphone
                 sources traffic fingerprints",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "201",
  number =       "??",
  pages =        "??--??",
  day =          "24",
  month =        dec,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108590",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:06 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S138912862100493X",
  acknowledgement = ack-nhfb,
  articleno =    "108590",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Roy:2021:DFA,
  author =       "Dibyendu Roy and Bhagwan Bathe and Subhamoy Maitra",
  title =        "Differential Fault Attack on {Kreyvium} \& {FLIP}",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "70",
  number =       "12",
  pages =        "2161--2167",
  month =        dec,
  year =         "2021",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2020.3038236",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Nov 11 08:55:47 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Russinovich:2021:TCC,
  author =       "Mark Russinovich and Manuel Costa and C{\'e}dric
                 Fournet and David Chisnall and Antoine Delignat-Lavaud
                 and Sylvan Clebsch and Kapil Vaswani and Vikas Bhatia",
  title =        "Toward confidential cloud computing",
  journal =      j-CACM,
  volume =       "64",
  number =       "6",
  pages =        "54--61",
  month =        jun,
  year =         "2021",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/3453930",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Tue May 25 16:39:05 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3453930",
  abstract =     "Extending hardware-enforced cryptographic protection
                 to data while in use.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Article{Sabir:2021:MLD,
  author =       "Bushra Sabir and Faheem Ullah and M. Ali Babar and Raj
                 Gaire",
  title =        "Machine Learning for Detecting Data Exfiltration: a
                 Review",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "3",
  pages =        "50:1--50:47",
  month =        jun,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3442181",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Mon Jun 7 07:26:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3442181",
  abstract =     "Context: Research at the intersection of
                 cybersecurity, Machine Learning (ML), and Software
                 Engineering (SE) has recently taken significant steps
                 in proposing countermeasures for detecting
                 sophisticated data exfiltration attacks. It is
                 important to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Sadhukhan:2021:LRU,
  author =       "Dipanwita Sadhukhan and Sangram Ray and Mou Dasgupta",
  title =        "A lightweight remote user authentication scheme for
                 {IoT} communication using elliptic curve cryptography",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "77",
  number =       "2",
  pages =        "1114--1151",
  month =        feb,
  year =         "2021",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-020-03318-7",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri May 14 09:19:59 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-020-03318-7",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  online-date =  "Published: 07 May 2020 Pages: 1114 - 1151",
}

@Article{Sadri:2021:ATF,
  author =       "Mohammad Javad Sadri and Maryam Rajabzadeh Asaar",
  title =        "An anonymous two-factor authentication protocol for
                 {IoT}-based applications",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "199",
  number =       "??",
  pages =        "??--??",
  day =          "9",
  month =        nov,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108460",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:05 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621004151",
  acknowledgement = ack-nhfb,
  articleno =    "108460",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Sahai:2021:HUI,
  author =       "Amit Sahai and Brent Waters",
  title =        "How to Use Indistinguishability Obfuscation: Deniable
                 Encryption, and More",
  journal =      j-SIAM-J-COMPUT,
  volume =       "50",
  number =       "3",
  pages =        "857--908",
  month =        "????",
  year =         "2021",
  CODEN =        "SMJCAT",
  DOI =          "https://doi.org/10.1137/15M1030108",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  bibdate =      "Wed Jan 19 08:07:44 MST 2022",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/50/3;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
  onlinedate =   "January 2021",
}

@Article{Sahu:2021:LMP,
  author =       "Amiya Kumar Sahu and Suraj Sharma and Deepak Puthal",
  title =        "Lightweight Multi-party Authentication and Key
                 Agreement Protocol in {IoT}-based E-Healthcare
                 Service",
  journal =      j-TOMM,
  volume =       "17",
  number =       "2s",
  pages =        "64:1--64:20",
  month =        jun,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3398039",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Tue Jun 22 08:33:16 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3398039",
  abstract =     "Internet of Things (IoT) is playing a promising role
                 in e-healthcare applications in the recent decades;
                 nevertheless, security is one of the crucial challenges
                 in the current field of study. Many healthcare devices
                 \ldots{} (More)",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Sanzo:2021:DKC,
  author =       "Karen L. Sanzo and Jay Paredes Scribner and Hongyi
                 Wu",
  title =        "Designing a {K-16} Cybersecurity Collaborative:
                 {CIPHER}",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "19",
  number =       "2",
  pages =        "56--59",
  year =         "2021",
  DOI =          "https://doi.org/10.1109/MSEC.2021.3050246",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Wed May 26 13:03:32 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
}

@Article{Sarier:2021:CBB,
  author =       "Neyire Deniz Sarier",
  title =        "Comments on biometric-based non-transferable
                 credentials and their application in blockchain-based
                 identity management",
  journal =      j-COMPUT-SECUR,
  volume =       "105",
  number =       "??",
  pages =        "Article 102243",
  month =        jun,
  year =         "2021",
  CODEN =        "CPSEDU",
  DOI =          "https://doi.org/10.1016/j.cose.2021.102243",
  ISSN =         "0167-4048 (print), 1872-6208 (electronic)",
  ISSN-L =       "0167-4048",
  bibdate =      "Tue May 4 07:59:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167404821000675",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers \& Security",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01674048",
}

@Article{Sasongko:2021:HCS,
  author =       "Arif Sasongko and I. M. Narendra Kumara and Arief
                 Wicaksana and Fr{\'e}d{\'e}ric Rousseau and Olivier
                 Muller",
  title =        "Hardware Context Switch-based Cryptographic
                 Accelerator for Handling Multiple Streams",
  journal =      j-TRETS,
  volume =       "14",
  number =       "3",
  pages =        "14:1--14:25",
  month =        sep,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3460941",
  ISSN =         "1936-7406 (print), 1936-7414 (electronic)",
  ISSN-L =       "1936-7406",
  bibdate =      "Sat Aug 21 07:50:22 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/trets.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3460941",
  abstract =     "The confidentiality and integrity of a stream has
                 become one of the biggest issues in telecommunication.
                 The best available algorithm handling the
                 confidentiality of a data stream is the symmetric key
                 block cipher combined with a chaining mode of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Transactions on Reconfigurable Technology and
                 Systems (TRETS)",
  journal-URL =  "https://dl.acm.org/loi/trets",
}

@Article{Satar:2021:TVC,
  author =       "Siti Dhalila Mohd Satar and Masnida Hussin and Zurina
                 Mohd Hanapi and Mohamad Afendee Mohamed",
  title =        "Towards Virtuous Cloud Data Storage Using Access
                 Policy Hiding in Ciphertext Policy Attribute-Based
                 Encryption",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "11",
  pages =        "279",
  day =          "30",
  month =        oct,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13110279",
  ISSN =         "1999-5903",
  bibdate =      "Wed Jan 19 05:45:13 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/11/279",
  abstract =     "Managing and controlling access to the tremendous data
                 in Cloud storage is very challenging. Due to various
                 entities engaged in the Cloud environment, there is a
                 high possibility of data tampering. Cloud encryption is
                 being employed to control data access while securing
                 Cloud data. The encrypted data are sent to Cloud
                 storage with an access policy defined by the data
                 owner. Only authorized users can decrypt the encrypted
                 data. However, the access policy of the encrypted data
                 is in readable form, which results in privacy leakage.
                 To address this issue, we proposed a reinforcement
                 hiding in access policy over Cloud storage by enhancing
                 the Ciphertext Policy Attribute-based Encryption
                 (CP-ABE) algorithm. Besides the encryption process, the
                 reinforced CP-ABE used logical connective operations to
                 hide the attribute value of data in the access policy.
                 These attributes were converted into scrambled data
                 along with a ciphertext form that provides a better
                 unreadability feature. It means that a two-level
                 concealed tactic is employed to secure data from any
                 unauthorized access during a data transaction.
                 Experimental results revealed that our reinforced
                 CP-ABE had a low computational overhead and consumed
                 low storage costs. Furthermore, a case study on
                 security analysis shows that our approach is secure
                 against a passive attack such as traffic analysis.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@TechReport{Schnorr:2021:FFI,
  author =       "Claus Peter Schnorr",
  title =        "Fast Factoring Integers by {SVP} Algorithms",
  type =         "Report",
  institution =  "Fachbereich Informatik und Mathematik,
                 Goethe-Universit{\"a}t Frankfurt",
  address =      "PSF 111932, D-60054 Frankfurt am Main, Germany",
  day =          "11",
  month =        mar,
  year =         "2021",
  bibdate =      "Sat Mar 13 13:12:37 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://eprint.iacr.org/2021/232.pdf",
  abstract =     "To factor an integer $N$, we construct $n$ triples of
                 $ p_n$-smooth integers $ u, v, | u v N|$ for the $n$-th
                 prime $ p_n$. Denote such triple a fac-relation. We get
                 fac-relations from a nearly shortest vector of the
                 lattice $ L(R_n, f)$ with basis matrix $ R_{n, f} \in
                 \mathbb {R}^{(n + 1) \times (n + 1)}$ where $ f \colon
                 [1, n] \to [1, n]$ is a permutation of $ [1, 2, \slash,
                 n]$ and $ (N f(1), \ldots {}, N f(n))$ for $ N = N^{1 /
                 (n + 1)}$ is the diagonal of $ R_{n, f}$. An
                 independent permutation $f$ yields an independent
                 fac-relation. We find sufficiently short lattice
                 vectors by strong primal-dual reduction of $ R_{n, f}$.
                 We factor $ N \approx 2^{400}$ by $ n = 47$ and $ N
                 \approx 2^{800} $ by $ n = 95$. Our accelerated strong
                 primal-dual reduction of [GN08] factors integers $ N
                 \approx 2^{400}$ and $ N \approx 2^{800}$ by $ 4.2
                 \cdot 10^9$ and $ 8.4 \cdot 10^{10}$ arithmetic
                 operations, much faster then the quadratic sieve and
                 the number field sieve and using much smaller primes $
                 p_n$. This destroys the RSA cryptosystem.",
  acknowledgement = ack-nhfb,
}

@Article{Sehrawat:2021:EST,
  author =       "Vipin Singh Sehrawat and Foo Yee Yeo and Yvo Desmedt",
  title =        "Extremal set theory and {LWE} based access structure
                 hiding verifiable secret sharing with
                 malicious-majority and free verification",
  journal =      j-THEOR-COMP-SCI,
  volume =       "886",
  number =       "??",
  pages =        "106--138",
  day =          "13",
  month =        sep,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.07.022",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Jan 26 14:22:28 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521004266",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Sepulveda:2021:BCA,
  author =       "Johanna Sep{\'u}lveda and Mathieu Gross and Andreas
                 Zankl and Georg Sigl",
  title =        "Beyond Cache Attacks: Exploiting the Bus-based
                 Communication Structure for Powerful On-Chip
                 Microarchitectural Attacks",
  journal =      j-TECS,
  volume =       "20",
  number =       "2",
  pages =        "17:1--17:23",
  month =        mar,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3433653",
  ISSN =         "1539-9087 (print), 1558-3465 (electronic)",
  ISSN-L =       "1539-9087",
  bibdate =      "Sat Mar 20 17:37:34 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tecs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3433653",
  abstract =     "System-on-Chips (SoCs) are a key enabling technology
                 for the Internet-of-Things (IoT), a hyper-connected
                 world where on- and inter-chip communication is
                 ubiquitous. SoCs usually integrate cryptographic
                 hardware cores for confidentiality and authentication
                 services. However, these components are prone to
                 implementation attacks. During the operation of a
                 cryptographic core, the secret key may passively be
                 inferred through cache observations. Access-driven
                 attacks exploiting these observations are therefore a
                 vital threat to SoCs operating in IoT environments.
                 Previous works have shown the feasibility of these
                 attacks in the SoC context. Yet, the SoC communication
                 structure can be used to further improve access-based
                 cache attacks. The communication attacks are not as
                 well-understood as other micro-architectural attacks.
                 It is important to raise the awareness of SoC designers
                 of such a threat. To this end, we present four
                 contributions. First, we demonstrate an improved
                 Prime+Probe attack on four different AES-128
                 implementations (original transformation tables,
                 T0-Only, T2KB, and S-Box). As a novelty, this attack
                 exploits the collisions of the bus-based SoC
                 communication to further increase its efficiency.
                 Second, we explore the impact of preloading on the
                 efficiency of our communication-optimized attack.
                 Third, we integrate three countermeasures (shuffling,
                 mini-tables, and Time-Division Multiple Access (TDMA)
                 bus arbitration) and evaluate their impact on the
                 attack. Although shuffling and mini-tables
                 countermeasures were proposed in previous work, their
                 application as countermeasures against the bus-based
                 attack was not studied before. In addition, TDMA as a
                 countermeasure for bus-based attacks is an original
                 contribution of this work. Fourth, we further discuss
                 the implications of our work in the SoC design and its
                 perspective with the new cryptographic primitives
                 proposed in the ongoing National Institute of Standard
                 and Technology Lightweight Cryptography competition.
                 The results show that our improved
                 communication-optimized attack is efficient, speeding
                 up full key recovery by up to 400 times when compared
                 to the traditional Prime+Probe technique. Moreover, the
                 protection techniques are feasible and effectively
                 mitigate the proposed improved attack.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Transactions on Embedded Computing Systems",
  journal-URL =  "https://dl.acm.org/loi/tecs",
}

@Article{Shaikh:2021:STB,
  author =       "Ayesha S. Shaikh and Vibha D. Patel",
  title =        "Significance of the Transition to Biometric Template
                 Protection: Explore the Future",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "21",
  number =       "02",
  pages =        "??--??",
  month =        apr,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S021946782150025X",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Wed May 5 11:23:13 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S021946782150025X",
  abstract =     "The IT security paradigm evolves from secret-based to
                 biometric identity-based. Biometric identification has
                 gradually become more popular in recent years for
                 handheld devices. Privacy-preserving is a key concern
                 when biometrics is used in authentication systems in
                 the present world today. Nowadays, the declaration of
                 biometric traits has been imposed not only by the
                 government but also by many private entities. There are
                 no proper mechanisms and assurance that biometric
                 traits will be kept safe by such entities. The
                 encryption of biometric traits to avoid privacy attacks
                 is a giant problem. Hence, state-of-the-art safety and
                 security technological solutions must be devised to
                 prevent the loss and misuse of such biometric traits.
                 In this paper, we have identified different cancelable
                 biometrics methods with the possible attacks on the
                 biometric traits and directions on possible
                 countermeasures in order to design a secure and
                 privacy-preserving biometric authentication system. We
                 also proposed a highly secure method for cancelable
                 biometrics using a non-invertible function based on
                 Discrete Cosine Transformation and Index of max
                 hashing. We tested and evaluated the proposed novel
                 method on a standard dataset and achieved good
                 results.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Shang:2021:IBD,
  author =       "Tao Shang and Feng Zhang and Xingyue Chen and Jianwei
                 Liu and Xinxi Lu",
  title =        "Identity-Based Dynamic Data Auditing for Big Data
                 Storage",
  journal =      j-IEEE-TRANS-BIG-DATA,
  volume =       "7",
  number =       "6",
  pages =        "913--921",
  month =        dec,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1109/TBDATA.2019.2941882",
  ISSN =         "2332-7790",
  ISSN-L =       "2332-7790",
  bibdate =      "Thu Apr 7 15:41:53 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransbigdata.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Big Data",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6687317",
}

@Article{Shao:2021:EBR,
  author =       "Huiru Shao and Jing Li and Jia Zhang and Hui Yu and
                 Jiande Sun",
  title =        "Eye-based Recognition for User Identification on
                 Mobile Devices",
  journal =      j-TOMM,
  volume =       "16",
  number =       "4",
  pages =        "117:1--117:19",
  month =        jan,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3399659",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Wed Feb 10 10:15:11 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3399659",
  abstract =     "User identification is becoming more and more
                 important for Apps on mobile devices. However, the
                 identity recognition based on eyes, e.g., iris
                 recognition, is rarely used on mobile devices comparing
                 with those based on face and fingerprint due to its
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "117",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Sharma:2021:BSD,
  author =       "N. Sharma and A. Anand and A. K. Singh",
  title =        "Bio-signal data sharing security through watermarking:
                 a technical survey",
  journal =      j-COMPUTING,
  volume =       "103",
  number =       "9",
  pages =        "1883--1917",
  month =        sep,
  year =         "2021",
  CODEN =        "CMPTA2",
  DOI =          "https://doi.org/10.1007/s00607-020-00881-y",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Mon May 9 09:55:41 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s00607-020-00881-y",
  acknowledgement = ack-nhfb,
  ajournal =     "Computing",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
}

@Article{Shen:2021:SAC,
  author =       "Jian Shen and Dengzhi Liu and Qi Liu and Xingming Sun
                 and Yan Zhang",
  title =        "Secure Authentication in Cloud Big Data with
                 Hierarchical Attribute Authorization Structure",
  journal =      j-IEEE-TRANS-BIG-DATA,
  volume =       "7",
  number =       "4",
  pages =        "668--677",
  year =         "2021",
  DOI =          "https://doi.org/10.1109/TBDATA.2017.2705048",
  ISSN =         "2332-7790",
  bibdate =      "Fri Aug 13 08:39:03 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransbigdata.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Big Data",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6687317",
}

@Article{Shi:2021:AVC,
  author =       "Cong Shi and Yan Wang and Yingying Jennifer Chen and
                 Nitesh Saxena",
  title =        "Authentication of Voice Commands by Leveraging
                 Vibrations in Wearables",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "19",
  number =       "6",
  pages =        "83--92",
  month =        nov # "\slash " # dec,
  year =         "2021",
  DOI =          "https://doi.org/10.1109/MSEC.2021.3077205",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Mon Jan 31 15:37:00 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
}

@Article{Shi:2021:TMO,
  author =       "Xiaofeng Shi and Haofan Cai and Minmei Wang and Ge
                 Wang and Baiwen Huang and Junjie Xie and Chen Qian",
  title =        "{TagAttention}: Mobile Object Tracing With Zero
                 Appearance Knowledge by Vision-{RFID} Fusion",
  journal =      j-IEEE-TRANS-NETWORKING,
  volume =       "29",
  number =       "2",
  pages =        "890--903",
  month =        apr,
  year =         "2021",
  CODEN =        "IEANEP",
  DOI =          "https://doi.org/10.1109/TNET.2021.3052805",
  ISSN =         "1063-6692 (print), 1558-2566 (electronic)",
  ISSN-L =       "1063-6692",
  bibdate =      "Tue Jun 15 09:48:17 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
  URL =          "https://dl.acm.org/doi/10.1109/TNET.2021.3052805",
  abstract =     "We propose to study mobile object tracing, which
                 allows a mobile system to report the shape, location,
                 and trajectory of the mobile objects appearing in a
                 video camera and identifies each of them with its
                 cyber-identity (ID), even if the appearances of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE\slash ACM Transactions on Networking",
  journal-URL =  "https://dl.acm.org/loi/ton",
}

@Article{Shi:2021:WEU,
  author =       "Cong Shi and Jian Liu and Hongbo Liu and Yingying
                 Chen",
  title =        "{WiFi}-Enabled User Authentication through Deep
                 Learning in Daily Activities",
  journal =      j-TIOT,
  volume =       "2",
  number =       "2",
  pages =        "13:1--13:25",
  month =        may,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3448738",
  ISSN =         "2691-1914 (print), 2577-6207 (electronic)",
  ISSN-L =       "2691-1914",
  bibdate =      "Wed May 5 11:10:26 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tiot.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3448738",
  abstract =     "User authentication is a critical process in both
                 corporate and home environments due to the ever-growing
                 security and privacy concerns. With the advancement of
                 smart cities and home environments, the concept of user
                 authentication is evolved with a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Transactions on Internet of Things (TIOT)",
  journal-URL =  "https://dl.acm.org/loi/tiot",
}

@Article{Shin:2021:VBP,
  author =       "Ji Sun Shin and Minjae Jo and Jung Yeon Hwang and
                 Jaehwan Lee",
  title =        "A Verifier-Based Password-Authenticated Key Exchange
                 Using Tamper-Proof Hardware",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "8",
  pages =        "1293--1302",
  month =        aug,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa178",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat Aug 28 14:54:07 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/8/1293/6064819",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Siddiqui:2021:CBV,
  author =       "Tanveer J. Siddiqui and Ashish Khare",
  title =        "Chaos-based Video Steganography Method in Discrete
                 Cosine Transform Domain",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "21",
  number =       "02",
  pages =        "??--??",
  month =        apr,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0219467821500157",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Wed May 5 11:23:13 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0219467821500157",
  abstract =     "Due to the technological advancements in digital
                 communication, the amount of multimedia content over
                 the internet has increased manifold in past decade.
                 This has renewed the internet of researchers in the
                 area of privacy and secure communication. This paper
                 presents a secure and robust video steganography method
                 in discrete cosine transform (DCT) domain. In order to
                 enhance the security of the proposed algorithm, the
                 frame selection process is randomized and the secret
                 data are pre-treated using Arnold's cat map. The secret
                 data are embedded in the middle band DCT coefficient
                 using two pseudo random sequences. These sequences are
                 generated using a chaotic map. We analyze the proposed
                 algorithm in terms of peak signal-to-noise ratio
                 (PSNR), structural similarity index (SSIM), multi-scale
                 structural similarity index (MSSIM) and video quality
                 metric (VQM). The evaluation has been done on 107 video
                 sequences. The experimental results demonstrate that
                 the algorithm maintains acceptable video quality. The
                 robustness of the proposed method is tested under
                 Gaussian and salt and pepper noise attack using
                 correlation between original and recovered images. The
                 proposed algorithm is able to recover 90.60\% data
                 without error under salt and pepper noise ( D=0.001 )
                 attack and 87.23\% data correctly under Gaussian noise
                 attack with mean $ = 0 $ and variance $ = 0.001 $.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Singh:2021:JEC,
  author =       "A. K. Singh and S. Thakur and Alireza Jolfaei and
                 Gautam Srivastava and MD. Elhoseny and A. Mohan",
  title =        "Joint Encryption and Compression-Based Watermarking
                 Technique for Security of Digital Documents",
  journal =      j-TOIT,
  volume =       "21",
  number =       "1",
  pages =        "18:1--18:20",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3414474",
  ISSN =         "1533-5399 (print), 1557-6051 (electronic)",
  ISSN-L =       "1533-5399",
  bibdate =      "Wed Feb 24 21:53:14 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toit.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3414474",
  abstract =     "Recently, due to the increase in popularity of the
                 Internet, the problem of digital data security over the
                 Internet is increasing at a phenomenal rate.
                 Watermarking is used for various notable applications
                 to secure digital data from unauthorized \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Transactions on Internet Technology (TOIT)",
  journal-URL =  "https://dl.acm.org/loi/toit",
}

@Article{Sisman:2021:OVC,
  author =       "Berrak Sisman and Junichi Yamagishi and Simon King and
                 Haizhou Li",
  title =        "An Overview of Voice Conversion and Its Challenges:
                 From Statistical Modeling to Deep Learning",
  journal =      j-IEEE-ACM-TASLP,
  volume =       "29",
  number =       "??",
  pages =        "132--157",
  month =        jan,
  year =         "2021",
  DOI =          "https://doi.org/10.1109/TASLP.2020.3038524",
  bibdate =      "Thu May 27 17:56:39 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeeacmtaslp.bib",
  URL =          "https://dl.acm.org/doi/10.1109/TASLP.2020.3038524",
  abstract =     "Speaker identity is one of the important
                 characteristics of human speech. In voice conversion,
                 we change the speaker identity from one to another,
                 while keeping the linguistic content unchanged. Voice
                 conversion involves multiple speech processing
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE\slash ACM Transactions on Audio, Speech, and
                 Language Processing",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6570655",
}

@Article{Sun:2021:BEN,
  author =       "Yuanyuan Sun and Sheng Wang and Huorong Li and Feifei
                 Li",
  title =        "Building enclave-native storage engines for practical
                 encrypted databases",
  journal =      j-PROC-VLDB-ENDOWMENT,
  volume =       "14",
  number =       "6",
  pages =        "1019--1032",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.14778/3447689.3447705",
  ISSN =         "2150-8097",
  bibdate =      "Tue Apr 13 13:43:38 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
  URL =          "https://dl.acm.org/doi/10.14778/3447689.3447705",
  abstract =     "Data confidentiality is one of the biggest concerns
                 that hinders enterprise customers from moving their
                 workloads to the cloud. Thanks to the trusted execution
                 environment (TEE), it is now feasible to build
                 encrypted databases in the enclave that can \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the VLDB Endowment",
  journal-URL =  "https://dl.acm.org/loi/pvldb",
}

@Article{Susilo:2021:WTA,
  author =       "Willy Susilo and Joseph Tonien",
  title =        "A {Wiener}-type attack on an {RSA}-like cryptosystem
                 constructed from cubic {Pell} equations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "885",
  number =       "??",
  pages =        "125--130",
  day =          "11",
  month =        sep,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.06.033",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Sep 4 11:08:23 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S030439752100390X",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Tabrizian:2021:HAN,
  author =       "Roozbeh Tabrizian and Swarup Bhunia",
  title =        "The Hidden Authenticators: Nanometer-Scale
                 Electromechanical Tags Could Thwart Counterfeiters",
  journal =      j-IEEE-SPECTRUM,
  volume =       "58",
  number =       "6",
  pages =        "32--37",
  month =        jun,
  year =         "2021",
  CODEN =        "IEESAM",
  DOI =          "https://doi.org/10.1109/MSPEC.2021.9444937",
  ISSN =         "0018-9235 (print), 1939-9340 (electronic)",
  ISSN-L =       "0018-9235",
  bibdate =      "Fri Jun 4 12:04:57 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeespectrum2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Spectrum",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
}

@Article{Tahir:2021:NIP,
  author =       "Ruhma Tahir and Shahzaib Tahir and Hasan Tahir and
                 Klaus McDonald-Maier and Gareth Howells and Ali
                 Sajjad",
  title =        "A novel {ICMetric} public key framework for secure
                 communication",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "195",
  number =       "??",
  pages =        "??--??",
  day =          "1",
  month =        dec,
  year =         "2021",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2021.103235",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Thu Jan 20 08:06:57 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804521002332",
  acknowledgement = ack-nhfb,
  articleno =    "103235",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Takayasu:2021:RIB,
  author =       "Atsushi Takayasu and Yohei Watanabe",
  title =        "Revocable identity-based encryption with bounded
                 decryption key exposure resistance: Lattice-based
                 construction and more",
  journal =      j-THEOR-COMP-SCI,
  volume =       "849",
  number =       "??",
  pages =        "64--98",
  day =          "6",
  month =        jan,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2020.10.010",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Mar 12 06:53:49 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S030439752030579X",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Taleb:2021:SVD,
  author =       "Abdul Rahman Taleb and Damien Vergnaud",
  title =        "Speeding-up verification of digital signatures",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "116",
  number =       "??",
  pages =        "22--39",
  month =        mar,
  year =         "2021",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1016/j.jcss.2020.08.005",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  bibdate =      "Wed May 26 15:41:29 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0022000020300854",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
}

@Article{Tan:2021:BEA,
  author =       "Liang Tan and Na Shi and Keping Yu and Moayad Aloqaily
                 and Yaser Jararweh",
  title =        "A Blockchain-empowered Access Control Framework for
                 Smart Devices in Green {Internet of Things}",
  journal =      j-TOIT,
  volume =       "21",
  number =       "3",
  pages =        "80:1--80:20",
  month =        jun,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3433542",
  ISSN =         "1533-5399 (print), 1557-6051 (electronic)",
  ISSN-L =       "1533-5399",
  bibdate =      "Sat Aug 7 15:54:18 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toit.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3433542",
  abstract =     "Green Internet of things (GIoT) generally refers to a
                 new generation of Internet of things design concept. It
                 can save energy and reduce emissions, reduce
                 environmental pollution, waste of resources, and harm
                 to human body and environment, in which green smart
                 device (GSD) is a basic unit of GIoT for saving energy.
                 With the access of a large number of heterogeneous
                 bottom-layer GSDs in GIoT, user access and control of
                 GSDs have become more and more complicated. Since there
                 is no unified GSD management system, users need to
                 operate different GIoT applications and access
                 different GIoT cloud platforms when accessing and
                 controlling these heterogeneous GSDs. This fragmented
                 GSD management model not only increases the complexity
                 of user access and control for heterogeneous GSDs, but
                 also reduces the scalability of GSDs applications. To
                 address this issue, this article presents a
                 blockchain-empowered general GSD access control
                 framework, which provides users with a unified GSD
                 management platform. First, based on the World Wide Web
                 Consortium (W3C) decentralized identifiers (DIDs)
                 standard, users and GSD are issued visual identity
                 (VID). Then, we extended the GSD-DIDs protocol to
                 authenticate devices and users. Finally, based on the
                 characteristics of decentralization and non-tampering
                 of blockchain, a unified access control system for GSD
                 was designed, including the registration, granting, and
                 revoking of access rights. We implement and test on the
                 Raspberry Pi device and the FISCO-BCOS alliance chain.
                 The experimental results prove that the framework
                 provides a unified and feasible way for users to
                 achieve decentralized, lightweight, and fine-grained
                 access control of GSDs. The solution reduces the
                 complexity of accessing and controlling GSDs, enhances
                 the scalability of GSD applications, as well as
                 guarantees the credibility and immutability of
                 permission data and identity data during access.",
  acknowledgement = ack-nhfb,
  articleno =    "80",
  fjournal =     "ACM Transactions on Internet Technology (TOIT)",
  journal-URL =  "https://dl.acm.org/loi/toit",
}

@Article{Tang:2021:STM,
  author =       "Xinyu Tang and Cheng Guo and Kim-Kwang Raymond Choo
                 and Yining Liu and Long Li",
  title =        "A secure and trustworthy medical record sharing scheme
                 based on searchable encryption and blockchain",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "200",
  number =       "??",
  pages =        "??--??",
  day =          "9",
  month =        dec,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108540",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:06 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S138912862100462X",
  acknowledgement = ack-nhfb,
  articleno =    "108540",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Tarkhanov:2021:CAI,
  author =       "I. A. Tarkhanov and D. V. Fomin-Nilov and M. V.
                 Fomin",
  title =        "Crypto access: {Is} it possible to use
                 cryptocurrencies in scholarly periodicals?",
  journal =      j-LEARN-PUBL,
  volume =       "34",
  number =       "2",
  pages =        "253--261",
  month =        apr,
  year =         "2021",
  CODEN =        "LEPUFJ",
  DOI =          "https://doi.org/10.1002/leap.1331",
  ISSN =         "0953-1513 (print), 1741-4857 (electronic)",
  ISSN-L =       "0953-1513",
  bibdate =      "Sat May 15 09:09:56 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/learnpubl.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Learn. Publ.",
  fjournal =     "Learned Publishing",
  journal-URL =  "https://onlinelibrary.wiley.com/journal/17414857",
  onlinedate =   "16 September 2020",
}

@Article{Thakur:2021:NDB,
  author =       "S. Thakur and A. K. Singh and S. P. Ghrera",
  title =        "{NSCT} domain-based secure multiple-watermarking
                 technique through lightweight encryption for medical
                 images",
  journal =      j-CCPE,
  volume =       "33",
  number =       "2",
  pages =        "e5108:1--e5108:??",
  day =          "25",
  month =        jan,
  year =         "2021",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.5108",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Tue May 18 08:31:19 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
  onlinedate =   "26 December 2018",
}

@Article{Thao:2021:OSS,
  author =       "Tran Phuong Thao and Mohammad Shahriar Rahman and Md
                 Zakirul Alam Bhuiyan and Ayumu Kubota and Shinsaku
                 Kiyomoto and Kazumasa Omote",
  title =        "Optimizing Share Size in Efficient and Robust Secret
                 Sharing Scheme for Big Data",
  journal =      j-IEEE-TRANS-BIG-DATA,
  volume =       "7",
  number =       "4",
  pages =        "703--716",
  year =         "2021",
  DOI =          "https://doi.org/10.1109/TBDATA.2017.2708085",
  ISSN =         "2332-7790",
  bibdate =      "Fri Aug 13 08:39:03 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransbigdata.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Big Data",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6687317",
}

@Article{Tian:2021:CIG,
  author =       "Jiajie Tian and Qihao Tang and Rui Li and Zhu Teng and
                 Baopeng Zhang and Jianping Fan",
  title =        "A Camera Identity-guided Distribution Consistency
                 Method for Unsupervised Multi-target Domain Person
                 Re-identification",
  journal =      j-TIST,
  volume =       "12",
  number =       "4",
  pages =        "38:1--38:18",
  month =        aug,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3454130",
  ISSN =         "2157-6904 (print), 2157-6912 (electronic)",
  ISSN-L =       "2157-6904",
  bibdate =      "Sat Aug 28 07:23:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tist.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3454130",
  abstract =     "Unsupervised domain adaptation (UDA) for person
                 re-identification (re-ID) is a challenging task due to
                 large variations in human classes, illuminations,
                 camera views, and so on. Currently, existing UDA
                 methods focus on two-domain adaptation and are
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Transactions on Intelligent Systems and Technology
                 (TIST)",
  journal-URL =  "https://dl.acm.org/loi/tist",
}

@Article{Tian:2021:URS,
  author =       "Yangguang Tian and Yingjiu Li and Yi Mu and Guomin
                 Yang",
  title =        "Unlinkable and Revocable Secret Handshake",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "8",
  pages =        "1303--1314",
  month =        aug,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa181",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat Aug 28 14:54:07 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/8/1303/6095852",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Tong:2021:IPP,
  author =       "Chao Tong and Mengze Zhang and Chao Lang and Zhigao
                 Zheng",
  title =        "An Image Privacy Protection Algorithm Based on
                 Adversarial Perturbation Generative Networks",
  journal =      j-TOMM,
  volume =       "17",
  number =       "2",
  pages =        "43:1--43:14",
  month =        jun,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3381088",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Sat Jun 5 07:35:45 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3381088",
  abstract =     "Today, users of social platforms upload a large number
                 of photos. These photos contain personal private
                 information, including user identity information, which
                 is easily gleaned by intelligent detection algorithms.
                 To thwart this, in this work, we \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Tsai:2021:LST,
  author =       "Po-An Tsai and Andres Sanchez and Christopher W.
                 Fletcher and Daniel Sanchez",
  title =        "Leaking Secrets Through Compressed Caches",
  journal =      j-IEEE-MICRO,
  volume =       "41",
  number =       "3",
  pages =        "27--33",
  year =         "2021",
  CODEN =        "IEMIDZ",
  DOI =          "https://doi.org/10.1109/MM.2021.3069158",
  ISSN =         "0272-1732 (print), 1937-4143 (electronic)",
  ISSN-L =       "0272-1732",
  bibdate =      "Thu May 27 07:44:43 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Micro",
  journal-URL =  "http://www.computer.org/csdl/mags/mi/index.html",
}

@Article{Tseng:2021:LLR,
  author =       "Yuh-Min Tseng and Jian-Lun Chen and Sen-Shan Huang",
  title =        "A Lightweight Leakage-Resilient Identity-Based Mutual
                 Authentication and Key Exchange Protocol for
                 Resource-limited Devices",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "196",
  number =       "??",
  pages =        "??--??",
  day =          "4",
  month =        sep,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108246",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:03 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621002826",
  acknowledgement = ack-nhfb,
  articleno =    "108246",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Tsiokanos:2021:DPD,
  author =       "Ioannis Tsiokanos and Jack Miskelly and Chongyan Gu
                 and Maire O'neill and Georgios Karakonstantis",
  title =        "{DTA-PUF}: Dynamic Timing-aware Physical Unclonable
                 Function for Resource-constrained Devices",
  journal =      j-JETC,
  volume =       "17",
  number =       "3",
  pages =        "32:1--32:24",
  month =        jul,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3434281",
  ISSN =         "1550-4832",
  ISSN-L =       "1550-4832",
  bibdate =      "Sat Aug 14 05:29:37 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jetc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3434281",
  abstract =     "In recent years, physical unclonable functions (PUFs)
                 have gained a lot of attention as mechanisms for
                 hardware-rooted device authentication. While the
                 majority of the previously proposed PUFs derive entropy
                 using dedicated circuitry, software PUFs \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Journal on Emerging Technologies in Computing
                 Systems (JETC)",
  journal-URL =  "https://dl.acm.org/loi/jetc",
}

@Article{Tu:2021:ROM,
  author =       "Shanshan Tu and Muhammad Waqas and Fengming Huang and
                 Ghulam Abbas and Ziaul Haq Abbas",
  title =        "A revocable and outsourced multi-authority
                 attribute-based encryption scheme in fog computing",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "195",
  number =       "??",
  pages =        "??--??",
  day =          "4",
  month =        aug,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108196",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:03 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621002474",
  acknowledgement = ack-nhfb,
  articleno =    "108196",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Tu:2021:SLM,
  author =       "Yu-Ju Tu and Gaurav Kapoor and Selwyn Piramuthu",
  title =        "Security of lightweight mutual authentication
                 protocols",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "77",
  number =       "5",
  pages =        "4565--4581",
  month =        may,
  year =         "2021",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-020-03448-y",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri May 14 09:20:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-020-03448-y",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  online-date =  "Published: 15 October 2020 Pages: 4565 - 4581",
}

@Article{Unal:2021:SEI,
  author =       "Devrim Unal and Abdulla Al-Ali and Ferhat Ozgur Catak
                 and Mohammad Hammoudeh",
  title =        "A secure and efficient {Internet of Things} cloud
                 encryption scheme with forensics investigation
                 compatibility based on identity-based encryption",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "125",
  number =       "??",
  pages =        "433--445",
  month =        dec,
  year =         "2021",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2021.06.050",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Wed Feb 9 09:07:21 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X21002454",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Vanderhallen:2021:RAA,
  author =       "Stien Vanderhallen and Jo {Van Bulck} and Frank
                 Piessens and Jan Tobias M{\"u}hlberg",
  title =        "Robust authentication for automotive control networks
                 through covert channels",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "193",
  number =       "??",
  pages =        "??--??",
  day =          "5",
  month =        jul,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108079",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621001699",
  acknowledgement = ack-nhfb,
  articleno =    "108079",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Varshney:2021:RCU,
  author =       "Shubham Varshney and Pankaj Charpe and S. K. Pal",
  title =        "Relation collection using {Pollard} special-$q$
                 sieving to solve integer factorization and discrete
                 logarithm problem",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "77",
  number =       "3",
  pages =        "2734--2769",
  month =        mar,
  year =         "2021",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-020-03351-6",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri May 14 09:19:59 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-020-03351-6",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  online-date =  "Published: 02 July 2020 Pages: 2734 - 2769",
}

@Article{Vasudev:2021:SPP,
  author =       "Harsha Vasudev and Debasis Das",
  title =        "{$ P^2$-SHARP}: Privacy Preserving Secure Hash based
                 Authentication and Revelation Protocol in {IoVs}",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "191",
  number =       "??",
  pages =        "??--??",
  day =          "22",
  month =        may,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.107989",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:01 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621001146",
  acknowledgement = ack-nhfb,
  articleno =    "107989",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Vishwakarma:2021:SIS,
  author =       "Lokendra Vishwakarma and Debasis Das",
  title =        "{SCAB--IoTA}: Secure communication and authentication
                 for {IoT} applications using blockchain",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "154",
  number =       "??",
  pages =        "94--105",
  month =        aug,
  year =         "2021",
  CODEN =        "JPDCER",
  DOI =          "https://doi.org/10.1016/j.jpdc.2021.04.003",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Thu Feb 10 06:39:17 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0743731521000800",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
}

@Article{Wang:2021:ABB,
  author =       "Qin Wang and Shiping Chen and Yang Xiang",
  title =        "Anonymous Blockchain-based System for Consortium",
  journal =      j-TMIS,
  volume =       "12",
  number =       "3",
  pages =        "26:1--26:25",
  month =        jul,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3459087",
  ISSN =         "2158-656X (print), 2158-6578 (electronic)",
  ISSN-L =       "2158-656X",
  bibdate =      "Thu Jul 22 08:13:40 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tmis.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3459087",
  abstract =     "Blockchain records transactions with various
                 protection techniques against tampering. To meet the
                 requirements on cooperation and anonymity of companies
                 and organizations, researchers have developed a few
                 solutions. Ring signature-based schemes allow multiple
                 participants cooperatively to manage while preserving
                 their individuals' privacy. However, the solutions
                 cannot work properly due to the increased computing
                 complexity along with the expanded group size. In this
                 article, we propose a Multi-center Anonymous
                 Blockchain-based (MAB) system, with joint management
                 for the consortium and privacy protection for the
                 participants. To achieve that, we formalize the syntax
                 used by the MAB system and present a general
                 construction based on a modular design. By applying
                 cryptographic primitives to each module, we instantiate
                 our scheme with anonymity and decentralization.
                 Furthermore, we carry out a comprehensive formal
                 analysis of our exemplified scheme. A proof of concept
                 simulation is provided to show the feasibility. The
                 results demonstrate security and efficiency from both
                 theoretical perspectives and practical perspectives.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Transactions on Management Information Systems
                 (TMIS)",
  journal-URL =  "https://dl.acm.org/loi/tmis",
}

@Article{Wang:2021:ADU,
  author =       "Xuerui Wang and Zheng Yan and Rui Zhang and Peng
                 Zhang",
  title =        "Attacks and defenses in user authentication systems: a
                 survey",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "188",
  number =       "??",
  pages =        "??--??",
  day =          "15",
  month =        aug,
  year =         "2021",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2021.103080",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Fri Jul 23 07:41:03 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804521001028",
  acknowledgement = ack-nhfb,
  articleno =    "103080",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Wang:2021:BSS,
  author =       "Pan Wang and Zixuan Wang and Feng Ye and Xuejiao
                 Chen",
  title =        "{ByteSGAN}: a semi-supervised Generative Adversarial
                 Network for encrypted traffic classification in {SDN}
                 Edge Gateway",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "200",
  number =       "??",
  pages =        "??--??",
  day =          "9",
  month =        dec,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108535",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:06 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S138912862100459X",
  acknowledgement = ack-nhfb,
  articleno =    "108535",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Wang:2021:CVP,
  author =       "Minmei Wang and Chen Qian and Xin Li and Shouqian Shi
                 and Shigang Chen",
  title =        "Collaborative Validation of Public-Key Certificates
                 for {IoT} by Distributed Caching",
  journal =      j-IEEE-TRANS-NETWORKING,
  volume =       "29",
  number =       "1",
  pages =        "92--105",
  month =        feb,
  year =         "2021",
  CODEN =        "IEANEP",
  DOI =          "https://doi.org/10.1109/TNET.2020.3029135",
  ISSN =         "1063-6692 (print), 1558-2566 (electronic)",
  ISSN-L =       "1063-6692",
  bibdate =      "Tue Jun 15 09:48:15 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
  URL =          "https://dl.acm.org/doi/10.1109/TNET.2020.3029135",
  abstract =     "Public-key certificate validation is an important
                 building block for various security protocols for IoT
                 devices, such as secure channel establishment,
                 handshaking, and verifying sensing data authenticity
                 from cloud storage. However, certification \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE\slash ACM Transactions on Networking",
  journal-URL =  "https://dl.acm.org/loi/ton",
}

@Article{Wang:2021:HPP,
  author =       "Baocheng Wang and Zetao Li",
  title =        "{Healthchain}: a Privacy Protection System for Medical
                 Data Based on Blockchain",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "10",
  pages =        "247",
  day =          "24",
  month =        sep,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13100247",
  ISSN =         "1999-5903",
  bibdate =      "Fri Oct 22 11:19:02 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/10/247",
  abstract =     "Recently, with the great development of e-health, more
                 and more countries have made certain achievements in
                 the field of electronic medical treatment. The
                 digitization of medical equipment and the
                 structuralization of electronic medical records are the
                 general trends. While bringing convenience to people,
                 the explosive growth of medical data will further
                 promote the value of mining medical data. Obviously,
                 finding out how to safely store such a large amount of
                 data is a problem that urgently needs to be solved.
                 Additionally, the particularity of medical data makes
                 it necessarily subject to great privacy protection
                 needs. This reinforces the importance of designing a
                 safe solution to ensure data privacy. Many existing
                 schemes are based on single-server architecture, which
                 have some natural defects (such as single-point
                 faults). Although blockchain can help solve such
                 problems, there are still some deficiencies in privacy
                 protection. To solve these problems, this paper designs
                 a medical data privacy protection system, which
                 integrates blockchain, group signature, and asymmetric
                 encryption to realize reliable medical data sharing
                 between medical institutions and protect the data
                 privacy of patients. This paper proves theoretically
                 that it meets our security and privacy requirements,
                 and proves its practicability through system
                 implementation.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Wang:2021:IFD,
  author =       "Rong Wang and Xiaoni Du and Cuiling Fan and Zhihua
                 Niu",
  title =        "Infinite Families of 2-Designs from a Class of Linear
                 Codes Related to {Dembowski--Ostrom} Functions",
  journal =      j-INT-J-FOUND-COMP-SCI,
  volume =       "32",
  number =       "03",
  pages =        "253--267",
  month =        apr,
  year =         "2021",
  DOI =          "https://doi.org/10.1142/S0129054121500143",
  ISSN =         "0129-0541",
  ISSN-L =       "0129-0541",
  bibdate =      "Wed Apr 14 07:18:41 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
                 http://www.worldscientific.com/loi/ijfcs",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0129054121500143",
  abstract =     "Due to their important applications to coding theory,
                 cryptography, communications and statistics,
                 combinatorial t -designs have attracted lots of
                 research interest for decades. The interplay between
                 coding theory and t -designs started many years ago. It
                 is generally known that t -designs can be used to
                 derive linear codes over any finite field, and that the
                 supports of all codewords with a fixed weight in a code
                 also may hold a t -design. In this paper, we first
                 construct a class of linear codes from cyclic codes
                 related to Dembowski-Ostrom functions. By using
                 exponential sums, we then determine the weight
                 distribution of the linear codes. Finally, we obtain
                 infinite families of 2 -designs from the supports of
                 all codewords with a fixed weight in these codes.
                 Furthermore, the parameters of 2 -designs are
                 calculated explicitly.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Foundations of Computer
                 Science (IJFCS)",
  journal-URL =  "http://www.worldscientific.com/loi/ijfcs",
  remark =       "",
}

@Article{Wang:2021:IFI,
  author =       "Gaoli Wang and Zhenfu Cao and Xiaolei Dong",
  title =        "Improved File-injection Attacks on Searchable
                 Encryption Using Finite Set Theory",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "8",
  pages =        "1264--1276",
  month =        aug,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa161",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat Aug 28 14:54:07 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/8/1264/6048928",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Wang:2021:MSD,
  author =       "Zichi Wang and Guorui Feng and Yanli Ren and Xinpeng
                 Zhang",
  title =        "Multichannel Steganography in Digital Images for
                 Multiple Receivers",
  journal =      j-IEEE-MULTIMEDIA,
  volume =       "28",
  number =       "1",
  pages =        "65--73",
  year =         "2021",
  CODEN =        "IEMUE4",
  DOI =          "https://doi.org/10.1109/MMUL.2020.3045173",
  ISSN =         "1070-986X (print), 1941-0166 (electronic)",
  ISSN-L =       "1070-986X",
  bibdate =      "Thu May 27 16:42:50 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE MultiMedia",
  journal-URL =  "http://www.computer.org/multimedia/",
}

@Article{Wang:2021:PAA,
  author =       "Kun Wang and Jiahui Yu and Xiulong Liu and Song Guo",
  title =        "A Pre-Authentication Approach to Proxy Re-Encryption
                 in Big Data Context",
  journal =      j-IEEE-TRANS-BIG-DATA,
  volume =       "7",
  number =       "4",
  pages =        "657--667",
  year =         "2021",
  DOI =          "https://doi.org/10.1109/TBDATA.2017.2702176",
  ISSN =         "2332-7790",
  bibdate =      "Fri Aug 13 08:39:03 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransbigdata.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Big Data",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6687317",
}

@Article{Wehner:2021:IWQ,
  author =       "Nikolas Wehner and Michael Seufert and Joshua Schuler
                 and Sarah Wassermann and Pedro Casas and Tobias
                 Hossfeld",
  title =        "Improving {Web} {QoE} Monitoring for Encrypted Network
                 Traffic through Time Series Modeling",
  journal =      j-SIGMETRICS,
  volume =       "48",
  number =       "4",
  pages =        "37--40",
  month =        may,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3466826.3466840",
  ISSN =         "0163-5999 (print), 1557-9484 (electronic)",
  ISSN-L =       "0163-5999",
  bibdate =      "Thu May 20 08:57:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3466826.3466840",
  abstract =     "This paper addresses the problem of Quality of
                 Experience (QoE) monitoring for web browsing. In
                 particular, the inference of common Web QoE metrics
                 such as Speed Index (SI) is investigated. Based on a
                 large dataset collected with open web-measurement
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGMETRICS Performance Evaluation Review",
  journal-URL =  "https://dl.acm.org/loi/sigmetrics",
}

@Article{Wei:2021:IIS,
  author =       "Tengda Wei and Ping Lin and Quanxin Zhu and Qi Yao",
  title =        "Instability of impulsive stochastic systems with
                 application to image encryption",
  journal =      j-APPL-MATH-COMP,
  volume =       "402",
  number =       "??",
  pages =        "Article 126098",
  day =          "1",
  month =        aug,
  year =         "2021",
  CODEN =        "AMHCBQ",
  DOI =          "https://doi.org/10.1016/j.amc.2021.126098",
  ISSN =         "0096-3003 (print), 1873-5649 (electronic)",
  ISSN-L =       "0096-3003",
  bibdate =      "Wed Jun 9 09:19:01 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/applmathcomput2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0096300321001466",
  acknowledgement = ack-nhfb,
  fjournal =     "Applied Mathematics and Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00963003",
}

@Article{Wiefling:2021:VYH,
  author =       "Stephan Wiefling and Markus D{\"u}rmuth and Luigi {Lo
                 Iacono}",
  title =        "Verify It's You: How Users Perceive Risk-Based
                 Authentication",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "19",
  number =       "6",
  pages =        "47--57",
  month =        nov # "\slash " # dec,
  year =         "2021",
  DOI =          "https://doi.org/10.1109/MSEC.2021.3077954",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Mon Jan 31 15:37:00 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
}

@Article{Xiang:2021:MTD,
  author =       "Yuexin Xiang and Wei Ren and Tiantian Li and Xianghan
                 Zheng and Tianqing Zhu and Kim-Kwang Raymond Choo",
  title =        "A multi-type and decentralized data transaction scheme
                 based on smart contracts and digital watermarks",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "176",
  number =       "??",
  pages =        "??--??",
  day =          "15",
  month =        feb,
  year =         "2021",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2020.102953",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Mon May 24 15:12:41 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804520304057",
  acknowledgement = ack-nhfb,
  articleno =    "102953",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Xie:2021:PLA,
  author =       "Ning Xie and Haijun Tan and Lei Huang and Alex X.
                 Liu",
  title =        "Physical-Layer Authentication in Wirelessly Powered
                 Communication Networks",
  journal =      j-IEEE-TRANS-NETWORKING,
  volume =       "29",
  number =       "4",
  pages =        "1827--1840",
  month =        aug,
  year =         "2021",
  CODEN =        "IEANEP",
  DOI =          "https://doi.org/10.1109/TNET.2021.3071670",
  ISSN =         "1063-6692 (print), 1558-2566 (electronic)",
  ISSN-L =       "1063-6692",
  bibdate =      "Wed Apr 20 07:36:13 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
  URL =          "https://dl.acm.org/doi/10.1109/TNET.2021.3071670",
  abstract =     "This paper addresses the problem of authenticating the
                 transmitter device in wirelessly powered communications
                 networks (WPCNs). We proposed a physical-layer
                 authentication scheme for a WPCN. In comparison with
                 upper-layer authentication schemes, the \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE\slash ACM Transactions on Networking",
  journal-URL =  "https://dl.acm.org/loi/ton",
}

@Article{Xing:2021:AAA,
  author =       "Biao Xing and DanDan Wang and Cuihua He",
  title =        "Accelerating {DES} and {AES} Algorithms for a
                 Heterogeneous Many-core Processor",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "49",
  number =       "3",
  pages =        "463--486",
  month =        jun,
  year =         "2021",
  CODEN =        "IJPPE5",
  DOI =          "https://doi.org/10.1007/s10766-021-00692-4",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  ISSN-L =       "0885-7458",
  bibdate =      "Fri May 14 08:58:34 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib",
  URL =          "https://link.springer.com/article/10.1007/s10766-021-00692-4",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Parallel Programming",
  journal-URL =  "http://link.springer.com/journal/10766",
  online-date =  "Published: 16 April 2021 Pages: 463 - 486",
}

@Article{Xu:2021:BBR,
  author =       "Zisang Xu and Wei Liang and Kuan-Ching Li and Jianbo
                 Xu and Hai Jin",
  title =        "A blockchain-based Roadside Unit-assisted
                 authentication and key agreement protocol for {Internet
                 of Vehicles}",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "149",
  number =       "??",
  pages =        "29--39",
  month =        mar,
  year =         "2021",
  CODEN =        "JPDCER",
  DOI =          "https://doi.org/10.1016/j.jpdc.2020.11.003",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Wed May 26 16:11:04 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0743731520304044",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
}

@Article{Xu:2021:GAC,
  author =       "Rui Xu and Xu Wang and Kirill Morozov",
  title =        "Group authentication for cloud-to-things computing:
                 Review and improvement",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "198",
  number =       "??",
  pages =        "??--??",
  day =          "24",
  month =        oct,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108374",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:04 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S138912862100356X",
  acknowledgement = ack-nhfb,
  articleno =    "108374",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Xu:2021:KGI,
  author =       "Weitao Xu and Junqing Zhang and Shunqi Huang and
                 Chengwen Luo and Wei Li",
  title =        "Key Generation for {Internet of Things}: a
                 Contemporary Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "1",
  pages =        "14:1--14:37",
  month =        apr,
  year =         "2021",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3429740",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Fri Apr 23 10:35:00 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3429740",
  abstract =     "Key generation is a promising technique to bootstrap
                 secure communications for the Internet of Things
                 devices that have no prior knowledge between each
                 other. In the past few years, a variety of key
                 generation protocols and systems have been proposed.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Yan:2021:LSH,
  author =       "Xiaobei Yan and Maode Ma",
  title =        "A lightweight and secure handover authentication
                 scheme for {5G} network using neighbour base stations",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "193",
  number =       "??",
  pages =        "??--??",
  day =          "1",
  month =        nov,
  year =         "2021",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2021.103204",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Thu Jan 20 08:06:56 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804521002095",
  acknowledgement = ack-nhfb,
  articleno =    "103204",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Yan:2021:NMZ,
  author =       "Zhenbin Yan and Yi Deng",
  title =        "Non-Malleable Zero-Knowledge Arguments with Lower
                 Round Complexity",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "4",
  pages =        "534--549",
  month =        apr,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa076",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Apr 23 10:21:15 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/4/534/5869147",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Yan:2021:RSI,
  author =       "Xuehu Yan and Lintao Liu and Longlong Li and Yuliang
                 Lu",
  title =        "Robust Secret Image Sharing Resistant to Noise in
                 Shares",
  journal =      j-TOMM,
  volume =       "17",
  number =       "1",
  pages =        "24:1--24:22",
  month =        apr,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3419750",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Sat Apr 17 08:40:21 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3419750",
  abstract =     "A secret image is split into shares in the generation
                 phase of secret image sharing (SIS) for a threshold. In
                 the recovery phase, the secret image is recovered when
                 any or more shares are collected, and each collected
                 share is generally assumed to be \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Yang:2021:OCS,
  author =       "Zheng Yang and Sridhar Adepu and Jianying Zhou",
  title =        "Opportunities and Challenges in Securing Critical
                 Infrastructures Through Cryptography",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "19",
  number =       "5",
  pages =        "57--65",
  month =        sep # "\slash " # oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1109/MSEC.2021.3090022",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Fri Oct 15 12:52:53 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
}

@Article{Yiu:2021:DSC,
  author =       "Neo C. K. Yiu",
  title =        "Decentralizing Supply Chain Anti-Counterfeiting and
                 Traceability Systems Using Blockchain Technology",
  journal =      j-FUTURE-INTERNET,
  volume =       "13",
  number =       "4",
  pages =        "84",
  day =          "25",
  month =        mar,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi13040084",
  ISSN =         "1999-5903",
  bibdate =      "Fri Apr 23 17:52:28 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/13/4/84",
  abstract =     "An interesting research problem in the supply chain
                 industry is evaluating and determining the provenance
                 of physical goods-demonstrating the authenticity of
                 luxury goods such as bottled wine. However, many supply
                 chain systems and networks have been built and
                 implemented with centralized system architecture,
                 relying on centralized authorities or any form of
                 intermediary, and leading to issues such as
                 single-point processing, storage and failure, which
                 could be susceptible to malicious modifications to
                 product records or various potential attacks to system
                 components by dishonest participant nodes traversing
                 along the supply chain. Blockchain technology has
                 evolved from merely being a decentralized, distributed
                 and immutable ledger of cryptocurrency transactions to
                 a programmable interactive environment for building
                 decentralized and reliable applications addressing
                 different use-cases and existing problems in the world.
                 In this research, with a chosen research method of
                 proof-by-demonstration, the Decentralized NFC-Enabled
                 Anti-Counterfeiting System (dNAS) is proposed and
                 developed, decentralizing a legacy anti-counterfeiting
                 system of the supply-chain industry using Blockchain
                 technology to facilitate trustworthy data provenance
                 retrieval, verification and management, as well as
                 strengthening the capability of the product's
                 anti-counterfeiting and traceability qualities in the
                 wine industry, with the capacity to further extend this
                 to the supply chain industry as a whole. The proposed
                 dNAS utilizes a decentralized blockchain network with a
                 consensus protocol compatible with the concept of
                 enterprise blockchain, programmable smart contracts and
                 a distributed file storage system to develop a secure
                 and immutable scientific-data provenance tracking and
                 management platform on which provenance records,
                 providing compelling properties of the data integrity
                 of luxurious goods, are recorded, verified and
                 validated automatically.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/1999-5903/",
}

@Article{Zaidi:2021:TBC,
  author =       "Ahmad Zairi Zaidi and Chun Yong Chong and Zhe Jin and
                 Rajendran Parthiban and Ali Safaa Sadiq",
  title =        "Touch-based continuous mobile device authentication:
                 State-of-the-art, challenges and opportunities",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "191",
  number =       "??",
  pages =        "??--??",
  day =          "1",
  month =        oct,
  year =         "2021",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2021.103162",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Thu Jan 20 08:06:55 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804521001740",
  acknowledgement = ack-nhfb,
  articleno =    "103162",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Zakaria:2021:TDM,
  author =       "La Zakaria",
  title =        "A Two-Dimensional {mKdV} Linear Map and Its
                 Application in Digital Image Cryptography",
  journal =      j-ALGORITHMS-BASEL,
  volume =       "14",
  number =       "4",
  month =        apr,
  year =         "2021",
  CODEN =        "ALGOCH",
  DOI =          "https://doi.org/10.3390/a14040124",
  ISSN =         "1999-4893 (electronic)",
  ISSN-L =       "1999-4893",
  bibdate =      "Fri Apr 23 08:14:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://www.mdpi.com/1999-4893/14/4/124",
  acknowledgement = ack-nhfb,
  articleno =    "124",
  fjournal =     "Algorithms (Basel)",
  journal-URL =  "https://www.mdpi.com/",
  pagecount =    "??",
}

@Article{Zhandry:2021:HCQ,
  author =       "Mark Zhandry",
  title =        "How to Construct Quantum Random Functions",
  journal =      j-J-ACM,
  volume =       "68",
  number =       "5",
  pages =        "33:1--33:43",
  month =        oct,
  year =         "2021",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/3450745",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Thu Jan 27 06:13:15 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3450745",
  abstract =     "Pseudorandom functions (PRFs) are one of the
                 foundational concepts in theoretical computer science,
                 with numerous applications in complexity theory and
                 cryptography. In this work, we study the security of
                 PRFs when evaluated on quantum superpositions of
                 inputs. The classical techniques for arguing the
                 security of PRFs do not carry over to this setting,
                 even if the underlying building blocks are quantum
                 resistant. We therefore develop a new proof technique
                 to show that many of the classical PRF constructions
                 remain secure when evaluated on superpositions.",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Zhang:2021:CAL,
  author =       "Fangfang Zhang and Xue Zhang and Maoyong Cao and
                 Fengying Ma and Zhengfeng Li",
  title =        "Characteristic Analysis of {2D} Lag-Complex Logistic
                 Map and Its Application in Image Encryption",
  journal =      j-IEEE-MULTIMEDIA,
  volume =       "28",
  number =       "4",
  pages =        "96--106",
  month =        oct # "\slash " # dec,
  year =         "2021",
  CODEN =        "IEMUE4",
  DOI =          "https://doi.org/10.1109/MMUL.2021.3080579",
  ISSN =         "1070-986X (print), 1941-0166 (electronic)",
  ISSN-L =       "1070-986X",
  bibdate =      "Thu Apr 7 17:12:35 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE MultiMedia",
  journal-URL =  "http://www.computer.org/multimedia/",
}

@Article{Zhang:2021:DHD,
  author =       "Guangxue Zhang and Tian Wang and Guojun Wang and
                 Anfeng Liu and Weijia Jia",
  title =        "Detection of hidden data attacks combined fog
                 computing and trust evaluation method in sensor-cloud
                 system",
  journal =      j-CCPE,
  volume =       "33",
  number =       "7",
  pages =        "1--1",
  day =          "10",
  month =        apr,
  year =         "2021",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.5109",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Tue May 18 08:31:22 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
  onlinedate =   "26 December 2018",
}

@Article{Zhang:2021:DSS,
  author =       "Zhishuo Zhang and Shijie Zhou",
  title =        "A decentralized strongly secure attribute-based
                 encryption and authentication scheme for distributed
                 {Internet} of Mobile Things",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "201",
  number =       "??",
  pages =        "??--??",
  day =          "24",
  month =        dec,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2021.108553",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Tue Feb 1 09:19:06 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128621004722",
  acknowledgement = ack-nhfb,
  articleno =    "108553",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Zhang:2021:FEC,
  author =       "Zheng Zhang and Fangguo Zhang",
  title =        "Functional encryption for cubic polynomials and
                 implementation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "885",
  number =       "??",
  pages =        "41--54",
  day =          "11",
  month =        sep,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.06.020",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Sep 4 11:08:23 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521003649",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Zhang:2021:PHP,
  author =       "Zhishuo Zhang and Wei Zhang and Zhiguang Qin",
  title =        "A partially hidden policy {CP--ABE} scheme against
                 attribute values guessing attacks with online
                 privacy-protective decryption testing in {IoT} assisted
                 cloud computing",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "123",
  number =       "??",
  pages =        "181--195",
  month =        oct,
  year =         "2021",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2021.04.022",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Wed Feb 9 09:07:18 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X21001436",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Zhang:2021:QAY,
  author =       "Lei Zhang and Andriy Miranskyy and Walid Rjaibi",
  title =        "Quantum Advantage and the {Y2K} Bug: a Comparison",
  journal =      j-IEEE-SOFTWARE,
  volume =       "38",
  number =       "2",
  pages =        "80--87",
  month =        mar # "\slash " # apr,
  year =         "2021",
  CODEN =        "IESOEG",
  DOI =          "https://doi.org/10.1109/MS.2020.2985321",
  ISSN =         "0740-7459 (print), 1937-4194 (electronic)",
  ISSN-L =       "0740-7459",
  bibdate =      "Thu May 27 17:14:52 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesoft.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Software",
  journal-URL =  "http://www.computer.org/portal/web/csdl/magazines/software",
}

@Article{Zhang:2021:TES,
  author =       "Hailong Zhang and Wei Yang",
  title =        "Theoretical Estimation on the Success Rate of the
                 Asymptotic Higher Order Optimal Distinguisher",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "8",
  pages =        "1277--1292",
  month =        aug,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa171",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat Aug 28 14:54:07 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/8/1277/6062487",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Zhao:2021:DAR,
  author =       "Juan Zhao and Tianrui Zong and Yong Xiang and
                 Longxiang Gao and Wanlei Zhou and Gleb Beliakov",
  title =        "Desynchronization Attacks Resilient Watermarking
                 Method Based on Frequency Singular Value Coefficient
                 Modification",
  journal =      j-IEEE-ACM-TASLP,
  volume =       "29",
  number =       "??",
  pages =        "2282--2295",
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1109/TASLP.2021.3092555",
  ISSN =         "2329-9290",
  ISSN-L =       "2329-9290",
  bibdate =      "Thu Apr 7 10:27:19 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeeacmtaslp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE\slash ACM Transactions on Audio, Speech, and
                 Language Processing",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6570655",
}

@Article{Zhao:2021:EBS,
  author =       "Benjamin Zi Hao Zhao and Hassan Jameel Asghar and
                 Mohamed Ali Kaafar and Francesca Trevisan and Haiyue
                 Yuan",
  title =        "Exploiting Behavioral Side Channels in Observation
                 Resilient Cognitive Authentication Schemes",
  journal =      j-TOPS,
  volume =       "24",
  number =       "1",
  pages =        "1:1--1:33",
  month =        jan,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3414844",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Fri Feb 5 09:05:31 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3414844",
  abstract =     "Observation Resilient Authentication Schemes (ORAS)
                 are a class of shared secret challenge-response
                 identification schemes where a user mentally computes
                 the response via a cognitive function to authenticate
                 herself such that eavesdroppers cannot \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Zhao:2021:ICA,
  author =       "Zishen Zhao and Shiyao Chen and Meiqin Wang and Wei
                 Wang",
  title =        "Improved cube-attack-like cryptanalysis of
                 reduced-round {Ketje-Jr} and {Keccak-MAC}",
  journal =      j-INFO-PROC-LETT,
  volume =       "171",
  number =       "??",
  pages =        "Article 106124",
  month =        oct,
  year =         "2021",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/j.ipl.2021.106124",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Feb 9 07:25:26 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/infoproc2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0020019021000387",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Zheng:2021:CRV,
  author =       "Mengce Zheng and Noboru Kunihiro and Yuanzhi Yao",
  title =        "Cryptanalysis of the {RSA} variant based on cubic
                 {Pell} equation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "889",
  number =       "??",
  pages =        "135--144",
  day =          "8",
  month =        oct,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.08.001",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Jan 26 14:22:46 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S030439752100445X",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Zhou:2021:CLR,
  author =       "Yanwei Zhou and Yuan Xu and Zirui Qiao and Bo Yang and
                 Mingwu Zhang",
  title =        "Continuous leakage-resilient certificate-based
                 signcryption scheme and application in cloud
                 computing",
  journal =      j-THEOR-COMP-SCI,
  volume =       "860",
  number =       "??",
  pages =        "1--22",
  day =          "8",
  month =        mar,
  year =         "2021",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.01.024",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Mar 12 06:53:55 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521000451",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Zhou:2021:FPT,
  author =       "H. Zhou and K. Chen and W. Zhang and C. Qin and N.
                 Yu",
  title =        "Feature-Preserving Tensor Voting Model for Mesh
                 Steganalysis",
  journal =      j-IEEE-TRANS-VIS-COMPUT-GRAPH,
  volume =       "27",
  number =       "1",
  pages =        "57--67",
  year =         "2021",
  CODEN =        "ITVGEA",
  DOI =          "https://doi.org/10.1109/TVCG.2019.2929041",
  ISSN =         "1077-2626",
  ISSN-L =       "1077-2626",
  bibdate =      "Fri Feb 5 12:50:18 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransviscomputgraph2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Visualization and Computer
                 Graphics",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}

@Article{Zhou:2021:IAR,
  author =       "Haibo Zhou and Rui Zong and Xiaoyang Dong and Keting
                 Jia and Willi Meier",
  title =        "Interpolation Attacks on Round-Reduced {Elephant},
                 {Kravatte} and {Xoofff}",
  journal =      j-COMP-J,
  volume =       "64",
  number =       "4",
  pages =        "628--638",
  month =        apr,
  year =         "2021",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa101",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Apr 23 10:21:15 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/64/4/628/5880072",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Zhou:2021:SHC,
  author =       "Zhen Zhou and Debiao He and Zhe Liu and Min Luo and
                 Kim-Kwang Raymond Choo",
  title =        "A Software\slash Hardware Co-Design of
                 Crystals-Dilithium Signature Scheme",
  journal =      j-TRETS,
  volume =       "14",
  number =       "2",
  pages =        "11:1--11:21",
  month =        jul,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3447812",
  ISSN =         "1936-7406 (print), 1936-7414 (electronic)",
  ISSN-L =       "1936-7406",
  bibdate =      "Fri Jul 16 07:17:05 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/trets.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447812",
  abstract =     "As quantum computers become more affordable and
                 commonplace, existing security systems that are based
                 on classical cryptographic primitives, such as RSA and
                 Elliptic Curve Cryptography (ECC), will no longer be
                 secure. Hence, there has been interest in designing
                 post-quantum cryptographic (PQC) schemes, such as those
                 based on lattice-based cryptography (LBC). The
                 potential of LBC schemes is evidenced by the number of
                 such schemes passing the selection of NIST PQC
                 Standardization Process Round-3. One such scheme is the
                 Crystals-Dilithium signature scheme, which is based on
                 the hard module-lattice problem. However, there is no
                 efficient implementation of the Crystals-Dilithium
                 signature scheme. Hence, in this article, we present a
                 compact hardware architecture containing elaborate
                 modular multiplication units using the Karatsuba
                 algorithm along with smart generators of address
                 sequence and twiddle factors for NTT, which can
                 complete polynomial addition/multiplication with the
                 parameter setting of Dilithium in a short clock period.
                 Also, we propose a fast software/hardware co-design
                 implementation on Field Programmable Gate Array (FPGA)
                 for the Dilithium scheme with a tradeoff between speed
                 and resource utilization. Our co-design implementation
                 outperforms a pure C implementation on a Nios-II
                 processor of the platform Altera DE2-115, in the sense
                 that our implementation is 11.2 and 7.4 times faster
                 for signature and verification, respectively. In
                 addition, we also achieve approximately 51\% and 31\%
                 speed improvement for signature and verification, in
                 comparison to the pure C implementation on processor
                 ARM Cortex-A9 of ZYNQ-7020 platform.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Transactions on Reconfigurable Technology and
                 Systems (TRETS)",
  journal-URL =  "https://dl.acm.org/loi/trets",
}

@Article{Zhu:2021:FEE,
  author =       "Jinwei Zhu and Kun Cheng and Jiayang Liu and Liang
                 Guo",
  title =        "Full encryption: an end to end encryption mechanism in
                 {GaussDB}",
  journal =      j-PROC-VLDB-ENDOWMENT,
  volume =       "14",
  number =       "12",
  pages =        "2811--2814",
  month =        jul,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.14778/3476311.3476351",
  ISSN =         "2150-8097",
  bibdate =      "Fri Oct 29 16:41:16 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
  URL =          "https://dl.acm.org/doi/10.14778/3476311.3476351",
  abstract =     "In this paper, we present a novel mechanism called
                 Full Encryption (FE) in GaussDB. FE-in-GaussDB provides
                 column-level encryption for sensitive data, and secures
                 the asset from any malicious cloud administrator or
                 information leakage attack. It ensures \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the VLDB Endowment",
  journal-URL =  "https://dl.acm.org/loi/pvldb",
}

@Article{Zilio:2021:FSG,
  author =       "Daniel Zilio and Nicola Orio and Luca Zamparo",
  title =        "{FakeMuse}: a Serious Game on Authentication for
                 Cultural Heritage",
  journal =      j-JOCCH,
  volume =       "14",
  number =       "2",
  pages =        "17:1--17:22",
  month =        jun,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3441627",
  ISSN =         "1556-4673 (print), 1556-4711 (electronic)",
  ISSN-L =       "1556-4673",
  bibdate =      "Mon Jun 7 07:36:52 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jocch.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3441627",
  abstract =     "This article presents FakeMuse, a serious game about
                 forgery and authentication in archaeological museums
                 that aims at letting users playfully approach this
                 issue. The player takes on the role of a museum curator
                 who is presented with several artifacts \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "Journal on Computing and Cultural Heritage (JOCCH)",
  journal-URL =  "https://dl.acm.org/loi/jocch",
}

@Article{Adeli:2022:CSP,
  author =       "Morteza Adeli and Nasour Bagheri and Honorio
                 Mart{\'\i}n and Pedro Peris-Lopez",
  title =        "Challenging the security of {``A PUF-based hardware
                 mutual authentication protocol''}",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "169",
  number =       "??",
  pages =        "199--210",
  month =        nov,
  year =         "2022",
  CODEN =        "JPDCER",
  DOI =          "https://doi.org/10.1016/j.jpdc.2022.06.018",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Mon Aug 29 12:03:19 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jpardistcomp2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0743731522001538",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
}

@Article{Adnan:2022:QKD,
  author =       "Mohd Hirzi Adnan and Zuriati Ahmad Zukarnain and Nur
                 Ziadah Harun",
  title =        "Quantum Key Distribution for {5G} Networks: A Review,
                 State of Art and Future Directions",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "3",
  pages =        "73",
  day =          "25",
  month =        feb,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14030073",
  ISSN =         "1999-5903",
  bibdate =      "Fri Mar 4 08:59:15 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/3/73",
  abstract =     "In recent years, 5G networks and services become
                 progressively popular among telecommunication
                 providers. Simultaneously, the growth in the usage and
                 deployment of smartphone platforms and mobile
                 applications have been seen as phenomenal. Therefore,
                 this paper discusses the current state of the art of 5G
                 technology in the merger of unconditional security
                 requirements referred to as Quantum Cryptography. The
                 various domain of Quantum Cryptography is illustrated
                 including the protocols available, their functionality
                 and previous implementation in real networks. This
                 paper further identifies research gaps covering
                 critical aspects of how Quantum Cryptography can be
                 realized and effectively utilized in 5G networks. These
                 include improving the current technique in Quantum
                 Cryptography through efficient key distribution and
                 message sharing between users in 5G networks.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Ahamed:2022:IMB,
  author =       "Farhad Ahamed and Farnaz Farid and Basem Suleiman and
                 Zohaib Jan and Luay A. Wahsheh and Seyed Shahrestani",
  title =        "An Intelligent Multimodal Biometric Authentication
                 Model for Personalised Healthcare Services",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "8",
  pages =        "222",
  day =          "26",
  month =        jul,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14080222",
  ISSN =         "1999-5903",
  bibdate =      "Fri Sep 2 12:13:30 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/8/222",
  abstract =     "With the advent of modern technologies, the healthcare
                 industry is moving towards a more personalised smart
                 care model. The enablers of such care models are the
                 Internet of Things (IoT) and Artificial Intelligence
                 (AI). These technologies collect and analyse data from
                 persons in care to alert relevant parties if any
                 anomaly is detected in a patient's regular pattern.
                 However, such reliance on IoT devices to capture
                 continuous data extends the attack surfaces and demands
                 high-security measures. Both patients and devices need
                 to be authenticated to mitigate a large number of
                 attack vectors. The biometric authentication method has
                 been seen as a promising technique in these scenarios.
                 To this end, this paper proposes an AI-based multimodal
                 biometric authentication model for single and
                 group-based users' device-level authentication that
                 increases protection against the traditional single
                 modal approach. To test the efficacy of the proposed
                 model, a series of AI models are trained and tested
                 using physiological biometric features such as ECG
                 (Electrocardiogram) and PPG (Photoplethysmography)
                 signals from five public datasets available in
                 Physionet and Mendeley data repositories. The
                 multimodal fusion authentication model shows promising
                 results with 99.8\% accuracy and an Equal Error Rate
                 (EER) of 0.16.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Ahmadjee:2022:SBA,
  author =       "Sabreen Ahmadjee and Carlos Mera-G{\'o}mez and Rami
                 Bahsoon and Rick Kazman",
  title =        "A Study on Blockchain Architecture Design Decisions
                 and Their Security Attacks and Threats",
  journal =      j-TOSEM,
  volume =       "31",
  number =       "2",
  pages =        "36e:1--36e:45",
  month =        apr,
  year =         "2022",
  CODEN =        "ATSMER",
  DOI =          "https://doi.org/10.1145/3502740",
  ISSN =         "1049-331X (print), 1557-7392 (electronic)",
  ISSN-L =       "1049-331X",
  bibdate =      "Tue May 24 07:09:20 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tosem.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3502740",
  abstract =     "Blockchain is a disruptive technology intended to
                 implement secure decentralised distributed systems, in
                 which transactional data can be shared, stored, and
                 verified by participants of the system without needing
                 a central authentication/verification authority.
                 Blockchain-based systems have several architectural
                 components and variants, which architects can leverage
                 to build secure software systems. However, there is a
                 lack of studies to assist architects in making
                 architecture design and configuration decisions for
                 blockchain-based systems. This knowledge gap may
                 increase the chance of making unsuitable design
                 decisions and producing configurations prone to
                 potential security risks. To address this limitation,
                 we report our comprehensive systematic literature
                 review to derive a taxonomy of commonly used
                 architecture design decisions in blockchain-based
                 systems. We map each of these decisions to potential
                 security attacks and their posed threats. MITRE's
                 attack tactic categories and Microsoft STRIDE threat
                 modeling are used to systematically classify threats
                 and their associated attacks to identify potential
                 attacks and threats in blockchain-based systems. Our
                 mapping approach aims to guide architects to make
                 justifiable design decisions that will result in more
                 secure implementations.",
  acknowledgement = ack-nhfb,
  articleno =    "36e",
  fjournal =     "ACM Transactions on Software Engineering and
                 Methodology",
  journal-URL =  "https://dl.acm.org/loi/tosem",
}

@Article{Ahmed:2022:DDP,
  author =       "Quazi Warisha Ahmed and Shruti Garg",
  title =        "{Double Diagonal Puzzle Encryption Standard-512} for
                 Securing Data over Cloud Environment",
  journal =      j-J-GRID-COMP,
  volume =       "20",
  number =       "4",
  pages =        "??--??",
  month =        dec,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1007/s10723-022-09612-3",
  ISSN =         "1570-7873 (print), 1572-9184 (electronic)",
  ISSN-L =       "1570-7873",
  bibdate =      "Wed Sep 21 07:07:29 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib",
  URL =          "https://link.springer.com/article/10.1007/s10723-022-09612-3",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Grid Comp.",
  articleno =    "33",
  fjournal =     "Journal of Grid Computing",
  journal-URL =  "http://link.springer.com/journal/10723",
}

@Article{Akbari:2022:TCI,
  author =       "Iman Akbari and Mohammad A. Salahuddin and Leni Ven
                 and Noura Limam and Raouf Boutaba and Bertrand Mathieu
                 and Stephanie Moteau and Stephane Tuffin",
  title =        "Traffic classification in an increasingly encrypted
                 web",
  journal =      j-CACM,
  volume =       "65",
  number =       "10",
  pages =        "75--83",
  month =        oct,
  year =         "2022",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/3559439",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Sep 26 08:09:44 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3559439",
  abstract =     "Traffic classification is essential in network
                 management for a wide range of operations. Recently, it
                 has become increasingly challenging with the widespread
                 adoption of encryption in the Internet, for example, as
                 a de facto in HTTP/2 and QUIC \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Article{Al-Dwairi:2022:RRS,
  author =       "Mahmoud Al-Dwairi and Ahmed S. Shatnawi and Osama
                 Al-Khaleel and Basheer Al-Duwairi",
  title =        "Ransomware-Resilient Self-Healing {XML} Documents",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "4",
  pages =        "115--??",
  day =          "07",
  month =        apr,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14040115",
  ISSN =         "1999-5903",
  bibdate =      "Fri Apr 22 09:50:26 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/4/115",
  abstract =     "In recent years, various platforms have witnessed an
                 unprecedented increase in the number of ransomware
                 attacks targeting hospitals, governments, enterprises,
                 and end-users. The purpose of this is to maliciously
                 encrypt documents and files on infected machines,
                 depriving victims of access to their data, whereupon
                 attackers would seek some sort of a ransom in return
                 for restoring access to the legitimate owners; hence
                 the name. This cybersecurity threat would inherently
                 cause substantial financial losses and time wastage for
                 affected organizations and users. A great deal of
                 research has taken place across academia and around the
                 industry to combat this threat and mitigate its danger.
                 These ongoing endeavors have resulted in several
                 detection and prevention schemas. Nonetheless, these
                 approaches do not cover all possible risks of losing
                 data. In this paper, we address this facet and provide
                 an efficient solution that would ensure an efficient
                 recovery of XML documents from ransomware attacks. This
                 paper proposes a self-healing version-aware ransomware
                 recovery (SH-VARR) framework for XML documents. The
                 proposed framework is based on the novel idea of using
                 the link concept to maintain file versions in a
                 distributed manner while applying access-control
                 mechanisms to protect these versions from being
                 encrypted or deleted. The proposed SH-VARR framework is
                 experimentally evaluated in terms of storage overhead,
                 time requirement, CPU utilization, and memory usage.
                 Results show that the snapshot size increases
                 proportionately with the original size; the time
                 required is less than 120 ms for files that are less
                 than 1 MB in size; and the highest CPU utilization
                 occurs when using the bzip2. Moreover, when the zip and
                 gzip are used, the memory usage is almost fixed (around
                 6.8 KBs). In contrast, it increases to around 28 KBs
                 when the bzip2 is used.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Alam:2022:FLR,
  author =       "Tanweer Alam and Ruchi Gupta",
  title =        "Federated Learning and Its Role in the Privacy
                 Preservation of {IoT} Devices",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "9",
  pages =        "246",
  day =          "23",
  month =        aug,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14090246",
  ISSN =         "1999-5903",
  bibdate =      "Fri Sep 23 06:03:23 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/9/246",
  abstract =     "Federated learning (FL) is a cutting-edge artificial
                 intelligence approach. It is a decentralized
                 problem-solving technique that allows users to train
                 using massive data. Unprocessed information is stored
                 in advanced technology by a secret confidentiality
                 service, which incorporates machine learning (ML)
                 training while removing data connections. As
                 researchers in the field promote ML configurations
                 containing a large amount of private data, systems and
                 infrastructure must be developed to improve the
                 effectiveness of advanced learning systems. This study
                 examines FL in-depth, focusing on application and
                 system platforms, mechanisms, real-world applications,
                 and process contexts. FL creates robust classifiers
                 without requiring information disclosure, resulting in
                 highly secure privacy policies and access control
                 privileges. The article begins with an overview of FL.
                 Then, we examine technical data in FL, enabling
                 innovation, contracts, and software. Compared with
                 other review articles, our goal is to provide a more
                 comprehensive explanation of the best procedure systems
                 and authentic FL software to enable scientists to
                 create the best privacy preservation solutions for IoT
                 devices. We also provide an overview of similar
                 scientific papers and a detailed analysis of the
                 significant difficulties encountered in recent
                 publications. Furthermore, we investigate the benefits
                 and drawbacks of FL and highlight comprehensive
                 distribution scenarios to demonstrate how specific FL
                 models could be implemented to achieve the desired
                 results.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Alam:2022:NLL,
  author =       "Manaar Alam and Sayandeep Saha and Debdeep
                 Mukhopadhyay and Sandip Kundu",
  title =        "{NN-Lock}: a Lightweight Authorization to Prevent {IP}
                 Threats of Deep Learning Models",
  journal =      j-JETC,
  volume =       "18",
  number =       "3",
  pages =        "51:1--51:19",
  month =        jul,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3505634",
  ISSN =         "1550-4832",
  ISSN-L =       "1550-4832",
  bibdate =      "Wed Aug 10 06:36:52 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jetc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3505634",
  abstract =     "The prevalent usage and unparalleled recent success of
                 Deep Neural Network (DNN) applications have raised the
                 concern of protecting their Intellectual Property (IP)
                 rights in different business models to prevent the
                 theft of trade secrets. In this article,. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Journal on Emerging Technologies in Computing
                 Systems (JETC)",
  journal-URL =  "https://dl.acm.org/loi/jetc",
}

@Article{Aloufi:2022:CBD,
  author =       "Asma Aloufi and Peizhao Hu and Yongsoo Song and
                 Kristin Lauter",
  title =        "Computing Blindfolded on Data Homomorphically
                 Encrypted under Multiple Keys: a Survey",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "195:1--195:37",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3477139",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3477139",
  abstract =     "With capability of performing computations on
                 encrypted data without needing the secret key,
                 homomorphic encryption (HE) is a promising
                 cryptographic technique that makes outsourced
                 computations secure and privacy-preserving. A decade
                 after Gentry's \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "195",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Alshawish:2022:EMA,
  author =       "Islam Alshawish and Ali Al-Haj",
  title =        "An efficient mutual authentication scheme for {IoT}
                 systems",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "14",
  pages =        "16056--16087",
  month =        sep,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-022-04520-5",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri Sep 9 10:02:23 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-022-04520-5",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Alt:2022:BPC,
  author =       "Florian Alt and Stefan Schneegass",
  title =        "Beyond Passwords: Challenges and Opportunities of
                 Future Authentication",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "20",
  number =       "1",
  pages =        "82--86",
  month =        jan # "\slash " # feb,
  year =         "2022",
  DOI =          "https://doi.org/10.1109/MSEC.2021.3127459",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Mon Jan 31 15:37:00 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
}

@Article{Altinok:2022:GAE,
  author =       "Kaan Furkan Altinok and Afsin Peker and Cihangir
                 Tezcan and Alptekin Temizel",
  title =        "{GPU} accelerated {3DES} encryption",
  journal =      j-CCPE,
  volume =       "34",
  number =       "9",
  pages =        "e6507:1--e6507:??",
  day =          "25",
  month =        apr,
  year =         "2022",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.6507",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Wed Apr 13 09:55:02 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ccpe2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Concurr. Comput.",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
  onlinedate =   "21 July 2021",
}

@Article{Alzoubi:2022:ITB,
  author =       "Yehia Ibrahim Alzoubi and Ahmad Al-Ahmad and Hasan
                 Kahtan and Ashraf Jaradat",
  title =        "{Internet of Things} and Blockchain Integration:
                 Security, Privacy, Technical, and Design Challenges",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "7",
  pages =        "216",
  day =          "21",
  month =        jul,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14070216",
  ISSN =         "1999-5903",
  bibdate =      "Tue Jul 26 06:44:01 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/7/216",
  abstract =     "The Internet of things model enables a world in which
                 all of our everyday devices can be integrated and
                 communicate with each other and their surroundings to
                 gather and share data and simplify task implementation.
                 Such an Internet of things environment would require
                 seamless authentication, data protection, stability,
                 attack resistance, ease of deployment, and
                 self-maintenance, among other things. Blockchain, a
                 technology that was born with the cryptocurrency
                 Bitcoin, may fulfill Internet of things requirements.
                 However, due to the characteristics of both Internet of
                 things devices and Blockchain technology, integrating
                 Blockchain and the Internet of things can cause several
                 challenges. Despite a large number of papers that have
                 been published in the field of Blockchain and the
                 Internet of things, the problems of this combination
                 remain unclear and scattered. Accordingly, this paper
                 aims to provide a comprehensive survey of the
                 challenges related to Blockchain-Internet of things
                 integration by evaluating the related peer-reviewed
                 literature. The paper also discusses some of the
                 recommendations for reducing the effects of these
                 challenges. Moreover, the paper discusses some of the
                 unsolved concerns that must be addressed before the
                 next generation of integrated Blockchain-Internet of
                 things applications can be deployed. Lastly, future
                 trends in the context of Blockchain-Internet of things
                 integration are discussed.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Andola:2022:SEC,
  author =       "Nitish Andola and Raghav Gahlot and Shekhar Verma",
  title =        "Searchable encryption on the cloud: a survey",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "7",
  pages =        "9952--9984",
  month =        may,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-022-04309-6",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Mon Jun 6 08:11:50 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-022-04309-6",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Andriamilanto:2022:LSE,
  author =       "Nampoina Andriamilanto and Tristan Allard and
                 Ga{\"e}tan {Le Guelvouit} and Alexandre Garel",
  title =        "A Large-scale Empirical Analysis of Browser
                 Fingerprints Properties for Web Authentication",
  journal =      j-TWEB,
  volume =       "16",
  number =       "1",
  pages =        "4:1--4:62",
  month =        feb,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3478026",
  ISSN =         "1559-1131 (print), 1559-114X (electronic)",
  ISSN-L =       "1559-1131",
  bibdate =      "Fri Jan 7 08:00:15 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tweb.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3478026",
  abstract =     "Modern browsers give access to several attributes that
                 can be collected to form a browser fingerprint.
                 Although browser fingerprints have primarily been
                 studied as a web tracking tool, they can contribute to
                 improve the current state of web security by \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Transactions on the Web (TWEB)",
  journal-URL =  "https://dl.acm.org/loi/tweb",
}

@Article{Awais:2022:NSE,
  author =       "Muhammad Awais and Shahzaib Tahir and Fawad Khan and
                 Hasan Tahir and Ruhma Tahir and Rabia Latif and Mir
                 Yasir Umair",
  title =        "A novel searchable encryption scheme to reduce the
                 access pattern leakage",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "133",
  number =       "??",
  pages =        "338--350",
  month =        aug,
  year =         "2022",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2022.03.031",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Mon Apr 25 15:59:34 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X22001066",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Awan:2022:TMB,
  author =       "Kamran Ahmad Awan and Ikram Ud Din and Abeer Almogren
                 and Neeraj Kumar and Ahmad Almogren",
  title =        "A Taxonomy of Multimedia-based Graphical User
                 Authentication for Green {Internet of Things}",
  journal =      j-TOIT,
  volume =       "22",
  number =       "2",
  pages =        "37:1--37:28",
  month =        may,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3433544",
  ISSN =         "1533-5399 (print), 1557-6051 (electronic)",
  ISSN-L =       "1533-5399",
  bibdate =      "Wed May 25 08:02:16 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toit.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3433544",
  abstract =     "Authentication receives enormous consideration from
                 the research community and is proven to be an
                 interesting field in today's era. User authentication
                 is the major concern because people have their private
                 data on devices. To strengthen user \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Transactions on Internet Technology (TOIT)",
  journal-URL =  "https://dl.acm.org/loi/toit",
}

@Article{Azhdari:2022:CBR,
  author =       "Mohammad Sadegh Azhdari and Ali Barati and Hamid
                 Barati",
  title =        "A cluster-based routing method with authentication
                 capability in {Vehicular Ad hoc Networks (VANETs)}",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "169",
  number =       "??",
  pages =        "1--23",
  month =        nov,
  year =         "2022",
  CODEN =        "JPDCER",
  DOI =          "https://doi.org/10.1016/j.jpdc.2022.06.009",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Mon Aug 29 12:03:19 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jpardistcomp2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0743731522001447",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
}

@Article{Bag:2022:PFA,
  author =       "Arnab Bag and Debapriya Basu Roy and Sikhar Patranabis
                 and Debdeep Mukhopadhyay",
  title =        "\pkg{FlexiPair}: An Automated Programmable Framework
                 for Pairing Cryptosystems",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "3",
  pages =        "506--519",
  month =        mar,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2021.3058345",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Feb 17 08:09:56 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Bahig:2022:SWF,
  author =       "Hazem M. Bahig and Dieaa I. Nassr and Hatem M. Bahig",
  title =        "Speeding up wheel factoring method",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "14",
  pages =        "15730--15748",
  month =        sep,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-022-04470-y",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri Sep 9 10:02:23 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-022-04470-y",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
  keywords =     "factoring integers into prime factors",
}

@Article{Baksi:2022:NAS,
  author =       "Anubhab Baksi and Satyam Kumar and Santanu Sarkar",
  title =        "A New Approach for Side Channel Analysis on Stream
                 Ciphers and Related Constructions",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "10",
  pages =        "2527--2537",
  month =        oct,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2021.3135191",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Sep 8 07:59:47 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Bang:2022:DEN,
  author =       "A. O. Bang and Udai Pratap Rao",
  title =        "Design and evaluation of a novel White-box encryption
                 scheme for resource-constrained {IoT} devices",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "8",
  pages =        "11111--11137",
  month =        may,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-022-04322-9",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Mon Jun 6 08:11:51 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-022-04322-9",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Barbeau:2022:AIR,
  author =       "Michel Barbeau and Evangelos Kranakis and Nicolas
                 Perez",
  title =        "Authenticity, Integrity, and Replay Protection in
                 Quantum Data Communications and Networking",
  journal =      j-TQC,
  volume =       "3",
  number =       "2",
  pages =        "9:1--9:22",
  month =        jun,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3517341",
  ISSN =         "2643-6809 (print), 2643-6817 (electronic)",
  ISSN-L =       "2643-6809",
  bibdate =      "Wed May 25 08:23:35 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tqc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3517341",
  abstract =     "Quantum data communications and networking involve
                 classical hardware and software. Quantum storage is
                 sensitive to environmental disturbances that may have
                 malicious origins. Teleportation and entanglement
                 swapping, two building blocks for the future \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Transactions on Quantum Computing (TQC)",
  journal-URL =  "https://dl.acm.org/loi/tqc",
}

@Book{Barone:2022:USW,
  author =       "Rebecca E. F. Barone",
  title =        "{Unbreakable}: the Spies Who Cracked the Nazis' Secret
                 Code",
  publisher =    "Henry Holt and Company",
  address =      "New York, NY",
  pages =        "ix + 260",
  year =         "2022",
  ISBN =         "1-250-81420-0 (hardcover), 1-250-81421-9 (e-book)",
  ISBN-13 =      "978-1-250-81420-3 (hardcover), 978-1-250-81421-0
                 (e-book)",
  LCCN =         "D810.C88",
  bibdate =      "Tue Jan 13 16:27:16 MST 2026",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 fsz3950.oclc.org:210/WorldCat",
  abstract =     "A nonfiction manuscript for young readers about a
                 group of Allied spies and codebreakers that cracked the
                 Nazis's infamous cypher, allowing them to read secret
                 military messages and turn the tide of World War II.
                 During WWII, as the Germans waged war, every Nazi plan,
                 every attack, was sent over radio. But to the Allies
                 listening in, the messages sounded like gibberish. The
                 communications were encoded with a powerful
                 cypher-unless you could unlock the key to Germany's
                 Enigma machine. Featuring historical photos,
                 Unbreakable tells the story of one of the most
                 dangerous war-time code-breaking efforts ever. As
                 Hitler marched his troops across conquered lands and
                 deadly `wolfpacks' of German U-Boats prowled the open
                 seas, victory-or defeat-for the Allies hinged on their
                 desperate attempts to crack the code. Told in riveting
                 multiple points of view, \booktitle{Unbreakable} is
                 perfect for fans of \booktitle{The Boys Who Challenged
                 Hitler and The Nazi Hunters}",
  acknowledgement = ack-nhfb,
  subject =      "World War, 1939--1945; Cryptography; Juvenile
                 literature; Enigma cipher system; Cryptographers;
                 Poland; France; Great Britain; Secret service; Guerre
                 mondiale, 1939--1945; Cryptographie; Ouvrages pour la
                 jeunesse; Enigma (Machine {\`a} chiffrer);
                 Cryptographes; Pologne; Grande-Bretagne; Service
                 secret; Europe; History; Juvenile Nonfiction;
                 Cryptographers; Cryptography; Enigma cipher system;
                 Secret service; France; Great Britain Poland",
  tableofcontents = "Traitor \\
                 The Starting Line \\
                 The Machine and the Method \\
                 Recklessness \\
                 The Violence of Words \\
                 A Four Character Answer to a Six-Word Question \\
                 As by Magic \\
                 The Gale \\
                 Verdier \\
                 Fahrenheit 451 \\
                 Two More Rotors \\
                 What Langer Didn't Say \\
                 Il y a du nouveau \\
                 Harry Hinsley \\
                 Escape \\
                 F{\"u}hrer der U-boote \\
                 Pay Him \\
                 Bletchley Park \\
                 Uncles \\
                 Phony War \\
                 A Missing Rotor \\
                 Dark \\
                 Certain Mechanical Devices \\
                 Nearly Drowned \\
                 Bombes and Spider Bombes \\
                 Hunting at Night \\
                 Joan \\
                 Operation Ruthless \\
                 Doubt \\
                 Asch{\'e} \\
                 Operation Paula \\
                 Refusal to Exit \\
                 Yet Another Home \\
                 U-boat Peril \\
                 Somali \\
                 Weather Ships \\
                 Tides Turn \\
                 Interlude \\
                 Churchill \\
                 Shark in the Water \\
                 Losses and Laconia \\
                 U-559 and Petard \\
                 Kisses \\
                 A Family Name \\
                 The Fall of Cadix \\
                 Jadwiga's Strength \\
                 Found \\
                 I Was Expecting You Tomorrow \\
                 Schmidt \\
                 Bertrand",
}

@Article{Basin:2022:TVL,
  author =       "David Basin and Cas Cremers and Jannik Dreier and Ralf
                 Sasse",
  title =        "{Tamarin}: Verification of Large-Scale, Real-World,
                 Cryptographic Protocols",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "20",
  number =       "3",
  pages =        "24--32",
  month =        may # "\slash " # jun,
  year =         "2022",
  DOI =          "https://doi.org/10.1109/MSEC.2022.3154689",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Tue Jun 7 10:14:13 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
}

@Article{Bencomo:2022:SBA,
  author =       "Nelly Bencomo and Jin L. C. Guo and Rachel Harrison
                 and Hans-Martin Heyn and Tim Menzies",
  title =        "The Secret to Better {AI} and Better Software (Is
                 Requirements Engineering)",
  journal =      j-IEEE-SOFTWARE,
  volume =       "39",
  number =       "1",
  pages =        "105--110",
  month =        feb,
  year =         "2022",
  CODEN =        "IESOEG",
  DOI =          "https://doi.org/10.1109/MS.2021.3118099",
  ISSN =         "0740-7459 (print), 1937-4194 (electronic)",
  ISSN-L =       "0740-7459",
  bibdate =      "Thu Apr 7 14:13:47 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesoft2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Software",
  journal-URL =  "http://www.computer.org/portal/web/csdl/magazines/software",
}

@Article{Berlato:2022:FMA,
  author =       "Stefano Berlato and Roberto Carbone and Adam J. Lee
                 and Silvio Ranise",
  title =        "Formal Modelling and Automated Trade-off Analysis of
                 Enforcement Architectures for Cryptographic Access
                 Control in the Cloud",
  journal =      j-TOPS,
  volume =       "25",
  number =       "1",
  pages =        "2:1--2:37",
  month =        feb,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3474056",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Fri Jan 7 07:47:52 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3474056",
  abstract =     "To facilitate the adoption of cloud by organizations,
                 Cryptographic Access Control (CAC) is the obvious
                 solution to control data sharing among users while
                 preventing partially trusted Cloud Service Providers
                 (CSP) from accessing sensitive data. Indeed, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Bhardwaj:2022:IAU,
  author =       "Anuj Bhardwaj and Vivek Singh Verma and Sandesh
                 Gupta",
  title =        "Image Authentication Using Block Truncation Coding in
                 Lifting Wavelet Domain",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "22",
  number =       "01",
  pages =        "??--??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1142/S0219467822500115",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Wed Feb 9 07:11:50 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0219467822500115",
  abstract =     "Image watermarking is one of the most accepted
                 solutions protecting image authenticity. The method
                 presented in this paper not only provides the desired
                 outcome also efficient in terms of memory requirements
                 and preserving image characteristics. This scheme
                 effectively utilizes the concepts of block truncation
                 coding (BTC) and lifting wavelet transform (LWT). The
                 BTC method is applied to observe the binary watermark
                 image corresponding to its gray-scale image. Whereas,
                 the LWT is incorporated to transform the cover image
                 from spatial coordinates to corresponding transform
                 coordinates. In this, a quantization-based approach for
                 watermark bit embedding is applied. And, the extraction
                 of binary watermark data from the attacked watermarked
                 image is based on adaptive thresholding. To show the
                 effectiveness of the proposed scheme, the experiment
                 over different benchmark images is performed. The
                 experimental results and the comparison with
                 state-of-the-art schemes depict not only the good
                 imperceptibility but also high robustness against
                 various attacks.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Bhatt:2022:DKG,
  author =       "Sachin Bhatt and Prithvi Singh and Archana Sharma and
                 Arpita Rai and Ravins Dohare and Shweta Sankhwar and
                 Akash Sharma and Mansoor Ali Syed",
  title =        "Deciphering Key Genes and {miRNAs} Associated With
                 Hepatocellular Carcinoma via Network-Based Approach",
  journal =      j-TCBB,
  volume =       "19",
  number =       "2",
  pages =        "843--853",
  month =        mar,
  year =         "2022",
  CODEN =        "ITCBCY",
  DOI =          "https://doi.org/10.1109/TCBB.2020.3016781",
  ISSN =         "1545-5963 (print), 1557-9964 (electronic)",
  ISSN-L =       "1545-5963",
  bibdate =      "Fri Apr 15 06:41:04 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
  URL =          "https://dl.acm.org/doi/10.1109/TCBB.2020.3016781",
  abstract =     "Hepatocellular carcinoma (HCC)is a common type of
                 liver cancer and has a high mortality world-widely. The
                 diagnosis, prognoses, and therapeutics are very poor
                 due to the unclear molecular mechanism of progression
                 of the disease. To unveil the molecular \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE/ACM Transactions on Computational Biology and
                 Bioinformatics",
  journal-URL =  "https://dl.acm.org/loi/tcbb",
}

@Article{Bilami:2022:LBB,
  author =       "Karam Eddine Bilami and Pascal LORENZ",
  title =        "Lightweight Blockchain-Based Scheme to Secure Wireless
                 {M2M} Area Networks",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "5",
  pages =        "158",
  day =          "23",
  month =        may,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14050158",
  ISSN =         "1999-5903",
  bibdate =      "Fri May 27 12:03:38 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/5/158",
  abstract =     "Security is a challenging issue for M2M/IoT
                 applications due to the deployment, decentralization
                 and heterogeneity of M2M and IoT devices. Typical
                 security solutions may not be suitable for M2M/IoT
                 systems regarding the difficulties encountered for
                 their implementation on resource-constrained devices.
                 In this paper, we discuss the architectures deployed
                 for M2M communications and the security challenges, as
                 well as the vulnerabilities and solutions to counter
                 possible attacks. We present a lightweight design based
                 on a private blockchain to secure wireless M2M
                 communications at the device domain level. Blockchain
                 integration provides secure storage of data while
                 preserving integrity traceability and availability.
                 Besides, the evaluation and experimentations under NS3
                 simulator of the proposed scheme show that the
                 authentication mechanism is lightweight, and presents
                 better performances comparatively to other protocols in
                 terms of key parameters as communication and
                 computational overheads, average delay and energy
                 consumption.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Blackburn-Lynch:2022:WEO,
  author =       "James Blackburn-Lynch",
  title =        "Are We Ever Our Best Possible Selves? An Application
                 of B{\'e}zout's Identity to Find Coincident Peaks of
                 Multiple Sine Curves",
  journal =      j-COLLEGE-MATH-J,
  volume =       "53",
  number =       "3",
  pages =        "183--189",
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1080/07468342.2022.2040264",
  ISSN =         "0746-8342 (print), 1931-1346 (electronic)",
  ISSN-L =       "0746-8342",
  bibdate =      "Wed Jun 8 09:46:31 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/collegemathj.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.tandfonline.com/doi/full/10.1080/07468342.2022.2040264",
  acknowledgement = ack-nhfb,
  fjournal =     "College Mathematics Journal",
  journal-URL =  "https://maa.tandfonline.com/loi/ucmj20;
                 https://www.jstor.org/journal/collmathj",
}

@Article{Boucetta:2022:BAU,
  author =       "Aldjia Boucetta and Leila Boussaad",
  title =        "Biometric Authentication Using Finger-Vein Patterns
                 with Deep-Learning and Discriminant Correlation
                 Analysis",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "22",
  number =       "01",
  pages =        "??--??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1142/S0219467822500139",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Wed Feb 9 07:11:50 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0219467822500139",
  abstract =     "Finger-vein identification, a biometric technology
                 that uses vein patterns in the human finger to identify
                 people. In recent years, it has received increasing
                 attention due to its tremendous advantages compared to
                 fingerprint characteristics. Moreover,
                 Deep-Convolutional Neural Networks (Deep-CNN) appeared
                 to be highly successful for feature extraction in the
                 finger-vein area, and most of the proposed works focus
                 on new Convolutional Neural Network (CNN) models, which
                 require huge databases for training, a solution that
                 may be more practicable in real world applications, is
                 to reuse pretrained Deep-CNN models. In this paper, a
                 finger-vein identification system is proposed, which
                 uses Squeezenet pretrained Deep-CNN model as feature
                 extractor from the left and the right finger vein
                 patterns. Then, combines this Deep-based features by
                 using a feature-level Discriminant Correlation Analysis
                 (DCA) to reduce feature dimensions and to give the most
                 relevant features. Finally, these composite feature
                 vectors are used as input data for a Support Vector
                 Machine (SVM) classifier, in an identification stage.
                 This method is tested on two widely available finger
                 vein databases, namely SDUMLA-HMT and FV-USM.
                 Experimental results show that the proposed finger vein
                 identification system achieves significant high mean
                 accuracy rates.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Boudot:2022:SAI,
  author =       "Fabrice Boudot and Pierrick Gaudry and Aurore
                 Guillevic and Nadia Heninger and Emmanuel Thom{\'e} and
                 Paul Zimmermann",
  title =        "The State of the Art in Integer Factoring and Breaking
                 Public-Key Cryptography",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "20",
  number =       "2",
  pages =        "80--86",
  month =        mar # "\slash " # apr,
  year =         "2022",
  DOI =          "https://doi.org/10.1109/MSEC.2022.3141918",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Mon Apr 4 09:38:59 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
}

@Article{Bouillaguet:2022:CME,
  author =       "Charles Bouillaguet and Florette Martinez and Damien
                 Vergnaud",
  title =        "Cryptanalysis of Modular Exponentiation Outsourcing
                 Protocols",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "9",
  pages =        "2299--2314",
  month =        sep,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxab066",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Mon Sep 19 15:38:40 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/9/2299/6289878",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Braeken:2022:AKA,
  author =       "An Braeken",
  title =        "Authenticated key agreement protocols for dew-assisted
                 {IoT} systems",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "10",
  pages =        "12093--12113",
  month =        jul,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-022-04364-z",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri Jun 10 07:18:59 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-022-04364-z",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Buccafurri:2022:BBF,
  author =       "Francesco Buccafurri and Vincenzo {De Angelis} and
                 Sara Lazzaro",
  title =        "A Blockchain-Based Framework to Enhance Anonymous
                 Services with Accountability Guarantees",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "8",
  pages =        "243",
  day =          "21",
  month =        aug,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14080243",
  ISSN =         "1999-5903",
  bibdate =      "Fri Sep 2 12:13:30 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/8/243",
  abstract =     "Anonymous service delivery has attracted the interest
                 of research and the industry for many decades. To
                 obtain effective solutions, anonymity should be
                 guaranteed against the service provider itself.
                 However, if the full anonymity of users is implemented,
                 no accountability mechanism can be provided. This
                 represents a problem, especially when referring to
                 scenarios in which a user, protected by anonymity, may
                 perform illegally when leveraging the anonymous
                 service. In this paper, we propose a blockchain-based
                 solution to the trade-off between anonymity and
                 accountability. In particular, our solution relies on
                 three independent parties (one of which is the service
                 provider itself) such that only the collaboration of
                 all three actors allows for the disclosure of the real
                 identity of the user. In all other cases, anonymity is
                 guaranteed. To show the feasibility of the proposal, we
                 developed a prototype with user-friendly interfaces
                 that minimize the client-side operations. Our solution
                 is then also effective from the point of view of
                 usability.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Cao:2022:FSE,
  author =       "Yibo Cao and Shiyuan Xu and Xue Chen and Yunhua He and
                 Shuo Jiang",
  title =        "A forward-secure and efficient authentication protocol
                 through lattice-based group signature in {VANETs}
                 scenarios",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "214",
  number =       "??",
  pages =        "??--??",
  day =          "4",
  month =        sep,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2022.109149",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Wed Sep 21 06:36:54 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128622002626",
  acknowledgement = ack-nhfb,
  articleno =    "109149",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Carnley:2022:PIT,
  author =       "Renee Carnley and Sikha Bagui",
  title =        "A Public Infrastructure for a Trusted Wireless World",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "7",
  pages =        "200",
  day =          "30",
  month =        jun,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14070200",
  ISSN =         "1999-5903",
  bibdate =      "Tue Jul 26 06:44:01 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/7/200",
  abstract =     "The novelty of this work lies in examining how 5G,
                 blockchain-based public key infrastructure (PKI), near
                 field communication (NFC), and zero trust architecture
                 securely provide not only a trusted digital identity
                 for telework but also a trusted digital identity for
                 secure online voting. The paper goes on to discuss how
                 blockchain-based PKI, NFC, and the cloud provide a
                 roadmap for how industry and governments can update
                 existing frameworks to obtain a trusted digital
                 identity in cyberspace that would provide secure
                 telework and online voting capabilities.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Castagnos:2022:TPC,
  author =       "Guilhem Castagnos and Fabien Laguillaumie and Ida
                 Tucker",
  title =        "A tighter proof for {CCA} secure inner product
                 functional encryption: {Genericity} meets efficiency",
  journal =      j-THEOR-COMP-SCI,
  volume =       "914",
  number =       "??",
  pages =        "84--113",
  day =          "7",
  month =        may,
  year =         "2022",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2022.02.014",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Apr 11 11:18:46 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397522000913",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Chaabane:2022:LPB,
  author =       "Faten Chaabane and Jalel Ktari and Tarek Frikha and
                 Habib Hamam",
  title =        "Low Power Blockchained {E}-Vote Platform for
                 University Environment",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "9",
  pages =        "269",
  day =          "19",
  month =        sep,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14090269",
  ISSN =         "1999-5903",
  bibdate =      "Fri Sep 23 06:03:23 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/9/269",
  abstract =     "With the onset of the COVID-19 pandemic and the
                 succession of its waves, the transmission of this
                 disease and the number of deaths caused by it have been
                 increasing. Despite the various vaccines, the COVID-19
                 virus is still contagious and dangerous for affected
                 people. One of the remedies to this is precaution, and
                 particularly social distancing. In the same vein, this
                 paper proposes a remote voting system, which has to be
                 secure, anonymous, irreversible, accessible, and simple
                 to use. It therefore allows voters to have the
                 possibility to vote for their candidate without having
                 to perform the operation on site. This system will be
                 used for university elections and particularly for
                 student elections. We propose a platform based on a
                 decentralized system. This system will use two
                 blockchains communicating with each other: the public
                 Ethereum blockchain and the private Quorum blockchain.
                 The private blockchain will be institution-specific.
                 All these blockchains send the necessary data to the
                 public blockchain which manages different data related
                 to the universities and the ministry. This system
                 enables using encrypted data with the SHA-256 algorithm
                 to have both security and information security.
                 Motivated by the high energy consumption of blockchain
                 and by the performance improvements in low-power, a
                 test is performed on a low-power embedded platform
                 Raspberry PI4 showing the possibility to use the
                 Blockchain with limited resources.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Chang:2022:SMD,
  author =       "Jinyong Chang and Qiaochuan Ren and Yanyan Ji and
                 Maozhi Xu and Rui Xue",
  title =        "Secure medical data management with
                 privacy-preservation and authentication properties in
                 smart healthcare system",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "212",
  number =       "??",
  pages =        "??--??",
  day =          "20",
  month =        jul,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2022.109013",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Mon Jun 13 16:39:03 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128622001736",
  acknowledgement = ack-nhfb,
  articleno =    "109013",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Chen:2022:ECA,
  author =       "Ningyu Chen and Jiguo Li and Yichen Zhang and Yuyan
                 Guo",
  title =        "Efficient {CP-ABE} Scheme With Shared Decryption in
                 Cloud Storage",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "1",
  pages =        "175--184",
  month =        jan,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2020.3043950",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Dec 16 07:21:34 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Chen:2022:NCB,
  author =       "Siyuan Chen and Peng Zeng and Kim-Kwang Raymond Choo",
  title =        "A New Code-Based Blind Signature Scheme",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "7",
  pages =        "1776--1786",
  month =        jul,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxab018",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Jul 19 09:06:37 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/7/1776/6236090",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Chiesa:2022:SII,
  author =       "Alessandro Chiesa and Michael A. Forbes and Tom Gur
                 and Nicholas Spooner",
  title =        "Spatial Isolation Implies Zero Knowledge Even in a
                 Quantum World",
  journal =      j-J-ACM,
  volume =       "69",
  number =       "2",
  pages =        "15:1--15:44",
  month =        apr,
  year =         "2022",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/3511100",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Fri Mar 25 07:20:32 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3511100",
  abstract =     "Zero knowledge plays a central role in cryptography
                 and complexity. The seminal work of Ben-Or et al. (STOC
                 1988) shows that zero knowledge can be achieved
                 unconditionally for any language in NEXP, as long as
                 one is willing to make a suitable physical \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "Journal of the ACM",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}

@Article{Chochtoula:2022:IEC,
  author =       "Despoina Chochtoula and Aristidis Ilias and Yannis C.
                 Stamatiou and Christos Makris",
  title =        "Integrating Elliptic Curve Cryptography with the
                 {Modbus TCP SCADA Communication Protocol}",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "8",
  pages =        "232",
  day =          "28",
  month =        jul,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14080232",
  ISSN =         "1999-5903",
  bibdate =      "Fri Sep 2 12:13:30 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/8/232",
  abstract =     "SCADA systems monitor critical industrial, energy and
                 other physical infrastructures in order to detect
                 malfunctions, issue alerts and, in many cases, propose
                 or even take remedial actions. However, due to their
                 attachment to the Internet, SCADA systems are, today,
                 vulnerable to attacks such as, among several others,
                 interception of data traffic, malicious modifications
                 of settings and control operations data, malicious
                 modification of measurements and infrastructure data
                 and Denial-of-Service attacks. Our research focuses on
                 strengthening SCADA systems with cryptographic methods
                 and protection mechanisms with emphasis on data and
                 messaging encryption and device identification and
                 authentication. The limited availability of computing
                 power and memory in sensors and embedded devices
                 deployed in SCADA systems make render cryptographic
                 methods with higher resource requirements, such as the
                 use of conventional public key cryptography such as
                 RSA, unsuitable. We, thus, propose Elliptic Curve
                 Cryptography as an alternative cryptographic mechanism,
                 where smaller key sizes are required, with lower
                 resource requirements for cryptographic operations.
                 Accordingly, our approach integrates Modbus, a commonly
                 used SCADA communication protocol, with Elliptic Curve
                 Cryptography. We have, also, developed an experimental
                 set-up in order to demonstrate the performance of our
                 approach and draw conclusions regarding its
                 effectiveness in real SCADA installations.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Choudhry:2022:DEI,
  author =       "Ajai Choudhry and Iliya Bluskov and Alexander James",
  title =        "A diophantine equation inspired by {Brahmagupta}'s
                 identity",
  journal =      j-INT-J-NUMBER-THEORY,
  volume =       "18",
  number =       "04",
  pages =        "905--911",
  month =        may,
  year =         "2022",
  DOI =          "https://doi.org/10.1142/S1793042122500476",
  ISSN =         "1793-0421 (print), 1793-7310 (electronic)",
  ISSN-L =       "1793-0421",
  bibdate =      "Fri Jun 24 11:06:50 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijnt.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S1793042122500476",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Number Theory (IJNT)",
  journal-URL =  "https://www.worldscientific.com/worldscinet/ijnt",
}

@Article{Chowdhuryy:2022:LST,
  author =       "Md Hafizul Islam Chowdhuryy and Fan Yao",
  title =        "Leaking Secrets Through Modern Branch Predictors in
                 the Speculative World",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "9",
  pages =        "2059--2072",
  month =        sep,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2021.3122830",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Aug 11 09:05:14 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Ciaurri:2022:EPG,
  author =       "{\'O}scar Ciaurri",
  title =        "An {``Esoteric''} Proof of {Gelin--Ces{\`a}ro}
                 Identity",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "129",
  number =       "5",
  pages =        "465--465",
  year =         "2022",
  CODEN =        "AMMYAE",
  DOI =          "https://doi.org/10.1080/00029890.2022.2043096",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Wed Jun 8 08:16:36 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/amermathmonthly2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "http://www.jstor.org/journals/00029890.html;
                 https://www.tandfonline.com/loi/uamm20",
  onlinedate =   "25 Apr 2022",
}

@Article{Cocco:2022:SPI,
  author =       "Luisanna Cocco and Roberto Tonelli and Michele
                 Marchesi",
  title =        "A System Proposal for Information Management in
                 Building Sector Based on {BIM}, {SSI}, {IoT} and
                 Blockchain",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "5",
  pages =        "140",
  day =          "30",
  month =        apr,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14050140",
  ISSN =         "1999-5903",
  bibdate =      "Fri May 27 12:03:38 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/5/140",
  abstract =     "This work presents a Self Sovereign Identity based
                 system proposal to show how Blockchain, Building
                 Information Modeling, Internet of Thing devices, and
                 Self Sovereign Identity concepts can support the
                 process of building digitalization, guaranteeing the
                 compliance standards and technical regulations. The
                 proposal ensures eligibility, transparency and
                 traceability of all information produced by
                 stakeholders, or generated by IoT devices appropriately
                 placed, during the entire life cycle of a building
                 artifact. By exploiting the concepts of the Self
                 Sovereign Identity, our proposal allows the
                 identification of all involved stakeholders, the
                 storage off-chain of all information, and that on-chain
                 of the sole data necessary for the information
                 notarization and certification, adopting
                 multi-signature approval mechanisms where appropriate.
                 In addition it allows the eligibility verification of
                 the certificated information, providing also useful
                 information for facility management. It is proposed as
                 an innovative system and companies that adopt the Open
                 Innovation paradigm might want to pursue it. The model
                 proposal is designed exploiting the Veramo platform,
                 hence the Ethereum Blockchain, and all the
                 recommendations about Self Sovereign Identity systems
                 given by the European Blockchain Partnership, and by
                 the World Wide Web Consortium.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Cuzzocrea:2022:EES,
  author =       "Alfredo Cuzzocrea and Panagiotis Karras and Akrivi
                 Vlachou",
  title =        "Effective and efficient skyline query processing over
                 attribute-order-preserving-free encrypted data in
                 cloud-enabled databases",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "126",
  number =       "??",
  pages =        "237--251",
  month =        jan,
  year =         "2022",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2021.08.008",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Wed Feb 9 09:07:24 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X21003137",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Dimitrov:2022:FGR,
  author =       "Vassil Dimitrov and Luigi Vigneri and Vidal Attias",
  title =        "Fast Generation of {RSA} Keys Using Smooth Integers",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "7",
  pages =        "1575--1585",
  month =        jul,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2021.3095669",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Jun 30 08:11:52 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
  keywords =     "computational number theory; Multiple-base
                 representations; primality testing; public-key
                 cryptography; RSA",
}

@Article{Dodds:2022:FVI,
  author =       "Mike Dodds",
  title =        "Formally Verifying Industry Cryptography",
  journal =      j-IEEE-SEC-PRIV,
  volume =       "20",
  number =       "3",
  pages =        "65--70",
  month =        may # "\slash " # jun,
  year =         "2022",
  DOI =          "https://doi.org/10.1109/MSEC.2022.3153035",
  ISSN =         "1540-7993 (print), 1558-4046 (electronic)",
  ISSN-L =       "1540-7993",
  bibdate =      "Tue Jun 7 10:14:13 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Security \& Privacy",
  journal-URL =  "https://publications.computer.org/security-and-privacy/",
}

@Article{Dong:2022:EEA,
  author =       "Jiankuo Dong and Fangyu Zheng and Jingqiang Lin and
                 Zhe Liu and Fu Xiao and Guang Fan",
  title =        "{EC-ECC}: Accelerating Elliptic Curve Cryptography for
                 Edge Computing on Embedded {GPU TX2}",
  journal =      j-TECS,
  volume =       "21",
  number =       "2",
  pages =        "16:1--16:25",
  month =        mar,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3492734",
  ISSN =         "1539-9087 (print), 1558-3465 (electronic)",
  ISSN-L =       "1539-9087",
  bibdate =      "Thu Mar 24 15:59:57 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tecs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3492734",
  abstract =     "Driven by artificial intelligence and computer vision
                 industries, Graphics Processing Units (GPUs) are now
                 rapidly achieving extraordinary computing power. In
                 particular, the NVIDIA Tegra K1/X1/X2 embedded GPU
                 platforms, which are also treated as edge \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Transactions on Embedded Computing Systems",
  journal-URL =  "https://dl.acm.org/loi/tecs",
}

@Article{Drusinsky:2022:CBS,
  author =       "Doron Drusinsky",
  title =        "Cryptographic--Biometric Self-Sovereign Personal
                 Identities",
  journal =      j-COMPUTER,
  volume =       "55",
  number =       "6",
  pages =        "96--102",
  month =        jun,
  year =         "2022",
  CODEN =        "CPTRB4",
  DOI =          "https://doi.org/10.1109/MC.2022.3164527",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Thu Jun 9 09:57:23 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computer2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Article{Dubey:2022:GML,
  author =       "Anuj Dubey and Rosario Cammarota and Vikram Suresh and
                 Aydin Aysu",
  title =        "Guarding Machine Learning Hardware Against Physical
                 Side-channel Attacks",
  journal =      j-JETC,
  volume =       "18",
  number =       "3",
  pages =        "56:1--56:31",
  month =        jul,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3465377",
  ISSN =         "1550-4832",
  ISSN-L =       "1550-4832",
  bibdate =      "Wed Aug 10 06:36:52 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jetc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3465377",
  abstract =     "Machine learning (ML) models can be trade secrets due
                 to their development cost. Hence, they need protection
                 against malicious forms of reverse engineering (e.g.,
                 in IP piracy). With a growing shift of ML to the edge
                 devices, in part for performance and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "ACM Journal on Emerging Technologies in Computing
                 Systems (JETC)",
  journal-URL =  "https://dl.acm.org/loi/jetc",
}

@Article{Duong:2022:CCL,
  author =       "Dung Hoang Duong and Partha Sarathi Roy and Willy
                 Susilo and Kazuhide Fukushima and Shinsaku Kiyomoto and
                 Arnaud Sipasseuth",
  title =        "Chosen-ciphertext lattice-based public key encryption
                 with equality test in standard model",
  journal =      j-THEOR-COMP-SCI,
  volume =       "905",
  number =       "??",
  pages =        "31--53",
  day =          "22",
  month =        feb,
  year =         "2022",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.12.013",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Jan 26 14:24:22 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521007210",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Dutta:2022:PIB,
  author =       "Priyanka Dutta and Willy Susilo and Dung Hoang Duong
                 and Partha Sarathi Roy",
  title =        "Puncturable identity-based and attribute-based
                 encryption from lattices",
  journal =      j-THEOR-COMP-SCI,
  volume =       "929",
  number =       "??",
  pages =        "18--38",
  day =          "11",
  month =        sep,
  year =         "2022",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2022.06.028",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Sep 21 10:24:08 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397522003954",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Echavarria:2022:CEE,
  author =       "Karina Rodriguez Echavarria and Myrsini Samaroudi and
                 Laurie Dibble and Edward Silverton and Sophie Dixon",
  title =        "Creative Experiences for Engaging Communities with
                 Cultural Heritage through Place-based Narratives",
  journal =      j-JOCCH,
  volume =       "15",
  number =       "2",
  pages =        "33:1--33:19",
  month =        jun,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3479007",
  ISSN =         "1556-4673 (print), 1556-4711 (electronic)",
  ISSN-L =       "1556-4673",
  bibdate =      "Sat Jul 2 07:43:15 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jocch.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3479007",
  abstract =     "This research explores technologically advanced means
                 to enhance audiences' connection with cultural heritage
                 assets through participatory creative methods that
                 particularly reinforce young people's sense of identity
                 and well-being during sensitive \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "Journal on Computing and Cultural Heritage (JOCCH)",
  journal-URL =  "https://dl.acm.org/loi/jocch",
}

@Article{El-Zawawy:2022:SSB,
  author =       "Mohamed A. El-Zawawy and Alessandro Brighente and
                 Mauro Conti",
  title =        "\pkg{SETCAP}: Service-Based Energy-Efficient Temporal
                 Credential Authentication Protocol for {Internet of
                 Drones}",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "206",
  number =       "??",
  pages =        "??--??",
  day =          "7",
  month =        apr,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2022.108804",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Mon Mar 7 06:52:32 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128622000305",
  acknowledgement = ack-nhfb,
  articleno =    "108804",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Elkoumy:2022:PCP,
  author =       "Gamal Elkoumy and Stephan A. Fahrenkrog-Petersen and
                 Mohammadreza Fani Sani and Agnes Koschmider and Felix
                 Mannhardt and Saskia Nu{\~n}ez Von Voigt and Majid
                 Rafiei and Leopold {Von Waldthausen}",
  title =        "Privacy and Confidentiality in Process Mining: Threats
                 and Research Challenges",
  journal =      j-TMIS,
  volume =       "13",
  number =       "1",
  pages =        "11:1--11:17",
  month =        mar,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3468877",
  ISSN =         "2158-656X (print), 2158-6578 (electronic)",
  ISSN-L =       "2158-656X",
  bibdate =      "Fri Jan 7 07:41:54 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tmis.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3468877",
  abstract =     "Privacy and confidentiality are very important
                 prerequisites for applying process mining to comply
                 with regulations and keep company secrets. This article
                 provides a foundation for future research on
                 privacy-preserving and confidential process mining
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Transactions on Management Information Systems
                 (TMIS)",
  journal-URL =  "https://dl.acm.org/loi/tmis",
}

@Article{Eltaief:2022:FCF,
  author =       "Hamdi Eltaief",
  title =        "{Flex-CC}: a flexible connected chains scheme for
                 multicast source authentication in dynamic {SDN}
                 environment",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "214",
  number =       "??",
  pages =        "??--??",
  day =          "4",
  month =        sep,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2022.109179",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Wed Sep 21 06:36:54 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128622002766",
  acknowledgement = ack-nhfb,
  articleno =    "109179",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Emura:2022:IBE,
  author =       "Keita Emura and Shuichi Katsumata and Yohei Watanabe",
  title =        "Identity-based encryption with security against the
                 {KGC}: a formal model and its instantiations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "900",
  number =       "??",
  pages =        "97--119",
  day =          "8",
  month =        jan,
  year =         "2022",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.11.021",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Jan 26 14:23:54 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S030439752100699X",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Fanfakh:2022:OGO,
  author =       "Ahmed Fanfakh and Hassan Noura and Rapha{\"e}l
                 Couturier",
  title =        "{ORSCA-GPU}: one round stream cipher algorithm for
                 {GPU} implementation",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "9",
  pages =        "11744--11767",
  month =        jun,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-022-04335-4",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Mon Jun 6 08:11:51 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-022-04335-4",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Feldmann:2022:AAC,
  author =       "Axel Feldmann and Nikola Samardzic and Aleksandar
                 Krastev and Srinivas Devadas and Ron Dreslinski and
                 Chris Peikert and Daniel Sanchez",
  title =        "An Architecture to Accelerate Computation on Encrypted
                 Data",
  journal =      j-IEEE-MICRO,
  volume =       "42",
  number =       "4",
  pages =        "59--68",
  month =        jul # "\slash " # aug,
  year =         "2022",
  CODEN =        "IEMIDZ",
  DOI =          "https://doi.org/10.1109/MM.2022.3170792",
  ISSN =         "0272-1732 (print), 1937-4143 (electronic)",
  ISSN-L =       "0272-1732",
  bibdate =      "Thu Jun 30 10:20:15 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Micro",
  journal-URL =  "http://www.computer.org/csdl/mags/mi/index.html",
}

@Article{Feng:2022:BTE,
  author =       "Shengyuan Feng and Junqing Gong and Jie Chen",
  title =        "Binary Tree Encryption with Constant-Size Public Key
                 in the Standard Model",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "6",
  pages =        "1489--1511",
  month =        jun,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa194",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Jun 24 10:59:06 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/6/1489/6154510",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Fischer:2022:CED,
  author =       "Andreas Fischer and Benny Fuhry and J{\"o}rn
                 Ku{\ss}maul and Jonas Janneck and Florian Kerschbaum
                 and Eric Bodden",
  title =        "Computation on Encrypted Data Using Dataflow
                 Authentication",
  journal =      j-TOPS,
  volume =       "25",
  number =       "3",
  pages =        "21:1--21:36",
  month =        aug,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3513005",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Mon Jul 25 09:49:14 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3513005",
  abstract =     "Encrypting data before sending it to the cloud ensures
                 data confidentiality but requires the cloud to compute
                 on encrypted data. Trusted execution environments, such
                 as Intel SGX enclaves, promise to provide a secure
                 environment in which data can be \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Fitzgerald:2022:ECP,
  author =       "Joshua Brian Fitzgerald",
  title =        "Elliptic Curve Pairings",
  journal =      j-COMPUTER,
  volume =       "55",
  number =       "4",
  pages =        "74--77",
  month =        apr,
  year =         "2022",
  CODEN =        "CPTRB4",
  DOI =          "https://doi.org/10.1109/MC.2022.3146745",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Thu Apr 14 16:26:07 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/computer2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  abstract =     "Elliptic curve pairings are a powerful tool and a
                 popular way to construct zero-knowledge proofs, which
                 are beginning to be used in blockchains as a way to
                 provide privacy in the transaction ledger.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Article{Fomichev:2022:NRC,
  author =       "Mikhail Fomichev and Luis F. Abanto-leon and Max
                 Stiegler and Alejandro Molina and Jakob Link and
                 Matthias Hollick",
  title =        "{Next2You}: Robust Copresence Detection Based on
                 Channel State Information",
  journal =      j-TIOT,
  volume =       "3",
  number =       "2",
  pages =        "11:1--11:31",
  month =        may,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3491244",
  ISSN =         "2691-1914 (print), 2577-6207 (electronic)",
  ISSN-L =       "2691-1914",
  bibdate =      "Wed Jul 20 07:48:51 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tiot.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3491244",
  abstract =     "Context-based copresence detection schemes are a
                 necessary prerequisite to building secure and usable
                 authentication systems in the Internet of Things (IoT).
                 Such schemes allow one device to verify proximity of
                 another device without user assistance \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Transactions on Internet of Things (TIOT)",
  journal-URL =  "https://dl.acm.org/loi/tiot",
}

@Article{Francq:2022:NTS,
  author =       "Julien Francq and Lo{\"\i}c Besson and Paul Huynh and
                 Philippe Guillot and Gilles Millerioux and Marine
                 Minier",
  title =        "Non-Triangular Self-Synchronizing Stream Ciphers",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "1",
  pages =        "134--145",
  month =        jan,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2020.3043714",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Dec 16 07:21:34 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Fu:2022:PFS,
  author =       "Junsong Fu and Na Wang and Baojiang Cui and Bharat K.
                 Bhargava",
  title =        "A Practical Framework for Secure Document Retrieval in
                 Encrypted Cloud File Systems",
  journal =      j-IEEE-TRANS-PAR-DIST-SYS,
  volume =       "33",
  number =       "5",
  pages =        "1246--1261",
  month =        may,
  year =         "2022",
  CODEN =        "ITDSEO",
  DOI =          "https://doi.org/10.1109/TPDS.2021.3107752",
  ISSN =         "1045-9219 (print), 1558-2183 (electronic)",
  ISSN-L =       "1045-9219",
  bibdate =      "Thu Oct 21 11:15:12 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Parallel and Distributed
                 Systems",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71",
}

@Article{Gajabe:2022:SKB,
  author =       "Rajashree Gajabe and Syed Taqi Ali",
  title =        "Secret Key-Based Image Steganography in Spatial
                 Domain",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "22",
  number =       "02",
  pages =        "??--??",
  month =        apr,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1142/S0219467822500140",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Fri May 6 07:27:02 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0219467822500140",
  abstract =     "Day by day, the requirement for secure communication
                 among users is rising in a digital world, to protect
                 the message from the undesirable users. Steganography
                 is a methodology that satisfies the user's necessity of
                 secure communication by inserting a message into
                 different formats. This paper proposes a secret
                 key-based image steganography to secure the message by
                 concealing the grayscale image inside a cover image.
                 The proposed technique shares the 20 characters long
                 secret key between two clients where the initial eight
                 characters of a secret key are utilized for bit
                 permutation of characters and pixels while the last 12
                 characters of secret key decide the encryption keys and
                 position of pixels of a grayscale image into the cover.
                 The grayscale image undergoes operation such as
                 encryption and chaotic baker followed by its hiding in
                 a cover to form a stego image. The execution of the
                 proposed strategy is performed on Matlab 2018. It shows
                 that the proposed approach manages to store the maximum
                 message of size 16 KB into the cover of size
                 256{\texttimes}256 . The image quality of stego images
                 has been evaluated using PSNR, MSE. For a full payload
                 of 16 KB, PSNR is around 51 dB to 53 dB which is
                 greater than satisfactory PSNR.",
  acknowledgement = ack-nhfb,
  articleno =    "2250014",
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Gao:2022:FVM,
  author =       "Pengfei Gao and Hongyi Xie and Pu Sun and Jun Zhang
                 and Fu Song and Taolue Chen",
  title =        "Formal Verification of Masking Countermeasures for
                 Arithmetic Programs",
  journal =      j-IEEE-TRANS-SOFTW-ENG,
  volume =       "48",
  number =       "3",
  pages =        "973--1000",
  month =        mar,
  year =         "2022",
  CODEN =        "IESEDJ",
  DOI =          "https://doi.org/10.1109/TSE.2020.3008852",
  ISSN =         "0098-5589 (print), 1939-3520 (electronic)",
  ISSN-L =       "0098-5589",
  bibdate =      "Thu Mar 17 07:11:56 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Software Engineering",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}

@Article{Gao:2022:UNU,
  author =       "Ming Gao and YuBin Lu",
  title =        "{URAP}: a new ultra-lightweight {RFID} authentication
                 protocol in passive {RFID} system",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "8",
  pages =        "10893--10905",
  month =        may,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-021-04252-y",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Mon Jun 6 08:11:51 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-021-04252-y",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Gentile:2022:VPA,
  author =       "Antonio Francesco Gentile and Davide Macr{\`\i} and
                 Floriano {De Rango} and Mauro Tropea and Emilio Greco",
  title =        "A {VPN} Performances Analysis of Constrained Hardware
                 Open Source Infrastructure Deploy in {IoT}
                 Environment",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "9",
  pages =        "264",
  day =          "13",
  month =        sep,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14090264",
  ISSN =         "1999-5903",
  bibdate =      "Fri Sep 23 06:03:23 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/9/264",
  abstract =     "Virtual private network (VPN) represents an HW/SW
                 infrastructure that implements private and confidential
                 communication channels that usually travel through the
                 Internet. VPN is currently one of the most reliable
                 technologies to achieve this goal, also because being a
                 consolidated technology, it is possible to apply
                 appropriate patches to remedy any security holes. In
                 this paper we analyze the performances of open source
                 firmware OpenWrt 21.x compared with a server-side
                 operating system (Debian 11 x64) and Mikrotik 7.x, also
                 virtualized, and different types of clients (Windows
                 10/11, iOS 15, Android 11, OpenWrt 21.x, Debian 11 x64
                 and Mikrotik 7.x), observing the performance of the
                 network according to the current implementation of the
                 various protocols and algorithms of VPN tunnel examined
                 on what are the most recent HW and SW for deployment in
                 outdoor locations with poor network connectivity.
                 Specifically, operating systems provide different
                 performance metric values for various combinations of
                 configuration variables. The first pursued goal is to
                 find the algorithms to guarantee a data
                 transmission/encryption ratio as efficiently as
                 possible. The second goal is to research the algorithms
                 capable of guaranteeing the widest spectrum of
                 compatibility with the current infrastructures that
                 support VPN technology, to obtain a connection system
                 secure for geographically scattered IoT networks spread
                 over difficult-to-manage areas such as suburban or
                 rural environments. The third goal is to be able to use
                 open firmware on constrained routers that provide
                 compatibility with different VPN protocols.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Giannakoulopoulos:2022:ICO,
  author =       "Andreas Giannakoulopoulos and Minas Pergantis and
                 Laida Limniati and Alexandros Kouretsis",
  title =        "Investigating the Country of Origin and the Role of
                 the {\tt .eu} {TLD} in External Trade of {European
                 Union} Member States",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "6",
  pages =        "174",
  day =          "04",
  month =        jun,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14060174",
  ISSN =         "1999-5903",
  bibdate =      "Fri Jun 24 09:41:47 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/6/174",
  abstract =     "The Internet, and specifically the World Wide Web, has
                 always been a useful tool in the effort to achieve more
                 outward-looking economies. The launch of the .eu TLD
                 (top-level domain) in December of 2005 introduced the
                 concept of a pan-European Internet identity that aimed
                 to enhance the status of European citizens and
                 businesses on the global Web. In this study, the
                 countries of origin of websites that choose to use the
                 .eu TLD are investigated and the reasoning behind that
                 choice, as well as its relation to each country's
                 economy and external trade are discussed. Using the Web
                 as a tool, information regarding a vast number of
                 existing .eu websites was collected, through means of
                 Web data extraction, and this information was analyzed
                 and processed by a detailed algorithm that produced
                 results concerning each website's most probable country
                 of origin based on a multitude of factors. This
                 acquired knowledge was then used to investigate
                 relations with each member-state's presence in its
                 local ccTLD, its GDP and its external trade revenue.
                 The study establishes a correlation between presence in
                 the .eu TLD and external trade that is both independent
                 of a country's GDP and stronger than the relation
                 between its local ccTLD presence and external trade.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Gokulkumari:2022:MEA,
  author =       "G. Gokulkumari",
  title =        "Metaheuristic-Enabled Artificial Neural Network
                 Framework For Multimodal Biometric Recognition With
                 Local Fusion Visual Features",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "6",
  pages =        "1586--1597",
  month =        jun,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxab001",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Jun 24 10:59:06 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/6/1586/6167838",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Gong:2022:SLC,
  author =       "Bei Gong and Yong Wu and Qian Wang and Yu-heng Ren and
                 Chong Guo",
  title =        "A secure and lightweight certificateless hybrid
                 signcryption scheme for {Internet of Things}",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "127",
  number =       "??",
  pages =        "23--30",
  month =        feb,
  year =         "2022",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2021.08.027",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Wed Feb 9 09:07:25 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X21003356",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Guo:2022:DFE,
  author =       "Mengzhuo Guo and Zhongzhi Xu and Qingpeng Zhang and
                 Xiuwu Liao and Jiapeng Liu",
  title =        "Deciphering Feature Effects on Decision-Making in
                 Ordinal Regression Problems: an Explainable Ordinal
                 Factorization Model",
  journal =      j-TKDD,
  volume =       "16",
  number =       "3",
  pages =        "59:1--59:26",
  month =        jun,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3487048",
  ISSN =         "1556-4681 (print), 1556-472X (electronic)",
  ISSN-L =       "1556-4681",
  bibdate =      "Fri Dec 10 11:04:18 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tkdd.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3487048",
  abstract =     "Ordinal regression predicts the objects' labels that
                 exhibit a natural ordering, which is vital to
                 decision-making problems such as credit scoring and
                 clinical diagnosis. In these problems, the ability to
                 explain how the individual features and their
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "ACM Transactions on Knowledge Discovery from Data
                 (TKDD)",
  journal-URL =  "https://dl.acm.org/loi/tkdd",
}

@Article{Guo:2022:SSR,
  author =       "Yimin Guo and Zhenfeng Zhang and Yajun Guo",
  title =        "\pkg{SecFHome}: Secure remote authentication in
                 fog-enabled smart home environment",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "207",
  number =       "??",
  pages =        "??--??",
  day =          "22",
  month =        apr,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2022.108818",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Wed Mar 16 07:35:04 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S138912862200041X",
  acknowledgement = ack-nhfb,
  articleno =    "108818",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Halder:2022:EST,
  author =       "Subir Halder and Thomas Newe",
  title =        "Enabling secure time-series data sharing via
                 homomorphic encryption in cloud-assisted {IIoT}",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "133",
  number =       "??",
  pages =        "351--363",
  month =        aug,
  year =         "2022",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2022.03.032",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Mon Apr 25 15:59:34 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X22001078",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Hong:2022:MTC,
  author =       "Jason Hong",
  title =        "Modern tech can't shield your secret identity",
  journal =      j-CACM,
  volume =       "65",
  number =       "5",
  pages =        "24--25",
  month =        may,
  year =         "2022",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/3524013",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Tue Apr 26 07:08:57 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3524013",
  abstract =     "The Communications website, http://cacm.acm.org,
                 features more than a dozen bloggers in the
                 [email&\#160;protected] community. In each issue of
                 Communications, we'll publish selected posts or
                 excerpts. twitter Follow us on Twitter at
                 http://twitter.com/blogCACM http:/. \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Article{Hu:2022:NDP,
  author =       "Xichao Hu and Yongqiang Li and Lin Jiao and Mingsheng
                 Wang",
  title =        "New Division Property Propagation Table: Applications
                 to Block Ciphers with Large {S}-boxes",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "6",
  pages =        "1560--1573",
  month =        jun,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa203",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Jun 24 10:59:06 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/6/1560/6134263",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Huang:2022:CLR,
  author =       "Meijuan Huang and Bo Yang and Yanwei Zhou and Xuewei
                 Hu",
  title =        "Continual Leakage-Resilient Hedged Public-Key
                 Encryption",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "6",
  pages =        "1574--1585",
  month =        jun,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa204",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Jun 24 10:59:06 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/6/1574/6134264",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Huang:2022:OEI,
  author =       "Yan Huang and Yan Jin and Zhi Hu and Fangguo Zhang",
  title =        "Optimizing the evaluation of $l$-isogenous curve for
                 isogeny-based cryptography",
  journal =      j-INFO-PROC-LETT,
  volume =       "178",
  number =       "??",
  pages =        "Article 106301",
  month =        nov,
  year =         "2022",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/j.ipl.2022.106301",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Tue Aug 2 15:20:34 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/infoproc2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0020019022000588",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Hughes:2022:CIT,
  author =       "James P. Hughes and Whitfield Diffie",
  title =        "The Challenges of {IoT}, {TLS}, and Random Number
                 Generators in the Real World: Bad random numbers are
                 still with us and are proliferating in modern systems",
  journal =      j-QUEUE,
  volume =       "20",
  number =       "3",
  pages =        "18--40",
  month =        may,
  year =         "2022",
  CODEN =        "AQCUAE",
  DOI =          "https://doi.org/10.1145/3546933",
  ISSN =         "1542-7730 (print), 1542-7749 (electronic)",
  ISSN-L =       "1542-7730",
  bibdate =      "Fri Jul 29 06:42:43 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/queue.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3546933",
  abstract =     "Many in the cryptographic community scoff at the
                 mistakes made in implementing RNGs. Many cryptographers
                 and members of the IETF resist the call to make TLS
                 more resilient to this class of failures. This article
                 discusses the history, current state, and fragility of
                 the TLS protocol, and it closes with an example of how
                 to improve the protocol. The goal is not to suggest a
                 solution but to start a dialog to make TLS more
                 resilient by proving that the security of TLS without
                 the assumption of perfect random numbers is possible.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Queue: Tomorrow's Computing Today",
  journal-URL =  "https://dl.acm.org/loi/queue",
}

@Article{Ji:2022:DFM,
  author =       "Xiaoyu Ji and Yushi Cheng and Juchuan Zhang and Yuehan
                 Chi and Wenyuan Xu and Yi-Chao Chen",
  title =        "Device Fingerprinting with Magnetic Induction Signals
                 Radiated by {CPU} Modules",
  journal =      j-TOSN,
  volume =       "18",
  number =       "2",
  pages =        "23:1--23:28",
  month =        may,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3495158",
  ISSN =         "1550-4859 (print), 1550-4867 (electronic)",
  ISSN-L =       "1550-4859",
  bibdate =      "Tue Apr 5 06:33:04 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tosn.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3495158",
  abstract =     "With the widespread use of smart devices, device
                 authentication has received much attention. One popular
                 method for device authentication is to utilize
                 internally measured device fingerprints, such as device
                 ID, software or hardware-based characteristics.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Transactions on Sensor Networks (TOSN)",
  journal-URL =  "https://dl.acm.org/loi/tosn",
}

@Article{Jin:2022:ESC,
  author =       "Sunghyun Jin and Sung Min Cho and HeeSeok Kim and
                 Seokhie Hong",
  title =        "Enhanced Side-Channel Analysis on {ECDSA} Employing
                 Fixed-Base Comb Method",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "9",
  pages =        "2341--2350",
  month =        sep,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2022.3191736",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Aug 11 09:05:14 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Kansal:2022:EMS,
  author =       "Meenakshi Kansal and Amit Kumar Singh and Ratna
                 Dutta",
  title =        "Efficient Multi-Signature Scheme Using Lattice",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "9",
  pages =        "2421--2429",
  month =        sep,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxab077",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Mon Sep 19 15:38:40 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/9/2421/6289877",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Karabulut:2022:EFC,
  author =       "Emre Karabulut and Erdem Alkim and Aydin Aysu",
  title =        "Efficient, Flexible, and Constant-Time {Gaussian}
                 Sampling Hardware for Lattice Cryptography",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "8",
  pages =        "1810--1823",
  month =        aug,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2021.3107729",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sat Jul 16 11:55:32 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Khanal:2022:UBI,
  author =       "Yurika Pant Khanal and Abeer Alsadoon and Khurram
                 Shahzad and Ahmad B. Al-Khalil and Penatiyana W. C.
                 Prasad and Sabih Ur Rehman and Rafiqul Islam",
  title =        "Utilizing Blockchain for {IoT} Privacy through
                 Enhanced {ECIES} with Secure Hash Function",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "3",
  pages =        "77",
  day =          "28",
  month =        feb,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14030077",
  ISSN =         "1999-5903",
  bibdate =      "Fri Mar 4 08:59:15 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/3/77",
  abstract =     "Blockchain technology has been widely advocated for
                 security and privacy in IoT systems. However, a major
                 impediment to its successful implementation is the lack
                 of privacy protection regarding user access policy
                 while accessing personal data in the IoT system. This
                 work aims to preserve the privacy of user access policy
                 by protecting the confidentiality and authenticity of
                 the transmitted message while obtaining the necessary
                 consents for data access. We consider a Modified
                 Elliptic Curve Integrated Encryption Scheme (ECIES) to
                 improve the security strength of the transmitted
                 message. A secure hash function is used in conjunction
                 with a key derivation function to modify the encryption
                 procedure, which enhances the efficiency of the
                 encryption and decryption by generating multiple secure
                 keys through one master key. The proposed solution
                 eliminates user-dependent variables by including
                 transaction generation and verification in the
                 calculation of computation time, resulting in increased
                 system reliability. In comparison to previously
                 established work, the security of the transmitted
                 message is improved through a reduction of more than
                 12\% in the correlation coefficient between the
                 constructed request transaction and encrypted
                 transaction, coupled with a decrease of up to 7\% in
                 computation time.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Kim:2022:PPE,
  author =       "Hyeong-Jin Kim and Hyunjo Lee and Jae-Woo Chang",
  title =        "Privacy-preserving $k$ {NN} query processing
                 algorithms via secure two-party computation over
                 encrypted database in cloud computing",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "7",
  pages =        "9245--9284",
  month =        may,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-021-04286-2",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Mon Jun 6 08:11:50 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-021-04286-2",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Kumar:2022:CSA,
  author =       "Ashish Kumar and Rahul Saha and Mauro Conti and
                 Gulshan Kumar and William J. Buchanan and Tai Hoon
                 Kim",
  title =        "A comprehensive survey of authentication methods in
                 {Internet-of-Things} and its conjunctions",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "204",
  number =       "??",
  pages =        "??--??",
  month =        aug,
  year =         "2022",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2022.103414",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Wed Jun 8 07:19:26 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804522000716",
  acknowledgement = ack-nhfb,
  articleno =    "103414",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Kumar:2022:NAT,
  author =       "Sunil Kumar and Harshdeep Singh and Gaurav Mittal",
  title =        "A Novel Approach Towards Degree and {Walsh}-Transform
                 of {Boolean} Functions",
  journal =      j-INT-J-FOUND-COMP-SCI,
  volume =       "33",
  number =       "05",
  pages =        "453--479",
  month =        aug,
  year =         "2022",
  DOI =          "https://doi.org/10.1142/S0129054122500101",
  ISSN =         "0129-0541",
  ISSN-L =       "0129-0541",
  bibdate =      "Fri Sep 2 11:22:43 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
                 http://www.worldscientific.com/loi/ijfcs",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0129054122500101",
  abstract =     "Boolean functions are fundamental bricks in the
                 development of various applications in Cryptography and
                 Coding theory by making benefit from the weights of
                 related Boolean functions (Walsh spectrum). Towards
                 this, the discrete Fourier transform (Walsh--Hadamard)
                 plays a pivotal tool. The work in this paper is
                 dedicated towards the algebraic and numerical degrees,
                 together with the relationship between weights of
                 Boolean function and their Walsh transforms. We
                 introduce Walsh matrices and generalize them to any
                 arbitrary Boolean function. This improves the
                 complexity in computation of Walsh--Hadamard and
                 Fourier transform in certain cases. We also discuss
                 some useful results related to the degree of the
                 algebraic normal form using Walsh--Hadamard
                 transform.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Foundations of Computer
                 Science (IJFCS)",
  journal-URL =  "http://www.worldscientific.com/loi/ijfcs",
}

@Article{Kumar:2022:RRA,
  author =       "Vinod Kumar and Mahmoud Shuker Mahmoud and Adesh
                 Kumari",
  title =        "{RAPCHI}: Robust authentication protocol for
                 {IoMT}-based cloud-healthcare infrastructure",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "14",
  pages =        "16167--16196",
  month =        sep,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-022-04513-4",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri Sep 9 10:02:23 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-022-04513-4",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Lai:2022:PSO,
  author =       "Jianchang Lai and Xinyi Huang and Debiao He and Wei
                 Wu",
  title =        "Provably Secure Online\slash Offline Identity-Based
                 Signature Scheme Based on {SM9}",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "7",
  pages =        "1692--1701",
  month =        jul,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxab009",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Jul 19 09:06:37 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/7/1692/6189769",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Lalouani:2022:CMA,
  author =       "Wassila Lalouani and Mohamed Younis and Mohammad
                 Ebrahimabadi and Naghmeh Karimi",
  title =        "Countering Modeling Attacks in {PUF}-based {IoT}
                 Security Solutions",
  journal =      j-JETC,
  volume =       "18",
  number =       "3",
  pages =        "46:1--46:28",
  month =        jul,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3491221",
  ISSN =         "1550-4832",
  ISSN-L =       "1550-4832",
  bibdate =      "Wed Aug 10 06:36:52 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jetc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3491221",
  abstract =     "Hardware fingerprinting has emerged as a viable option
                 for safeguarding IoT devices from cyberattacks. Such a
                 fingerprint is used to not only authenticate the
                 interconnected devices but also to derive cryptographic
                 keys for ensuring data integrity and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Journal on Emerging Technologies in Computing
                 Systems (JETC)",
  journal-URL =  "https://dl.acm.org/loi/jetc",
}

@Article{LaMacchia:2022:SLR,
  author =       "Brian LaMacchia",
  title =        "Security: The long road ahead to transition to
                 post-quantum cryptography",
  journal =      j-CACM,
  volume =       "65",
  number =       "1",
  pages =        "28--30",
  month =        jan,
  year =         "2022",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/3498706",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Dec 20 13:58:11 MST 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cacm2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3498706",
  abstract =     "Anticipating the output of the competition for new
                 cryptographic algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "https://dl.acm.org/loi/cacm",
}

@Article{Lapworth:2022:PEI,
  author =       "Leigh Lapworth",
  title =        "Parallel encryption of input and output data for {HPC}
                 applications",
  journal =      j-IJHPCA,
  volume =       "36",
  number =       "2",
  pages =        "231--250",
  day =          "1",
  month =        mar,
  year =         "2022",
  CODEN =        "IHPCFL",
  DOI =          "https://doi.org/10.1177/10943420211016516",
  ISSN =         "1094-3420 (print), 1741-2846 (electronic)",
  ISSN-L =       "1094-3420",
  bibdate =      "Wed Apr 6 08:31:23 MDT 2022",
  bibsource =    "http://hpc.sagepub.com/;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijsa.bib",
  URL =          "https://journals.sagepub.com/doi/full/10.1177/10943420211016516",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of High Performance Computing
                 Applications",
}

@Article{Levi:2022:NCN,
  author =       "Anthony F. J. Levi and Gabriel Aeppli",
  title =        "The Naked Chip: No trade secret or hardware trojan can
                 hide from ptychographic {X}-ray laminography",
  journal =      j-IEEE-SPECTRUM,
  volume =       "59",
  number =       "5",
  pages =        "38--43",
  month =        may,
  year =         "2022",
  CODEN =        "IEESAM",
  DOI =          "https://doi.org/10.1109/MSPEC.2022.9771357",
  ISSN =         "0018-9235 (print), 1939-9340 (electronic)",
  ISSN-L =       "0018-9235",
  bibdate =      "Thu Jun 2 10:23:59 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeespectrum2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Spectrum",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
}

@Article{Li:2022:DCB,
  author =       "Yantao Li and Peng Tao and Shaojiang Deng and Gang
                 Zhou",
  title =        "{DeFFusion}: {CNN}-based Continuous Authentication
                 Using Deep Feature Fusion",
  journal =      j-TOSN,
  volume =       "18",
  number =       "2",
  pages =        "18:1--18:20",
  month =        may,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3485060",
  ISSN =         "1550-4859 (print), 1550-4867 (electronic)",
  ISSN-L =       "1550-4859",
  bibdate =      "Tue Apr 5 06:33:04 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tosn.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485060",
  abstract =     "Smartphones have become crucial and important in our
                 daily life, but the security and privacy issues have
                 been major concerns of smartphone users. In this
                 article, we present DeFFusion, a CNN-based continuous
                 authentication system using Deep Feature \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Transactions on Sensor Networks (TOSN)",
  journal-URL =  "https://dl.acm.org/loi/tosn",
}

@Article{Li:2022:DDV,
  author =       "Yingying Li and Jianfeng Ma and Yinbin Miao and
                 Huizhong Li and Qiang Yan and Yue Wang and Ximeng Liu
                 and Kim-Kwang Raymond Choo",
  title =        "{DVREI}: Dynamic Verifiable Retrieval Over Encrypted
                 Images",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "8",
  pages =        "1755--1769",
  month =        aug,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2021.3106482",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sat Jul 16 11:55:32 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Li:2022:ESA,
  author =       "Sujuan Li and Futai Zhang",
  title =        "{eCK}-Secure Authenticated Key Exchange against
                 Auxiliary Input Leakage",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "8",
  pages =        "2063--2072",
  month =        aug,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxab046",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Aug 19 18:03:49 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/8/2063/6269133",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Li:2022:ESS,
  author =       "Jingwei Li and Suyu Huang and Yanjing Ren and Zuoru
                 Yang and Patrick P. C. Lee and Xiaosong Zhang and Yao
                 Hao",
  title =        "Enabling Secure and Space-Efficient Metadata
                 Management in Encrypted Deduplication",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "4",
  pages =        "959--970",
  month =        apr,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2021.3067326",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Mar 17 06:38:17 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Li:2022:IMM,
  author =       "Manman Li and Shaozhen Chen",
  title =        "Improved Meet-in-the-Middle Attacks on Reduced-Round
                 Tweakable Block Cipher {Deoxys-BC}",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "9",
  pages =        "2411--2420",
  month =        sep,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxab076",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Mon Sep 19 15:38:40 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/9/2411/6291059",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Li:2022:TCC,
  author =       "Ying Li and Yi Huang and Suranga Seneviratne and
                 Kanchana Thilakarathna and Adriel Cheng and Guillaume
                 Jourjon and Darren Webb and David B. Smith and Richard
                 Yi Da Xu",
  title =        "From traffic classes to content: a hierarchical
                 approach for encrypted traffic classification",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "212",
  number =       "??",
  pages =        "??--??",
  day =          "20",
  month =        jul,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2022.109017",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Mon Jun 13 16:39:03 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S138912862200175X",
  acknowledgement = ack-nhfb,
  articleno =    "109017",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Liang:2022:MSA,
  author =       "Wei Liang and Songyou Xie and Dafang Zhang and Xiong
                 Li and Kuan-ching Li",
  title =        "A Mutual Security Authentication Method for {RFID-PUF}
                 Circuit Based on Deep Learning",
  journal =      j-TOIT,
  volume =       "22",
  number =       "2",
  pages =        "34:1--34:20",
  month =        may,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3426968",
  ISSN =         "1533-5399 (print), 1557-6051 (electronic)",
  ISSN-L =       "1533-5399",
  bibdate =      "Wed May 25 08:02:16 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toit.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3426968",
  abstract =     "The Industrial Internet of Things (IIoT) is designed
                 to refine and optimize the process controls, thereby
                 leveraging improvements in economic benefits, such as
                 efficiency and productivity. However, the Radio
                 Frequency Identification (RFID) technology in
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Transactions on Internet Technology (TOIT)",
  journal-URL =  "https://dl.acm.org/loi/toit",
}

@Article{Liao:2022:BBI,
  author =       "Chia-Hung Liao and Xue-Qin Guan and Jen-Hao Cheng and
                 Shyan-Ming Yuan",
  title =        "Blockchain-based identity management and access
                 control framework for open banking ecosystem",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "135",
  number =       "??",
  pages =        "450--466",
  month =        oct,
  year =         "2022",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2022.05.015",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri Jun 10 07:12:09 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X22001868",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Liu:2022:LOH,
  author =       "Yanjiang Liu and Tongzhou Qu and Zibin Dai",
  title =        "A Low-Overhead and High-Security Cryptographic Circuit
                 Design Utilizing the {TIGFET}-Based Three-Phase
                 Single-Rail Pulse Register against Side-Channel
                 Attacks",
  journal =      j-TODAES,
  volume =       "27",
  number =       "4",
  pages =        "36:1--36:13",
  month =        jul,
  year =         "2022",
  CODEN =        "ATASFO",
  DOI =          "https://doi.org/10.1145/3498339",
  ISSN =         "1084-4309 (print), 1557-7309 (electronic)",
  ISSN-L =       "1084-4309",
  bibdate =      "Wed May 25 08:20:01 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/todaes.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3498339",
  abstract =     "Side-channel attack (SCA) reveals confidential
                 information by statistically analyzing physical
                 manifestations, which is the serious threat to
                 cryptographic circuits. Various SCA circuit-level
                 countermeasures have been proposed as fundamental
                 solutions to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Transactions on Design Automation of Electronic
                 Systems",
  journal-URL =  "https://dl.acm.org/loi/todaes",
}

@Article{Liu:2022:NLN,
  author =       "Zeyi Liu and Weijuan Zhang and Ji Xiang and Daren Zha
                 and Lei Wang",
  title =        "{NP-LFA}: Non-profiled Leakage Fingerprint Attacks
                 against Improved Rotating {S}-box Masking Scheme",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "6",
  pages =        "1598--1610",
  month =        jun,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxab003",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Jun 24 10:59:06 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/6/1598/6178973",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Liu:2022:TCS,
  author =       "Xiangyu Liu and Shengli Liu and Shuai Han and Dawu
                 Gu",
  title =        "Tightly {CCA}-secure inner product functional
                 encryption scheme",
  journal =      j-THEOR-COMP-SCI,
  volume =       "898",
  number =       "??",
  pages =        "1--19",
  day =          "4",
  month =        jan,
  year =         "2022",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.10.008",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Jan 26 14:23:43 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521006009",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Lloret-Talavera:2022:EHE,
  author =       "Guillermo Lloret-Talavera and Marc Jorda and Harald
                 Servat and Fabian Boemer and Chetan Chauhan and Shigeki
                 Tomishima and Nilesh N. Shah and Antonio J. Pe{\~n}a",
  title =        "Enabling Homomorphically Encrypted Inference for Large
                 {DNN} Models",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "5",
  pages =        "1145--1155",
  month =        may,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2021.3076123",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Fri Apr 8 07:50:20 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Lu:2022:EKE,
  author =       "Jinyu Lu and Yunwen Liu and Tomer Ashur and Chao Li",
  title =        "On the Effect of the Key-Expansion Algorithm in
                 {Simon}-like Ciphers",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "9",
  pages =        "2454--2469",
  month =        sep,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxab082",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Mon Sep 19 15:38:40 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/9/2454/6314722",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Lu:2022:PDD,
  author =       "Hai Lu and Ruyun Yu and Yan Zhu and Xiao He and Kaitai
                 Liang and William Cheng-Chung Chu",
  title =        "Policy-driven Data Sharing over Attribute-Based
                 Encryption supporting Dual Membership",
  journal =      j-J-SYST-SOFTW,
  volume =       "188",
  number =       "??",
  pages =        "??--??",
  month =        jun,
  year =         "2022",
  CODEN =        "JSSODM",
  DOI =          "https://doi.org/10.1016/j.jss.2022.111271",
  ISSN =         "0164-1212 (print), 1873-1228 (electronic)",
  ISSN-L =       "0164-1212",
  bibdate =      "Tue Mar 29 12:02:42 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsystsoftw2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0164121222000346",
  acknowledgement = ack-nhfb,
  articleno =    "111271",
  fjournal =     "Journal of Systems and Software",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01641212",
}

@Article{Lu:2022:SSK,
  author =       "Youjing Lu and Fan Wu and Qianyi Huang and Shaojie
                 Tang and Linghe Kong and Guihai Chen",
  title =        "Shared Secret Key Generation by Exploiting Inaudible
                 Acoustic Channels",
  journal =      j-TOSN,
  volume =       "18",
  number =       "1",
  pages =        "13:1--13:26",
  month =        feb,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3480461",
  ISSN =         "1550-4859 (print), 1550-4867 (electronic)",
  ISSN-L =       "1550-4859",
  bibdate =      "Fri Jan 7 08:17:53 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tosn.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3480461",
  abstract =     "To build a secure wireless networking system, it is
                 essential that the cryptographic key is known only to
                 the two (or more) communicating parties. Existing key
                 extraction schemes put the devices into physical
                 proximity and utilize the common inherent \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Transactions on Sensor Networks (TOSN)",
  journal-URL =  "https://dl.acm.org/loi/tosn",
}

@Article{Luo:2022:FDF,
  author =       "Yukui Luo and Shijin Duan and Xiaolin Xu",
  title =        "{FPGAPRO}: a Defense Framework Against
                 Crosstalk-Induced Secret Leakage in {FPGA}",
  journal =      j-TODAES,
  volume =       "27",
  number =       "3",
  pages =        "24:1--24:31",
  month =        may,
  year =         "2022",
  CODEN =        "ATASFO",
  DOI =          "https://doi.org/10.1145/3491214",
  ISSN =         "1084-4309 (print), 1557-7309 (electronic)",
  ISSN-L =       "1084-4309",
  bibdate =      "Thu Mar 24 16:05:33 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/todaes.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3491214",
  abstract =     "With the emerging cloud-computing development, FPGAs
                 are being integrated with cloud servers for higher
                 performance. Recently, it has been explored to enable
                 multiple users to share the hardware resources of a
                 remote FPGA, i.e., to execute their own \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Transactions on Design Automation of Electronic
                 Systems",
  journal-URL =  "https://dl.acm.org/loi/todaes",
}

@Article{Luo:2022:MEO,
  author =       "Meng Luo and Yepeng Yao and Liling Xin and Zhengwei
                 Jiang and Qiuyun Wang and Wenchang Shi",
  title =        "Measurement for encrypted open resolvers: Applications
                 and security",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "213",
  number =       "??",
  pages =        "??--??",
  day =          "4",
  month =        aug,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2022.109081",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Thu Aug 4 05:58:27 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128622002183",
  acknowledgement = ack-nhfb,
  articleno =    "109081",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Ma:2022:RAS,
  author =       "Ruhui Ma and Jin Cao and Dengguo Feng and Hui Li and
                 Xiaowei Li and Yang Xu",
  title =        "A robust authentication scheme for remote diagnosis
                 and maintenance in {5G V2N}",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "198",
  number =       "??",
  pages =        "??--??",
  month =        feb,
  year =         "2022",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2021.103281",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Thu Jan 20 08:06:58 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804521002770",
  acknowledgement = ack-nhfb,
  articleno =    "103281",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Mahalat:2022:ICA,
  author =       "Mahabub Hasan Mahalat and Suraj Mandal and Anindan
                 Mondal and Bibhash Sen and Rajat Subhra Chakraborty",
  title =        "Implementation, Characterization and Application of
                 Path Changing Switch based Arbiter {PUF} on {FPGA} as a
                 lightweight Security Primitive for {IoT}",
  journal =      j-TODAES,
  volume =       "27",
  number =       "3",
  pages =        "26:1--26:26",
  month =        may,
  year =         "2022",
  CODEN =        "ATASFO",
  DOI =          "https://doi.org/10.1145/3491212",
  ISSN =         "1084-4309 (print), 1557-7309 (electronic)",
  ISSN-L =       "1084-4309",
  bibdate =      "Thu Mar 24 16:05:33 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/todaes.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3491212",
  abstract =     "Secure authentication of any Internet-of-Things (IoT)
                 device becomes the utmost necessity due to the lack of
                 specifically designed IoT standards and intrinsic
                 vulnerabilities with limited resources and
                 heterogeneous technologies. Despite the suitability ...
                 $^$",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Transactions on Design Automation of Electronic
                 Systems",
  journal-URL =  "https://dl.acm.org/loi/todaes",
}

@Article{Mary:2022:VTS,
  author =       "Narla John Metilda Sagaya Mary and Srinivasan Umesh
                 and Sandesh Varadaraju Katta",
  title =        "{S}-Vectors and {TESA}: Speaker Embeddings and a
                 Speaker Authenticator Based on Transformer Encoder",
  journal =      j-IEEE-ACM-TASLP,
  volume =       "30",
  number =       "??",
  pages =        "404--413",
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1109/TASLP.2021.3134566",
  ISSN =         "2329-9290",
  ISSN-L =       "2329-9290",
  bibdate =      "Thu Apr 7 10:27:19 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeeacmtaslp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE\slash ACM Transactions on Audio, Speech, and
                 Language Processing",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6570655",
}

@Article{Mayrhofer:2022:AMM,
  author =       "Ren{\'e} Mayrhofer and Stephan Sigg",
  title =        "Adversary Models for Mobile Device Authentication",
  journal =      j-COMP-SURV,
  volume =       "54",
  number =       "9",
  pages =        "198:1--198:35",
  month =        dec,
  year =         "2022",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3477601",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Tue Oct 26 07:04:27 MDT 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3477601",
  abstract =     "Mobile device authentication has been a highly active
                 research topic for over 10 years, with a vast range of
                 methods proposed and analyzed. In related areas, such
                 as secure channel protocols, remote authentication, or
                 desktop user authentication, strong, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "198",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Article{Meftah:2022:THP,
  author =       "Souhail Meftah and Benjamin Hong Meng Tan and Khin Mi
                 Mi Aung and Lu Yuxiao and Lin Jie and Bharadwaj
                 Veeravalli",
  title =        "Towards high performance homomorphic encryption for
                 inference tasks on {CPU}: an {MPI} approach",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "134",
  number =       "??",
  pages =        "13--21",
  month =        sep,
  year =         "2022",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2022.03.033",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Fri May 20 11:45:43 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/pvm.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X22001145",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Meshram:2022:EAK,
  author =       "Chandrashekhar Meshram and Rabha W. Ibrahim and
                 Agbotiname Lucky Imoize",
  title =        "An efficient authentication with key agreement
                 procedure using {Mittag-Leffler--Chebyshev} summation
                 chaotic map under the multi-server architecture",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "4",
  pages =        "4938--4959",
  month =        mar,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-021-04039-1",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Mon Jun 6 08:11:48 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-021-04039-1",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Meshram:2022:ERU,
  author =       "Chandrashekhar Meshram and Rabha W. Ibrahim and Sharad
                 Kumar Barve",
  title =        "An efficient remote user authentication with key
                 agreement procedure based on convolution-{Chebyshev}
                 chaotic maps using biometric",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "10",
  pages =        "12792--12814",
  month =        jul,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-021-04280-8",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri Jun 10 07:18:59 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-021-04280-8",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Mirsaraei:2022:STF,
  author =       "AmirHossein Ghafouri Mirsaraei and Ali Barati and
                 Hamid Barati",
  title =        "A secure three-factor authentication scheme for {IoT}
                 environments",
  journal =      j-J-PAR-DIST-COMP,
  volume =       "169",
  number =       "??",
  pages =        "87--105",
  month =        nov,
  year =         "2022",
  CODEN =        "JPDCER",
  DOI =          "https://doi.org/10.1016/j.jpdc.2022.06.011",
  ISSN =         "0743-7315 (print), 1096-0848 (electronic)",
  ISSN-L =       "0743-7315",
  bibdate =      "Mon Aug 29 12:03:19 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jpardistcomp2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0743731522001460",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Parallel and Distributed Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07437315",
}

@Article{Mobarhan:2022:RAS,
  author =       "Mostafa Ayoubi Mobarhan and Mohammed Salamah",
  title =        "{REPS-AKA3}: a secure authentication and re-
                 authentication protocol for {LTE} networks",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "201",
  number =       "??",
  pages =        "??--??",
  month =        may,
  year =         "2022",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2022.103345",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Thu Mar 24 07:52:07 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804522000145",
  acknowledgement = ack-nhfb,
  articleno =    "103345",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Mogensen:2022:HRL,
  author =       "Torben {\AE}gidius Mogensen",
  title =        "\pkg{Hermes}: a reversible language for lightweight
                 encryption",
  journal =      j-SCI-COMPUT-PROGRAM,
  volume =       "215",
  number =       "??",
  pages =        "??--??",
  day =          "1",
  month =        mar,
  year =         "2022",
  CODEN =        "SCPGD4",
  DOI =          "https://doi.org/10.1016/j.scico.2021.102746",
  ISSN =         "0167-6423 (print), 1872-7964 (electronic)",
  ISSN-L =       "0167-6423",
  bibdate =      "Tue Jan 25 06:43:25 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167642321001398",
  acknowledgement = ack-nhfb,
  articleno =    "102746",
  fjournal =     "Science of Computer Programming",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01676423",
}

@Article{Narasimhulu:2022:NBW,
  author =       "C. Venkata Narasimhulu",
  title =        "A New Blind Watermark Embedding Model: Spiral Updated
                 Rider Optimization Algorithm",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "6",
  pages =        "1365--1385",
  month =        jun,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa185",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Jun 24 10:59:06 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/6/1365/6124657",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Nassr:2022:ISP,
  author =       "Dieaa I. Nassr and M. Anwar and Hatem M. Bahig",
  title =        "Improving small private exponent attack on the
                 {Murru--Saettone} cryptosystem",
  journal =      j-THEOR-COMP-SCI,
  volume =       "923",
  number =       "??",
  pages =        "222--234",
  day =          "26",
  month =        jun,
  year =         "2022",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2022.05.010",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Jun 8 09:18:44 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397522003085",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Natgunanathan:2022:BBA,
  author =       "Iynkaran Natgunanathan and Purathani Praitheeshan and
                 Longxiang Gao and Yong Xiang and Lei Pan",
  title =        "Blockchain-Based Audio Watermarking Technique for
                 Multimedia Copyright Protection in Distribution
                 Networks",
  journal =      j-TOMM,
  volume =       "18",
  number =       "3",
  pages =        "86:1--86:23",
  month =        aug,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3492803",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Thu Mar 24 08:21:55 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3492803",
  abstract =     "Copyright protection in multimedia protection
                 distribution is a challenging problem. To protect
                 multimedia data, many watermarking methods have been
                 proposed in the literature. However, most of them
                 cannot be used effectively in a multimedia distribution
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "86",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Nath:2022:EWV,
  author =       "Kaushik Nath and Palash Sarkar",
  title =        "Efficient 4-Way Vectorizations of the {Montgomery}
                 Ladder",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "3",
  pages =        "712--723",
  month =        mar,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2021.3060505",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Feb 17 08:09:56 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Noura:2022:DGB,
  author =       "Hassan N. Noura and Rapha{\"e}l Couturier and Kamel
                 Mazouzi",
  title =        "{DKEMA}: {GPU}-based and dynamic key-dependent
                 efficient message authentication algorithm",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "12",
  pages =        "14034--14071",
  month =        aug,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-022-04433-3",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Tue Jul 19 08:40:45 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-022-04433-3",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Oden:2022:ICA,
  author =       "Lena Oden and J{\"o}rg Keller",
  title =        "Improving cryptanalytic applications with stochastic
                 runtimes on {GPUs} and multicores",
  journal =      j-PARALLEL-COMPUTING,
  volume =       "112",
  number =       "??",
  pages =        "??--??",
  month =        sep,
  year =         "2022",
  CODEN =        "PACOEJ",
  DOI =          "https://doi.org/10.1016/j.parco.2022.102944",
  ISSN =         "0167-8191 (print), 1872-7336 (electronic)",
  ISSN-L =       "0167-8191",
  bibdate =      "Thu Jul 21 09:54:49 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/parallelcomputing.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167819122000412",
  acknowledgement = ack-nhfb,
  articleno =    "102944",
  fjournal =     "Parallel Computing",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01678191",
}

@Article{Ono:2022:PPF,
  author =       "Shinji Ono and Jun Takata and Masaharu Kataoka and
                 Tomohiro I and Kilho Shin and Hiroshi Sakamoto",
  title =        "Privacy-Preserving Feature Selection with Fully
                 Homomorphic Encryption",
  journal =      j-ALGORITHMS-BASEL,
  volume =       "15",
  number =       "7",
  month =        jul,
  year =         "2022",
  CODEN =        "ALGOCH",
  DOI =          "https://doi.org/10.3390/a15070229",
  ISSN =         "1999-4893 (electronic)",
  ISSN-L =       "1999-4893",
  bibdate =      "Tue Jul 26 06:26:13 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://www.mdpi.com/1999-4893/15/7/229",
  acknowledgement = ack-nhfb,
  articleno =    "229",
  fjournal =     "Algorithms (Basel)",
  journal-URL =  "https://www.mdpi.com/journal/algorithms",
  pagecount =    "??",
}

@Article{Palit:2022:ABB,
  author =       "Sudip Kumar Palit and Mohuya Chakraborty and
                 Subhalaxmi Chakraborty",
  title =        "{AUGChain}: blockchain-based mobile user
                 authentication scheme in global mobility network",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "5",
  pages =        "6788--6816",
  month =        apr,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-021-04139-y",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Mon Jun 6 08:11:48 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-021-04139-y",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Pang:2022:FUP,
  author =       "Bo Pang and Deming Zhai and Junjun Jiang and Xianming
                 Liu",
  title =        "Fully Unsupervised Person Re-Identification via
                 Selective Contrastive Learning",
  journal =      j-TOMM,
  volume =       "18",
  number =       "2",
  pages =        "64:1--64:15",
  month =        may,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3485061",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Thu Mar 24 08:21:54 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485061",
  abstract =     "Person re-identification (ReID) aims at searching the
                 same identity person among images captured by various
                 cameras. Existing fully supervised person ReID methods
                 usually suffer from poor generalization capability
                 caused by domain gaps. Unsupervised \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Pang:2022:TPP,
  author =       "Xiaoyi Pang and Zhibo Wang and Defang Liu and John C.
                 S. Lui and Qian Wang and Ju Ren",
  title =        "Towards Personalized Privacy-Preserving Truth
                 Discovery Over Crowdsourced Data Streams",
  journal =      j-IEEE-TRANS-NETWORKING,
  volume =       "30",
  number =       "1",
  pages =        "327--340",
  month =        feb,
  year =         "2022",
  CODEN =        "IEANEP",
  DOI =          "https://doi.org/10.1109/TNET.2021.3110052",
  ISSN =         "1063-6692 (print), 1558-2566 (electronic)",
  ISSN-L =       "1063-6692",
  bibdate =      "Fri Apr 15 05:49:29 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
  URL =          "https://dl.acm.org/doi/10.1109/TNET.2021.3110052",
  abstract =     "Truth discovery is an effective paradigm which could
                 reveal the truth from crowdsouced data with conflicts,
                 enabling data-driven decision-making systems to make
                 quick and smart decisions. The increasing privacy
                 concern promotes users to perturb or encrypt \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE\slash ACM Transactions on Networking",
  journal-URL =  "https://dl.acm.org/loi/ton",
}

@Article{Panoff:2022:RCA,
  author =       "Max Panoff and Honggang Yu and Haoqi Shan and Yier
                 Jin",
  title =        "A Review and Comparison of {AI}-enhanced Side Channel
                 Analysis",
  journal =      j-JETC,
  volume =       "18",
  number =       "3",
  pages =        "62:1--62:20",
  month =        jul,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3517810",
  ISSN =         "1550-4832",
  ISSN-L =       "1550-4832",
  bibdate =      "Wed Aug 10 06:36:52 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jetc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3517810",
  abstract =     "Side Channel Analysis (SCA) presents a clear threat to
                 privacy and security in modern computing systems. The
                 vast majority of communications are secured through
                 cryptographic algorithms. These algorithms are often
                 provably-secure from a cryptographical \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "62",
  fjournal =     "ACM Journal on Emerging Technologies in Computing
                 Systems (JETC)",
  journal-URL =  "https://dl.acm.org/loi/jetc",
}

@Article{Pedone:2022:QKD,
  author =       "Ignazio Pedone and Antonio Lioy",
  title =        "Quantum Key Distribution in {Kubernetes} Clusters",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "6",
  pages =        "160",
  day =          "25",
  month =        may,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14060160",
  ISSN =         "1999-5903",
  bibdate =      "Fri Jun 24 09:41:47 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/6/160",
  abstract =     "Quantum Key Distribution (QKD) represents a reasonable
                 countermeasure to the advent of Quantum Computing and
                 its impact on current public-key cryptography. So far,
                 considerable efforts have been devoted to investigate
                 possible application scenarios for QKD in several
                 domains such as Cloud Computing and NFV. This paper
                 extends a previous work whose main objective was to
                 propose a new software stack, the Quantum Software
                 Stack (QSS), to integrate QKD into software-defined
                 infrastructures. The contribution of this paper is
                 twofold: enhancing the previous work adding
                 functionalities to the first version of the QSS, and
                 presenting a practical integration of the QSS in
                 Kubernetes, which is the de-facto standard for
                 container orchestration.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Perillo:2022:SSE,
  author =       "Angelo Massimo Perillo and Giuseppe Persiano and
                 Alberto Trombetta",
  title =        "Secure Selections on Encrypted Multi-writer Streams",
  journal =      j-TOPS,
  volume =       "25",
  number =       "1",
  pages =        "7:1--7:33",
  month =        feb,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3485470",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Fri Jan 7 07:47:52 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3485470",
  abstract =     "Performing searches over encrypted data is a very
                 current and active area. Several efficient solutions
                 have been provided for the single-writer scenario in
                 which all sensitive data originate with one party (the
                 Data Owner ) that encrypts and uploads the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Pham:2022:WIB,
  author =       "Minh Thuy Truc Pham and Ngoc Ai Van Nguyen and Mei
                 Jiang and Dung Hoang Duong and Willy Susilo",
  title =        "Wildcarded identity-based encryption from lattices",
  journal =      j-THEOR-COMP-SCI,
  volume =       "902",
  number =       "??",
  pages =        "41--53",
  day =          "18",
  month =        jan,
  year =         "2022",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.12.007",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Jan 26 14:24:05 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521007167",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Pilania:2022:FVS,
  author =       "Urmila Pilania and Rohit Tanwar and Mazdak Zamani and
                 Azizah Abdul Manaf",
  title =        "Framework for Video Steganography Using Integer
                 Wavelet Transform and {JPEG} Compression",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "9",
  pages =        "254",
  day =          "25",
  month =        aug,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14090254",
  ISSN =         "1999-5903",
  bibdate =      "Fri Sep 23 06:03:23 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/9/254",
  abstract =     "In today's world of computers everyone is
                 communicating their personal information through the
                 web. So, the security of personal information is the
                 main concern from the research point of view.
                 Steganography can be used for the security purpose of
                 personal information. Storing and forwarding of
                 embedded personal information specifically in public
                 places is gaining more attention day by day. In this
                 research work, the Integer Wavelet Transform technique
                 along with JPEG (Joint Photograph Expert Group)
                 compression is proposed to overcome some of the issues
                 associated with steganography techniques. Video cover
                 files and JPEG compression improve concealing capacity
                 because of their intrinsic properties. Integer Wavelet
                 Transform is used to improve the imperceptibility and
                 robustness of the proposed technique. The
                 Imperceptibility of the proposed work is analyzed
                 through evaluation parameters such as PSNR (Peak Signal
                 to Noise Ratio), MSE (Mean Square Error), SSIM
                 (Structure Similarity Metric), and CC (Correlation
                 Coefficient). Robustness is validated through some
                 image processing attacks. Complexity is calculated in
                 terms of concealing and retrieval time along with the
                 amount of secret information hidden.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Pirayesh:2022:PHB,
  author =       "Jamshid Pirayesh and Alberto Giaretta and Mauro Conti
                 and Parviz Keshavarzi",
  title =        "A {PLS-HECC}-based device authentication and key
                 agreement scheme for smart home networks",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "216",
  number =       "??",
  pages =        "??--??",
  day =          "24",
  month =        oct,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2022.109077",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Wed Sep 21 06:36:55 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S138912862200216X",
  acknowledgement = ack-nhfb,
  articleno =    "109077",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Przytarski:2022:QPB,
  author =       "Dennis Przytarski and Christoph Stach and
                 Cl{\'e}mentine Gritti and Bernhard Mitschang",
  title =        "Query Processing in Blockchain Systems: Current State
                 and Future Challenges",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "1",
  pages =        "1",
  day =          "21",
  month =        dec,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14010001",
  ISSN =         "1999-5903",
  bibdate =      "Wed Jan 19 05:45:15 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/1/1",
  abstract =     "When, in 2008, Satoshi Nakamoto envisioned the first
                 distributed database management system that relied on
                 cryptographically secured chain of blocks to store data
                 in an immutable and tamper-resistant manner, his
                 primary use case was the introduction of a digital
                 currency. Owing to this use case, the blockchain system
                 was geared towards efficient storage of data, whereas
                 the processing of complex queries, such as provenance
                 analyses of data history, is out of focus. The
                 increasing use of Internet of Things technologies and
                 the resulting digitization in many domains, however,
                 have led to a plethora of novel use cases for a secure
                 digital ledger. For instance, in the healthcare sector,
                 blockchain systems are used for the secure storage and
                 sharing of electronic health records, while the food
                 industry applies such systems to enable a reliable
                 food-chain traceability, e.g., to prove compliance with
                 cold chains. In these application domains, however,
                 querying the current state is not
                 sufficient-comprehensive history queries are required
                 instead. Due to these altered usage modes involving
                 more complex query types, it is questionable whether
                 today's blockchain systems are prepared for this type
                 of usage and whether such queries can be processed
                 efficiently by them. In our paper, we therefore
                 investigate novel use cases for blockchain systems and
                 elicit their requirements towards a data store in terms
                 of query capabilities. We reflect the state of the art
                 in terms of query support in blockchain systems and
                 assess whether it is capable of meeting the
                 requirements of such more sophisticated use cases. As a
                 result, we identify future research challenges with
                 regard to query processing in blockchain systems.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Qi:2022:AKE,
  author =       "Mingping Qi and Jianhua Chen",
  title =        "Authentication and key establishment protocol from
                 supersingular isogeny for mobile environments",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "5",
  pages =        "6371--6385",
  month =        apr,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-021-04121-8",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Mon Jun 6 08:11:48 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-021-04121-8",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Qi:2022:PSP,
  author =       "Mingping Qi and Jianhua Chen",
  title =        "Provably secure post-quantum authenticated key
                 exchange from supersingular isogenies",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "10",
  pages =        "12815--12833",
  month =        jul,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-022-04378-7",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri Jun 10 07:18:59 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-022-04378-7",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Qi:2022:RRV,
  author =       "Wenfa Qi and Sirui Guo and Yuxin Liu and Xiang Wang
                 and Zongming Guo",
  title =        "Research on Reversible Visible Watermarking Algorithms
                 Based on Vectorization Compression Method",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "5",
  pages =        "1320--1337",
  month =        may,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxaa184",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat May 21 14:00:52 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/5/1320/6120302",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Raheman:2022:WZV,
  author =       "Fazal Raheman and Tejas Bhagat and Brecht Vermeulen
                 and Peter {Van Daele}",
  title =        "Will Zero Vulnerability Computing {(ZVC)} Ever Be
                 Possible? {Testing} the Hypothesis",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "8",
  pages =        "238",
  day =          "30",
  month =        jul,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14080238",
  ISSN =         "1999-5903",
  bibdate =      "Fri Sep 2 12:13:30 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/8/238",
  abstract =     "Life without computers is unimaginable. However,
                 computers remain vulnerable to cybercrimes, a USD 6
                 trillion industry that the world has come to accept as
                 a ``necessary evil''. Third-party permissions resulting
                 in an attack surface (AS) and in-computer storage that
                 computers mandate are key design elements that hackers
                 exploit, formerly by remote malware installation and
                 later by stealing personal data using authentication
                 faking techniques. In legacy computers, the AS cannot
                 be completely eliminated, nor can a connected device
                 retain data offline, rendering fool-proof cybersecurity
                 impossible. Although the architects of legacy computers
                 made perfectly reasonable engineering trade-offs for
                 their world, our world is very different. Zero
                 vulnerability computing (ZVC) challenges the impossible
                 with in-computer offline storage (ICOS) and Supra OS
                 (SOS), to deliver comprehensive protection against
                 vulnerabilities. The feasibility of ZVC is demonstrated
                 in a tiny permanently computer-mounted hardware wallet,
                 providing the first evidence of the complete
                 obliteration of the AS. Malware cannot infect the ZVC
                 device on account of lacking an AS, nor can personal
                 data be hacked as they mostly remain offline, except
                 for sporadic processing. Further research should
                 explore whether ZVC can fully secure computers in more
                 complex real-world scenarios and open a new epoch in
                 the evolution of computers and the Internet.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Rahman:2022:WSD,
  author =       "Md Rayhanur Rahman and Nasif Imtiaz and Laurie
                 Williams",
  title =        "Why secret detection tools are not enough: It's not
                 just about false positives --- an industrial case
                 study",
  journal =      j-EMPIR-SOFTWARE-ENG,
  volume =       "27",
  number =       "3",
  pages =        "??--??",
  month =        may,
  year =         "2022",
  CODEN =        "ESENFW",
  DOI =          "https://doi.org/10.1007/s10664-021-10109-y",
  ISSN =         "1382-3256 (print), 1573-7616 (electronic)",
  ISSN-L =       "1382-3256",
  bibdate =      "Tue Jun 7 16:08:33 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/empir-software-eng.bib",
  URL =          "https://link.springer.com/article/10.1007/s10664-021-10109-y",
  acknowledgement = ack-nhfb,
  ajournal =     "Empir. Software. Eng.",
  fjournal =     "Empirical Software Engineering",
  journal-URL =  "http://link.springer.com/journal/10664",
}

@Article{Rahmani:2022:NAS,
  author =       "Peyman Rahmani and Seyed Mostafa Fakhrahmad and
                 Mohammad Taheri",
  title =        "New attacks on secret sharing-based data outsourcing:
                 toward a resistant scheme",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "14",
  pages =        "15749--15785",
  month =        sep,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-022-04467-7",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri Sep 9 10:02:23 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-022-04467-7",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Rajalakshmi:2022:EVP,
  author =       "M. Rajalakshmi and K. Annapurani",
  title =        "Enhancement of Vascular Patterns in Palm Images Using
                 Various Image Enhancement Techniques for Person
                 Identification",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "22",
  number =       "04",
  pages =        "??--??",
  month =        jul,
  year =         "2022",
  DOI =          "https://doi.org/10.1142/S0219467822500322",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Thu Aug 11 08:52:44 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0219467822500322",
  abstract =     "Image classification is a complicated process of
                 classifying an image based on its visual
                 representation. This paper portrays the need for
                 adapting and applying a suitable image enhancement and
                 denoising technique in order to arrive at a successful
                 classification of data captured remotely. Biometric
                 properties that are widely explored today are very
                 important for authentication purposes. Noise may be the
                 result of incorrect vein detection in the accepted
                 image, thus explaining the need for a better
                 development technique. This work provides subjective
                 and objective analysis of the performance of various
                 image enhancement filters in the spatial domain. After
                 performing these pre-processing steps, the vein map and
                 the corresponding vein graph can be easily obtained
                 with minimal extraction steps, in which the appropriate
                 Graph Matching method can be used to evaluate hand vein
                 graphs thus performing the person authentication. The
                 analysis result shows that the image enhancement filter
                 performs better as an image enhancement filter compared
                 to all other filters. Image quality measures (IQMs) are
                 also tabulated for the evaluation of image quality.",
  acknowledgement = ack-nhfb,
  articleno =    "2250032",
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Raju:2022:SEM,
  author =       "Konduru Upendra Raju and Amutha Prabha Nagarajan",
  title =        "A Steganography Embedding Method Based on {CDF-DWT}
                 Technique for Reversible Data Hiding Application Using
                 {Elgamal} Algorithm",
  journal =      j-INT-J-FOUND-COMP-SCI,
  volume =       "33",
  number =       "6--7",
  pages =        "489--512",
  month =        sep # "--" # nov,
  year =         "2022",
  DOI =          "https://doi.org/10.1142/S0129054122420011",
  ISSN =         "0129-0541",
  ISSN-L =       "0129-0541",
  bibdate =      "Wed Oct 19 07:46:36 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
                 http://www.worldscientific.com/loi/ijfcs",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0129054122420011",
  abstract =     "Steganography is a data hiding method mainly used in
                 the security purposes. While hiding more data in the
                 embedding process the data may be lost and also cause
                 some security problems. To avoid this problem a
                 Steganography Embedding method is used. In this
                 manuscript, Steganography Embedding method based on
                 Cohen--Daubechies--Feauveau Discrete Wavelet Transform
                 (CDF-DWT) technique to data hiding application using
                 Elgamal algorithm is proposed. In this the cover image
                 is taken for hiding the secret data. Then the cover
                 image edges are detected and filtered with Speeded-Up
                 Robust Features (SURF) method. Then the input secret
                 data is encrypted with Elgamal algorithm. Then the
                 secret data is hided under cover image for obtaining
                 the stego image by process of Embedding using CDF DWT
                 technique. In this data in the stego images are
                 unreadable. To get readable secured data is extracted
                 from the stego image and the data's are decrypted to
                 get secured secret data. The objective of this method
                 is to safe guard the secret using Steganography method
                 and to increase embedding efficiency, Embedding
                 capacity and carrier capacity and to reduce the
                 execution time. The MATLAB simulation results of the
                 proposed CDF DWT technique with Elgamal algorithm
                 portrays better outcomes such as Peak to Signal Noise
                 Ratio (PSNR), Mean Square Error (MSE) (lower), Bit
                 Error Rate (BER) was Lower, Execution time provides is
                 lower, Carrier Capacity and Embedding Capacity are much
                 higher and the values are compared with the existing
                 method such as Elliptic Galois in cryptography and in
                 the Steganography method with Adaptive Firefly
                 Algorithm (EGC-AFA), Reversible Data hiding within
                 Encrypted images Via Adaptive Embedding Strategy with
                 block selection (RDHEI-AES), Double Linear Regression
                 Prediction based Reversible Data Hiding in Encrypted
                 Image (DLRP-RDHEI) respectively.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Foundations of Computer
                 Science (IJFCS)",
  journal-URL =  "http://www.worldscientific.com/loi/ijfcs",
  remark =       "Special Issue: Mathematical Aspects of Evolutionary
                 Computation and its Applications Guest Editors: Jia-Bao
                 Liu, Muhammad Javaid and Mohammad Reza Farahani",
}

@Article{Ramkumar:2022:IBC,
  author =       "D. Ramkumar and C. Annadurai and I. Nelson",
  title =        "Iris-based continuous authentication in mobile ad hoc
                 network",
  journal =      j-CCPE,
  volume =       "34",
  number =       "8",
  pages =        "e5542:1--e5542:??",
  day =          "10",
  month =        apr,
  year =         "2022",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.5542",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Wed Apr 13 09:55:01 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ccpe2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Concurr. Comput.",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
  onlinedate =   "28 October 2019",
}

@Article{Rana:2022:LCI,
  author =       "Muhammad Rana and Quazi Mamun and Rafiqul Islam",
  title =        "Lightweight cryptography in {IoT} networks: a survey",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "129",
  number =       "??",
  pages =        "77--89",
  month =        apr,
  year =         "2022",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2021.11.011",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Wed Feb 9 09:07:29 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X21004404",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Rangwani:2022:FFM,
  author =       "Diksha Rangwani and Hari Om",
  title =        "Four-factor mutual authentication scheme for
                 health-care based on wireless body area network",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "4",
  pages =        "5744--5778",
  month =        mar,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-021-04099-3",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Mon Jun 6 08:11:48 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-021-04099-3",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Rawal:2022:MTS,
  author =       "Bharat S. Rawal and Poongodi M. and Gunasekaran
                 Manogaran and Mounir Hamdi",
  title =        "Multi-Tier Stack of Block Chain with Proxy
                 Re-Encryption Method Scheme on the {Internet of Things}
                 Platform",
  journal =      j-TOIT,
  volume =       "22",
  number =       "2",
  pages =        "41:1--41:20",
  month =        may,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3421508",
  ISSN =         "1533-5399 (print), 1557-6051 (electronic)",
  ISSN-L =       "1533-5399",
  bibdate =      "Wed May 25 08:02:16 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/toit.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3421508",
  abstract =     "Block chain provides an innovative solution to
                 information storage, transaction execution, security,
                 and trust building in an open environment. The block
                 chain is technological progress for cyber security and
                 cryptography, with efficiency-related cases \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Transactions on Internet Technology (TOIT)",
  journal-URL =  "https://dl.acm.org/loi/toit",
}

@Article{Roy:2022:FFH,
  author =       "Prasanta Kumar Roy and Prashant Sahu and Ansuman
                 Bhattacharya",
  title =        "{FastHand}: a fast handover authentication protocol
                 for densely deployed small-cell networks",
  journal =      j-J-NETW-COMPUT-APPL,
  volume =       "205",
  number =       "??",
  pages =        "??--??",
  month =        sep,
  year =         "2022",
  CODEN =        "JNCAF3",
  DOI =          "https://doi.org/10.1016/j.jnca.2022.103435",
  ISSN =         "1084-8045 (print), 1095-8592 (electronic)",
  ISSN-L =       "1084-8045",
  bibdate =      "Wed Jul 20 16:30:20 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1084804522000893",
  acknowledgement = ack-nhfb,
  articleno =    "103435",
  fjournal =     "Journal of Network and Computer Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/10848045",
}

@Article{Roy:2022:LBP,
  author =       "Partha Sarathi Roy and Dung Hoang Duong and Willy
                 Susilo and Arnaud Sipasseuth and Kazuhide Fukushima and
                 Shinsaku Kiyomoto",
  title =        "Lattice-based public-key encryption with equality test
                 supporting flexible authorization in standard model",
  journal =      j-THEOR-COMP-SCI,
  volume =       "929",
  number =       "??",
  pages =        "124--139",
  day =          "11",
  month =        sep,
  year =         "2022",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2022.06.034",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Sep 21 10:24:08 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397522004091",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Salvakkam:2022:MLM,
  author =       "Dilli Babu Salvakkam and Rajendra Pamula",
  title =        "{MESSB-LWE}: multi-extractable somewhere statistically
                 binding and learning with error-based integrity and
                 authentication for cloud storage",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "14",
  pages =        "16364--16393",
  month =        sep,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-022-04497-1",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri Sep 9 10:02:23 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-022-04497-1",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Sayeed:2022:ACI,
  author =       "Aqsa Sayeed and Chaman Verma and Neerendra Kumar and
                 Neha Koul and Zolt{\'a}n Ill{\'e}s",
  title =        "Approaches and Challenges in {Internet of Robotic
                 Things}",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "9",
  pages =        "265",
  day =          "14",
  month =        sep,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14090265",
  ISSN =         "1999-5903",
  bibdate =      "Fri Sep 23 06:03:23 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/9/265",
  abstract =     "The Internet of robotic things (IoRT) is the
                 combination of different technologies including cloud
                 computing, robots, Internet of things (IoT), artificial
                 intelligence (AI), and machine learning (ML). IoRT
                 plays a major role in manufacturing, healthcare,
                 security, and transport. IoRT can speed up human
                 development by a very significant percentage. IoRT
                 allows robots to transmit and receive data to and from
                 other devices and users. In this paper, IoRT is
                 reviewed in terms of the related techniques,
                 architectures, and abilities. Consequently, the related
                 research challenges are presented. IoRT architectures
                 are vital in the design of robotic systems and robotic
                 things. The existing 3--7-tier IoRT architectures are
                 studied. Subsequently, a detailed IoRT architecture is
                 proposed. Robotic technologies provide the means to
                 increase the performance and capabilities of the user,
                 product, or process. However, robotic technologies are
                 vulnerable to attacks on data security. Trust-based and
                 encryption-based mechanisms can be used for secure
                 communication among robotic things. A security method
                 is recommended to provide a secure and trustworthy
                 data-sharing mechanism in IoRT. Significant security
                 challenges are also discussed. Several known attacks on
                 ad hoc networks are illustrated. Threat models ensure
                 integrity confidentiality and availability of the data.
                 In a network, trust models are used to boost a system's
                 security. Trust models and IoRT networks play a key
                 role in obtaining a steady and nonvulnerable
                 configuration in the network. In IoRT, remote server
                 access results in remote software updates of robotic
                 things. To study navigation strategies, navigation
                 using fuzzy logic, probabilistic roadmap algorithms,
                 laser scan matching algorithms, heuristic functions,
                 bumper events, and vision-based navigation techniques
                 are considered. Using the given research challenges,
                 future researchers can get contemporary ideas of IoRT
                 implementation in the real world.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Scala:2022:SBC,
  author =       "Roberto {La Scala} and Sharwan K. Tiwari",
  title =        "Stream\slash block ciphers, difference equations and
                 algebraic attacks",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "109",
  number =       "??",
  pages =        "177--198",
  month =        mar # "\slash " # apr,
  year =         "2022",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Thu Feb 17 08:45:06 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0747717121000584",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171",
}

@Article{Sellami:2022:DRL,
  author =       "Bassem Sellami and Akram Hakiri and Sadok {Ben
                 Yahia}",
  title =        "{Deep Reinforcement Learning} for energy-aware task
                 offloading in join {SDN-Blockchain 5G} massive {IoT}
                 edge network",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "137",
  number =       "??",
  pages =        "363--379",
  month =        dec,
  year =         "2022",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2022.07.024",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Tue Sep 20 07:47:12 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X22002588",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Shen:2022:IBA,
  author =       "Shiyu Shen and Hongbing Wang and Yunlei Zhao",
  title =        "Identity-based authenticated encryption with identity
                 confidentiality",
  journal =      j-THEOR-COMP-SCI,
  volume =       "901",
  number =       "??",
  pages =        "1--18",
  day =          "12",
  month =        jan,
  year =         "2022",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2021.11.014",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Jan 26 14:24:00 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397521006897",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Shinagawa:2022:QAS,
  author =       "Kazuo Shinagawa and Tetsu Iwata",
  title =        "Quantum attacks on Sum of Even-{Mansour} pseudorandom
                 functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "173",
  number =       "??",
  pages =        "Article 106172",
  month =        jan,
  year =         "2022",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/j.ipl.2021.106172",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Feb 9 07:25:26 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/infoproc2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0020019021000879",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Shukla:2022:NEB,
  author =       "Shivangi Shukla and Sankita J. Patel",
  title =        "A novel {ECC}-based provably secure and
                 privacy-preserving multi-factor authentication protocol
                 for cloud computing",
  journal =      j-COMPUTING,
  volume =       "104",
  number =       "5",
  pages =        "1173--1202",
  month =        may,
  year =         "2022",
  CODEN =        "CMPTA2",
  DOI =          "https://doi.org/10.1007/s00607-021-01041-6",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Mon May 9 09:55:44 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computing.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s00607-021-01041-6",
  acknowledgement = ack-nhfb,
  ajournal =     "Computing",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
}

@Article{Singh:2022:TII,
  author =       "Kedar Nath Singh and Amit Kumar Singh",
  title =        "Towards Integrating Image Encryption with Compression:
                 a Survey",
  journal =      j-TOMM,
  volume =       "18",
  number =       "3",
  pages =        "89:1--89:21",
  month =        aug,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3498342",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Thu Mar 24 08:21:55 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/tomccap.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3498342",
  abstract =     "As digital images are consistently generated and
                 transmitted online, the unauthorized utilization of
                 these images is an increasing concern that has a
                 significant impact on both security and privacy issues;
                 additionally, the representation of digital \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "89",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Streit:2022:DET,
  author =       "Franz-Josef Streit and Paul Kr{\"u}ger and Andreas
                 Becher and Stefan Wildermann and J{\"u}rgen Teich",
  title =        "Design and Evaluation of a Tunable {PUF} Architecture
                 for {FPGAs}",
  journal =      j-TRETS,
  volume =       "15",
  number =       "1",
  pages =        "7:1--7:27",
  month =        mar,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3491237",
  ISSN =         "1936-7406 (print), 1936-7414 (electronic)",
  ISSN-L =       "1936-7406",
  bibdate =      "Fri Jan 28 07:03:50 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/trets.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3491237",
  abstract =     "FPGA-based Physical Unclonable Functions (PUF) have
                 emerged as a viable alternative to permanent key
                 storage by turning effects of inaccuracies during the
                 manufacturing process of a chip into a unique,
                 FPGA-intrinsic secret. However, many fixed PUF
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Transactions on Reconfigurable Technology and
                 Systems (TRETS)",
  journal-URL =  "https://dl.acm.org/loi/trets",
}

@Article{Su:2022:BRB,
  author =       "Jian Su and Leyou Zhang and Yi Mu",
  title =        "\pkg{BA-RMKABSE}: Blockchain-aided Ranked
                 Multi-keyword Attribute-based Searchable Encryption
                 with Hiding Policy for Smart Health System",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "132",
  number =       "??",
  pages =        "299--309",
  month =        jul,
  year =         "2022",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2022.01.021",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Tue Mar 29 14:04:51 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X22000292",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Sun:2022:CRV,
  author =       "Sheng Sun",
  title =        "A Chosen Random Value Attack on {WPA3 SAE}
                 Authentication Protocol",
  journal =      j-DTRAP,
  volume =       "3",
  number =       "2",
  pages =        "16:1--16:8",
  month =        jun,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3468526",
  ISSN =         "2692-1626 (print), 2576-5337 (electronic)",
  ISSN-L =       "2576-5337",
  bibdate =      "Sat Jul 30 07:34:14 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/dtrap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3468526",
  abstract =     "Simultaneous Authentication of Equals (SAE) is a
                 password-authenticated key exchange protocol that is
                 designed to replace the WPA2-PSK-based authentication.
                 The SAE authenticated key exchange protocol supports
                 the peer-to-peer authentication and is one of he major
                 authentication mechanisms of the Authentication and Key
                 Management Suite specified within Wi-Fi. The SAE
                 authenticated key exchange protocol has been widely
                 implemented in today's Wi-Fi devices as part of major
                 security feature upgrades and is regarded as the third
                 generation of Wi-Fi Protected Access. This article
                 presents a way of attacking the weaker randomness
                 generation algorithm within the SAE protocols, which
                 can lead to successful impersonation types of attacks.
                 We also suggest some protocol amendments for
                 protection. It is recommended that SAE implementations
                 should be upgraded to ensure protection against these
                 attacks.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "Digital Threats: Research and Practice (DTRAP)",
  journal-URL =  "https://dl.acm.org/loi/dtrap",
}

@Article{Tanveer:2022:EIP,
  author =       "Muhammad Tanveer and Tariq Shah and Asif Ali and
                 Dawood Shah",
  title =        "An Efficient Image Privacy-Preserving Scheme Based On
                 Mixed Chaotic Map and Compression",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "22",
  number =       "02",
  pages =        "??--??",
  month =        apr,
  year =         "2022",
  DOI =          "https://doi.org/10.1142/S0219467822500206",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Fri May 6 07:27:02 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0219467822500206",
  abstract =     "In the digital modern era, multimedia security has
                 turned into a major concern by the rapid growth of
                 network technologies and digital communications.
                 Accordingly, from the last few decades, the application
                 of nonlinear dynamics and chaotic phenomena for
                 multimedia data security earn significant attention. In
                 this paper, an efficient image-encryption technique
                 based on a two-dimensional (2D) chaotic system combine
                 with the finite field of the specific order is
                 introduced. The proposed scheme consists of four
                 modules which are the separation of bits, compression,
                 2D chaotic map, and small S-boxes. Initially, the
                 suggested scheme separates the pixels of the image into
                 the least significant bits (LSB) and the most
                 significant bits (MSB). Subsequently, the compression
                 algorithm on these separated bits is applied and
                 instantly transformed the MSB of the image into LSB.
                 The key objective of the first module is to minimize
                 the range of the pixel value up to eight times less
                 than the original image, which consequently reduces the
                 time complexity of the scheme. In the end, a 2D chaotic
                 map is used to reshuffle the bytes to interrupt the
                 internal correlation amongst the pixels of the image.
                 At the tail end, the small S-boxes have been used to
                 substitute the permuted image. The significance of
                 small S-boxes plays a vital role to maintain the
                 optimum security level, prevent computational effort,
                 and reduced time complexity. The result of the
                 suggested encryption system is tailor-made for
                 instantaneous communication.",
  acknowledgement = ack-nhfb,
  articleno =    "2250020",
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Tropea:2022:SWS,
  author =       "Mauro Tropea and Mattia Giovanni Spina and Floriano
                 {De Rango} and Antonio Francesco Gentile",
  title =        "Security in Wireless Sensor Networks: a Cryptography
                 Performance Analysis at {MAC} Layer",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "5",
  pages =        "145",
  day =          "10",
  month =        may,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14050145",
  ISSN =         "1999-5903",
  bibdate =      "Fri May 27 12:03:38 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/5/145",
  abstract =     "Wireless Sensor Networks (WSNs) are networks of small
                 devices with limited resources which are able to
                 collect different information for a variety of
                 purposes. Energy and security play a key role in these
                 networks and MAC aspects are fundamental in their
                 management. The classical security approaches are not
                 suitable in WSNs given the limited resources of the
                 nodes, which subsequently require lightweight
                 cryptography mechanisms in order to achieve high
                 security levels. In this paper, a security analysis is
                 provided comparing BMAC and LMAC protocols, in order to
                 determine, using AES, RSA, and elliptic curve
                 techniques, the protocol with the best trade-off in
                 terms of received packets and energy consumption.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Vandana:2022:ARB,
  author =       "Vandana and Navdeep Kaur",
  title =        "Analytical Review of Biometric Technology Employing
                 Vivid Modalities",
  journal =      j-INT-J-IMAGE-GRAPHICS,
  volume =       "22",
  number =       "01",
  pages =        "??--??",
  month =        jan,
  year =         "2022",
  DOI =          "https://doi.org/10.1142/S0219467822500048",
  ISSN =         "0219-4678",
  ISSN-L =       "0219-4678",
  bibdate =      "Wed Feb 9 07:11:50 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ijig.bib",
  URL =          "https://www.worldscientific.com/doi/10.1142/S0219467822500048",
  abstract =     "The digitalization has been challenged with the
                 security and privacy aspects in each and every field.
                 In addition to numerous authentication methods,
                 biometrics has been popularized as it relies on one's
                 individual behavioral and physical characters. In this
                 context, numerous unimodal and multimodal biometrics
                 have been proposed and tested in the last decade. In
                 this paper, authors have presented a comprehensive
                 survey of the existing biometric systems while
                 highlighting their respective challenges, advantage and
                 limitations. The paper also discusses the present
                 biometric technology market value, its scope, and
                 practical applications in vivid sectors. The goal of
                 this review is to offer a compact outline of various
                 advances in biometrics technology with potential
                 applications using unimodal and multimodal
                 bioinformatics are discussed that would prove to offer
                 a base for any biometric-based future research.",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Image and Graphics (IJIG)",
  journal-URL =  "http://www.worldscientific.com/worldscinet/ijig",
}

@Article{Vandervelden:2022:SKV,
  author =       "Thibaut Vandervelden and Ruben {De Smet} and Kris
                 Steenhaut and An Braeken",
  title =        "{SHA~3} and {Keccak} variants computation speeds on
                 constrained devices",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "128",
  number =       "??",
  pages =        "28--35",
  month =        mar,
  year =         "2022",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2021.09.042",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Wed Feb 9 09:07:27 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X21003885",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Vgena:2022:DRS,
  author =       "Katerina Vgena and Angeliki Kitsiou and Christos
                 Kalloniatis and Stefanos Gritzalis",
  title =        "Determining the Role of Social Identity Attributes to
                 the Protection of Users' Privacy in Social Media",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "9",
  pages =        "249",
  day =          "24",
  month =        aug,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14090249",
  ISSN =         "1999-5903",
  bibdate =      "Fri Sep 23 06:03:23 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/9/249",
  abstract =     "Drawing on digital identity theories, social software
                 engineering theory (SSE), and the Privacy Safeguard
                 (PriS) methodology, we examined the way that personal
                 information uploaded on social media (SM) imposes
                 privacy issues. Throughout a review on users'
                 self-representation on SM, we examined the impact of
                 self-determination and self-disclosure on users'
                 privacy, and we identified the social attributes (SA)
                 that cause privacy implications. This paper specifies
                 18 SA that users employ to achieve their optimal level
                 of representation while summarizing possible ways that
                 these attributes provoke users' identification. In
                 particular, our research has shown that SM users
                 represent their personas by unveiling SA to construct
                 popular, representative, and conversational profiles.
                 As disclosing SA increases privacy implications, we
                 intend to help users build profiles that respect their
                 privacy. Examining users' SA deepens our understanding
                 of disclosing personal information on SM while leading
                 to a better quantification of identity attributes;
                 furthermore, users' top five most revealing attributes
                 were summarized. Considering that SSE addresses users'
                 privacy implications from an early stage of systems
                 designing, our research, identifying the SA, will be
                 helpful in addressing privacy from a socio-technical
                 aspect, aiming at bridging the socio-technical gap by
                 drawing designers' attention to users' social
                 aspects.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Vryzas:2022:PWA,
  author =       "Nikolaos Vryzas and Anastasia Katsaounidou and Lazaros
                 Vrysis and Rigas Kotsakis and Charalampos Dimoulas",
  title =        "A Prototype {Web} Application to Support
                 Human-Centered Audiovisual Content Authentication and
                 Crowdsourcing",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "3",
  pages =        "75",
  day =          "27",
  month =        feb,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14030075",
  ISSN =         "1999-5903",
  bibdate =      "Fri Mar 4 08:59:15 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/3/75",
  abstract =     "Media authentication relies on the detection of
                 inconsistencies that may indicate malicious editing in
                 audio and video files. Traditionally, authentication
                 processes are performed by forensics professionals
                 using dedicated tools. There is rich research on the
                 automation of this procedure, but the results do not
                 yet guarantee the feasibility of providing automated
                 tools. In the current approach, a computer-supported
                 toolbox is presented, providing online functionality
                 for assisting technically inexperienced users
                 (journalists or the public) to investigate visually the
                 consistency of audio streams. Several algorithms based
                 on previous research have been incorporated on the
                 backend of the proposed system, including a novel CNN
                 model that performs a Signal-to-Reverberation-Ratio
                 (SRR) estimation with a mean square error of 2.9\%. The
                 user can access the web application online through a
                 web browser. After providing an audio/video file or a
                 YouTube link, the application returns as output a set
                 of interactive visualizations that can allow the user
                 to investigate the authenticity of the file. The
                 visualizations are generated based on the outcomes of
                 Digital Signal Processing and Machine Learning models.
                 The files are stored in a database, along with their
                 analysis results and annotation. Following a
                 crowdsourcing methodology, users are allowed to
                 contribute by annotating files from the dataset
                 concerning their authenticity. The evaluation version
                 of the web application is publicly available online.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Vucinic:2022:LAK,
  author =       "Mali{\v{s}}a Vu{\v{c}}ini{\'c} and G{\"o}ran Selander
                 and John Preuss Mattsson and Thomas Watteyne",
  title =        "Lightweight Authenticated Key Exchange With {EDHOC}",
  journal =      j-COMPUTER,
  volume =       "55",
  number =       "4",
  pages =        "94--100",
  month =        apr,
  year =         "2022",
  CODEN =        "CPTRB4",
  DOI =          "https://doi.org/10.1109/MC.2022.3144764",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Thu Apr 14 16:26:07 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/computer2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
  keywords =     "Ephemeral Diffie--Hellman Over COSE (EDHOC) protocol",
}

@Article{Wang:2022:CAE,
  author =       "Zhihui Wang and Liheng Gong and Jingjing Yang and Xiao
                 Zhang",
  title =        "Cloud-assisted elliptic curve password authenticated
                 key exchange protocol for wearable healthcare
                 monitoring system",
  journal =      j-CCPE,
  volume =       "34",
  number =       "9",
  pages =        "e5734:1--e5734:??",
  day =          "25",
  month =        apr,
  year =         "2022",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.5734",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Wed Apr 13 09:55:02 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ccpe2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Concurr. Comput.",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
  onlinedate =   "12 May 2020",
}

@Article{Wang:2022:ESV,
  author =       "Zuan Wang and Xiaofeng Ding and Hai Jin and Pan Zhou",
  title =        "Efficient secure and verifiable location-based skyline
                 queries over encrypted data",
  journal =      j-PROC-VLDB-ENDOWMENT,
  volume =       "15",
  number =       "9",
  pages =        "1822--1834",
  month =        may,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.14778/3538598.3538605",
  ISSN =         "2150-8097",
  bibdate =      "Thu Jul 28 06:16:23 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
  URL =          "https://dl.acm.org/doi/10.14778/3538598.3538605",
  abstract =     "Supporting secure location-based services on encrypted
                 data that is outsourced to cloud computing platforms
                 remains an ongoing challenge for efficiency due to
                 expensive ciphertext calculation overhead. Furthermore,
                 since the clouds may not be \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "Proceedings of the VLDB Endowment",
  journal-URL =  "https://dl.acm.org/loi/pvldb",
}

@Article{Wang:2022:LBP,
  author =       "Peng Wang and Biwen Chen and Tao Xiang and Zhongming
                 Wang",
  title =        "Lattice-based public key searchable encryption with
                 fine-grained access control for edge computing",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "127",
  number =       "??",
  pages =        "373--383",
  month =        feb,
  year =         "2022",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2021.09.012",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Wed Feb 9 09:07:25 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X21003587",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Wang:2022:LCG,
  author =       "Zhihao Wang and Ru Huo and Shuo Wang",
  title =        "A Lightweight Certificateless Group Key Agreement
                 Method without Pairing Based on Blockchain for Smart
                 Grid",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "4",
  pages =        "119--??",
  day =          "14",
  month =        apr,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14040119",
  ISSN =         "1999-5903",
  bibdate =      "Fri Apr 22 09:50:26 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/4/119",
  abstract =     "In smart grids, the access verification of a large
                 number of intelligent gateways and terminal devices has
                 become one of the main concerns to ensure system
                 security. This means that smart grids need a new key
                 management method that is safe and efficient and has a
                 low computational cost. Although a large number of
                 scholars have conducted relevant research, most of
                 these schemes cannot balance the computational overhead
                 and security. Therefore, we propose a lightweight and
                 secure key management method, having a low
                 computational overhead, based on blockchain for smart
                 grids. Firstly, we redesigned the architecture of the
                 smart grid based on blockchain and completed the
                 division of various entities. Furthermore, we designed
                 a pairing-free certification authenticated group key
                 agreement method based on blockchain under the
                 architecture. Finally, we achieved higher security
                 attributes, and lower authentication delay and
                 computational overhead, compared to the traditional
                 schemes, as shown in performance analysis and
                 comparison.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{West:2022:CIC,
  author =       "Sarah Myers West",
  title =        "Cryptography as information control",
  journal =      j-SOC-STUD-SCI,
  volume =       "52",
  number =       "3",
  pages =        "353--375",
  day =          "1",
  month =        jun,
  year =         "2022",
  CODEN =        "SSSCDH",
  DOI =          "https://doi.org/10.1177/03063127221078314",
  ISSN =         "0306-3127 (print), 1460-3659 (electronic)",
  ISSN-L =       "0306-3127",
  bibdate =      "Sat Jun 4 16:13:05 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/socstudsci.bib",
  URL =          "https://journals.sagepub.com/doi/full/10.1177/03063127221078314",
  acknowledgement = ack-nhfb,
  fjournal =     "Social Studies of Science",
  journal-URL =  "http://sss.sagepub.com/content/by/year",
}

@Article{Wu:2022:ALC,
  author =       "Da-Chun Wu and Yu-Tsung Hsu",
  title =        "Authentication of {LINE} Chat History Files by
                 Information Hiding",
  journal =      j-TOMM,
  volume =       "18",
  number =       "1",
  pages =        "22:1--22:23",
  month =        jan,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3474225",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Thu Mar 24 08:22:44 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3474225",
  abstract =     "With the prevalence of smartphones, message exchanges
                 via mobile chatting programs like LINE have become
                 popular. The messages in the form of chat records in a
                 LINE chat history, after being downloaded for legal
                 uses, might be tampered with illicitly. A \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Wu:2022:PSL,
  author =       "Tsu-Yang Wu and Qian Meng and Saru Kumari",
  title =        "A provably secure lightweight authentication protocol
                 in mobile edge computing environments",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "12",
  pages =        "13893--13914",
  month =        aug,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-022-04411-9",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Tue Jul 19 08:40:45 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-022-04411-9",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Xia:2022:FCS,
  author =       "Zhihua Xia and Qiuju Ji and Qi Gu and Chengsheng Yuan
                 and Fengjun Xiao",
  title =        "A Format-compatible Searchable Encryption Scheme for
                 {JPEG} Images Using Bag-of-words",
  journal =      j-TOMM,
  volume =       "18",
  number =       "3",
  pages =        "85:1--85:18",
  month =        aug,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3492705",
  ISSN =         "1551-6857 (print), 1551-6865 (electronic)",
  ISSN-L =       "1551-6857",
  bibdate =      "Thu Mar 24 08:21:55 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3492705",
  abstract =     "The development of cloud computing attracts
                 enterprises and individuals to outsource their data,
                 such as images, to the cloud server. However, direct
                 outsourcing causes the extensive concern of privacy
                 leakage, as images often contain rich sensitive
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "85",
  fjournal =     "ACM Transactions on Multimedia Computing,
                 Communications, and Applications",
  journal-URL =  "https://dl.acm.org/loi/tomm",
}

@Article{Xiong:2022:BBP,
  author =       "Ting Xiong and Ran Zhang and Jiang Liu and Tao Huang
                 and Yunjie Liu and F. Richard Yu",
  title =        "A blockchain-based and privacy-preserved
                 authentication scheme for inter-constellation
                 collaboration in {Space-Ground Integrated Networks}",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "206",
  number =       "??",
  pages =        "??--??",
  day =          "7",
  month =        apr,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2022.108793",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Mon Mar 7 06:52:32 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S138912862200024X",
  acknowledgement = ack-nhfb,
  articleno =    "108793",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Xiong:2022:RIB,
  author =       "Hu Xiong and Kim-Kwang Raymond Choo and Athanasios V.
                 Vasilakos",
  title =        "Revocable Identity-Based Access Control for Big Data
                 with Verifiable Outsourced Computing",
  journal =      j-IEEE-TRANS-BIG-DATA,
  volume =       "8",
  number =       "1",
  pages =        "1--13",
  month =        feb,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1109/TBDATA.2017.2697448",
  ISSN =         "2332-7790",
  ISSN-L =       "2332-7790",
  bibdate =      "Thu Apr 7 15:41:53 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransbigdata.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Big Data",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6687317",
}

@Article{Xu:2022:DLF,
  author =       "Liangliang Xu and Min Lyu and Zhipeng Li and Cheng Li
                 and Yinlong Xu",
  title =        "A Data Layout and Fast Failure Recovery Scheme for
                 Distributed Storage Systems With Mixed Erasure Codes",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "8",
  pages =        "1740--1754",
  month =        aug,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2021.3105882",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sat Jul 16 11:55:32 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Xu:2022:MSC,
  author =       "Zhuang Xu and Owen Pemberton and Sujoy Sinha Roy and
                 David Oswald and Wang Yao and Zhiming Zheng",
  title =        "Magnifying Side-Channel Leakage of Lattice-Based
                 Cryptosystems With Chosen Ciphertexts: the Case Study
                 of {Kyber}",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "9",
  pages =        "2163--2176",
  month =        sep,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2021.3122997",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Aug 11 09:05:14 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Yakubu:2022:BBA,
  author =       "Abukari Mohammed Yakubu and Yi Ping Phoebe Chen",
  title =        "A blockchain-based application for genomic access and
                 variant discovery using smart contracts and homomorphic
                 encryption",
  journal =      j-FUT-GEN-COMP-SYS,
  volume =       "137",
  number =       "??",
  pages =        "234--247",
  month =        dec,
  year =         "2022",
  CODEN =        "FGSEVI",
  DOI =          "https://doi.org/10.1016/j.future.2022.07.012",
  ISSN =         "0167-739X (print), 1872-7115 (electronic)",
  ISSN-L =       "0167-739X",
  bibdate =      "Tue Sep 20 07:47:12 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167739X22002400",
  acknowledgement = ack-nhfb,
  fjournal =     "Future Generation Computer Systems",
  journal-URL =  "http://www.sciencedirect.com/science/journal/0167739X",
}

@Article{Yan:2022:CDC,
  author =       "Hui Yan and Chaoyuan Cui",
  title =        "{CacheHawkeye}: Detecting Cache Side Channel Attacks
                 Based on Memory Events",
  journal =      j-FUTURE-INTERNET,
  volume =       "14",
  number =       "1",
  pages =        "24",
  day =          "08",
  month =        jan,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.3390/fi14010024",
  ISSN =         "1999-5903",
  bibdate =      "Wed Jan 19 05:45:15 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
  URL =          "https://www.mdpi.com/1999-5903/14/1/24",
  abstract =     "Cache side channel attacks, as a type of
                 cryptanalysis, seriously threaten the security of the
                 cryptosystem. These attacks continuously monitor the
                 memory addresses associated with the victim's secret
                 information, which cause frequent memory access on
                 these addresses. This paper proposes CacheHawkeye,
                 which uses the frequent memory access characteristic of
                 the attacker to detect attacks. CacheHawkeye monitors
                 memory events by CPU hardware performance counters. We
                 proved the effectiveness of CacheHawkeye on
                 Flush+Reload and Flush+Flush attacks. In addition, we
                 evaluated the accuracy of CacheHawkeye under different
                 system loads. Experiments demonstrate that CacheHawkeye
                 not only has good accuracy but can also adapt to
                 various system loads.",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://www.mdpi.com/journal/futureinternet",
}

@Article{Yang:2022:NVM,
  author =       "Jing Yang and Fang-Wei Fu",
  title =        "New $ (k, l, m)$-verifiable multi-secret sharing
                 schemes based on {XTR} public key system",
  journal =      j-THEOR-COMP-SCI,
  volume =       "910",
  number =       "??",
  pages =        "54--67",
  day =          "2",
  month =        apr,
  year =         "2022",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2022.01.036",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Fri Mar 4 15:08:49 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397522000500",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Yang:2022:UPL,
  author =       "Shaojun Yang and Xinyi Huang",
  title =        "Universal product learning with errors: a new variant
                 of {LWE} for lattice-based cryptography",
  journal =      j-THEOR-COMP-SCI,
  volume =       "915",
  number =       "??",
  pages =        "90--100",
  day =          "14",
  month =        may,
  year =         "2022",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2022.02.032",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Apr 20 07:02:29 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397522001268",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@Article{Yao:2022:IET,
  author =       "Haipeng Yao and Chong Liu and Peiying Zhang and Sheng
                 Wu and Chunxiao Jiang and Shui Yu",
  title =        "Identification of Encrypted Traffic Through Attention
                 Mechanism Based Long Short Term Memory",
  journal =      j-IEEE-TRANS-BIG-DATA,
  volume =       "8",
  number =       "1",
  pages =        "241--252",
  month =        feb,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1109/TBDATA.2019.2940675",
  ISSN =         "2332-7790",
  ISSN-L =       "2332-7790",
  bibdate =      "Thu Apr 7 15:41:53 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetransbigdata.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Big Data",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6687317",
}

@Article{Ye:2022:OAD,
  author =       "Qianchuan Ye and Benjamin Delaware",
  title =        "Oblivious algebraic data types",
  journal =      j-PACMPL,
  volume =       "6",
  number =       "POPL",
  pages =        "51:1--51:29",
  month =        jan,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3498713",
  ISSN =         "2475-1421 (electronic)",
  ISSN-L =       "2475-1421",
  bibdate =      "Thu May 26 06:32:48 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/pacmpl.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3498713",
  abstract =     "Secure computation allows multiple parties to compute
                 joint functions over private data without leaking any
                 sensitive data, typically using powerful cryptographic
                 techniques. Writing secure applications using these
                 techniques directly can be challenging,. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "Proceedings of the ACM on Programming Languages
                 (PACMPL)",
  journal-URL =  "https://dl.acm.org/loi/pacmpl",
}

@Article{Ying:2022:CNC,
  author =       "Qianjin Ying and Yulei Yu and Changzhen Hu",
  title =        "{CJSpector}: A Novel Cryptojacking Detection Method
                 Using Hardware Trace and Deep Learning",
  journal =      j-J-GRID-COMP,
  volume =       "20",
  number =       "4",
  pages =        "??--??",
  month =        dec,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1007/s10723-022-09621-2",
  ISSN =         "1570-7873 (print), 1572-9184 (electronic)",
  ISSN-L =       "1570-7873",
  bibdate =      "Wed Sep 21 07:07:29 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib",
  URL =          "https://link.springer.com/article/10.1007/s10723-022-09621-2",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Grid Comp.",
  articleno =    "31",
  fjournal =     "Journal of Grid Computing",
  journal-URL =  "http://link.springer.com/journal/10723",
}

@Article{Yuan:2022:IBP,
  author =       "Yilin Yuan and Jianbiao Zhang and Zheng Li",
  title =        "Identity-based public data integrity verification
                 scheme in cloud storage system via blockchain",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "6",
  pages =        "8509--8530",
  month =        apr,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-021-04193-6",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Mon Jun 6 08:11:49 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-021-04193-6",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Zaki:2022:GGM,
  author =       "Faiz Zaki and Firdaus Afifi and Shukor Abd Razak and
                 Abdullah Gani and Nor Badrul Anuar",
  title =        "{GRAIN}: Granular multi-label encrypted traffic
                 classification using classifier chain",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "213",
  number =       "??",
  pages =        "??--??",
  day =          "4",
  month =        aug,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1016/j.comnet.2022.109084",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  ISSN-L =       "1389-1286",
  bibdate =      "Thu Aug 4 05:58:27 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S1389128622002213",
  acknowledgement = ack-nhfb,
  articleno =    "109084",
  fjournal =     "Computer Networks (Amsterdam, Netherlands: 1999)",
  journal-URL =  "http://www.sciencedirect.com/science/journal/13891286/",
}

@Article{Zhang:2022:CLA,
  author =       "Wenzheng Zhang and Zirui Qiao and Bo Yang and Yanwei
                 Zhou and Mingwu Zhang",
  title =        "Continuous Leakage-Amplified Public-Key Encryption
                 With {CCA} Security",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "7",
  pages =        "1760--1775",
  month =        jul,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxab017",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Jul 19 09:06:37 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/7/1760/6236091",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Zhang:2022:SHI,
  author =       "Xiaomei Zhang and Pengming Zhang and Chi-hung Chi",
  title =        "{sAuth}: a hierarchical implicit authentication
                 mechanism for service robots",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "78",
  number =       "14",
  pages =        "16029--16055",
  month =        sep,
  year =         "2022",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-022-04472-w",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Fri Sep 9 10:02:23 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-022-04472-w",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Article{Zhang:2022:VSB,
  author =       "Jiliang Zhang and Chaoqun Shen and Haihan Su and Md
                 Tanvir Arafin and Gang Qu",
  title =        "Voltage Over-Scaling-Based Lightweight Authentication
                 for {IoT} Security",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "2",
  pages =        "323--336",
  month =        feb,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2021.3049543",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Thu Jan 20 07:18:16 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Zheng:2022:CSE,
  author =       "Lijuan Zheng and Zihan Wang and Senping Tian",
  title =        "Comparative study on electrocardiogram encryption
                 using elliptic curves cryptography and data encryption
                 standard for applications in {Internet of Medical
                 Things}",
  journal =      j-CCPE,
  volume =       "34",
  number =       "9",
  pages =        "e5776:1--e5776:??",
  day =          "25",
  month =        apr,
  year =         "2022",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.5776",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Wed Apr 13 09:55:02 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ccpe2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Concurr. Comput.",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
  onlinedate =   "06 April 2020",
}

@Article{Zhou:2022:OBS,
  author =       "Chao Zhou and Chunhua Wang and Wei Yao and Hairong
                 Lin",
  title =        "Observer-based synchronization of memristive neural
                 networks under {DoS} attacks and actuator saturation
                 and its application to image encryption",
  journal =      j-APPL-MATH-COMP,
  volume =       "425",
  number =       "??",
  pages =        "??--??",
  day =          "15",
  month =        jul,
  year =         "2022",
  CODEN =        "AMHCBQ",
  DOI =          "https://doi.org/10.1016/j.amc.2022.127080",
  ISSN =         "0096-3003 (print), 1873-5649 (electronic)",
  ISSN-L =       "0096-3003",
  bibdate =      "Mon Apr 11 16:09:04 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/applmathcomput2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0096300322001643",
  acknowledgement = ack-nhfb,
  articleno =    "127080",
  fjournal =     "Applied Mathematics and Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00963003",
}

@Article{Zhu:2022:FSE,
  author =       "Fei Zhu and Xun Yi and Alsharif Abuadbba and Ibrahim
                 Khalil and Surya Nepal and Xinyi Huang",
  title =        "Forward-Secure Edge Authentication for Graphs",
  journal =      j-COMP-J,
  volume =       "65",
  number =       "7",
  pages =        "1653--1665",
  month =        jul,
  year =         "2022",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxab004",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Jul 19 09:06:37 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://academic.oup.com/comjnl/article/65/7/1653/6178962",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Zijlstra:2022:LBC,
  author =       "Timo Zijlstra and Karim Bigou and Arnaud Tisserand",
  title =        "Lattice-Based Cryptosystems on {FPGA}: Parallelization
                 and Comparison Using {HLS}",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "71",
  number =       "8",
  pages =        "1916--1927",
  month =        aug,
  year =         "2022",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/TC.2021.3112052",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Sat Jul 16 11:55:32 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}

@Article{Zolotavkin:2022:IUA,
  author =       "Yevhen Zolotavkin and Jongkil Jay Jeong and Veronika
                 Kuchta and Maksym Slavnenko and Robin Doss",
  title =        "Improving Unlinkability of Attribute-based
                 Authentication through Game Theory",
  journal =      j-TOPS,
  volume =       "25",
  number =       "2",
  pages =        "12:1--12:36",
  month =        may,
  year =         "2022",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3501260",
  ISSN =         "2471-2566 (print), 2471-2574 (electronic)",
  ISSN-L =       "2471-2566",
  bibdate =      "Sat Jul 2 07:50:27 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/tops.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3501260",
  abstract =     "This article first formalizes the problem of
                 unlinkable attribute-based authentication in the system
                 where each user possesses multiple assertions and uses
                 them interchangeably. Currently, there are no
                 recommendations for optimal usage of assertions in
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Transactions on Privacy and Security (TOPS)",
  journal-URL =  "https://dl.acm.org/loi/tops",
}

@Article{Zou:2022:NIE,
  author =       "Chengye Zou and Xingyuan Wang and Changjun Zhou and
                 Shujuan Xu and Chun Huang",
  title =        "A novel image encryption algorithm based on {DNA}
                 strand exchange and diffusion",
  journal =      j-APPL-MATH-COMP,
  volume =       "430",
  number =       "??",
  pages =        "??--??",
  day =          "1",
  month =        oct,
  year =         "2022",
  CODEN =        "AMHCBQ",
  DOI =          "https://doi.org/10.1016/j.amc.2022.127291",
  ISSN =         "0096-3003 (print), 1873-5649 (electronic)",
  ISSN-L =       "0096-3003",
  bibdate =      "Fri Jun 24 10:24:53 MDT 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/applmathcomput2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0096300322003654",
  acknowledgement = ack-nhfb,
  articleno =    "127291",
  fjournal =     "Applied Mathematics and Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00963003",
}

@Article{Baksi:2023:SFA,
  author =       "Anubhab Baksi and Shivam Bhasin and Jakub Breier and
                 Dirmanto Jap and Dhiman Saha",
  title =        "A Survey on Fault Attacks on Symmetric Key
                 Cryptosystems",
  journal =      j-COMP-SURV,
  volume =       "55",
  number =       "4",
  pages =        "86:1--86:??",
  month =        may,
  year =         "2023",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/3530054",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Sat Nov 26 08:32:02 MST 2022",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3530054",
  abstract =     "Fault attacks are among the well-studied topics in the
                 area of cryptography. These attacks constitute a
                 powerful tool to recover the secret key used in the
                 encryption process. Fault attacks work by forcing a
                 device to work under non-ideal environmental conditions
                 (such as high temperature) or external disturbances
                 (such as glitch in the power supply) while performing a
                 cryptographic operation. The recent trend shows that
                 the amount of research in this direction --- which
                 ranges from attacking a particular primitive, proposing
                 a fault countermeasure, to attacking countermeasures
                 --- has grown up substantially and is going to stay as
                 an active research interest for the foreseeable future.
                 Hence, it becomes apparent to have a comprehensive yet
                 compact study of the (major) works. This work, which
                 covers a wide spectrum in the present-day research on
                 fault attacks that fall under the purview of the
                 symmetric key cryptography, aims at fulfilling the
                 absence of an up-to-date survey. We present mostly all
                 aspects of the topic in a way that is not only
                 understandable for a non-expert reader, but also
                 helpful for an expert as a reference.",
  acknowledgement = ack-nhfb,
  articleno =    "86",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "https://dl.acm.org/loi/csur",
}

@Misc{Bursztein:2023:TQR,
  author =       "Elie Bursztein and Fabian Kaczmarczyck",
  title =        "Toward Quantum Resilient Security Keys",
  howpublished = "Google Security Blog",
  day =          "15",
  month =        aug,
  year =         "2023",
  bibdate =      "Fri Sep 01 15:43:35 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  note =         "2023",
  URL =          "https://security.googleblog.com/2023/08/toward-quantum-resilient-security-keys.html",
  abstract =     "As part of our effort to deploy quantum resistant
                 cryptography, we are happy to announce the release of
                 the first quantum resilient FIDO2 security key
                 implementation as part of OpenSK, our open source
                 security key firmware. This open-source hardware
                 optimized implementation uses a novel ECC/Dilithium
                 hybrid signature schema that benefits from the security
                 of ECC against standard attacks and Dilithium's
                 resilience against quantum attacks. This schema was
                 co-developed in partnership with the ETH Z{\"u}rich and
                 won the ACNS secure cryptographic implementation
                 workshop best pape",
  acknowledgement = ack-nhfb,
}

@Misc{Goodin:2023:FCK,
  author =       "Dan Goodin",
  title =        "In a first, cryptographic keys protecting {SSH}
                 connections stolen in new attack",
  howpublished = "Ars Technica Web site",
  day =          "13",
  month =        nov,
  year =         "2023",
  bibdate =      "Mon Dec 04 12:12:07 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  note =         "Details are in the technical paper
                 \cite{Ryan:2023:PSK}.",
  URL =          "https://arstechnica.com/security/2023/11/hackers-can-steal-ssh-cryptographic-keys-in-new-cutting-edge-attack/",
  abstract =     "An error as small as a single flipped memory bit is
                 all it takes to expose a private key.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Ryan:2023:PSK,
  author =       "Keegan Ryan and Kaiwen He and George Arnold Sullivan
                 and Nadia Heninger",
  booktitle =    "Proceedings of the {2023 ACM SIGSAC Conference on
                 Computer and Communications Security: [CCS '23,
                 November 26--30, 2023, Copenhagen, Denmark]}",
  title =        "Passive {SSH} Key Compromise via Lattices",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  year =         "2023",
  DOI =          "https://doi.org/10.1145/3576915.3616629",
  ISBN-13 =      "979-84-00-70050-7",
  bibdate =      "Mon Dec 4 12:07:24 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://eprint.iacr.org/2023/1711.pdf",
  abstract =     "We demonstrate that a passive network attacker can
                 opportunistically obtain private RSA host keys from an
                 SSH server that experiences a naturally arising fault
                 during signature computation. In prior work, this was
                 not believed to be possible for the SSH protocol
                 because the signature included information like the
                 shared Diffie--Hellman secret that would not be
                 available to a passive network observer. We show that
                 for the signature parameters commonly in use for SSH,
                 there is an efficient lattice attack to recover the
                 private key in case of a signature fault. We provide a
                 security analysis of the SSH, IKEv1, and IKEv2
                 protocols in this scenario, and use our attack to
                 discover hundreds of compromised keys in the wild from
                 several independently vulnerable implementations.",
  acknowledgement = ack-nhfb,
  remark =       "This would seem to be an extremely serious compromise,
                 because it only requires reading network traffic, and
                 has been shown to allow key recovery for about one in a
                 million RSA keys. See also \cite{Goodin:2023:FCK}.",
}

@Article{Saini:2023:CNF,
  author =       "A. Saini and A. Tsokanos and R. Kirner",
  title =        "{CryptoQNRG}: a new framework for evaluation of
                 cryptographic strength in quantum and pseudorandom
                 number generation for key-scheduling algorithms",
  journal =      j-J-SUPERCOMPUTING,
  volume =       "79",
  number =       "11",
  pages =        "12219--12237",
  month =        jul,
  year =         "2023",
  CODEN =        "JOSUED",
  DOI =          "https://doi.org/10.1007/s11227-023-05115-4",
  ISSN =         "0920-8542 (print), 1573-0484 (electronic)",
  ISSN-L =       "0920-8542",
  bibdate =      "Sat Jun 10 08:11:52 MDT 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  URL =          "https://link.springer.com/article/10.1007/s11227-023-05115-4",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Supercomputing",
  fjournal =     "The Journal of Supercomputing",
  journal-URL =  "http://link.springer.com/journal/11227",
}

@Misc{Anonymous:2024:GCY,
  author =       "Anonymous",
  title =        "{GCHQ} Celebrates 80 Years of {Colossus}",
  howpublished = "Web site",
  day =          "18",
  month =        jan,
  year =         "2024",
  bibdate =      "Fri Jan 19 13:53:31 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://www.gchq.gov.uk/news/colossus-80",
  acknowledgement = ack-nhfb,
  remark =       "Contains rare photos of the Colossus machine",
}

@TechReport{Ekhall:2024:TDC,
  author =       "Magnus Ekhall",
  title =        "The {TICOM DF-114} Cryptanalytic Device --- a Theory
                 of Operation and Computer Simulation",
  type =         "Report",
  number =       "??",
  institution =  "????",
  address =      "????",
  pages =        "10",
  month =        jun,
  year =         "2024",
  bibdate =      "Sat Aug 03 16:10:39 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  note =         "Presented at HistoCrypt 2024, June 25--27, 2024,
                 Oxford/Bletchley Park, UK.",
  URL =          "https://dspace.ut.ee/server/api/core/bitstreams/f707e86c-a7d6-421b-b904-267439ee1cee/content",
  abstract =     "The M-209 cipher machine was used extensively by the
                 U.S.A. during World War II. It is known that German
                 cryptanalysts under certain circumstances were able to
                 decipher M-209 enciphered messages using pen-and-paper
                 techniques. A German wartime document found by the
                 allies Target Intelligence Committee (TICOM) in 1947
                 describes a electromechanical machine that supposedly
                 could be used as an aid when breaking M-209 enciphered
                 messages. The document, designated DF-114 by TICOM, is
                 quite technical but does not describe how the device
                 would work.\par

                 This paper suggests a theory of how the device could
                 have been used, and by creating a computer simulation
                 of the device described in DF-114 explores the
                 viability of the theory.",
  acknowledgement = ack-nhfb,
}

@Article{Lemire:2024:ESP,
  author =       "Daniel Lemire",
  title =        "Exact Short Products From Truncated Multipliers",
  journal =      j-COMP-J,
  volume =       "67",
  number =       "4",
  pages =        "1514--1520",
  month =        apr,
  year =         "2024",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxad077",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Apr 26 12:13:08 MDT 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  URL =          "http://academic.oup.com/comjnl/article/67/4/1514/7306807;
                 https://arxiv.org/abs/2303.14321v1",
  abstract =     "We sometimes need to compute the most significant
                 digits of the product of small integers with a
                 multiplier requiring much storage: e.g., a large
                 integer (e.g., $ 5^{100} A$) or an irrational number ($
                 \pi $). We only need to access the most significant
                 digits of the multiplier --- as long as the integers
                 are sufficiently small. We provide an efficient
                 algorithm to compute the range of integers given a
                 truncated multiplier and a desired number of digits.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Misc{Martin:2024:GCA,
  author =       "Alexander Martin",
  title =        "{GCHQ} celebrates 80th anniversary of world's first
                 digital computer, used to crack {Nazi} ciphers",
  howpublished = "Web site",
  day =          "18",
  month =        jan,
  year =         "2024",
  bibdate =      "Fri Jan 19 13:47:14 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://therecord.media/80th-anniversary-colossus-digital-computer-uk-wwii-nazi-codebreaking",
  acknowledgement = ack-nhfb,
  remark =       "Contains rare photos of the Colossus machine, and
                 information about its tremendous importance in World
                 War II.",
}

@Misc{McCallum:2024:UIC,
  author =       "Shiona McCallum",
  title =        "Unseen images of code breaking computer that helped
                 win {WW2}",
  howpublished = "Web site",
  day =          "18",
  month =        jan,
  year =         "2024",
  bibdate =      "Fri Jan 19 13:47:14 2024",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://www.bbc.com/news/technology-67997406",
  acknowledgement = ack-nhfb,
  remark =       "Contains rare photos of the Colossus machine",
}

@Article{DiMatteo:2025:AFO,
  author =       "Stefano {Di Matteo} and Diamante Simone Crescenzo and
                 Rafael Carrera Rodriguez and Emanuele Valea and Florent
                 Bruguier and Pascal Benoit",
  title =        "Accelerating First-Order Secure {ML-KEM} with Masked
                 {SHA-3}: Cost, Randomness, and Security Evaluation",
  journal =      j-IEEE-ACCESS,
  volume =       "13 (early access)",
  pages =        "1--13",
  year =         "2025",
  DOI =          "https://doi.org/10.1109/ACCESS.2025.3616775",
  ISSN =         "2169-3536",
  bibdate =      "Sun Oct 5 10:31:31 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/risc-v.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Access",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6287639",
  keywords =     "Clocks; Costs; Cryptography; Domain-Oriented Masking;
                 Field programmable gate arrays; Hash functions; Keccak;
                 ML-KEM; NIST; PQC; Randomness Generation; Registers;
                 RISC-V; SHA-3; Side-channel attacks; Side-Channel
                 Attacks; Standards; Vectors",
  remark =       "From the abstract: ``existing DOM (Domain-Oriented
                 Masking) implementations of Keccak demand 1600 bits of
                 fresh randomness per clock cycle.'' They achieve this
                 massive bit rate with 25 parallel Trivium generators,
                 each producing a 64-bit random number in each clock
                 cycle.",
}

@TechReport{Gutmann:2025:RQF,
  author =       "Peter Gutmann and Stephan Neuhaus",
  title =        "Replication of Quantum Factorisation Records with an
                 8-bit Home Computer, an Abacus, and a Dog",
  type =         "Report",
  institution =  "University of Auckland and Z{\"u}rcher Hochschule
                 f{\"u}r Angewandte Wissenschaften",
  address =      "Auckland, New Zealand and Zurich, Switzerland",
  pages =        "16",
  month =        mar,
  year =         "2025",
  bibdate =      "Wed Jul 16 12:01:13 2025",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://eprint.iacr.org/2025/1237.pdf",
  abstract =     "This paper presents implementations that match and,
                 where possible, exceed current quantum factorisation
                 records using a VIC-20 8-bit home computer from 1981,
                 an abacus, and a dog. We hope that this work will
                 inspire future efforts to match any further quantum
                 factorisation records, should they arise.",
  acknowledgement = ack-nhfb,
}

%%% ====================================================================
%%% Cross-referenced entries must come last.  Bibliography entries are
%%% ordered by year, and then by citation label, with `bibsort
%%% --byyear'.

@Book{Lewis:2021:ICF,
  author =       "Harry R. Lewis",
  booktitle =    "Ideas That Created the Future: Classic Papers of
                 Computer Science",
  title =        "Ideas That Created the Future: Classic Papers of
                 Computer Science",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xxii + 495",
  year =         "2021",
  DOI =          "https://doi.org/10.7551/mitpress/12274.001.0001",
  ISBN =         "0-262-04530-3",
  ISBN-13 =      "978-0-262-04530-8",
  LCCN =         "Q124.6-127.2",
  bibdate =      "Tue Feb 1 07:01:34 MST 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/h/hamming-richard-w.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/l/lovelace-ada-augusta.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This book includes classic papers by thinkers ranging
                 from Aristotle and Leibniz to Norbert Wiener and Gordon
                 Moore that chart the evolution of computer science.
                 Ideas That Created the Future collects forty-six
                 classic papers in computer science that map the
                 evolution of the field. It covers all aspects of
                 computer science: theory and practice, architectures
                 and algorithms, and logic and software systems, with an
                 emphasis on the period of 1936--1980 but also including
                 important earlier work. Offering papers by thinkers
                 ranging from Aristotle and Leibniz to Alan Turing and
                 Nobert Wiener, the book documents the discoveries and
                 inventions that created today's digital world. A brief
                 essay by volume editor Harry Lewis, offering historical
                 and intellectual context, accompanies each paper.
                 Readers will learn that we owe to Aristotle the
                 realization that fixed rules of logic can apply to
                 different phenomena --- that logic provides a general
                 framework for reasoning --- and that Leibniz recognized
                 the merits of binary notation. They can read Ada
                 Lovelace's notes on L. F. Menabrea's sketch of an
                 analytical engine, George Boole's attempt to capture
                 the rules of reason in mathematical form, David
                 Hilbert's famous 1900 address, ``Mathematical
                 Problems,'' and Alan Turing's illumination of a
                 metamathematical world. Later papers document the
                 ``Cambrian era'' of 1950s computer design, Maurice
                 Wilkes's invention of microcode, Grace Hopper's vision
                 of a computer's ``education,'' Ivan Sutherland's
                 invention of computer graphics at MIT, Whitfield Diffie
                 and Martin Hellman's pioneering work on encryption, and
                 much more. Lewis's guided tour of a burgeoning field is
                 especially welcome at a time when computer education is
                 increasingly specialized.",
  acknowledgement = ack-nhfb,
  subject =      "Computer science; Geschichte; Computerarchitektur;
                 Informatik; Mathematics / General",
  tableofcontents = "Introduction: The Roots and Growth of Computer
                 Science \\
                 Prior Analytics (ca. 350 BCE) / Aristotle \\
                 The True Method (1677) / Gottfried Wilhelm Leibniz \\
                 Sketch of the Analytical Engine (1843) / L. F.
                 Menabrea, with notes by the translator, Ada Agusta,
                 Countess of Lovelace \\
                 An Investigation of the Laws of Thought on Which Are
                 Founded the Mathematical Theories of Logic and
                 Probabilities (1854) / George Boole \\
                 Mathematical Problems (1900) / David Hilbert \\
                 On Computable Numbers, with an Application to the
                 Entscheidungsproblem (1936) / Alan Mathison Turing \\
                 Proposed Automatic Calculating Machine (1937) / Howard
                 Hathaway Aiken \\
                 A Symbolic Analysis of Relay and Switching Circuits
                 (1938) / Claude Shannon \\
                 A Logical Calculus of the Ideas Immanent in Nervous
                 Activity (1943) / Warren McCulloch and Walter Pitts \\
                 First Draft of a Report on the EDVAC (1945) / John von
                 Neumann \\
                 As We May Think (1945) / Vannevar Bush \\
                 A Mathematical Theory of Communication (1948) / Claude
                 Shannon \\
                 Error Detecting and Error Correcting Codes (1950) / R.
                 W. Hamming \\
                 Computing Machinery and Intelligence (1950) / Alan
                 Mathison Turing \\
                 The Best Way to Design an Automatic Calculating Machine
                 (1951) / Maurice Wilkes \\
                 The Education of a Computer (1952) / Grace Murray
                 Hopper \\
                 On the Shortest Spanning Subtree of a Graph and the
                 Traveling Salesman Problem (1956) / Joseph B. Kruskal,
                 Jr., The Perceptron: A Probabilistic Model for
                 Information Storage and Organization (1958) / Frank
                 Rosenblatt \\
                 Some Moral and Technical Consequences of Automation
                 (1960) / Norbert Wiener \\
                 Man-Computer Symbiosis (1960) / J. C. R. Licklider \\
                 Recursive Functions of Symbolic Expressions and Their
                 Computation by Machine (1960) / John McCarthy \\
                 Augmenting Human Intellect: A Conceptual Framework
                 (1962) / Douglas C. Engelbart \\
                 An Experimental Time-Sharing System (1962) / Fernando
                 Corbat{\'y}o, Marjorie Merwin Daggett, and Robert C.
                 Daley \\
                 Sketchpad (1963) / Ivan E. Sutherland \\
                 Cramming More Components onto Integrated Circuits
                 (1965) / Gordon Moore \\
                 Solution of a Problem in Concurrent Program Control
                 (1965) / Edsger Dijkstra \\
                 ELIZA-A Computer Program for the Study of Natural
                 Language Communication between Man and Machine (1966) /
                 Joseph Weizenbaum \\
                 The Structure of the ``THE''-Multiprogramming System
                 (1968) / Edsger Dijkstra \\
                 Go To Statement Considered Harmful (1968) / Edsger
                 Dijkstra \\
                 Gaussian Elimination is Not Optimal (1969) / Volker
                 Strassen \\
                 An Axiomatic Basis for Computer Programming (1969) / C.
                 A. R. Hoare \\
                 A Relational Model of Large Shared Data Banks (1970) /
                 Edgar F. Codd \\
                 Managing the Development of Large Software Systems
                 (1970) / Winston W. Royce \\
                 The Complexity of Theorem-Proving Procedures (1971) /
                 Stephen A. Cook \\
                 A Statistical Interpretation of Term Specificity and
                 Its Application in Retrieval (1972) / Karen Sp{\'y}arck
                 Jones \\
                 Reducibility among Combinatorial Problems (1972) /
                 Richard Karp \\
                 The Unix Time-Sharing System (1974) / Dennis Ritchie
                 and Kenneth Thompson \\
                 A Protocol for Packet Network Intercommunication (1974)
                 / Vinton Cerf and Robert Kahn \\
                 Programming with Abstract Data Types (1974) / Barbara
                 Liskov and Stephen Zilles \\
                 The Mythical Man-Month (1975) / Frederick C. Brooks \\
                 Ethernet: Distributed Packet Switching for Local
                 Computer Networks (1976) / Robert Metcalfe and David R.
                 Boggs \\
                 New Directions in Cryptography (1976) / Whitfield
                 Diffie and Martin Hellman \\
                 Big Omicron and Big Omega and Big Theta (1976) / Donald
                 E. Knuth: Social Processes and Proofs of Theorems and
                 Programs (1977) / Richard DeMillo, Richard Lipton, and
                 Alan Perlis \\
                 A Method for Obtaining Digital Signatures and
                 Public-Key Cryptosystems (1978) / Ronald Rivest, Adi
                 Shamir, and Len Adleman \\
                 How to Share a Secret (1979) / Adi Shamir",
}

@Book{Slayton:2022:DCW,
  author =       "Rebecca Slayton",
  booktitle =    "Democratizing Cryptography: The Work of {Whiteld
                 Diffie} and {Martin Hellman}",
  title =        "Democratizing Cryptography: The Work of {Whiteld
                 Diffie} and {Martin Hellman}",
  volume =       "42",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xx + 538",
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3549993",
  ISBN =         "1-4503-9825-1 (paperback), 1-4503-9826-X (epub),
                 1-4503-9827-8 (hardcover), 1-4503-9828-6 (ebook)",
  ISBN-13 =      "978-1-4503-9825-1 (paperback), 978-1-4503-9826-8
                 (epub), 978-1-4503-9827-5 (hardcover),
                 978-1-4503-9828-2 (ebook)",
  ISSN =         "2374-6777",
  LCCN =         "QA76.9.A25 .S539 2022; RC87 .S539 2022",
  bibdate =      "Thu Sep 29 13:51:00 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  series =       "ACM books",
  acknowledgement = ack-nhfb,
  subject =      "Democratizing Cryptography (Computer Science)",
  tableofcontents = "1 Introduction: The Early Lives and Lasting
                 Legacies of Whitfield Diffie and Martin Hellman /
                 Rebecca Slayton \\
                 1.1 Introduction \\
                 1.2 Early Life and Socialization \\
                 1.3 Different Paths to Cryptography \\
                 1.4 Finding an Intellectual Soul Mate \\
                 1.5 New Directions in Cryptography \\
                 1.6 Changing the World: The Chapters Ahead \\
                 References \\
                 2 Public Key Cryptography's Impact on Society: How
                 Diffie and Hellman Changed the World / Paul C. van
                 Oorschot \\
                 2.1 Introduction \\
                 2.2 Security Background \\
                 2.3 Context: Motivation and Environment \\
                 2.4 Inventive Contributions \\
                 2.5 Supporting and Related Developments \\
                 2.6 Major Impacts on Society \\
                 2.7 Concluding Remarks \\
                 Acknowledgments \\
                 References \\
                 3 Public Key Cryptography in Computer and Network
                 Security / Paul Kocher \\
                 3.1 Symmetric Encryption and the Challenge of Scaling
                 Communications Security \\
                 3.2 Key Management Before Public Key Cryptography \\
                 3.3 Public Key Cryptography \\
                 3.4 Digital Signatures and Certificates \\
                 3.5 Securing Internet Communications \\
                 3.6 Security Protocols \\
                 3.7 Beyond Communication \\
                 3.8 Securing Supply Chains \\
                 3.9 Protecting Software \ldots{} and Protecting from
                 Software \\
                 3.10 Protecting Stored Data \\
                 3.11 Securing Implementations \\
                 3.12 The Need for Aligned Interests and Transparency
                 \\
                 3.13 The Potential Impact of Quantum Computing \\
                 3.14 The Future \\
                 References \\
                 4 The Influence of Public-Key Cryptography on
                 Mathematics / Johannes Buchmann, Michael J. Jacobson,
                 Jr., and Hugh C. Williams \\
                 4.1 Introduction \\
                 4.2 Primes \\
                 4.3 Factoring Integers \\
                 4.4 Discrete Logarithms \\
                 4.5 Elliptic Curves \\
                 4.6 Algebraic Number Fields \\
                 4.7 The Quantum Computer \\
                 4.8 Quantum-resistant Methods \\
                 4.9 Conclusion \\
                 References \\
                 5 A Gift that Keeps on Giving: The Impact of Public-Key
                 Cryptography on Theoretical Computer Science / Joan
                 Feigenbaum \\
                 5.1 Introduction \\
                 5.2 New Concepts in TCS \\
                 5.3 New Characterizations of Complexity Classes \\
                 5.4 Conclusion \\
                 References \\
                 6 Creating an Open Community of Cryptographers /
                 Hilarie Orman \\
                 6.1 Introduction \\
                 6.2 Initialization \\
                 6.3 Shifting in Parallel \\
                 6.4 Expanding in New Directions with New People \\
                 6.5 Compression \\
                 6.6 Expansion \\
                 6.7 Permutation and Translation \\
                 6.8 Output \\
                 6.9 Timeline of Early Events in the Discovery of
                 Public-key Cryptography \\
                 References \\
                 7 The Development of a Crypto Policy Community:
                 Diffie-Hellman's Impact on Public Policy / Susan Landau
                 \\
                 7.1 The Prologue \\
                 7.2 These, Our Actors \\
                 7.3 Action from an Unexpected Front: The Pentagon
                 Papers and the White House ``Plumbers'' \\
                 7.4 You Can't Publish That-and Other Forms of Control
                 \\
                 7.5 A Shift to Controlling Federal Encryption Standards
                 \\
                 7.6 Controlling the Sale of Cryptography \\
                 7.7 The Second Crypto War \\
                 7.8 The Lasting Public Policy Legacy of Diffie and
                 Hellman's Work \\
                 Acknowledgments \\
                 References \\
                 8 An Interview with Whitfield Diffie \\
                 9 An Interview with Martin Hellman \\
                 10 Information Security \\
                 11 Cybersecurity, Nuclear Security, Alan Turing, and
                 Illogical Logic \\
                 12 New Directions in Cryptography / Whitfield Diffie
                 and Martin E. Hellman \\
                 Abstract \\
                 12.1 Introduction \\
                 12.2 Conventional Cryptography \\
                 12.3 Public Key Cryptography \\
                 12.4 One Way Authentication \\
                 12.5 Problem Interrelations and Trap Doors \\
                 12.6 Computational Complexity \\
                 12.7 Historical Perspective \\
                 References \\
                 13 Exhaustive Cryptanalysis of the NBS Data Encryption
                 Standard / Whitfield Diffie and Martin E. Hellman \\
                 13.1 Introduction \\
                 13.2 The Basic Argument \\
                 13.3 Objections to the Basic Argument \\
                 13.4 System Architecture \\
                 13.5 Chip Design \\
                 13.5 Chip Design \\
                 13.7 Variable Key-size Techniques \\
                 13.8 Discussion \\
                 Acknowledgment \\
                 References \\
                 14 An Improved Algorithm for Computing Logarithms over
                 ${\rm GF}(p)$ and Its Cryptographic Significance /
                 Stephen C. Pohlig and Martin E. Hellman \\
                 Abstract \\
                 14.1 Introduction \\
                 14.2 Use in Cryptography \\
                 14.3 An Algorithm for $p = 2n + 1$ \\
                 14.4 An Algorithm for Arbitrary Primes \\
                 14.5 Discussion \\
                 References \\
                 15 Privacy and Authentication: An Introduction to
                 Cryptography / Whitfield Diffie and Martin E. Hellman
                 \\
                 Abstract \\
                 15.1 Introduction \\
                 15.2 Cryptographic Fundamentals \\
                 15.3 Examples of Systems and Solutions \\
                 15.4 Cryptographic Taxonomy \\
                 15.5 Cryptography in Practice \\
                 15.6 Applications of Cryptography \\
                 15.7 Selected Bibliography \\
                 References \\
                 Contributors",
}