@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"
}
@String{ack-bs = "Bruce Schneier,
Counterpane Systems,
101 East Minnehaha Parkway,
Minneapolis, MN 55419,
e-mail: \path|schneier@counterpane.com"}
@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,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|https://www.math.utah.edu/~beebe/|"}
@String{ack-pb = "Preston Briggs,
Tera Computer Company,
2815 Eastlake East,
Seattle, WA 98102,
USA,
Tel: +1 206 325-0800,
e-mail: \path|preston@tera.com|"}
@String{ack-r-project = "R Project Team"}
@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"}
@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-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 = "ComputingEdge"}
@String{j-COMPUT-MATH-APPL = "Computers and Mathematics with Applications"}
@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-COMPUTERWORLD = "ComputerWorld"}
@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-ELECT-COMM-JAPAN-3-FUND-ELECT-SCI = "Electronics and communications
in Japan. Part 3, Fundamental electronic
science"}
@String{j-EURASIP-J-APPL-SIG-PROC = "EURASIP Journal on Applied Signal Processing"}
@String{j-EXP-MATH = "Experimental Mathematics"}
@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-STAT-PROBAB = "International Journal of Statistics
and Probability"}
@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-INTERNET-HIST = "Internet Histories"}
@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-NUMBER-THEORY = "Journal of Number Theory"}
@String{j-J-PAR-DIST-COMP = "Journal of Parallel and Distributed
Computing"}
@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-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-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-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-SIGAPP = "ACM SIGAPP Applied Computing Review"}
@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-SIGNIF = "Significance ({Oxford, England})"}
@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-SPE = "Soft\-ware\emdash Prac\-tice and Experience"}
@String{j-STAT-COMPUT = "Statistics and Computing"}
@String{j-STAT-MED = "Statistics in Medicine"}
@String{j-STAT-NEERLANDICA = "Statistica Neerlandica"}
@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-TCBB = "IEEE/ACM Transactions on Computational
Biology and Bioinformatics"}
@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-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-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-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-TSAS = "ACM Transactions on Spatial Algorithms and
Systems (TSAS)"}
@String{j-TWEB = "ACM Transactions on the Web (TWEB)"}
@String{j-VLDB-J = "VLDB Journal: Very Large Data Bases"}
@String{j-WIRES = "WIREs Computational Statistics"}
@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-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"}
@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"}
@InProceedings{Wani:1970:PEA,
author = "Abdul Raoof Wani and Q. P. Rana and Nitin Pandey",
editor = "Kanad Ray and Tarun K. Sharma and Sanyog Rawat and R.
K. Saini and Anirban Bandyopadhyay",
booktitle = "Soft Computing: Theories and Applications: Proceedings
of SoCTA 2017",
title = "Performance Evaluation and Analysis of Advanced
Symmetric key Cryptographic Algorithms for Cloud
Computing Security",
publisher = pub-SV,
address = pub-SV:adr,
pages = "261--270",
year = "1970",
DOI = "https://doi.org/10.1007/978-981-13-0589-4",
ISBN = "981-13-0588-9 (print), 981-13-0589-7 (e-book)",
ISBN-13 = "978-981-13-0588-7 (print), 978-981-13-0589-4
(e-book)",
ISSN = "2194-5357 (print), 2194-5365 (electronic)",
LCCN = "QA76.9.S63",
bibdate = "Sun Jun 07 13:19:38 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://link.springer.com/10.1007/978-981-13-0589-4",
abstract = "The book focuses on soft computing and its
applications to solve real-world problems occurring in
different domains ranging from medicine and healthcare,
and supply chain management to image processing and
cryptanalysis. It includes high-quality papers
presented in the International Conference on Soft
Computing: Theories and Applications (SoCTA 2017),
organized by Bundelkhand University, Jhansi, India.
Offering significant insights into soft computing for
teachers and researchers alike, the book inspires more
researchers to work in the field of soft computing.",
acknowledgement = ack-nhfb,
keywords = "3DES; AES; Blowfish; DES; IDEA; RC4; TEA",
tableofcontents = "1: An Analysis of Authors productivity in RFID and
Supply Chain Management \\
2: Meta Heuristic Techniques Study for Fault Tolerant
in Cloud Computing Environment: A Survey Work \\
3: Complexity Metrics for Component Based Software
System \\
4: Design and Analysis of On-Chip Low Power, Low
Drop-Out Voltage Regulator using FFRC and MCC
Techniques \\
5: Study and Analysis of Back-Propagation Approach in
Artificial Neural Network using HOG Descriptor for
Real-time Object Classification \\
6: Identification of relevant stochastic input
variables for prediction of daily PM10 using Artificial
Neural Networks \\
7: Field based Weighting Information Retrieval on
Document field of Ad hoc dataset",
}
@Book{Delfs:2002:ICP,
author = "Hans Delfs and Helmut Knebl",
title = "Introduction to Cryptography: Principles and
Applications",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 310",
year = "2002",
DOI = "https://doi.org/10.1007/978-3-642-87126-9",
ISBN = "3-642-87126-7 (e-book), 3-642-87128-3",
ISBN-13 = "978-3-642-87126-9 (e-book), 978-3-642-87128-3",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.A25",
bibdate = "Sat Jun 10 08:35:18 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/978-3-642-87126-9",
abstract = "Due to the rapid growth of digital communication and
electronic data exchange, information security has
become a crucial issue in industry, business, and
administration. Modern cryptography provides essential
techniques for securing information and protecting
data. In the first part, this book covers the key
concepts of cryptography on an undergraduate level,
from encryption and digital signatures to cryptographic
protocols. Essential techniques are demonstrated in
protocols for key exchange, user identification,
electronic elections and digital cash. In the second
part, more advanced topics are addressed, such as the
bit security of one-way functions and computationally
perfect pseudorandom bit generators. The security of
cryptographic schemes is a central topic. Typical
examples of provably secure encryption and signature
schemes and their security proofs are given. Though
particular attention is given to the mathematical
foundations, no special background in mathematics is
presumed. The necessary algebra, number theory and
probability theory are included in the appendix. Each
chapter closes with a collection of exercises. The
second edition contains corrections, revisions and new
material, including a complete description of the AES,
an extended section on cryptographic hash functions, a
new section on random oracle proofs, and a new section
on public-key encryption schemes that are provably
secure against adaptively-chosen-ciphertext attacks.",
acknowledgement = ack-nhfb,
subject = "Computer science; Data encryption (Computer science);
Coding theory; Coding theory; Computer science; Data
encryption (Computer science)",
tableofcontents = "1. Introduction \\
1.1 Encryption and Secrecy \\
1.2 The Objectives of Cryptography \\
1.3 Attacks \\
1.4 Cryptographic Protocols \\
1.5 Provable Security \\
2. Symmetric-Key Encryption \\
2.1 Stream Ciphers \\
2.2 Block Ciphers \\
3. Public-Key Cryptography \\
3.1 The Concept of Public-Key Cryptography \\
3.2 Modular Arithmetic \\
3.3 RSA \\
3.4 Hash Functions \\
3.5 The Discrete Logarithm \\
3.6 Modular Squaring \\
4. Cryptographic Protocols \\
4.1 Key Exchange and Entity Authentication \\
4.2 Identification Schemes \\
4.3 Commitment Schemes \\
4.4 Electronic Elections \\
4.5 Digital Cash \\
5. Probabilistic Algorithms \\
5.1 Coin-Tossing Algorithms \\
5.2 Monte Carlo and Las Vegas Algorithms \\
6. One-Way Functions and the Basic Assumptions \\
6.1 A Notation for Probabilities \\
6.2 Discrete Exponential Function \\
6.3 Uniform Sampling Algorithms \\
6.4 Modular Powers \\
6.5 Modular Squaring \\
6.6 Quadratic Residuosity Property \\
6.7 Formal Definition of One-Way Functions \\
6.8 Hard-Core Predicates \\
7. Bit Security of One-Way Functions \\
7.1 Bit Security of the Exp Family \\
7.2 Bit Security of the RSA Family \\
7.3 Bit Security of the Square Family \\
8. One-Way Functions and Pseudorandomness \\
8.1 Computationally Perfect Pseudorandom Bit Generators
\\
8.2 Yao's Theorem \\
9. Provably Secure Encryption \\
9.1 Classical Information-Theoretic Security \\
9.2 Perfect Secrecy and Probabilistic Attacks \\
9.3 Public-Key One-Time Pads \\
9.4 Computationally Secret Encryption Schemes \\
9.5 Unconditional Security of Cryptosystems \\
10. Provably Secure Digital Signatures \\
10.1 Attacks and Levels of Security \\
10.2 Claw-Free Pairs and Collision-Resistant Hash
Functions \\
10.3 Authentication-Tree-Based Signatures \\
10.4 A State-Free Signature Scheme \\
A. Algebra and Number Theory \\
A.1 The Integers \\
A.2 Residues \\
A.3 The Chinese Remainder Theorem \\
A.4 Primitive Roots and the Discrete Logarithm \\
A.5 Quadratic Residues \\
A.6 Modular Square Roots \\
A.7 Primes and Primality Tests \\
B. Probabilities and Information Theory \\
B.1 Finite Probability Spaces and Random Variables \\
B.2 The Weak Law of Large Numbers \\
B.3 Distance Measures \\
B.4 Basic Concepts of Information Theory \\
References",
}
@Book{Nievergelt:2002:FLM,
author = "Yves Nievergelt",
title = "Foundations of Logic and Mathematics: Applications to
Computer Science and Cryptography",
publisher = pub-BIRKHAUSER,
address = pub-BIRKHAUSER:adr,
pages = "xvi + 415",
year = "2002",
ISBN = "0-8176-4249-8 , 3-7643-4249-8",
ISBN-13 = "978-0-8176-4249-5, 978-3-7643-4249-4",
LCCN = "QA9 .N53 2002",
bibdate = "Fri Mar 23 19:09:42 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0812/2001052551-d.html;
http://www.loc.gov/catdir/enhancements/fy0812/2001052551-t.html",
acknowledgement = ack-nhfb,
subject = "Logic, Symbolic and mathematical; Set theory; Number
theory; Computer science; Mathematics",
zz-isbn = "0-8176-4249-8, 3-7643-4249-8",
}
@Book{Shparlinski:2003:CAA,
author = "Igor E. Shparlinski",
title = "Cryptographic Applications of Analytic Number Theory:
Complexity Lower Bounds and Pseudorandomness",
volume = "22",
publisher = pub-BIRKHAUSER,
address = pub-BIRKHAUSER:adr,
pages = "viii + 411",
year = "2003",
ISBN = "3-7643-6654-0 , 0-8176-6654-0",
ISBN-13 = "978-3-7643-6654-4, 978-0-8176-6654-5",
LCCN = "QA267.7 .S55 2003",
bibdate = "Fri Mar 23 10:30:16 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
jenson.stanford.edu:2210/unicorn",
series = "Progress in computer science and applied logic",
acknowledgement = ack-nhfb,
subject = "Computational complexity; Coding theory; Combinatorial
number theory",
zz-isbn = "3-7643-6654-0, 0-8176-6654-0",
}
@InCollection{Huang:2005:EMP,
author = "Liusheng Huang and Hong Zhong and Hong Shen and
Yonglong Luo",
editor = "Hong Shen and Koji Nakano",
booktitle = "{Sixth International Conference on Parallel and
Distributed Computing, Applications and Technologies,
2005. PDCAT 2005: 5--8 December 2005, Dalian, China}",
title = "An Efficient Multiple-Precision Division Algorithm",
publisher = pub-IEEE,
address = pub-IEEE:adr,
bookpages = "xxvi + 1091",
pages = "971--974",
year = "2005",
DOI = "https://doi.org/10.1109/PDCAT.2005.79",
ISBN = "0-7695-2405-2",
ISBN-13 = "978-0-7695-2405-4",
LCCN = "QA76.58 .I5752 2005",
bibdate = "Mon Dec 09 14:30:16 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
note = "The authors present an integer-division algorithm that
runs three to five times faster than Knuth's 1981
original. However, there is an error in the
renormalization algorithm that is corrected in
\cite{Mukhopadhyay:2014:EMP}, while retaining the
speedup.",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=10544",
}
@Book{Beissinger:2006:CUM,
author = "Janet Beissinger and Vera Pless",
title = "The Cryptoclub: Using Mathematics to Make and Break
Secret Codes",
publisher = pub-A-K-PETERS,
address = pub-A-K-PETERS:adr,
pages = "xvi + 199",
year = "2006",
ISBN = "1-56881-223-X",
ISBN-13 = "978-1-56881-223-6",
LCCN = "QA40.5 .B45 2006",
bibdate = "Fri Mar 23 19:22:49 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip067/2006002743.html",
acknowledgement = ack-nhfb,
subject = "Mathematics; Juvenile literature; Cryptography",
}
@Article{Lee:2006:DCK,
author = "Patrick P. C. Lee and John C. S. Lui and David K. Y.
Yau",
title = "Distributed collaborative key agreement and
authentication protocols for dynamic peer groups",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "263--276",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872575",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider several distributed collaborative key
agreement and authentication protocols for dynamic peer
groups. There are several important characteristics
which make this problem different from traditional
secure group communication. They are: (1) distributed
nature in which there is no centralized key server; (2)
collaborative nature in which the group key is
contributory (i.e., each group member will
collaboratively contribute its part to the global group
key); and (3) dynamic nature in which existing members
may leave the group while new members may join. Instead
of performing individual rekeying operations, i.e.,
recomputing the group key after every join or leave
request, we discuss an interval-based approach of
rekeying. We consider three interval-based distributed
rekeying algorithms, or interval-based algorithms for
short, for updating the group key: (1) the Rebuild
algorithm; (2) the Batch algorithm; and (3) the
Queue-batch algorithm. Performance of these three
interval-based algorithms under different settings,
such as different join and leave probabilities, is
analyzed. We show that the interval-based algorithms
significantly outperform the individual rekeying
approach and that the Queue-batch algorithm performs
the best among the three interval-based algorithms.
More importantly, the Queue-batch algorithm can
substantially reduce the computation and communication
workload in a highly dynamic environment. We further
enhance the interval-based algorithms in two aspects:
authentication and implementation. Authentication
focuses on the security improvement, while
implementation realizes the interval-based algorithms
in real network settings. Our work provides a
fundamental understanding about establishing a group
key via a distributed and collaborative approach for a
dynamic peer group.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Book{Delfs:2007:ICP,
author = "Hans Delfs and Helmut Knebl",
title = "Introduction to Cryptography: Principles and
Applications",
volume = "1",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Second",
pages = "xvi + 367",
year = "2007",
DOI = "https://doi.org/10.1007/3-540-49244-5",
ISBN = "3-540-49243-7 (hardcover), 3-540-49244-5",
ISBN-13 = "978-3-540-49243-6 (hardcover), 978-3-540-49244-3",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9A25 D44 2007; QA76.9.D35",
bibdate = "Sat Jun 10 08:34:43 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/gm2886",
abstract = "In the first part, this book covers the key concepts
of cryptography on an undergraduate level, from
encryption and digital signatures to cryptographic
protocols. Essential techniques are demonstrated in
protocols for key exchange, user identification,
electronic elections and digital cash. In the second
part, more advanced topics are addressed, such as the
bit security of one-way functions and computationally
perfect pseudorandom bit generators. The security of
cryptographic schemes is a central topic. Typical
examples of provably secure encryption and signature
schemes and their security proofs are given. Though
particular attention is given to the mathematical
foundations, no special background in mathematics is
presumed. The necessary algebra, number theory and
probability theory are included in the appendix. Each
chapter closes with a collection of exercises.",
acknowledgement = ack-nhfb,
subject = "Computer security; Cryptography; Computer networks;
Security measures; Cryptography; Security measures;
Computer security; Informatique; Security measures;
Computer security; Cryptography; Coding theory; Data
encryption (Computer science); Data protection; Data
structures (Computer science); Number theory; Coding
theory; Data encryption (Computer science); Data
protection; Data structures (Computer science); Number
theory.",
tableofcontents = "1. Introduction \\
2. Symmetric-key encryption \\
3. Public-key cryptography \\
4. Cryptographic protocols \\
5. Probabilistic algorithms \\
6. One-way functions and the basic assumptions \\
7. Bit security of one-way functions \\
8. One-way functions and pseudorandomness \\
9. Provably secure encryption \\
10. Provably secure digital signatures \\
A. Algebra and number theory \\
B. Probabilities and information theory \\
References \\
Index",
}
@Book{Biggs:2008:CII,
author = "Norman Biggs",
title = "Codes: An introduction to Information Communication
and Cryptography",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 273",
year = "2008",
ISBN = "1-84800-273-4 (e-book), 1-84800-272-6 (paperback)",
ISBN-13 = "978-1-84800-273-9 (e-book), 978-1-84800-272-2
(paperback)",
LCCN = "QA268 .B496 2008eb",
bibdate = "Fri Mar 23 10:32:24 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
jenson.stanford.edu:2210/unicorn",
series = "Springer undergraduate mathematics series",
abstract = "This book is an integrated introduction to the
mathematics of coding, that is, replacing information
expressed in symbols, such as a natural language or a
sequence of bits, by another message using (possibly)
different symbols. There are three main reasons for
doing this: economy, reliability, and security, and
each is covered in detail. Only a modest mathematical
background is assumed, the mathematical theory being
introduced at a level that enables the basic problems
to be stated carefully, but without unnecessary
abstraction.",
acknowledgement = ack-nhfb,
subject = "Coding theory; Cryptography; Computer Science; IT;
COMPUTERS; Information Theory; Kryptologie",
tableofcontents = "Coding and its uses \\
Prefix-free codes \\
Economical coding \\
Data compression \\
Noisy channels \\
The problem of reliable communication \\
The noisy coding theorems \\
Linear codes \\
Algebraic coding theory \\
Coding natural languages \\
The development of cryptography \\
Cryptography in theory and practice \\
The RSA cryptosystem \\
Cryptography and calculation \\
Elliptic curve cryptography",
}
@Book{Hoffstein:2008:IMC,
author = "Jeffrey Hoffstein and Jill Catherine Pipher and Joseph
H. Silverman",
title = "An Introduction to Mathematical Cryptography",
volume = "666",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xv + 523",
year = "2008",
ISBN = "0-387-77993-0 (hardcover)",
ISBN-13 = "978-0-387-77993-5 (hardcover)",
LCCN = "QA268 .H64 2008",
bibdate = "Thu Mar 22 12:29:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "Undergraduate texts in mathematics",
acknowledgement = ack-nhfb,
subject = "Coding theory; Cryptography; Mathematics",
tableofcontents = "An introduction to cryptography \\
Discrete logarithms and Diffie-Hellman \\
Integer factorization and RSA \\
Combinatorics, probability, and information theory \\
Elliptic curves and cryptography \\
Lattices and cryptography \\
Digital signatures \\
Additional topics in cryptography",
}
@Book{Katz:2008:IMC,
author = "Jonathan Katz and Yehuda Lindell",
title = "Introduction to modern cryptography: Principles and
Protocols",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
pages = "xviii + 534",
year = "2008",
ISBN = "1-58488-551-3",
ISBN-13 = "978-1-58488-551-1",
LCCN = "QA76.9.A25 K36 2008",
bibdate = "Thu Mar 22 12:29:41 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "Chapman and Hall/CRC cryptography and network
security",
URL = "http://www.loc.gov/catdir/enhancements/fy0807/2007017861-d.html;
http://www.loc.gov/catdir/toc/ecip0716/2007017861.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Cryptography",
tableofcontents = "I. Introduction and Classical Cryptography \\
1. Introduction \\
2. Perfectly-Secret Encryption \\
II. Private-Key (Symmetric) Cryptography \\
3. Private-Key Encryption and Pseudorandomness \\
4. Message Authentication Codes and Collision-Resistant
Hash Functions \\
5. Practical Constructions of Pseudorandom Permutations
(Block Ciphers) \\
6. Theoretical Constructions of Pseudorandom Objects
\\
III. Public-Key (Asymmetric) Cryptography \\
7. Number Theory and Cryptographic Hardness Assumptions
\\
8. Factoring and Computing Discrete Logarithms \\
9. Private-Key Management and the Public-Key Revolution
\\
10. Public-Key Encryption \\
11. Additional Public-Key Encryption Schemes \\
12. Digital Signature Schemes \\
13. Public-Key Cryptosystems in the Random Oracle Model
\\
A. Mathematical Background \\
B. Supplementary Algorithmic Number Theory",
}
@Article{Douhou:2009:RUA,
author = "Salima Douhou and Jan R. Magnus",
title = "The reliability of user authentication through
keystroke dynamics",
journal = j-STAT-NEERLANDICA,
volume = "63",
number = "4",
pages = "432--449",
month = nov,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1111/j.1467-9574.2009.00434.x",
ISSN = "0039-0402 (print), 1467-9574 (electronic)",
ISSN-L = "0039-0402",
bibdate = "Tue Oct 8 09:15:34 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/statneerlandica.bib",
URL = "https://onlinelibrary.wiley.com/doi/epdf/10.1111/j.1467-9574.2009.00434.x",
acknowledgement = ack-nhfb,
ajournal = "Stat. Neerl.",
fjournal = "Statistica Neerlandica",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-9574",
onlinedate = "23 November 2009",
}
@Book{Elbirt:2009:UAC,
author = "Adam J. Elbirt",
title = "Understanding and Applying Cryptography and Data
Security",
publisher = pub-CRC,
address = pub-CRC:adr,
pages = "xxvii + 637",
year = "2009",
ISBN = "1-4200-6160-7",
ISBN-13 = "978-1-4200-6160-4",
LCCN = "QA76.9.A25 E43 2009",
bibdate = "Thu Mar 22 13:10:01 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0821/2008028154.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Cryptography",
}
@Article{Xiong:2009:PSI,
author = "H. Xiong and F. Li and Z. Qin",
title = "Provably Secure Identity Based Threshold Signature
Without Random Oracles",
journal = j-INT-J-COMPUT-APPL,
volume = "31",
number = "4",
pages = "290--295",
year = "2009",
DOI = "https://doi.org/10.1080/1206212X.2009.11441953",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:26:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2009.11441953",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Agarwal:2010:BRW,
author = "Parag Agarwal and Balakrishnan Prabhakaran",
title = "Blind robust watermarking of {$3$D} motion data",
journal = j-TOMCCAP,
volume = "6",
number = "1",
pages = "2:1--2:??",
month = feb,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1671954.1671956",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Mar 16 18:53:23 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "The article addresses the problem of copyright
protection for 3D motion-captured data by designing a
robust blind watermarking mechanism. The mechanism
segments motion capture data and identifies clusters of
3D points per segment. A watermark can be embedded and
extracted within these clusters by using a proposed
extension of 3D quantization index modulation. The
watermarking scheme is blind in nature and the encoded
watermarks are shown to be imperceptible, and secure.
The resulting hiding capacity has bounds based on
cluster size. The watermarks are shown to be robust
against attacks such as uniform affine transformations
(scaling, rotation, and translation), cropping,
reordering, and noise addition. The time complexity for
watermark embedding and extraction is estimated as
O({\em n\/} log {\em n\/}) and O({\em n\/}$^2$ log {\em
n\/}), respectively.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
keywords = "blind; decoding; encoding; spatial; Watermarking",
}
@Article{Ahmadian:2010:PDS,
author = "Zahra Ahmadian and Javad Mohajeri and Mahmoud
Salmasizadeh and Risto M. Hakala and Kaisa Nyberg",
title = "A practical distinguisher for the {Shannon} cipher",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "4",
pages = "543--547",
month = apr,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Altman:2010:AAP,
author = "Alon Altman and Moshe Tennenholtz",
title = "An axiomatic approach to personalized ranking
systems",
journal = j-J-ACM,
volume = "57",
number = "4",
pages = "26:1--26:35",
month = apr,
year = "2010",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/1734213.1734220",
ISSN = "0004-5411",
ISSN-L = "0004-5411",
bibdate = "Thu Apr 29 13:26:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/pagerank.bib",
abstract = "Personalized ranking systems and trust systems are an
essential tool for collaboration in a multi-agent
environment. In these systems, trust relations between
many agents are aggregated to produce a personalized
trust rating of the agents. In this article, we
introduce the first extensive axiomatic study of this
setting, and explore a wide array of well-known and new
personalized ranking systems. We adapt several axioms
(basic criteria) from the literature on global ranking
systems to the context of personalized ranking systems,
and fully classify the set of systems that satisfy all
of these axioms. We further show that all these axioms
are necessary for this result.",
acknowledgement = ack-nhfb,
articleno = "26",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "Advogato; Axiomatic approach; e-Bay reputation system;
epinions.com; manipulation; MoleTrust; OpenPGP;
PageRank; ranking systems; social networks",
}
@Article{Anonymous:2010:MML,
author = "Anonymous",
title = "Mirror, mirror \ldots{}",
journal = j-IEEE-SPECTRUM,
volume = "47",
number = "2",
pages = "11--11",
month = feb,
year = "2010",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2010.5397764",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Fri Jan 17 18:54:05 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Cryogenics; Cryptography; Europe; Magnetic cores;
Magnetic fields; Mirrors; Telescopes; Testing",
}
@TechReport{Anyanwu:2010:DCS,
author = "Matthew N. Anyanwu and Lih-Yuan Deng and Dipankar
Dasgupta",
title = "Design of Cryptographically Strong Generator By
Linearly Generated Sequences",
type = "Report",
number = "??",
institution = "The University of Memphis",
address = "Memphis, TN 38152, USA",
day = "12",
month = jan,
year = "2010",
bibdate = "Fri Mar 09 15:16:06 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ais.cs.memphis.edu/files/papers/Mathew-security-paper.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Applebaum:2010:PKC,
author = "Benny Applebaum and Boaz Barak and Avi Wigderson",
title = "Public-key cryptography from different assumptions",
crossref = "ACM:2010:PAI",
pages = "171--180",
year = "2010",
bibdate = "Wed Sep 1 10:42:57 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Article{Ardagna:2010:ECP,
author = "Claudio A. Ardagna and Jan Camenisch and Markulf
Kohlweiss and Ronald Leenes and Gregory Neven and Bart
Priem and Pierangela Samarati and Dieter Sommer and
Mario Verdicchio",
title = "Exploiting cryptography for privacy-enhanced access
control: A result of the {PRIME Project}",
journal = j-J-COMP-SECUR,
volume = "18",
number = "1",
pages = "123--160",
month = "????",
year = "2010",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2010-0367",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:24:34 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Argyropoulos:2010:BTP,
author = "Savvas Argyropoulos and Dimitrios Tzovaras and
Dimosthenis Ioannidis and Yannis Damousis and Michael
G. Strintzis and Martin Braun and Serge Boverie",
title = "Biometric template protection in multimodal
authentication systems based on error correcting
codes",
journal = j-J-COMP-SECUR,
volume = "18",
number = "1",
pages = "161--185",
month = "????",
year = "2010",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2010-0369",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:24:34 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Arnedo-Moreno:2010:JRA,
author = "Joan Arnedo-Moreno and Jordi
Herrera-Joancomart{\'\i}",
title = "{JXTA} resource access control by means of
advertisement encryption",
journal = j-FUT-GEN-COMP-SYS,
volume = "26",
number = "1",
pages = "21--28",
month = jan,
year = "2010",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Sep 11 13:08:16 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Badrignans:2010:SSA,
author = "Beno{\^\i}t Badrignans and David Champagne and Reouven
Elbaz and Catherine Gebotys and Lionel Torres",
title = "{SARFUM}: Security Architecture for Remote {FPGA}
Update and Monitoring",
journal = j-TRETS,
volume = "3",
number = "2",
pages = "8:1--8:??",
month = may,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1754386.1754389",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Tue Jun 22 16:00:33 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Remote update of hardware platforms or embedded
systems is a convenient service enabled by Field
Programmable Gate Array (FPGA)-based systems. This
service is often essential in applications like
space-based FPGA systems or set-top boxes. However,
having the source of the update be remote from the FPGA
system opens the door to a set of attacks that may
challenge the confidentiality and integrity of the FPGA
configuration, the bitstream. Existing schemes propose
to encrypt and authenticate the bitstream to thwart
these attacks. However, we show that they do not
prevent the replay of old bitstream versions, and thus
give adversaries an opportunity for downgrading the
system. In this article, we propose a new architecture
called\par
sarfum that, in addition to ensuring bitstream
confidentiality and integrity, precludes the replay of
old bitstreams. sarfum also includes a protocol for the
system designer to remotely monitor the running
configuration of the FPGA. Following our presentation
and analysis of the security protocols, we propose an
example of implementation with the CCM (Counter with
CBC-MAC) authenticated encryption standard. We also
evaluate the impact of our architecture on the
configuration time for different FPGA devices.",
acknowledgement = ack-nhfb,
articleno = "8",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
keywords = "authenticated encryption; bitstream security; FPGA;
replay attack; security protocol; system downgrade",
}
@Article{Bai:2010:RKI,
author = "L. Bai",
title = "A Reliable {$ (K, N) $} Image Secret Sharing Scheme
with Low Information Overhead",
journal = j-INT-J-COMPUT-APPL,
volume = "32",
number = "1",
pages = "9--14",
year = "2010",
DOI = "https://doi.org/10.1080/1206212X.2010.11441955",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:26:12 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2010.11441955",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Baldwin:2010:AFI,
author = "Adrian Baldwin and Marco Casassa Mont and Yolanta
Beres and Simon Shiu",
title = "Assurance for federated identity management",
journal = j-J-COMP-SECUR,
volume = "18",
number = "4",
pages = "541--572",
month = "????",
year = "2010",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2009-0380",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:24:47 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@TechReport{Barak:2010:IPO,
author = "Boaz Barak and Oded Goldreich and Russell Impagliazzo
and Steven Rudich and Amit Sahai and Salil Vadhan and
Ke Yang",
title = "On the (Im)possibility of Obfuscating Programs",
type = "Report",
institution = "Weizmann Institute",
address = "Rehovot 7610001, Israel",
pages = "54",
day = "29",
month = jul,
year = "2010",
bibdate = "Sat Sep 20 12:41:14 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.wisdom.weizmann.ac.il/~oded/PS/obf4.pdf",
acknowledgement = ack-nhfb,
keywords = "cryptography; encryption; obfuscation",
remark = "Revision of CRYPTO'01 paper \cite{Barak:2001:IPO}.",
}
@Book{Batey:2010:DMW,
author = "Mavis Batey",
title = "{Dilly}: the man who broke {Enigmas}",
publisher = "Biteback",
address = "London, UK",
pages = "256 (est.)",
year = "2010",
ISBN = "1-906447-15-2 (paperback)",
ISBN-13 = "978-1-906447-15-1 (paperback)",
LCCN = "????",
bibdate = "Thu May 12 11:03:33 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
library.ox.ac.uk:210/ADVANCE",
price = "US\$9.99",
acknowledgement = ack-nhfb,
subject = "Knox, A. D; (Alfred Dillwyn); cryptographers; Great
Britain; Biography; World War II, 1939--1945;
cryptography",
subject-dates = "1884--1943",
}
@Article{Bauer:2010:RVC,
author = "Andreas Bauer and Jan J{\"u}rjens",
title = "Runtime verification of cryptographic protocols",
journal = j-COMPUT-SECUR,
volume = "29",
number = "3",
pages = "315--330",
month = may,
year = "2010",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:20 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404809001047",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Baylis:2010:CC,
author = "John Baylis",
title = "Codes, not ciphers",
journal = j-MATH-GAZ,
volume = "94",
number = "531",
pages = "412--425",
month = nov,
year = "2010",
CODEN = "MAGAAS",
DOI = "https://doi.org/10.2307/3621549",
ISSN = "0025-5572",
ISSN-L = "0025-5572",
bibdate = "Tue May 5 12:04:12 MDT 2015",
bibsource = "http://journals.cambridge.org/action/displayIssue?jid=MAG&volumeId=94&issueId=531;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/mathgaz2010.bib",
acknowledgement = ack-nhfb,
ajournal = "Math. Gaz.",
fjournal = "The Mathematical Gazette",
journal-URL = "http://journals.cambridge.org/action/displayBackIssues?jid=MAG",
}
@Article{Benedetto:2010:DQE,
author = "Francesco Benedetto and Alberto Curcio and Gaetano
Giunta",
title = "Dynamic {QoS} Evaluation of Multimedia Contents in
Wireless Networks by ``Double-Boomerang''
Watermarking",
journal = j-FUTURE-INTERNET,
volume = "2",
number = "1",
pages = "60--73",
day = "08",
month = mar,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi2010060",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:44 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/2/1/60",
abstract = "This work presents a cooperative network-aware
processing of multimedia content for dynamic quality of
service management in wireless IP networks. Our
technique can be also used for quality control in UMTS
environments, exploiting the tracing watermarking
recently introduced in literature. In this work, we use
the transmitted video-sequences to monitor the QoS in a
videoconference call. The video-sequence of every
active user travels on the communication link, one time
as video (transparent mode), one time as watermark
(hidden mode) describing a boomerang trajectory. The
results obtained through our simulation trials confirm
the validity of such approach. In fact, the advantages
of distributing the management process are (i) an
easier and more precise localization of the cause of
QoS problems, (ii) a better knowledge of local
situations, (iii) a lower complexity for a single QoS
agent and (iv) an increase in possible actions.",
acknowledgement = ack-nhfb,
remark = "Special Issue QoS in Wired and Wireless IP Networks.",
}
@Article{Berbecaru:2010:FSM,
author = "Diana Berbecaru and Luca Albertalli and Antonio Lioy",
title = "The {ForwardDiffsig} scheme for multicast
authentication",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "6",
pages = "1855--1868",
month = dec,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2010.2052927",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:17 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bobba:2010:ABM,
author = "Rakesh Bobba and Omid Fatemieh and Fariba Khan and
Arindam Khan and Carl A. Gunter and Himanshu Khurana
and Manoj Prabhakaran",
title = "Attribute-Based Messaging: Access Control and
Confidentiality",
journal = j-TISSEC,
volume = "13",
number = "4",
pages = "31:1--31:??",
month = dec,
year = "2010",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1880022.1880025",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Attribute-Based Messaging (ABM) enables messages to be
addressed using attributes of recipients rather than an
explicit list of recipients. Such messaging offers
benefits of efficiency, exclusiveness, and
intensionality, but faces challenges in access control
and confidentiality. In this article we explore an
approach to intraenterprise ABM based on providing
access control and confidentiality using information
from the same attribute database exploited by the
addressing scheme. We show how to address three key
challenges. First, we demonstrate a manageable access
control system based on attributes. Second, we
demonstrate use of attribute-based encryption to
provide end-to-end confidentiality. Third, we show that
such a system can be efficient enough to support ABM
for mid-size enterprises.",
acknowledgement = ack-nhfb,
articleno = "31",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Book{Bohme:2010:ASS,
author = "Rainer B{\"o}hme",
title = "Advanced Statistical Steganalysis",
volume = "0",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xv + 285",
year = "2010",
DOI = "https://doi.org/10.1007/978-3-642-14313-7",
ISBN = "3-642-14312-1, 3-642-14313-X (e-book)",
ISBN-13 = "978-3-642-14312-0, 978-3-642-14313-7 (e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.A25 B64 2010; TA1637-1638; Z104 .B68 2010",
bibdate = "Sat Jun 10 08:35:01 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/978-3-642-14313-7",
abstract = "Steganography is the art and science of hiding
information in inconspicuous cover data so that even
the existence of a secret message is kept confidential,
and steganalysis is the task of detecting secret
messages in covers. This research monograph focuses on
the role of cover signals, the distinguishing feature
that requires us to treat steganography and
steganalysis differently from other secrecy techniques.
The main theoretical contribution of this book is a
proposal to structure approaches to provably secure
steganography according to their implied assumptions on
the limits of the adversary and on the nature of
covers. A further contribution is the emphasis on
dealing with heterogeneity in cover distributions,
crucial for security analyses. The author's work
complements earlier approaches based on information,
complexity, probability and signal processing theory,
and he presents numerous practical implications. The
scientific advances are supported by a survey of the
classical steganography literature; a new proposal for
a unified terminology and notation that is maintained
throughout this book; a critical discussion of the
results achieved and their limitations; and an
assessment of the possibility of transferring elements
of this research's empirical perspective to other
domains in information security. This book is suitable
for researchers working in cryptography and information
security, practitioners in the corporate and national
security domains, and graduate students specializing in
multimedia security and data hiding.",
acknowledgement = ack-nhfb,
author-dates = "1978--",
shorttableofcontents = "Background and Advances in Theory \\
Principles of Modern Steganography and Steganalysis \\
Towards a Theory of Cover Models \\
Specific Advances in Steganalysis \\
Detection of Model-Based Steganography with First-Order
Statistics \\
Models of Heterogeneous Covers for Quantitative
Steganalysis \\
Improved Weighted Stego Image Steganalysis \\
Using Encoder Artefacts for Steganalysis of Compressed
Audio Streams \\
Synthesis \\
General Discussion",
subject = "Cryptography; Data encryption (Computer science);
Cryptographie; Chiffrement (Informatique);
Cryptography; Data encryption (Computer science)",
tableofcontents = "1 Introduction / 1 \\
1.1 Steganography and Steganalysis as Empirical
Sciences / 1 \\
1.2 Objective and Approach / 2 \\
1.3 Outline / 4 \\
Part I Background and Advances in Theory \\
2 Principles of Modern Steganography and Steganalysis /
11 \\
2.1 Digital Steganography and Steganalysis / 11 \\
2.1.1 Steganographic System / 12 \\
2.1.2 Steganalysis / 13 \\
2.1.3 Relevance in Social and Academic Contexts / 13
\\
2.2 Conventions / 14 \\
2.3 Design Goals and Metrics / 17 \\
2.3.1 Capacity / 17 \\
2.3.2 Steganographic Security / 18 \\
2.3.3 Robustness / 21 \\
2.3.4 Further Metrics / 22 \\
2.4 Paradigms for the Design of Steganographic Systems
/ 22 \\
2.4.1 Paradigm I: Modify with Caution / 22 \\
2.4.2 Paradigm II: Cover Generation / 23 \\
2.4.3 Dominant Paradigm / 25 \\
2.5 Adversary Models / 26 \\
2.5.1 Passive Warden / 26 \\
2.5.2 Active Warden / 28 \\
2.6 Embedding Domains / 30 \\
2.6.1 Artificial Channels / 30 \\
2.6.2 Spatial and Time Domains / 31 \\
2.6.3 Transformed Domain / 31 \\
2.6.4 Selected Cover Formats: JPEG and MP3 / 35 \\
2.6.5 Exotic Covers / 38 \\
2.7 Embedding Operations / 39 \\
2.7.1 LSB Replacement / 40 \\
2.7.2 LSB Matching ($\pm 1$) / 41 \\
2.7.3 Mod-k Replacement, Mod-A; Matching, and
Generalisations / 45 \\
2.7.4 Multi-Sample Rules / 47 \\
2.7.5 Adaptive Embedding / 48 \\
2.8 Protocols and Message Coding / 49 \\
2.8.1 Public-Key Steganography / 50 \\
2.8.2 Maximising Embedding Efficiency / 53 \\
2.9 Specific Detection Techniques / 57 \\
2.9.1 Calibration of JPEG Histograms / 57 \\
2.9.2 Universal Detectors / 60 \\
2.9.3 Quantitative Steganalysis / 63 \\
2.10 Selected Estimators for LSB Replacement in Spatial
Domain Images / 64 \\
2.10.1 RS Analysis / 64 \\
2.10.2 Sample Pair Analysis / 67 \\
2.10.3 Higher-Order Structural Steganalysis / 69 \\
2.10.4 Weighted Stego Image Steganalysis / 73 \\
2.11 Summary and Further Steps / 76 \\
Towards a Theory of Cover Models / 79 \\
3.1 Steganalyst 's Problem Formalised / 79 \\
3.1.1 The Plausibility Heuristic / 79 \\
3.1.2 Application to Digital Steganography / 81 \\
3.1.3 Incognisability of the Cover Distribution / 83
\\
3.2 Cover Models / 84 \\
3.2.1 Defining Cover Models / 84 \\
3.2.2 Options for Formulating Cover Models / 86 \\
3.2.3 Cover Models and Detection Performance / 88 \\
3.2.4 Summary and Motivations for Studying Cover Models
/ 92 \\
3.3 Dealing with Heterogeneous Cover Sources / 93 \\
3.3.1 Mixture Distributions / 95 \\
3.3.2 The Mixture Cover Model / 95 \\
3.4 Relation to Prior Information-Theoretic Work / 97
\\
3.4.1 Theoretical Limits / 98 \\
3.4.2 Observability Bounds / 99 \\
3.4.3 Computational Bounds / 101 \\
3.4.4 Applicability of the Theory of Cover Models / 102
\\
3.4.5 Indeterminacy in the Cover / 104 \\
3.5 Instances of Cover Models for Heterogeneous Sources
/ 106 \\
3.6 Summary / 107 \\
Part II Specific Advances in Steganalysis \\
4 Detection of Model-Based Steganography with
First-Order Statistics Ill 4.1 Fundamentals of
Model-Based Steganography Ill 4.2 MB1: An Embedding
Function for JPEG Covers / 114 \\
4.3 Detection Method / 117 \\
4.4 Experimental Validation / 120 \\
4.5 Summary and Outlook / 123 \\
4.5.1 Limitations and Future Directions / 124 \\
4.5.2 Possible (Short-Term) Countermeasures / 125 \\
4.5.3 Implications for More Secure Steganography / 126
\\
5 Models of Heterogeneous Covers for Quantitative
Steganalysis / 127 \\
5.1 Metrics for Quantitative Steganalysis / 128 \\
5.1.1 Conventional Metrics / 128 \\
5.1.2 Improved Metrics Based on a Distribution Model /
130 \\
5.1.3 Decomposition of Estimation Errors / 135 \\
5.2 Measurement of Sensitivity to Cover Properties /
141 \\
5.2.1 Method / 142 \\
5.2.2 Modelling the Shape of the Between-Image
Distribution / 144 \\
5.2.3 Modelling the Shape of the Within-Image
Distribution / 148 \\
5.3 Summary and Conclusion / 151 \\
6 Improved Weighted Stego Image Steganalysis / 155 \\
6.1 Enhanced WS for Never-Compressed Covers / 155 \\
6.1.1 Enhanced Predictor / 156 \\
6.1.2 Enhanced Calculation of Weights / 161 \\
6.1.3 Enhanced Bias Correction / 166 \\
6.1.4 Experimental Results / 166 \\
6.2 Adaptation of WS to JPEG Pre-Compressed Covers /
172 \\
6.2.1 Improved Predictor / 173 \\
6.2.2 Estimation of the Cover's JPEG Compression
Quality / 176 \\
6.2.3 Experimental Results / 177 \\
6.3 Summary and Outlook / 182 \\
7 Using Encoder Artefacts for Steganalysis of
Compressed Audio Streams / 183 \\
7.1 MP3 Steganography and Steganalysis / 183 \\
7.1.1 Problem Statement in the Mixture Cover Model
Framework / 185 \\
7.1.2 Level of Analysis and Related Work / 185 \\
7.1.3 Method / 187 \\
7.2 Description of Features / 189 \\
7.2.1 Features Based on the Compression Size Control
Mechanism / 190 \\
7.2.2 Features Based on Model Decisions / 192 \\
7.2.3 Features Based on Capability Usage / 194 \\
7.2.4 Feature Based on Stream Formatting / 195 \\
7.3 Experimental Results for Encoder Detection / 196
\\
7.3.1 Single-Compressed Audio Files / 196 \\
7.3.2 Importance of Individual Features / 199 \\
7.3.3 Influence of Double-Compression / 199 \\
7.4 Experimental Results for Improved Steganalysis /
201 \\
7.5 Explorative Analysis of Encoder Similarities / 202
\\
7.6 Summary and Discussion / 204 \\
7.6.1 Limitations and Future Directions / 204 \\
7.6.2 Transferability to Other Formats / 205 \\
7.6.3 Related Applications / 206 \\
Part III Synthesis \\
8 General Discussion / 209 \\
8.1 Summary of Results / 209 \\
8.1.1 Results Based on Informal Arguments / 209 \\
8.1.2 Results Based on Mathematical Proofs / 210 \\
8.1.3 Results Based on Empirical Evidence / 211 \\
8.2 Limitations / 212 \\
8.3 Directions for Future Research / 213 \\
8.3.1 Theoretical Challenges / 214 \\
8.3.2 Empirical Challenges / 214 \\
8.3.3 Practical Challenges / 215 \\
8.4 Conclusion and Outlook / 215 \\
A Description of Covers Used in the Experiments / 219
\\
B Spurious Steganalysis Results Using the 'van Hateren'
Image Database / 223 \\
C Proof of Weighted Stego Image (WS) Estimator / 227
\\
D Derivation of Linear Predictor for Enhanced WS / 229
\\
E Game for Formal Security Analysis / 231 \\
F Derivation of ROC Curves and AUC Metric for Example
Cover Models / 233 \\
G Supplementary Figures and Tables / 235 \\
References / 245 \\
List of Tables / 263 \\
List of Figures / 266 \\
List of Acronyms / 269 \\
List of Symbols / 272 \\
List of Functions / 278 \\
Index / 280",
xxpages = "xvi + 288",
xxpages = "xii + 285",
}
@PhdThesis{Borghoff:2010:CLC,
author = "Julia Borghoff",
title = "Cryptanalysis of lightweight ciphers",
type = "{Ph.D.} thesis",
school = "Department of Mathematics, Technical University of
Denmark",
address = "Lyngby, Denmark",
pages = "x + 198",
year = "2010",
bibdate = "Fri May 13 07:36:47 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Brakerski:2010:OHB,
author = "Z. Brakerski and Y. T. Kalai and J. Katz and V.
Vaikuntanathan",
title = "Overcoming the Hole in the Bucket: Public-Key
Cryptography Resilient to Continual Memory Leakage",
crossref = "IEEE:2010:PIA",
pages = "501--510",
year = "2010",
DOI = "https://doi.org/10.1109/FOCS.2010.55",
bibdate = "Thu Apr 12 09:34:12 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/focs2010.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5669376",
}
@Article{Brooke:2010:DCX,
author = "Phillip J. Brooke and Richard F. Paige and Christopher
Power",
title = "Document-centric {XML} workflows with fragment digital
signatures",
journal = j-SPE,
volume = "40",
number = "8",
pages = "655--672",
month = jul,
year = "2010",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.974",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Jun 21 17:09:48 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Software---Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "7 May 2010",
}
@Article{Brumley:2010:CAI,
author = "B. B. Brumley and K. U. Jarvinen",
title = "Conversion Algorithms and Implementations for
{Koblitz} Curve Cryptography",
journal = j-IEEE-TRANS-COMPUT,
volume = "59",
number = "1",
pages = "81--92",
month = jan,
year = "2010",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2009.132",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sun Jul 3 11:52:25 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5255226",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Book{Buchmann:2010:EKG,
author = "Johannes Buchmann",
title = "Einf{\"u}hrung in die Kryptographie. ({German})
[{Introduction} to Cryptography]",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xxiv + 280",
year = "2010",
ISBN = "3-642-11186-6",
ISBN-13 = "978-3-642-11186-0",
LCCN = "????",
bibdate = "Thu Apr 21 17:40:25 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.gbv.de:20011/gvk",
series = "Springer-Lehrbuch",
URL = "http://www.springer.com/mathematics/numbers/book/978-3-642-11185-3;
http://www.springerlink.com/content/j5g004",
acknowledgement = ack-nhfb,
language = "German",
subject = "Mathematics; Data structures (Computer science); Data
encryption (Computer science); Combinatorics; Number
theory",
}
@Article{Bulygin:2010:AOP,
author = "Stanislav Bulygin",
title = "Abstract only: {Polynomial} system solving for
decoding linear codes and algebraic cryptanalysis
parametric polynomial system discussion: canonical
comprehensive",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "72--72",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838626",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "This book that represents the author's Ph. D. thesis
is devoted to applying symbolic methods to the problems
of decoding linear codes and of algebraic
cryptanalysis. The paradigm we employ here is as
follows. We reformulate the initial problem in terms of
systems of polynomial equations over a finite field.
The solution(s) of such systems should yield a way to
solve the initial problem. Our main tools for handling
polynomials and polynomial systems in such a paradigm
is the technique of Gr{\"o}bner bases and normal form
reductions.\par
The first part of the book is devoted to formulating
and solving specific polynomial systems that reduce the
problem of decoding linear codes to the problem of
polynomial system solving. We analyze the existing
methods (mainly for the cyclic codes) and propose an
original method for arbitrary linear codes that in some
sense generalizes the Newton identities method widely
known for cyclic codes. We investigate the structure of
the underlying ideals and show how one can solve the
decoding problem -- both the so-called bounded decoding
and more general nearest codeword decoding -- by
finding reduced Gr{\"o}bner bases of these ideals. The
main feature of the method is that unlike usual methods
based on Gr{\"o}bner bases for 'finite field'
situations, we do not add the so-called field
equations. This tremendously simplifies the underlying
ideals, thus making feasible working with quite large
parameters of codes. Further we address complexity
issues, by giving some insight to the Macaulay matrix
of the underlying systems. By making a series of
assumptions we are able to provide an upper bound for
the complexity coefficient of our method. We address
also finding the minimum distance and the weight
distribution. We provide solid experimental material
and comparisons with some of the existing methods in
this area.\par
In the second part we deal with the algebraic
cryptanalysis of block iterative ciphers. Namely, we
analyze the small-scale variants of the Advanced
Encryption Standard (AES), which is a widely used
modern block cipher. Here a cryptanalyst composes the
polynomial systems which solutions should yield a
secret key used by communicating parties in a symmetric
cryptosystem. We analyze the systems formulated by
researchers for the algebraic cryptanalysis, and
identify the problem that conventional systems have
many auxiliary variables that are not actually needed
for the key recovery. Moreover, having many such
auxiliary variables, specific to a given
plaintext/ciphertext pair, complicates the use of
several pairs which is common in cryptanalysis. We thus
provide a new system where the auxiliary variables are
eliminated via normal form reductions. The resulting
system in key-variables only is then solved. We present
experimental evidence that such an approach is quite
good for small scaled ciphers. We investigate further
our approach and employ the so-called
meet-in-the-middle principle to see how far one can go
in analyzing just 2--3 rounds of scaled ciphers.
Additional 'tuning techniques' are discussed together
with experimental material. Overall, we believe that
the material of this part of the thesis makes a step
further in algebraic cryptanalysis of block
ciphers.\par
A short description of the thesis is on the KLUDO
webpage:
http://kluedo.ub.uni-kl.de/volltexte/2009/2350/.",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
}
@Book{Bulygin:2010:CAC,
author = "Stanislav Bulygin",
title = "Computer algebra in coding theory and cryptanalysis",
publisher = "S{\"u}dwestdeutscher Verlag f{\"u}r
Hochschulschriften",
address = "Saarbr{\"u}cken, Germany",
pages = "????",
year = "2010",
ISBN = "3-8381-0948-1",
ISBN-13 = "978-3-8381-0948-0",
LCCN = "????",
bibdate = "Fri May 13 06:47:50 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Article{Bulygin:2010:OSS,
author = "Stanislav Bulygin and Michael Brickenstein",
title = "Obtaining and Solving Systems of Equations in Key
Variables Only for the Small Variants of {AES}",
journal = j-MATH-COMPUT-SCI,
volume = "3",
number = "2",
pages = "185--200",
month = apr,
year = "2010",
CODEN = "????",
ISSN = "1661-8270 (print), 1661-8289 (electronic)",
ISSN-L = "1661-8270",
bibdate = "Sun Aug 22 09:02:18 MDT 2010",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1661-8270&volume=3&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1661-8270&volume=3&issue=2&spage=185",
abstract = "This work is devoted to attacking the small scale
variants of the Advanced Encryption Standard (AES) via
systems that contain only the initial key variables. To
this end, we investigate a system of equations that
naturally arises in the AES, and then introduce an
elimination of all the intermediate variables via
normal form reductions. The resulting system in key
variables only is solved then. We also consider a
possibility to apply our method in the
meet-in-the-middle scenario especially with several
plaintext\slash ciphertext pairs. We elaborate on the
method further by looking for subsystems which contain
fewer variables and are overdetermined, thus
facilitating solving the large system.",
acknowledgement = ack-nhfb,
fjournal = "Mathematics in Computer Science",
journal-URL = "http://www.springerlink.com/content/1661-8270/",
}
@Article{Burns:2010:SCR,
author = "Randal Burns and Zachary Peterson",
title = "Security constructs for regulatory-compliant storage",
journal = j-CACM,
volume = "53",
number = "1",
pages = "126--130",
month = jan,
year = "2010",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1629175.1629206",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Feb 4 17:12:32 MST 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "In response to a growing body of electronic records
legislation, the storage community has enhanced data
stores to include privacy, auditability, and a
'chain-of-custody' for data. There are currently over
4,000 federal, state, and local regulations that govern
the storage, management, and retrieval of electronic
records. Most notably, the Sarbanes--Oxley Act of 2002,
which regulates corporate financial records. Storage
vendors provide 'compliance' platforms that store and
manage data in accordance with regulations, which aids
customers in meeting compliance guidelines. Examples
include: EMC Centera Compliance Edition,\TM{} NetApp
SnapLock,\TM{} and IBM Tivoli Security Compliance
Manage.\TM{}\par
Many of these platforms add storage management policy
to existing systems. Vendors start with systems that
manage versions of files or volumes. They add
immutability to past versions by preventing writes by
policy. They also enforce data retention guidelines by
not allowing the deletion of protected files. Enhanced
metadata allows users and auditors to examine the store
at any point-in-time and investigate the manner in
which data have changed throughout their
history.\par
While these features aid organizations in complying
with regulations, they do not provide strong evidence
of compliance. By following storage management
policies, data are versioned and retained for mandated
periods. However, there are many opportunities and
motivations to subvert such storage policies. In fact,
the file system owner represents the most likely
attacker. For example, a corporation might alter or
destroy data after the corporation comes under
suspicion of malfeasance. The shredding of Enron audit
documents at Arthur Anderson in 2001 provides a notable
paper analog. Similarly, a hospital or private medical
practice might attempt to amend or delete a patient's
medical records to hide evidence of malpractice. In
policy-based storage systems, past data may be altered
or destroyed by reverse engineering file system formats
and editing the file data on disk--a common and well
understood data forensics task.\par
We assert that these features need to be
cryptographically strong, providing irrefutable
evidence of compliance with regulations. This can be
achieved for data retention and chain of custody. A
storage system commits to a version history so that, at
a later time, an auditor may access past data and gain
conclusive evidence that the data have been retained
and are unmodified. Further, all data should be bound
to the users that modify, create, or delete that data.
Such constructs improve the evidentiary value of
electronic records within the courts, increase an
auditor's confidence in the veracity of the information
on which they report (and for which they are
responsible), and enhance an organization's quality of
data management.\par
To these ends, we review three security constructs for
versioning file systems. {\em Digital audit trails\/}
allow a file system to prove to an independent auditor
that it stored data in conformance with regulated
retention guidelines. {\em Fine-grained, secure
deletion\/} allows a system to efficiently delete
individual versions of files to meet confidentiality
requirements, limit liability, and allow data to be
redacted. {\em Per-block authenticated encryption\/}
adds authenticity guarantees to the confidentiality
provided by encryption. We also include a distillation
of requirements based on a review of relevant
legislation and a brief characterization of the
performance impact of these techniques based on their
implementation within the ext3cow file system.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Cachin:2010:EKS,
author = "Christian Cachin and Jan Camenisch",
title = "Encrypting Keys Securely",
journal = j-IEEE-SEC-PRIV,
volume = "8",
number = "4",
pages = "66--69",
month = jul # "\slash " # aug,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2010.124",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Jul 27 16:38:19 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Caranay:2010:ESP,
author = "Perlas C. Caranay and Renate Scheidler",
title = "An Efficient Seventh Power Residue Symbol Algorithm",
journal = j-INT-J-NUMBER-THEORY,
volume = "6",
number = "8",
pages = "1831--1853",
month = dec,
year = "2010",
DOI = "https://doi.org/10.1142/S1793042110003770",
ISSN = "1793-0421 (print), 1793-7310 (electronic)",
ISSN-L = "1793-0421",
bibdate = "Tue Jul 21 10:01:24 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijnt.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S1793042110003770",
abstract = "Power residue symbols and their reciprocity laws have
applications not only in number theory, but also in
other fields like cryptography. A crucial ingredient in
certain public key cryptosystems is a fast algorithm
for computing power residue symbols. Such algorithms
have only been devised for the Jacobi symbol as well as
for cubic and quintic power residue symbols, but for no
higher powers. In this paper, we provide an efficient
procedure for computing 7th power residue symbols. The
method employs arithmetic in the field {$ \mathbb {Q}
$}(\zeta), with \zeta a primitive 7th root of unity,
and its ring of integers {\mathbb{Z}}[\zeta ]. We give
an explicit characterization for an element in
{\mathbb{Z}}[\zeta ] to be primary, and provide an
algorithm for finding primary associates of integers in
{\mathbb{Z}}[\zeta ]. Moreover, we formulate explicit
forms of the complementary laws to Kummer's 7th degree
reciprocity law, and use Lenstra's norm-Euclidean
algorithm in the cyclotomic field.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Number Theory (IJNT)",
journal-URL = "https://www.worldscientific.com/worldscinet/ijnt",
}
@Article{Carter:2010:TB,
author = "Frank Carter",
title = "The {Turing Bombe}",
journal = j-RUTHERFORD-J,
volume = "3",
number = "??",
pages = "??--??",
month = "????",
year = "2010",
CODEN = "????",
ISSN = "1177-1380",
ISSN-L = "1177-1380",
bibdate = "Mon Jan 4 09:52:24 MST 2016",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/rutherfordj.bib",
URL = "http://rutherfordjournal.org/article030108.html",
acknowledgement = ack-nhfb,
fjournal = "Rutherford Journal",
journal-URL = "http://rutherfordjournal.org/",
}
@Article{Casselman:2010:VC,
author = "Bill Casselman",
title = "Visible Cryptography",
journal = j-NAMS,
volume = "57",
number = "3",
pages = "378--379",
month = mar,
year = "2010",
CODEN = "AMNOAN",
ISSN = "0002-9920 (print), 1088-9477 (electronic)",
ISSN-L = "0002-9920",
bibdate = "Mon Feb 22 15:35:29 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.ams.org/notices/201003/",
acknowledgement = ack-nhfb,
fjournal = "Notices of the American Mathematical Society",
journal-URL = "http://www.ams.org/notices/",
keywords = "2-D barcodes",
}
@InProceedings{Chang:2010:PRN,
author = "Weiling Chang and Binxing Fang and Xiaochun Yun and
Shupeng Wang and Xiangzhan Yu",
booktitle = "{2010 Data Compression Conference (DCC)}",
title = "A pseudo-random number generator based on {LZSS}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "524",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.77",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453503",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5453382",
keywords = "L12RC4; LZSS compression algorithm; RC4 stream
cipher",
}
@InProceedings{Chari:2010:DSC,
author = "Suresh Chari and Vincenzo V. Diluoffo and Paul A.
Karger and Elaine R. Palmer and Tal Rabin and Josyula
R. Rao and Pankaj Rohatgi and Helmut Scherzer and
Michael Steiner and David C. Toll",
title = "Designing a Side Channel Resistant Random Number
Generator",
crossref = "Gollmann:2010:SCR",
pages = "49--64",
year = "2010",
DOI = "https://doi.org/10.1007/978-3-642-12510-2_5",
bibdate = "Thu Feb 10 12:53:16 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.informatik.uni-trier.de/~ley/db/conf/cardis/cardis2010.html#ChariDKPRRRSST10",
abstract = "This paper describes the design of the random number
generator (RNG) in the Caernarvon high assurance smart
card operating system. Since it is used in the
generation of cryptographic keys and other sensitive
materials, the RNG has a number of stringent security
requirements that the random bits must be of good
quality, i.e., the bits must not be predictable or
biased. To this end, a number of standards such as the
German AIS 31 mandate that true random bits be
continuously tested before use in sensitive
applications such as key generation. A key issue in
implementing this standard is that such testing before
use in key generation greatly increases the attack
surface for side-channel attacks. For example, template
attacks which can extract information about the random
bits from even a single run provided we use the same
bits at many different points in the computation.
Because of these potential risks, the Caernarvon
operating system uses pseudo random number generators
which are initially seeded by externally generated high
quality random bits, and then perturbed by bits from
the true random number generator. We describe a PRNG
design which yields high quality random bits while also
ensuring that it is not susceptible to side-channel
attacks and provide an informal argument about its
effectiveness.",
acknowledgement = ack-nhfb,
}
@Article{Chen:2010:ALD,
author = "Songqing Chen and Shiping Chen and Xinyuan Wang and
Zhao Zhang and Sushil Jajodia",
title = "An Application-Level Data Transparent Authentication
Scheme without Communication Overhead",
journal = j-IEEE-TRANS-COMPUT,
volume = "59",
number = "7",
pages = "943--954",
month = jul,
year = "2010",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2010.80",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sun Jul 3 11:52:30 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453339",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Chen:2010:IFA,
author = "Lanxiang Chen and Dan Feng and Yu Zhang and Lingfang
Zeng and Zhongying Niu",
title = "Integrating {FPGA\slash ASIC} into cryptographic
storage systems to avoid re-encryption",
journal = j-INT-J-PAR-EMER-DIST-SYS,
volume = "25",
number = "2",
pages = "105--122",
year = "2010",
CODEN = "????",
ISSN = "1744-5760 (print), 1744-5779 (electronic)",
ISSN-L = "1744-5760",
bibdate = "Thu Sep 2 08:12:38 MDT 2010",
bibsource = "http://www.informaworld.com/smpp/title~content=t713729127~link=cover;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://www.tandfonline.com/loi/gpaa20",
}
@Article{Chen:2010:NUP,
author = "Tzung-Her Chen and Jyun-Ci Huang",
title = "A novel user-participating authentication scheme",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "5",
pages = "861--867",
month = may,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Cheneau:2010:SIP,
author = "Tony Cheneau and Aymen Boudguiga and Maryline
Laurent",
title = "Significantly improved performances of the
cryptographically generated addresses thanks to {ECC}
and {GPGPU}",
journal = j-COMPUT-SECUR,
volume = "29",
number = "4",
pages = "419--431",
month = jun,
year = "2010",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:20 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404809001461",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Chevalier:2010:CSC,
author = "Yannick Chevalier and Micha{\"e}l Rusinowitch",
title = "Compiling and securing cryptographic protocols",
journal = j-INFO-PROC-LETT,
volume = "110",
number = "3",
pages = "116--122",
day = "1",
month = jan,
year = "2010",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 12:46:29 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Chmielowiec:2010:FPR,
author = "Andrzej Chmielowiec",
title = "Fixed points of the {RSA} encryption algorithm",
journal = j-THEOR-COMP-SCI,
volume = "411",
number = "1",
pages = "288--292",
day = "1",
month = jan,
year = "2010",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 17:10:22 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Chou:2010:PSO,
author = "Cheng-Fu Chou and William C. Cheng and Leana
Golubchik",
title = "Performance study of online batch-based digital
signature schemes",
journal = j-J-NETW-COMPUT-APPL,
volume = "33",
number = "2",
pages = "98--114",
month = mar,
year = "2010",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:40 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804509001374",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@MastersThesis{Choudary:2010:SCD,
author = "Omar S. Choudary",
title = "The {Smart Card} Detective: a hand-held {EMV}
interceptor",
type = "{M. Phil. dissertation in Advance Computer Science}",
school = "Computer Laboratory, Darwin College, University of
Cambridge",
address = "Cambridge, UK",
pages = "57",
month = jun,
year = "2010",
bibdate = "Thu Nov 04 15:01:34 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.cl.cam.ac.uk/~osc22/docs/mphil_acs_osc22.pdf;
http://www.cl.cam.ac.uk/~osc22/scd/;
http://www.lightbluetouchpaper.org/2010/10/19/the-smart-card-detective-a-hand-held-emv-interceptor/",
abstract = "Several vulnerabilities have been found in the EMV
system (also known as Chip and PIN). Saar Drimer and
Steven Murdoch have successfully implemented a relay
attack against EMV using a fake terminal. Recently the
same authors have found a method to successfully
complete PIN transactions without actually entering the
correct PIN. The press has published this vulnerability
but they reported such scenario as being hard to
execute in practice because it requires specialized and
complex hardware.\par
As proposed by Ross Anderson and Mike Bond in 2006, I
decided to create a miniature man-in-the-middle device
to defend smartcard users against relay attacks.\par
As a result of my MPhil project work I created a
hand-held device, called Smart Card Defender (SCD),
which intercepts the communication between smartcard
and terminal. The device has been built using a low
cost ATMEL AT90USB1287 microcontroller and other
readily available electronic components. The total cost
of the SCD has been around \$100, but an industrial
version could be produced for less than\$20.\par
I implemented several applications using the SCD,
including the defense against the relay attack as well
as the recently discovered vulnerability to complete a
transaction without using the correct PIN.\par
All the applications have been successfully tested on
CAP readers and live terminals. Even more, I have
performed real tests using the SCD at several shops in
town.\par
From the experiments using the SCD, I have noticed some
particularities of the CAP protocol compared to the EMV
standard. I have also discovered that the smartcard
does not follow the physical transport protocol
exactly. Such ndings are presented in detail, along
with a discussion of the results.",
acknowledgement = ack-nhfb,
}
@Article{Ciriani:2010:CFE,
author = "Valentina Ciriani and Sabrina {De Capitani Di
Vimercati} and Sara Foresti and Sushil Jajodia and
Stefano Paraboschi and Pierangela Samarati",
title = "Combining fragmentation and encryption to protect
privacy in data storage",
journal = j-TISSEC,
volume = "13",
number = "3",
pages = "22:1--22:??",
month = jul,
year = "2010",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1805974.1805978",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Jul 28 14:57:15 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "The impact of privacy requirements in the development
of modern applications is increasing very quickly. Many
commercial and legal regulations are driving the need
to develop reliable solutions for protecting sensitive
information whenever it is stored, processed, or
communicated to external parties. To this purpose,
encryption techniques are currently used in many
scenarios where data protection is required since they
provide a layer of protection against the disclosure of
personal information, which safeguards companies from
the costs that may arise from exposing their data to
privacy breaches. However, dealing with encrypted data
may make query processing more expensive.\par
In this article, we address these issues by proposing a
solution to enforce the privacy of data collections
that combines data fragmentation with encryption. We
model privacy requirements as confidentiality
constraints expressing the sensitivity of attributes
and their associations. We then use encryption as an
underlying (conveniently available) measure for making
data unintelligible while exploiting fragmentation as a
way to break sensitive associations among attributes.
We formalize the problem of minimizing the impact of
fragmentation in terms of number of fragments and their
affinity and present two heuristic algorithms for
solving such problems. We also discuss experimental
results, comparing the solutions returned by our
heuristics with respect to optimal solutions, which
show that the heuristics, while guaranteeing a
polynomial-time computation cost are able to retrieve
solutions close to optimum.",
acknowledgement = ack-nhfb,
articleno = "22",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "encryption; fragmentation; Privacy",
}
@InBook{Ciriani:2010:TPA,
author = "Valentina Ciriani and Sabrina {De Capitani di
Vimercati} and Sara Foresti and Pierangela Samarati",
title = "Theory of Privacy and Anonymity",
crossref = "Atallah:2010:ATC",
chapter = "18",
pages = "1--35",
year = "2010",
DOI = "https://doi.org/10.1201/9781584888215-c18",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.crcnetbase.com/doi/abs/10.1201/9781584888215-c18",
acknowledgement = ack-nhfb,
}
@Article{Comon-Lundh:2010:DSP,
author = "Hubert Comon-Lundh and V{\'e}ronique Cortier and Eugen
Z{\~a}linescu",
title = "Deciding security properties for cryptographic
protocols. Application to key cycles",
journal = j-TOCL,
volume = "11",
number = "2",
pages = "9:1--9:??",
month = jan,
year = "2010",
CODEN = "????",
ISSN = "1529-3785",
ISSN-L = "1529-3785",
bibdate = "Tue Mar 16 08:57:57 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tocl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on Computational Logic",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J773",
}
@InBook{Conitzer:2010:AP,
author = "Vincent Conitzer",
title = "Auction Protocols",
crossref = "Atallah:2010:ATC",
chapter = "16",
pages = "1--19",
year = "2010",
DOI = "https://doi.org/10.1201/9781584888215-c16",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.crcnetbase.com/doi/abs/10.1201/9781584888215-c16",
acknowledgement = ack-nhfb,
}
@Article{Copeland:2010:CBG,
author = "B. Jack Copeland",
title = "{Colossus}: Breaking the {German} `{Tunny}' Code at
{Bletchley Park}. {An} Illustrated History",
journal = j-RUTHERFORD-J,
volume = "3",
number = "??",
pages = "??--??",
month = "????",
year = "2010",
CODEN = "????",
ISSN = "1177-1380",
ISSN-L = "1177-1380",
bibdate = "Mon Jan 4 09:52:24 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/rutherfordj.bib",
URL = "http://rutherfordjournal.org/article030109.html",
acknowledgement = ack-nhfb,
fjournal = "Rutherford Journal",
journal-URL = "http://rutherfordjournal.org/",
}
@Article{Daemen:2010:FYA,
author = "Joan Daemen and Vincent Rijmen",
title = "The First 10 Years of Advanced Encryption",
journal = j-IEEE-SEC-PRIV,
volume = "8",
number = "6",
pages = "72--74",
month = nov # "\slash " # dec,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2010.193",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Dec 15 15:02:36 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{DeCapitaniDiVimercati:2010:EPR,
author = "Sabrina {De Capitani Di Vimercati} and Sara Foresti
and Sushil Jajodia and Stefano Paraboschi and
Pierangela Samarati",
title = "Encryption policies for regulating access to
outsourced data",
journal = j-TODS,
volume = "35",
number = "2",
pages = "12:1--12:??",
month = apr,
year = "2010",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/1735886.1735891",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Apr 28 13:44:08 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Current access control models typically assume that
resources are under the strict custody of a trusted
party which monitors each access request to verify if
it is compliant with the specified access control
policy. There are many scenarios where this approach is
becoming no longer adequate. Many clear trends in Web
technology are creating a need for owners of sensitive
information to manage access to it by legitimate users
using the services of {\em honest but curious\/} third
parties, that is, parties trusted with providing the
required service but not authorized to read the actual
data content. In this scenario, the data owner encrypts
the data before outsourcing and stores them at the
server. Only the data owner and users with knowledge of
the key will be able to decrypt the data. Possible
access authorizations are to be enforced by the owner.
In this article, we address the problem of enforcing
selective access on outsourced data without need of
involving the owner in the access control process. The
solution puts forward a novel approach that combines
cryptography with authorizations, thus enforcing access
control via {\em selective encryption}. The article
presents a formal model for access control management
and illustrates how an authorization policy can be
translated into an equivalent encryption policy while
minimizing the amount of keys and cryptographic tokens
to be managed. The article also introduces a two-layer
encryption approach that allows the data owner to
outsource, besides the data, the complete management of
the authorization policy itself, thus providing
efficiency and scalability in dealing with policy
updates. We also discuss experimental results showing
that our approach is able to efficiently manage complex
scenarios.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Database Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
keywords = "Data outsourcing; encryption policy; privacy",
}
@Article{derhans:2010:USC,
author = "der.hans",
title = "Use {SSH} to cross a suspect host securely",
journal = j-LINUX-J,
volume = "2010",
number = "191",
pages = "3:1--3:??",
month = mar,
year = "2010",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Tue Nov 23 11:41:53 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@InBook{Desmedt:2010:CF,
author = "Yvo Desmedt",
title = "Cryptographic Foundations",
crossref = "Atallah:2010:ATC",
chapter = "9",
pages = "1--15",
year = "2010",
DOI = "https://doi.org/10.1201/9781584888215-c9",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.crcnetbase.com/doi/abs/10.1201/9781584888215-c9",
acknowledgement = ack-nhfb,
}
@InBook{Desmedt:2010:ES,
author = "Yvo Desmedt",
title = "Encryption Schemes",
crossref = "Atallah:2010:ATC",
chapter = "10",
pages = "1--30",
year = "2010",
DOI = "https://doi.org/10.1201/9781584888215-c10",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.crcnetbase.com/doi/abs/10.1201/9781584888215-c10",
acknowledgement = ack-nhfb,
}
@Article{Dharwadkar:2010:SSG,
author = "Nagaraj V. Dharwadkar and B. B. Amberker",
title = "Steganographic Scheme for Gray-Level Image Using Pixel
Neighborhood and {LSB} Substitution",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "10",
number = "4",
pages = "589--607",
month = oct,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467810003901",
ISSN = "0219-4678",
bibdate = "Thu Dec 9 21:06:32 MST 2010",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Dinoor:2010:PIM,
author = "Shlomi Dinoor",
title = "Privileged identity management: securing the
enterprise",
journal = j-NETWORK-SECURITY,
volume = "2010",
number = "12",
pages = "4--6",
month = dec,
year = "2010",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(10)70144-6",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:24 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485810701446",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{DiPietro:2010:HKS,
author = "Roberto {Di Pietro} and Luigi V. Mancini and
Alessandro Mei",
title = "Hierarchies of keys in secure multicast
communications",
journal = j-J-COMP-SECUR,
volume = "18",
number = "5",
pages = "839--860",
month = "????",
year = "2010",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2009-0384",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:24:50 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@InProceedings{Dodis:2010:CAC,
author = "Y. Dodis and K. Haralambiev and A. Lopez-Alt and D.
Wichs",
title = "Cryptography against Continuous Memory Attacks",
crossref = "IEEE:2010:PIA",
pages = "511--520",
year = "2010",
DOI = "https://doi.org/10.1109/FOCS.2010.56",
bibdate = "Thu Apr 12 09:34:12 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/focs2010.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5669376",
}
@Article{Drimer:2010:DBP,
author = "Saar Drimer and Tim G{\"u}neysu and Christof Paar",
title = "{DSPs}, {BRAMs}, and a Pinch of Logic: Extended
Recipes for {AES} on {FPGAs}",
journal = j-TRETS,
volume = "3",
number = "1",
pages = "3:1--3:??",
month = jan,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1661438.1661441",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Tue Mar 16 09:47:03 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
}
@Article{Eibach:2010:OGB,
author = "Tobias Eibach and Gunnar V{\"o}lkel and Enrico Pilz",
title = "Optimising {Gr{\"o}bner} Bases on {Bivium}",
journal = j-MATH-COMPUT-SCI,
volume = "3",
number = "2",
pages = "159--172",
month = apr,
year = "2010",
CODEN = "????",
ISSN = "1661-8270 (print), 1661-8289 (electronic)",
ISSN-L = "1661-8270",
bibdate = "Sun Aug 22 09:02:18 MDT 2010",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1661-8270&volume=3&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1661-8270&volume=3&issue=2&spage=159",
abstract = "Bivium is a reduced version of the stream cipher
Trivium. In this paper we investigate how fast a key
recovery attack on Bivium using Gr{\"o}bner bases is.
First we explain the attack scenario and the
cryptographic background. Then we identify the factors
that have impact on the computation time and show how
to optimise them. As a side effect these experiments
benchmark several Gr{\"o}bner basis implementations.
The optimised version of the Gr{\"o}bner attack has an
expected running time of $ 2^{39.12} $ s, beating the
attack time of our previous SAT solver attack by a
factor of more than 330. Furthermore this approach is
faster than an attack based on BDDs, an exhaustive key
search, a generic time-memory trade-off attack and a
guess-and-determine strategy.",
acknowledgement = ack-nhfb,
fjournal = "Mathematics in Computer Science",
journal-URL = "http://www.springerlink.com/content/1661-8270/",
}
@Book{Eisenbarth:2010:CCE,
author = "Thomas Eisenbarth",
title = "Cryptography and cryptanalysis for embedded systems",
volume = "11",
publisher = "Europ{\"a}ischer Universit{\"a}tsverlag",
address = "Berlin, Germany",
pages = "xiv + 193",
year = "2010",
ISBN = "3-89966-344-6",
ISBN-13 = "978-3-89966-344-0",
LCCN = "????",
bibdate = "Fri May 13 07:29:02 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "IT-Security",
acknowledgement = ack-nhfb,
remark = "Bochum University Dissertation.",
}
@Article{Fadlullah:2010:DCA,
author = "Zubair M. Fadlullah and Tarik Taleb and Athanasios V.
Vasilakos and Mohsen Guizani and Nei Kato",
title = "{DTRAB}: combating against attacks on encrypted
protocols through traffic-feature analysis",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "4",
pages = "1234--1247",
month = aug,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2039492",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:11 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fan:2010:AMI,
author = "Chun-I Fan and Ling-Ying Huang and Pei-Hsiu Ho",
title = "Anonymous Multireceiver Identity-Based Encryption",
journal = j-IEEE-TRANS-COMPUT,
volume = "59",
number = "9",
pages = "1239--1249",
month = sep,
year = "2010",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2010.23",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sun Jul 3 11:52:32 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5396332",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Fan:2010:PSN,
author = "Chun-I Fan and Pei-Hsiu Ho and Ruei-Hau Hsu",
title = "Provably secure nested one-time secret mechanisms for
fast mutual authentication and key exchange in mobile
communications",
journal = j-IEEE-TRANS-NETWORKING,
volume = "18",
number = "3",
pages = "996--1009",
month = jun,
year = "2010",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2009.2036366",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Mar 14 09:25:09 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@InProceedings{Faugere:2010:CLR,
author = "Jean-Charles Faug{\`e}re and Mohab Safey {El Din} and
Pierre-Jean Spaenlehauer",
title = "Computing loci of rank defects of linear matrices
using {Gr{\"o}bner} bases and applications to
cryptology",
crossref = "Watt:2010:IPI",
pages = "257--264",
year = "2010",
DOI = "https://doi.org/10.1145/1837934.1837984",
bibdate = "Fri Jun 17 08:06:37 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Article{Fehr:2010:QC,
author = "Serge Fehr",
title = "Quantum Cryptography",
journal = j-FOUND-PHYS,
volume = "40",
number = "5",
pages = "494--531",
month = may,
year = "2010",
CODEN = "FNDPA4",
DOI = "https://doi.org/10.1007/s10701-010-9408-4",
ISSN = "0015-9018 (print), 1572-9516 (electronic)",
ISSN-L = "0015-9018",
bibdate = "Tue Jun 11 20:39:34 MDT 2013",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0015-9018&volume=40&issue=5;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/foundphys.bib",
URL = "http://link.springer.com/article/10.1007/s10701-010-9408-4",
acknowledgement = ack-nhfb,
fjournal = "Foundations of Physics",
journal-URL = "http://link.springer.com/journal/10701",
}
@InProceedings{Feng:2010:CTS,
author = "Tao Feng and Yongguo Gao and Jianfeng Ma",
editor = "{IEEE}",
booktitle = "{Proceedings of the 2010 International Conference on
E-Business and E-Government (ICEE), Guangzhou, China,
7--9 May 2010}",
title = "Changeable Threshold Signature Scheme Based on Lattice
Theory",
publisher = pub-IEEE,
address = pub-IEEE:adr,
year = "2010",
ISBN = "0-7695-3997-1",
ISBN-13 = "978-0-7695-3997-3",
LCCN = "????",
bibdate = "Thu Apr 21 11:13:59 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=5589107",
abstract = "The current changeable threshold signature schemes are
generally based on RSA or ECC algorithm. They often
have shortcomings of the large amount of calculation,
need the dealer to participate in when adjusting the
threshold etc. This paper introduced the related
concepts and theories of lattice, proposed a novel
changeable threshold signature scheme and analyzed the
essential security, it based on the changeable
threshold Shamir secret sharing scheme and NTRUSign
signature algorithm. The scheme has the following
properties: It is mainly based on polynomial
multiplication and integer coefficient modular
arithmetic and needn't introduce exponential operation;
It needn't redistribute the subsecret and modify the
group public key when changing threshold; The scheme
guarantees threshold security, robustness and
unforgeability.",
acknowledgement = ack-nhfb,
keywords = "ANSI X9.98-2010; NTRUSign",
}
@Book{Ferguson:2010:CED,
author = "Niels Ferguson and Bruce Schneier and Tadayoshi
Kohno",
title = "Cryptography Engineering: Design Principles and
Practical Applications",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xxix + 353",
year = "2010",
ISBN = "0-470-47424-6 (paperback)",
ISBN-13 = "978-0-470-47424-2 (paperback)",
LCCN = "QA76.9.A25 F466 2010",
bibdate = "Sun Mar 28 14:55:52 MDT 2010",
bibsource = "aubrey.tamu.edu:7090/voyager;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
remark = "A fully updated version of the first two authors' {\em
Practical cryptography} (2003).",
}
@TechReport{Ferguson:2010:SHF,
author = "Niels Ferguson and Stefan Lucks and Bruce Schneier and
Doug Whiting and Mihir Bellare and Tadayoshi Kohno and
Jon Callas and Jesse Walker",
title = "The {Skein} Hash Function Family",
type = "Report",
institution = "(various)",
pages = "ii + vi + 92",
day = "1",
month = oct,
year = "2010",
bibdate = "Sat Dec 10 14:55:54 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://en.wikipedia.org/wiki/Skein_(hash_function);
http://www.skein-hash.info/sites/default/files/skein1.3.pdf",
acknowledgement = ack-nhfb,
keywords = "hash function; Skein; Threefish",
remark = "The Skein family is a contestant in the NIST
competition for a new hash-function algorithm to become
SHA-3, the next member of the Secure Hash Algorithm
(SHA-1 and SHA-2) family. From the executive summary in
the paper: ``Skein is fast \ldots{} secure \ldots{}
simple \ldots{} flexible \ldots{} efficient. Skein is
defined for three different internal state sizes ---
256 bits, 512 bits, and 1024 bits ---and any output
size. This allows Skein to be a drop-in replacement for
the entire SHA family of hash functions. A completely
optional and extendable argument system makes Skein an
efficient tool to use for a very large number of
functions: PRNG, stream cipher, key derivation
function, authentication without the overhead of HMAC,
and personalization capability. All these features can
be implemented with very low overhead. Together with
the Threefish large-block cipher at Skein's core, this
design provides a full set of symmetric cryptographic
primitives suitable for most modern applications.''",
}
@Article{Forne:2010:PAA,
author = "Jordi Forn{\'e} and Francisca Hinarejos and Andr{\'e}s
Mar{\'{\i}}n and Florina Almen{\'a}rez and Javier Lopez
and Jose A. Montenegro and Marc Lacoste and Daniel
D{\'{\i}}az",
title = "Pervasive authentication and authorization
infrastructures for mobile users",
journal = j-COMPUT-SECUR,
volume = "29",
number = "4",
pages = "501--514",
month = jun,
year = "2010",
CODEN = "CPSEDU",
DOI = "https://doi.org/10.1016/j.cose.2009.09.001",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:20 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404809000911",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Frey:2010:ABC,
author = "Gerhard Frey",
title = "The Arithmetic Behind Cryptography",
journal = j-NAMS,
volume = "57",
number = "3",
pages = "366--374",
month = mar,
year = "2010",
CODEN = "AMNOAN",
ISSN = "0002-9920 (print), 1088-9477 (electronic)",
ISSN-L = "0002-9920",
bibdate = "Mon Feb 22 15:35:29 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.ams.org/notices/201003/",
acknowledgement = ack-nhfb,
fjournal = "Notices of the American Mathematical Society",
journal-URL = "http://www.ams.org/notices/",
}
@Book{Fridrich:2010:SDM,
author = "Jessica Fridrich",
title = "Steganography in digital media: principles,
algorithms, and applications",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "xxii + 437 + 4",
year = "2010",
ISBN = "0-521-19019-3 (hardcover)",
ISBN-13 = "978-0-521-19019-0 (hardcover)",
LCCN = "QA76.9.A25 F75 2010",
bibdate = "Fri Aug 15 13:52:51 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
abstract = "Steganography, the art of hiding of information in
apparently innocuous objects or images, is a field with
a rich heritage, and an area of rapid current
development. This clear, self-contained guide shows you
how to understand the building blocks of covert
communication in digital media files and how to apply
the techniques in practice, including those of
steganalysis, the detection of steganography. Assuming
only a basic knowledge in calculus and statistics, the
book blends the various strands of steganography,
including information theory, coding, signal estimation
and detection, and statistical signal processing.
Experiments on real media files demonstrate the
performance of the techniques in real life, and most
techniques are supplied with pseudo-code, making it
easy to implement the algorithms. The book is ideal for
students taking courses on steganography and
information hiding, and is also a useful reference for
engineers and practitioners working in media security
and information assurance. Real media files are
provided so that readers can see how the techniques
work in practice. Includes pseudo-code to help with the
implementation of practical algorithms. Each chapter
ends with carefully chosen exercises supplied with
hints to jump-start the problem solving process.",
acknowledgement = ack-nhfb,
subject = "Data encryption (Computer science); Data protection;
Digital media; Data encryption (Computer science); Data
protection; Digital media",
tableofcontents = "Preface \\
Acknowledgments \\
1. Introduction \\
2. Digital image formats \\
3. Digital image acquisition \\
4. Steganographic channel \\
5. Naive steganography \\
6. Steganographic security \\
7. Practical steganographic methods \\
8. Matrix embedding \\
9. Non-shared selection channel \\
10. Steganalysis \\
11. Selected targeted attacks \\
12. Blind steganalysis \\
13. Steganography \\
A. Statistics \\
B. Information theory \\
C. Linear codes \\
D. Signal detection and estimation \\
E. Support vector machines \\
Notation \\
Glossary \\
References \\
Index",
}
@InBook{Frikken:2010:SMC,
author = "Keith B. Frikken",
title = "Secure Multiparty Computation",
crossref = "Atallah:2010:ATC",
chapter = "14",
pages = "1--16",
year = "2010",
DOI = "https://doi.org/10.1201/9781584888215-c14",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.crcnetbase.com/doi/abs/10.1201/9781584888215-c14",
acknowledgement = ack-nhfb,
}
@Article{Fulton:2010:BRB,
author = "Ben Fulton",
title = "Book Review: {{\booktitle{Introduction to Modern
Cryptography}}, by Jonathan Katz and Yehuda Lindell,
Publisher: Chapman \& Hall-CRC 2008 1-58488-551-3}",
journal = j-SIGACT,
volume = "41",
number = "4",
pages = "44--47",
month = dec,
year = "2010",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1907450.1907525",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Mar 20 14:39:00 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Katz:2008:IMC}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Gentry:2010:CAF,
author = "Craig Gentry",
title = "Computing arbitrary functions of encrypted data",
journal = j-CACM,
volume = "53",
number = "3",
pages = "97--105",
month = mar,
year = "2010",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1666420.1666444",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed May 12 15:13:19 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Suppose that you want to delegate the ability to {\em
process\/} your data, without giving away {\em
access\/} to it. We show that this separation is
possible: we describe a `fully homomorphic' encryption
scheme that keeps data private, but that allows a
worker that {\em does not have the secret decryption
key\/} to compute any (still encrypted) result of the
data, even when the function of the data is very
complex. In short, a third party can perform
complicated processing of data without being able to
see it. Among other things, this helps make cloud
computing compatible with privacy.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@PhdThesis{Gorski:2010:CDS,
author = "Michael Gorski",
title = "Cryptanalysis and design of symmetric primitives",
type = "{Ph.D.} thesis (??)",
school = "Bauhausuniversit{\"a}t",
address = "Weimar, Germany",
pages = "vi + 146",
year = "2010",
bibdate = "Fri May 13 06:45:57 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Gradwohl:2010:SRC,
author = "R. Gradwohl and N. Livne and A. Rosen",
title = "Sequential Rationality in Cryptographic Protocols",
crossref = "IEEE:2010:PIA",
pages = "623--632",
year = "2010",
DOI = "https://doi.org/10.1109/FOCS.2010.65",
bibdate = "Thu Apr 12 09:34:12 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/focs2010.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5669376",
}
@Article{Guo:2010:HMW,
author = "Jing-Ming Guo and Yun-Fu Liu",
title = "Hiding Multitone Watermarks in Halftone Images",
journal = j-IEEE-MULTIMEDIA,
volume = "17",
number = "1",
pages = "65--65",
month = jan,
year = "2010",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2010.14",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Thu May 13 11:33:52 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
}
@InProceedings{Haitner:2010:EIC,
author = "Iftach Haitner and Omer Reingold and Salil Vadhan",
title = "Efficiency improvements in constructing pseudorandom
generators from one-way functions",
crossref = "ACM:2010:PAI",
pages = "437--446",
year = "2010",
bibdate = "Wed Sep 1 10:42:57 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Article{Halder:2010:WTR,
author = "R. Halder and S. Pal and A. Cortesi",
title = "Watermarking Techniques for Relational Databases:
Survey, Classification and Comparison",
journal = j-J-UCS,
volume = "16",
number = "21",
pages = "3164--??",
month = "????",
year = "2010",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Fri Apr 6 05:52:28 MDT 2012",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.jucs.org/jucs_16_21/watermarking_techniques_for_relational",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Harn:2010:AGK,
author = "L. Harn and Changlu Lin",
title = "Authenticated Group Key Transfer Protocol Based on
Secret Sharing",
journal = j-IEEE-TRANS-COMPUT,
volume = "59",
number = "6",
pages = "842--846",
month = jun,
year = "2010",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2010.40",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sun Jul 3 11:52:29 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5416683",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Harnik:2010:CIC,
author = "Danny Harnik and Moni Naor",
title = "On the Compressibility of $ \mathcal {NP} $ Instances
and Cryptographic Applications",
journal = j-SIAM-J-COMPUT,
volume = "39",
number = "5",
pages = "1667--1713",
month = "????",
year = "2010",
CODEN = "SMJCAT",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Tue May 18 08:22:16 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/39/5;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@Book{Hazay:2010:EST,
author = "Carmit Hazay and Yehuda Lindell",
title = "Efficient Secure Two-Party Protocols: Techniques and
Constructions",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 263 + 1",
year = "2010",
DOI = "https://doi.org/10.1007/978-3-642-14303-8",
ISBN = "3-642-14302-4 (hardcover), 3-642-14303-2 (e-book)",
ISBN-13 = "978-3-642-14302-1 (hardcover), 978-3-642-14303-8
(e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "Z103 .H39 2010",
bibdate = "Sat Jun 10 08:35:00 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
jenson.stanford.edu:2210/unicorn",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/978-3-642-14303-8",
abstract = "The authors present a comprehensive study of efficient
protocols and techniques for secure two-party
computation - both general constructions that can be
used to securely compute any functionality, and
protocols for specific problems of interest. The book
focuses on techniques for constructing efficient
protocols and proving them secure. In addition, the
authors study different definitional paradigms and
compare the efficiency of protocols achieved under
these different definitions. The book opens with a
general introduction to secure computation and then
presents definitions of security for a number of
different adversary models and definitional paradigms.
In the second part, the book shows how any
functionality can be securely computed in an efficient
way in the presence of semi-honest, malicious and
covert adversaries. These general constructions provide
a basis for understanding the feasibility of secure
computation, and they are a good introduction to design
paradigms and proof techniques for efficient protocols.
In the final part, the book presents specific
constructions of importance. The authors begin with an
in-depth study of sigma protocols and zero knowledge,
focusing on secure computation, and they then provide a
comprehensive study of the fundamental oblivious
transfer function. Starting from protocols that achieve
privacy only, they show highly efficient constructions
that achieve security in the presence of malicious
adversaries for both a single and multiple batch
executions. Oblivious pseudorandom function evaluation
is then presented as an immediate application of
oblivious transfer. Finally, the book concludes with
two examples of high-level protocol problems that
demonstrate how specific properties of a problem can be
exploited to gain high efficiency: securely computing
the kth-ranked element, and secure database and text
search. This book is essential for practitioners and
researchers in the field of secure protocols,
particularly those with a focus on efficiency, and for
researchers in the area of privacy-preserving data
mining. This book can also be used as a textbook for an
advanced course on secure protocols.",
acknowledgement = ack-nhfb,
subject = "Computer science; Computer Communication Networks;
Data structures (Computer science); Data mining;
Informatique; Structures de donn{\'e}es (Informatique);
Exploration de donn{\'e}es (Informatique)",
tableofcontents = "Front Matter / i--xiii \\
Introduction and Definitions \\
Front Matter / 1--2 \\
Introduction / 3--18 \\
Definitions / 19--49 \\
General Constructions \\
Front Matter / 51--52 \\
Semi-honest Adversaries / 53--80 \\
Malicious Adversaries / 81--108 \\
Covert Adversaries / 109--143 \\
Specific Constructions \\
Front Matter / 145--146 \\
Sigma Protocols and Efficient Zero--Knowledge /
147--175 \\
Oblivious Transfer and Applications / 177--212 \\
The $k$th-Ranked Element / 213--226 \\
Search Problems / 227--254 \\
Back Matter / 255--263",
xxpages = "viii + 265",
}
@Article{Hefeeda:2010:ASM,
author = "Mohamed Hefeeda and Kianoosh Mokhtarian",
title = "Authentication schemes for multimedia streams:
{Quantitative} analysis and comparison",
journal = j-TOMCCAP,
volume = "6",
number = "1",
pages = "6:1--6:??",
month = feb,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1671954.1671960",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Mar 16 18:53:23 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "With the rapid increase in the demand for multimedia
services, securing the delivery of multimedia content
has become an important issue. Accordingly, the problem
of multimedia stream authentication has received
considerable attention by previous research and various
solutions have been proposed. However, these solutions
have not been rigorously analyzed and contrasted to
each other, and thus their relative suitability for
different streaming environments is not clear. This
article presents comprehensive analysis and comparison
among different schemes proposed in the literature to
authenticate multimedia streams. Authentication schemes
for nonscalable and scalable multimedia streams are
analyzed. To conduct this analysis, we define five
important performance metrics, which are computation
cost, communication overhead, receiver buffer size,
delay, and tolerance to packet losses. We derive
analytic formulas for these metrics for all considered
authentication schemes to numerically analyze their
performance. In addition, we implement all schemes in a
simulator to study and compare their performance in
different environments. The parameters for the
simulator are carefully chosen to mimic realistic
settings. We draw several conclusions on the advantages
and disadvantages of each scheme. We extend our
analysis to authentication techniques for scalable
streams. We pay careful attention to the flexibility of
scalable streams and analyze its impacts on the
authentication schemes. Our analysis and comparison
reveal the merits and shortcomings of each scheme,
provide guidelines on choosing the most appropriate
scheme for a given multimedia streaming application,
and could stimulate designing new authentication
schemes or improving existing ones. For example, our
detailed analysis has led us to design a new
authentication scheme that combines the best features
of two previous schemes.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
keywords = "authentication schemes; Multimedia authentication;
multimedia security; multimedia streaming; scalable
coding; secure streaming",
}
@PhdThesis{Hermelin:2010:MLC,
author = "Miia Hermelin",
title = "Multidimensional linear cryptanalysis",
volume = "16",
type = "{Ph.D.} thesis",
school = "Aalto-yliopiston teknillinen korkeakoulu",
address = "Espoo, Finland",
pages = "97",
year = "2010",
ISBN = "952-60-3189-X",
ISBN-13 = "978-952-60-3189-7",
ISSN = "1797-5050",
bibdate = "Thu May 12 06:49:36 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Dissertations in information and computer science",
acknowledgement = ack-nhfb,
keywords = "block cipher stream cipher; linear cryptanalysis;
Matsui's algorithm; multidimensional cryptanalysis",
}
@Book{Hinek:2010:CRV,
author = "M. Jason Hinek",
title = "Cryptanalysis of {RSA} and its variants",
publisher = pub-CRC,
address = pub-CRC:adr,
pages = "xviii + 268",
year = "2010",
ISBN = "1-4200-7518-7 (hardcover)",
ISBN-13 = "978-1-4200-7518-2 (hardcover)",
LCCN = "TK5102.94 .H56 2010",
bibdate = "Sat May 15 09:16:45 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Chapman and Hall/CRC cryptography and network
security",
acknowledgement = ack-nhfb,
subject = "telecommunication; security measures; mathematics;
public key cryptography; computer security",
tableofcontents = "I. Preliminaries \\
1. The RSA Cryptosystem \\
2. Some Notation, Mathematics and Techniques \\
II. Cryptanalysis of RSA \\
3. Some Early Attacks \\
4. Small Public Exponent Attacks \\
5. Small Private Exponent Attacks \\
6. Partial Key Exposure Attacks \\
7. More Small Private Exponent Attacks \\
III. Cryptanalysis of Variants of RSA \\
8. Crt-Rsa \\
9. Multi-Prime RSA \\
10. Multi-Power RSA \\
11. Common Prime RSA \\
12. Dual RSA \\
A. Distribution of 9 = gcd(p - 1, q - 1) \\
B. Geometrically Progressive Matrices \\
C. Some Algorithms",
}
@Article{Holbl:2010:TPI,
author = "Marko H{\"o}lbl and Tatjana Welzer and Bostjan
Brumen",
title = "Two proposed identity-based three-party authenticated
key agreement protocols from pairings",
journal = j-COMPUT-SECUR,
volume = "29",
number = "2",
pages = "244--252",
month = mar,
year = "2010",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:19 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S016740480900090X",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Book{Howard:2010:DSS,
author = "Michael Howard and David LeBlanc and John Viega",
title = "24 deadly sins of software security: programming flaws
and how to fix them",
publisher = pub-MCGRAW-HILL,
address = pub-MCGRAW-HILL:adr,
pages = "xxxvii + 393",
year = "2010",
ISBN = "0-07-162675-1",
ISBN-13 = "978-0-07-162675-0",
LCCN = "QA76.9.A25 H6977 2010",
bibdate = "Wed Jan 12 11:17:59 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computer security; Computer networks; Security
measures",
}
@Article{Hu:2010:TTW,
author = "Wen Hu and Hailun Tan and Peter Corke and Wen Chan
Shih and Sanjay Jha",
title = "Toward trusted wireless sensor networks",
journal = j-TOSN,
volume = "7",
number = "1",
pages = "5:1--5:??",
month = aug,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1806895.1806900",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Fri Oct 8 18:33:47 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "This article presents the design and implementation of
a trusted sensor node that provides Internet-grade
security at low system cost. We describe trustedFleck,
which uses a commodity Trusted Platform Module (TPM)
chip to extend the capabilities of a standard wireless
sensor node to provide security services such as {\em
message integrity, confidentiality, authenticity}, and
{\em system integrity\/} based on RSA public-key and
XTEA-based symmetric-key cryptography. In addition
trustedFleck provides secure storage of private keys
and provides platform configuration registers (PCRs) to
store system configurations and detect code tampering.
We analyze system performance using metrics that are
important for WSN applications such as computation
time, memory size, energy consumption and cost. Our
results show that trustedFleck significantly
outperforms previous approaches (e.g., TinyECC) in
terms of these metrics while providing stronger
security levels. Finally, we describe a number of
examples, built on trustedFleck, of symmetric key
management, secure RPC, secure software update, and
{\em remote attestation}.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
keywords = "public key (PK); remote attestation; RSA; TPM; trusted
computing; Wireless sensor networks",
}
@Article{Huffmire:2010:SPR,
author = "Ted Huffmire and Timothy Levin and Thuy Nguyen and
Cynthia Irvine and Brett Brotherton and Gang Wang and
Timothy Sherwood and Ryan Kastner",
title = "Security Primitives for Reconfigurable Hardware-Based
Systems",
journal = j-TRETS,
volume = "3",
number = "2",
pages = "10:1--10:??",
month = may,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1754386.1754391",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Tue Jun 22 16:00:33 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Computing systems designed using reconfigurable
hardware are increasingly composed using a number of
different Intellectual Property (IP) cores, which are
often provided by third-party vendors that may have
different levels of trust. Unlike traditional software
where hardware resources are mediated using an
operating system, IP cores have fine-grain control over
the underlying reconfigurable hardware. To address this
problem, the embedded systems community requires novel
security primitives that address the realities of
modern reconfigurable hardware. In this work, we
propose security primitives using ideas centered around
the notion of ``moats and drawbridges.'' The primitives
encompass four design properties: logical isolation,
interconnect traceability, secure reconfigurable
broadcast, and configuration scrubbing. Each of these
is a fundamental operation with easily understood
formal properties, yet they map cleanly and efficiently
to a wide variety of reconfigurable devices. We
carefully quantify the required overheads of the
security techniques on modern FPGA architectures across
a number of different applications.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
keywords = "Advanced Encryption Standard (AES); controlled
sharing; enforcement mechanisms; execution monitors;
Field Programmable Gate Arrays (FPGAs); hardware
security; isolation; memory protection; reference
monitors; security policies; security primitives;
separation; static analysis; Systems-on-a-Chip (SoCs)",
}
@Article{Hur:2010:CCS,
author = "Junbeom Hur and Chanil Park and Hyunsoo Yoon",
title = "Chosen ciphertext secure authenticated group
communication using identity-based signcryption",
journal = j-COMPUT-MATH-APPL,
volume = "60",
number = "2",
pages = "362--375",
month = jul,
year = "2010",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122110000167",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Hwang:2010:RIB,
author = "Min-Shiang Hwang and Song-Kong Chong and Te-Yu Chen",
title = "{DoS}-resistant {ID}-based password authentication
scheme using smart cards",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "1",
pages = "163--172",
month = jan,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Ismail:2010:EAE,
author = "I. A. Ismail and M. Amin and H. Diab",
title = "An Efficient Adaptive Ergodic Matrix and Chaotic
System for Image Encryption",
journal = j-INT-J-COMPUT-APPL,
volume = "32",
number = "3",
pages = "381--388",
year = "2010",
DOI = "https://doi.org/10.2316/Journal.202.2010.3.202-2330",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:26:37 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2010.3.202-2330",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Jain:2010:QP,
author = "Rahul Jain and Zhengfeng Ji and Sarvagya Upadhyay and
John Watrous",
title = "{QIP $=$ PSPACE}",
journal = j-CACM,
volume = "53",
number = "12",
pages = "102--109",
month = dec,
year = "2010",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1859204.1859231",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed Nov 24 17:07:53 MST 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "The interactive proof system model of computation has
been studied extensively in computational complexity
theory and theoretical cryptography for more than 25
years, and has driven the development of interesting
new techniques and insights in those fields. This work
considers the quantum interactive proof system model,
which is the classical model's natural quantum
computational analog. An exact characterization of the
expressive power of quantum interactive proof systems
is obtained: the collection of computational problems
having quantum interactive proof systems consists
precisely of those problems solvable with an ordinary
classical computer using at most a polynomial amount of
memory (or QIP $=$ PSPACE in complexity-theoretic
terminology). One striking implication of this
characterization is that it implies quantum computing
provides no increase in computational power whatsoever
over classical computing in the context of interactive
proof systems.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
remark = "An earlier version of this work won Best Paper Award
at STOC'2010 (Symposium on the Theory of Computing):
see \url{https://doi.org/10.1145/1806689.1806768}",
}
@Article{Jiang:2010:EDI,
author = "Yixin Jiang and Haojin Zhu and Minghui Shi and Xuemin
(Sherman) Shen and Chuang Lin",
title = "An efficient dynamic-identity based signature scheme
for secure network coding",
journal = j-COMP-NET-AMSTERDAM,
volume = "54",
number = "1",
pages = "28--40",
day = "15",
month = jan,
year = "2010",
CODEN = "????",
ISSN = "1389-1286",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:35 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Jie:2010:AAI,
author = "Wei Jie and Junaid Arshad and Pascal Ekin",
title = "Authentication and authorization infrastructure for
{Grids} --- issues, technologies, trends and
experiences",
journal = j-J-SUPERCOMPUTING,
volume = "52",
number = "1",
pages = "82--96",
month = apr,
year = "2010",
CODEN = "JOSUED",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Wed Aug 25 08:38:57 MDT 2010",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=52&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=52&issue=1&spage=82",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Jin:2010:ADW,
author = "C. Jin",
title = "Adaptive Digital Watermark System Using Soft
Computation",
journal = j-INT-J-COMPUT-APPL,
volume = "32",
number = "3",
pages = "341--346",
year = "2010",
DOI = "https://doi.org/10.2316/Journal.202.2010.3.202-2846",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:26:37 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2010.3.202-2846",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Johnson:2010:BRF,
author = "Neil F. Johnson",
title = "Book Review: {Frank Y. Shih, {\em Digital Watermarking
and Steganography: Fundamentals and Techniques}.
CRC\slash Taylor \& Francis (2008). ISBN-13
978-1-4200-4757-8. \pounds 46.99. 180 pp. Hardcover}",
journal = j-COMP-J,
volume = "53",
number = "5",
pages = "616--617",
month = jun,
year = "2010",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxp057",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Jul 7 08:36:58 MDT 2010",
bibsource = "http://comjnl.oxfordjournals.org/content/vol53/issue5/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/reprint/53/5/616",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Kamal:2010:EIN,
author = "A. A. Kamal and A. M. Youssef",
title = "Enhanced implementation of the {NTRUEncrypt} algorithm
using graphics cards",
crossref = "Chaudhuri:2010:PIC",
pages = "168--174",
year = "2010",
DOI = "https://doi.org/10.1109/PDGC.2010.5679887",
bibdate = "Thu Apr 21 10:40:48 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "The NTRU encryption algorithm, also known as
NTRUEncrypt, is a parameterized family of lattice-based
public key cryptosystems that has been accepted to the
IEEE P1363 standards under the specifications for
lattice-based public-key cryptography (IEEE P1363.1).
The operations of the NTRU encryption algorithm show
good characteristics for data parallel processing which
makes the NTRU a good candidate to benefit from the
high degree of parallelism available in modern graphics
processing units (GPUs). In this paper, we investigate
different GPU implementation options for the NTRU
encryption algorithm. Our implementation, on the NVIDIA
GTX275 GPU, using the CUDA framework, achieves about 77
MB/s for NTRU with the parameter set $ (N, q, p) =
(1171, 2048, 3) $.",
acknowledgement = ack-nhfb,
keywords = "ANSI X9.98-2010; NTRUEncrypt",
}
@Article{Karopoulos:2010:FIP,
author = "Giorgos Karopoulos and Georgios Kambourakis and
Stefanos Gritzalis and Elisavet Konstantinou",
title = "A framework for identity privacy in {SIP}",
journal = j-J-NETW-COMPUT-APPL,
volume = "33",
number = "1",
pages = "16--28",
month = jan,
year = "2010",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:38 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804509001052",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Karthigaikumar:2010:PPV,
author = "P. Karthigaikumar and K. Baskaran",
title = "Partially Pipelined {VLSI} Implementation of
{Blowfish} Encryption\slash Decryption Algorithm",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "10",
number = "3",
pages = "327--341",
month = jul,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467810003809",
ISSN = "0219-4678",
bibdate = "Tue Aug 31 08:38:02 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Book{Kastner:2010:AOT,
author = "Ryan Kastner and Anup Hosangadi and Farzan Fallah",
title = "Arithmetic optimization techniques for hardware and
software design",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "vii + 187",
year = "2010",
ISBN = "0-521-88099-8",
ISBN-13 = "978-0-521-88099-2",
LCCN = "QA76.9.C62 K37 2010; QA76.9.C62 KAS 2010",
bibdate = "Mon Jul 12 14:32:42 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
library.ox.ac.uk:210/ADVANCE",
URL = "http://assets.cambridge.org/97805218/80992/cover/9780521880992.jpg",
abstract = "Obtain better system performance, lower energy
consumption, and avoid hand-coding arithmetic functions
with this concise guide to automated optimization
techniques for hardware and software design. High-level
compiler optimizations and high-speed architectures for
implementing FIR filters are covered, which can improve
performance in communications, signal processing,
computer graphics, and cryptography. Clearly explained
algorithms and illustrative examples throughout make it
easy to understand the techniques and write software
for their implementation. Background information on the
synthesis of arithmetic expressions and computer
arithmetic is also included, making the book ideal for
newcomers to the subject. This is an invaluable
resource for researchers, professionals, and graduate
students working in system level design and automation,
compilers, and VLSI CAD.",
acknowledgement = ack-nhfb,
subject = "computer arithmetic; electronic digital computers;
design and construction; computer software;
development; mathematical optimization",
tableofcontents = "1. Introduction; \\
2. Use of arithmetic expressions\\
3. Software compilation\\
4. Hardware synthesis\\
5. Fundamentals of digital arithmetic\\
6. Polynomial expressions\\
7. Linear systems",
}
@Article{Kate:2010:PBO,
author = "Aniket Kate and Greg M. Zaverucha and Ian Goldberg",
title = "Pairing-Based Onion Routing with Improved Forward
Secrecy",
journal = j-TISSEC,
volume = "13",
number = "4",
pages = "29:1--29:??",
month = dec,
year = "2010",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1880022.1880023",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "This article presents new protocols for onion routing
anonymity networks. We define a provably secure
privacy-preserving key agreement scheme in an
identity-based infrastructure setting, and use it to
design new onion routing circuit constructions. These
constructions, based on a user's selection, offer
immediate or eventual forward secrecy at each node in a
circuit and require significantly less computation and
communication than the telescoping mechanism used by
the Tor project. Further, the use of an identity-based
infrastructure also leads to a reduction in the
required amount of authenticated directory
information.",
acknowledgement = ack-nhfb,
articleno = "29",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Keller:2010:DAS,
author = "Nathan Keller and Stephen D. Miller",
title = "Distinguishing attacks on stream ciphers based on
arrays of pseudo-random words",
journal = j-INFO-PROC-LETT,
volume = "110",
number = "4",
pages = "129--132",
day = "16",
month = jan,
year = "2010",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 12:46:30 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Keskinarkaus:2010:IWD,
author = "A. Keskinarkaus and A. Pramila and T. Sepp{\"a}nen",
title = "Image watermarking with a directed periodic pattern to
embed multibit messages resilient to print-scan and
compound attacks",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "10",
pages = "1715--1725",
month = oct,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:06 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Khan:2010:RCB,
author = "Zeeshan Shafi Khan and Khalid Rashid and Fahad Bin
Muhaya and Qutbuddin and Aneel Rahim",
title = "Realization of Call-Back Authentication {(CBA)} for
secure web to cellular phone {SMS} communication",
journal = j-COMPUT-MATH-APPL,
volume = "60",
number = "2",
pages = "198--208",
month = jul,
year = "2010",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122110000118",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@PhdThesis{Khazaei:2010:NBS,
author = "Shahram Khazaei",
title = "Neutrality-Based Symmetric Cryptanalysis",
type = "Th{\`e}se",
school = "{\'E}cole polytechnique f{\'e}d{\'e}rale de Lausanne
(EPFL)",
address = "Lausanne, Switzerland",
pages = "138",
year = "2010",
DOI = "https://doi.org/10.5075/epfl-thesis-4755",
bibdate = "Fri May 13 06:33:43 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
advisor = "Arjen K. Lenstra and Willi Meier",
}
@InProceedings{Khomejani:2010:PCT,
author = "S. Khomejani and A. Movaghar",
editor = "{IEEE}",
booktitle = "{Proceedings of the 2010 International Conference On
Electronics and Information Engineering (ICEIE), 1--3,
August, 2010, Kyoto, Japan}",
title = "Privacy consideration for trustworthy vehicular ad hoc
networks",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "437--??",
year = "2010",
DOI = "https://doi.org/10.1109/ICEIE.2010.5559670",
ISBN = "1-4244-7679-8",
ISBN-13 = "978-1-4244-7679-4",
LCCN = "????",
bibdate = "Thu Apr 21 11:18:00 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.bibsys.no:2100/BIBSYS",
abstract = "For increasing safety of driving, intelligent vehicles
in vehicular ad hoc networks (VANETs) communicate with
each other by sending announcements. The existence of a
system that guarantees the trustworthiness of these
announcements seems necessary. The proposed approach
generating announcements should be preserved from
internal and external attackers that attempt to send
fake messages. In this paper, we use a group-based
endorsement mechanism based on threshold signatures
against internal attackers. We choose NTRUSign as a
public key cryptosystem for decreasing signature
generation and verification times. This approach
optimizes the network overhead and consequently its
performance. In this scheme, also the privacy of
signers and endorsers that generate or endorse
trustworthy announcements is preserved.",
acknowledgement = ack-nhfb,
keywords = "ANSI X9.98-2010; NTRUSign",
}
@TechReport{Khovratovich:2010:RCA,
author = "Dmitry Khovratovich and Ivica Nikoli{\'c}",
title = "Rotational Cryptanalysis of {ARX}",
type = "Report",
institution = "University of Luxembourg",
address = "Luxembourg",
pages = "24",
month = jan,
year = "2010",
bibdate = "Mon Nov 28 14:40:24 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.skein-hash.info/sites/default/files/axr.pdf",
abstract = "In this paper we analyze the security of systems based
on modular additions, rotations, and XORs (ARX
systems). We provide both theoretical support for their
security and practical cryptanalysis of real ARX
primitives. We use a technique called rotational
cryptanalysis, that is universal for the ARX systems
and is quite efficient. We illustrate the method with
the best known attack on reduced versions of the block
cipher Threefish (the core of Skein). Additionally, we
prove that ARX with constants are functionally
complete, i.e., any function can be realized with these
operations.",
acknowledgement = ack-nhfb,
date = "24",
keywords = "ARX; cryptanalysis; rotational cryptanalysis",
}
@TechReport{Khovratovich:2010:RRA,
author = "Dmitry Khovratovich and Ivica Nikoli{\'c} and
Christian Rechberger",
title = "Rotational Rebound Attacks on Reduced {Skein}",
type = "Report",
institution = "University of Luxembourg",
address = "Luxembourg",
pages = "20",
day = "20",
month = oct,
year = "2010",
bibdate = "Sat Dec 10 16:07:50 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://eprint.iacr.org/2010/538",
acknowledgement = ack-nhfb,
keywords = "cipher; compression function; distinguisher; hash
function; rebound attack; rotational cryptanalysis;
secret-key cryptography; SHA-3; Skein; Skein hash
algorithm; Threefish encryption",
}
@InBook{Klapper:2010:PSS,
author = "Andrew Klapper",
title = "Pseudorandom Sequences and Stream Ciphers",
crossref = "Atallah:2010:ATC",
chapter = "17",
pages = "1--23",
year = "2010",
DOI = "https://doi.org/10.1201/9781584888215-c17",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.crcnetbase.com/doi/abs/10.1201/9781584888215-c17",
acknowledgement = ack-nhfb,
}
@TechReport{Kleinjung:2010:FBR,
author = "Thorsten Kleinjung and Kazumaro Jens Franke and Arjen
K. Lenstra and Emmanuel Thom{\'e} and Joppe W. Bos and
Pierrick Gaudry and Alexander Kruppa and Peter L.
Montgomery and Dag Arne Osvik and Herman te Riele and
Andrey Timofeev and Paul Zimmermann",
title = "Factorization of a 768-bit {RSA} modulus",
type = "Report",
number = "1.4",
institution = "EPFL IC LACAL [and others]",
address = "Station 14, CH-1015 Lausanne, Switzerland [and
others]",
day = "18",
month = feb,
year = "2010",
bibdate = "Tue Jan 02 07:55:25 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://eprint.iacr.org/2010/006.pdf",
abstract = "This paper reports on the factorization of the 768-bit
number RSA-768 by the number field sieve factoring
method and discusses some implications for RSA.",
acknowledgement = ack-nhfb,
}
@Article{Ko:2010:MME,
author = "Jeonggil Ko and Jong Hyun Lim and Yin Chen and
Rv{\~a}zvan Musvaloiu-E and Andreas Terzis and Gerald
M. Masson and Tia Gao and Walt Destler and Leo Selavo
and Richard P. Dutton",
title = "{MEDiSN}: {Medical} emergency detection in sensor
networks",
journal = j-TECS,
volume = "10",
number = "1",
pages = "11:1--11:??",
month = aug,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1814539.1814550",
ISSN = "1539-9087",
ISSN-L = "1539-9087",
bibdate = "Mon Aug 30 15:29:45 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Staff shortages and an increasingly aging population
are straining the ability of emergency departments to
provide high quality care. At the same time, there is a
growing concern about hospitals' ability to provide
effective care during disaster events. For these
reasons, tools that automate patient monitoring have
the potential to greatly improve efficiency and quality
of health care. Towards this goal, we have developed
{\em MEDiSN}, a wireless sensor network for monitoring
patients' physiological data in hospitals and during
disaster events. MEDiSN comprises {\em Physiological
Monitors\/} (PMs), which are custom-built, patient-worn
motes that sample, encrypt, and sign physiological data
and {\em Relay Points\/} (RPs) that self-organize into
a multi-hop wireless backbone for carrying
physiological data. Moreover, MEDiSN includes a
back-end server that persistently stores medical data
and presents them to authenticated GUI clients. The
combination of MEDiSN's two-tier architecture and
optimized rate control protocols allows it to address
the compound challenge of reliably delivering large
volumes of data while meeting the application's QoS
requirements. Results from extensive simulations,
testbed experiments, and multiple pilot hospital
deployments show that MEDiSN can scale from tens to at
least five hundred PMs, effectively protect application
packets from congestive and corruptive losses, and
deliver medically actionable data.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
keywords = "Medical sensor networks; wireless physiological
monitoring",
}
@Article{Koblitz:2010:BNW,
author = "Neal Koblitz and Alfred Menezes",
title = "The Brave New World of Bodacious Assumptions in
Cryptography",
journal = j-NAMS,
volume = "57",
number = "3",
pages = "357--365",
month = mar,
year = "2010",
CODEN = "AMNOAN",
ISSN = "0002-9920 (print), 1088-9477 (electronic)",
ISSN-L = "0002-9920",
bibdate = "Mon Feb 22 15:35:29 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.ams.org/notices/201003/",
acknowledgement = ack-nhfb,
fjournal = "Notices of the American Mathematical Society",
journal-URL = "http://www.ams.org/notices/",
}
@Article{Koblitz:2010:BRB,
author = "Neal Koblitz",
title = "Book Review: {{\booktitle{Decrypted Secrets: Methods
and Maxims of Cryptology}}. Fourth Edition}",
journal = j-SIAM-REVIEW,
volume = "52",
number = "4",
pages = "777--779",
month = "????",
year = "2010",
CODEN = "SIREAD",
ISSN = "0036-1445 (print), 1095-7200 (electronic)",
ISSN-L = "0036-1445",
bibdate = "Fri Jun 21 11:25:02 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Review",
journal-URL = "http://epubs.siam.org/sirev",
}
@Article{Konstantinou:2010:RCI,
author = "Elisavet Konstantinou and Aristides Kontogeorgis",
title = "{Ramanujan}'s class invariants and their use in
elliptic curve cryptography",
journal = j-COMPUT-MATH-APPL,
volume = "59",
number = "8",
pages = "2901--2917",
month = apr,
year = "2010",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:38 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122110001173",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Kramer:2010:FDC,
author = "Simon Kramer and Rajeev Gor{\'e} and Eiji Okamoto",
title = "Formal definitions and complexity results for trust
relations and trust domains fit for {TTPs}, the web of
trust, {PKIs}, and {ID}-based cryptography",
journal = j-SIGACT,
volume = "41",
number = "1",
pages = "75--98",
month = mar,
year = "2010",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1753171.1753193",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Mar 20 14:39:00 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
abstract = "We propose computational, declarative definitions of
the concepts of weak and strong trust relations between
interacting agents, and trust domains of trust-related
agents in distributed systems. Our definitions yield
computational complexity results for deciding potential
and actual trust relationships and membership in trust
domains. We instantiate our trust concepts in four
major applications of trust, namely: Trusted Third
Parties (TTPs), the Web of Trust, Public-Key
Infrastructures (PKIs), and Identity-Based
Cryptography. Finally, we point out computational means
for building trust, and by that, building up trust
relations and trust domains. Our defining principle for
weak and strong trust is (common) belief in and
knowledge of agent correctness, respectively",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Kumagai:2010:UGS,
author = "J. Kumagai",
title = "{UK} gets a space agency of its very own",
journal = j-IEEE-SPECTRUM,
volume = "47",
number = "2",
pages = "11--11",
month = feb,
year = "2010",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2010.5397763",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Fri Jan 17 18:54:05 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Cryogenics; Cryptography; Europe; Magnetic cores;
Magnetic fields; Mirrors; Telescopes; Testing",
}
@Article{Kwon:2010:SEB,
author = "Taekyoung Kwon and Jin Hong",
title = "Secure and Efficient Broadcast Authentication in
Wireless Sensor Networks",
journal = j-IEEE-TRANS-COMPUT,
volume = "59",
number = "8",
pages = "1120--1133",
month = aug,
year = "2010",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2009.171",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sun Jul 3 11:52:31 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5313804",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Lan:2010:RNG,
author = "Jingjing Lan and Wang Ling Goh and Zhi Hui Kong and
Kiat Seng Yeo",
booktitle = "{2010 International SoC Design Conference (ISOCC)}",
title = "A random number generator for low power cryptographic
application",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "328--331",
year = "2010",
DOI = "https://doi.org/10.1109/SOCDC.2010.5682906",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5682906",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5678854",
}
@Book{Landau:2010:SSR,
author = "Susan Eva Landau",
title = "Surveillance or security?: {The} risks posed by new
wiretapping technologies",
publisher = pub-MIT,
address = pub-MIT:adr,
pages = "xvi + 383",
year = "2010",
ISBN = "0-262-01530-7 (hardcover),0-262-29558-X (e-book)",
ISBN-13 = "978-0-262-01530-1 (hardcover), 978-0-262-29558-1
(e-book)",
LCCN = "TK5102.85 .L36 2010",
bibdate = "Tue May 7 10:51:07 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Telecommunication; Security measures; United States;
Wiretapping; Data encryption (Computer science);
Government policy; Electronic surveillance; Political
aspects; Computer crimes; Risk assessment",
tableofcontents = "Introduction \\
Communication networks and their architectures \\
Securing the Internet is difficult \\
Wiretaps and the law \\
The effectiveness of wiretapping \\
Evolving communications technologies \\
Who are the intruders? what are they targeting? \\
Security risks arising from wiretapping technology \\
Policy risks arising from wiretapping \\
Communication during crisis \\
Getting communications security right \\
Epilogue",
}
@Article{Lee:2010:CGC,
author = "Moon Sung Lee and Sang Geun Hahn",
title = "Cryptanalysis of the {GGH} Cryptosystem",
journal = j-MATH-COMPUT-SCI,
volume = "3",
number = "2",
pages = "201--208",
month = apr,
year = "2010",
CODEN = "????",
ISSN = "1661-8270 (print), 1661-8289 (electronic)",
ISSN-L = "1661-8270",
bibdate = "Sun Aug 22 09:02:18 MDT 2010",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1661-8270&volume=3&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1661-8270&volume=3&issue=2&spage=201",
abstract = "In this correspondence, we show that partial
information of plaintext can be used to simplify the
decryption problem in the case of the GGH cryptosystem.
Combined with Nguyen's previous attack, we solve the
numerical GGH challenge of the highest dimension 400,
proposed on the Internet by the authors of the
cryptosystem. We also discuss how to avoid this
attack.",
acknowledgement = ack-nhfb,
fjournal = "Mathematics in Computer Science",
journal-URL = "http://www.springerlink.com/content/1661-8270/",
}
@Article{Lee:2010:PMB,
author = "Hui-Lung Lee and Chia-Feng Lee and Ling-Hwei Chen",
title = "A perfect maze based steganographic method",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "12",
pages = "2528--2535",
month = dec,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Mon Nov 1 11:40:41 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Lekkas:2010:PMT,
author = "Dimitrios Lekkas and Dimitris Gritzalis",
title = "{e-Passports} as a means towards a {Globally
Interoperable Public Key Infrastructure}",
journal = j-J-COMP-SECUR,
volume = "18",
number = "3",
pages = "379--396",
month = "????",
year = "2010",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2008-0370",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:24:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Lewand:2010:PC,
author = "Robert Edward Lewand",
title = "The perfect cipher",
journal = j-MATH-GAZ,
volume = "94",
number = "531",
pages = "401--411",
month = nov,
year = "2010",
CODEN = "MAGAAS",
DOI = "https://doi.org/10.1017/S0025557200001698",
ISSN = "0025-5572",
ISSN-L = "0025-5572",
bibdate = "Tue May 5 12:04:12 MDT 2015",
bibsource = "http://journals.cambridge.org/action/displayIssue?jid=MAG&volumeId=94&issueId=531;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/mathgaz2010.bib",
acknowledgement = ack-nhfb,
ajournal = "Math. Gaz.",
fjournal = "The Mathematical Gazette",
journal-URL = "http://journals.cambridge.org/action/displayBackIssues?jid=MAG",
}
@Article{Li:2010:AFF,
author = "Peng Li and Xin Yang and Kai Cao and Xunqiang Tao and
Ruifang Wang and Jie Tian",
title = "An alignment-free fingerprint cryptosystem based on
fuzzy vault scheme",
journal = j-J-NETW-COMPUT-APPL,
volume = "33",
number = "3",
pages = "207--220",
month = may,
year = "2010",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:42 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804509001398",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Li:2010:AIS,
author = "Feifei Li and Marios Hadjieleftheriou and George
Kollios and Leonid Reyzin",
title = "Authenticated Index Structures for Aggregation
Queries",
journal = j-TISSEC,
volume = "13",
number = "4",
pages = "32:1--32:??",
month = dec,
year = "2010",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1880022.1880026",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Query authentication is an essential component in
Outsourced DataBase (ODB) systems. This article
introduces efficient index structures for
authenticating aggregation queries over large datasets.
First, we design an index that features good
performance characteristics for static environments.
Then, we propose more involved structures for the
dynamic case. Our structures feature excellent
performance for authenticating queries with multiple
aggregate attributes and multiple selection predicates.
Furthermore, our techniques cover a large number of
aggregate types, including distributive aggregates
(such as SUM, COUNT, MIN, and MAX), algebraic
aggregates (such as the AVG), and holistic aggregates
(such as MEDIAN and QUANTILE). We have also addressed
the issue of authenticating aggregation queries
efficiently when the database is encrypted to protect
data confidentiality.",
acknowledgement = ack-nhfb,
articleno = "32",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Li:2010:CCB,
author = "Jiguo Li and Xinyi Huang and Yi Mu and Willy Susilo
and Qianhong Wu",
title = "Constructions of certificate-based signature secure
against key replacement attacks",
journal = j-J-COMP-SECUR,
volume = "18",
number = "3",
pages = "421--449",
month = "????",
year = "2010",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2009-0366",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:24:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Li:2010:DCY,
author = "Chengqing Li and Shujun Li and Kwok-Tung Lo and
Kyandoghere Kyamakya",
title = "A differential cryptanalysis of {Yen--Chen--Wu}
multimedia cryptography system",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "8",
pages = "1443--1452",
month = aug,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:06 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Li:2010:EBB,
author = "Chun-Ta Li and Min-Shiang Hwang",
title = "An efficient biometrics-based remote user
authentication scheme using smart cards",
journal = j-J-NETW-COMPUT-APPL,
volume = "33",
number = "1",
pages = "1--5",
month = jan,
year = "2010",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:38 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804509001192",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Li:2010:ESS,
author = "Chung Ki Li and Guomin Yang and Duncan S. Wong and
Xiaotie Deng and Sherman S. M. Chow",
title = "An efficient signcryption scheme with key privacy and
its extension to ring signcryption",
journal = j-J-COMP-SECUR,
volume = "18",
number = "3",
pages = "451--473",
month = "????",
year = "2010",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2009-0374",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:24:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Li:2010:GCP,
author = "Hui Li and Chuan-Kun Wu and Jun Sun",
title = "A general compiler for password-authenticated group
key exchange protocol",
journal = j-INFO-PROC-LETT,
volume = "110",
number = "4",
pages = "160--167",
day = "16",
month = jan,
year = "2010",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 12:46:30 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Li:2010:PAP,
author = "Mengdong Li",
title = "Preimage awareness proofs of two compression
functions",
crossref = "Yang:2010:PII",
pages = "660--664",
month = dec,
year = "2010",
DOI = "https://doi.org/10.1109/ICITIS.2010.5689483",
ISBN = "1-4244-6942-2",
ISBN-13 = "978-1-4244-6942-0",
bibdate = "Fri Mar 13 10:55:22 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
keywords = "collision resistance; Compression Function;
Cryptography; cryptography; data compression; Domain
extension; Games; hash function; Hash Function;
Merkle-Damgard paradigm; Message authentication;
Polynomials; PrA property; Preimage aware; preimage
awareness proof; PRO compression function; random
oracle; Resistance; security property; Transforms",
}
@Article{Li:2010:PES,
author = "C. H. Li and X. F. Zhang and H. Jin and W. Xiang",
title = "{E}-passport {EAC} scheme based on {Identity-Based
Cryptography}",
journal = j-INFO-PROC-LETT,
volume = "111",
number = "1",
pages = "26--30",
day = "15",
month = dec,
year = "2010",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 12:46:51 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Liao:2010:MPC,
author = "Xin Liao and Qiao-yan Wen and Ying Sun and Jie Zhang",
title = "Multi-party covert communication with steganography
and quantum secret sharing",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "10",
pages = "1801--1804",
month = oct,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:06 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Libert:2010:KES,
author = "Beno{\^\i}t Libert and Jean-Jacques Quisquater and
Moti Yung",
title = "Key Evolution Systems in Untrusted Update
Environments",
journal = j-TISSEC,
volume = "13",
number = "4",
pages = "37:1--37:??",
month = dec,
year = "2010",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1880022.1880031",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Forward-Secure Signatures (FSS) prevent forgeries for
past time periods when an attacker obtains full access
to the signer's storage by evolving the private key in
a one-way fashion. To simplify the integration of these
primitives into standard security architectures, Boyen
et al. [2006] recently introduced the concept of
forward-secure signatures with untrusted updates where
private keys are additionally protected by a second
factor (derived from a password). Key updates can be
made on encrypted version of signing keys so that
passwords only come into play for signing messages and
not at update time (since update is not user-driven).
The scheme put forth by Boyen et al.",
acknowledgement = ack-nhfb,
articleno = "37",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Lima:2010:PKE,
author = "J. B. Lima and D. Panario and R. M. Campello de
Souza",
title = "Public-key encryption based on {Chebyshev} polynomials
over {$ \mathrm {GF}(q) $}",
journal = j-INFO-PROC-LETT,
volume = "111",
number = "2",
pages = "51--56",
day = "31",
month = dec,
year = "2010",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 12:46:52 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Lin:2010:DSM,
author = "Dai-Rui Lin and Chih-I Wang and Zhi-Kai Zhang and D.
J. Guan",
title = "A digital signature with multiple subliminal channels
and its applications",
journal = j-COMPUT-MATH-APPL,
volume = "60",
number = "2",
pages = "276--284",
month = jul,
year = "2010",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S089812211000012X",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Liu:2010:CIE,
author = "Hongjun Liu and Xingyuan Wang",
title = "Color image encryption based on one-time keys and
robust chaotic maps",
journal = j-COMPUT-MATH-APPL,
volume = "59",
number = "10",
pages = "3320--3327",
month = may,
year = "2010",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:33 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122110001938",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Liu:2010:NDC,
author = "Feng Liu and ChuanKun Wu and XiJun Lin",
title = "A new definition of the contrast of visual
cryptography scheme",
journal = j-INFO-PROC-LETT,
volume = "110",
number = "7",
pages = "241--246",
day = "1",
month = mar,
year = "2010",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 12:46:33 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Liu:2010:SET,
author = "Feng Liu and ChuanKun Wu and XiJun Lin",
title = "Some Extensions on Threshold Visual Cryptography
Schemes",
journal = j-COMP-J,
volume = "53",
number = "1",
pages = "107--119",
month = jan,
year = "2010",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxn072",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Apr 28 14:33:36 MDT 2010",
bibsource = "http://comjnl.oxfordjournals.org/content/vol53/issue1/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/53/1/107;
http://comjnl.oxfordjournals.org/cgi/reprint/53/1/107",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Liu:2010:SVE,
author = "Fuwen Liu and Hartmut Koenig",
title = "A survey of video encryption algorithms",
journal = j-COMPUT-SECUR,
volume = "29",
number = "1",
pages = "3--15",
month = feb,
year = "2010",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:19 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404809000698",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Lou:2010:NAS,
author = "Der-Chyuan Lou and Nan-I Wu and Chung-Ming Wang and
Zong-Han Lin and Chwei-Shyong Tsai",
title = "A novel adaptive steganography based on local
complexity and human vision sensitivity",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "7",
pages = "1236--1248",
month = jul,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:06 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Lu:2010:MSC,
author = "H. Karen Lu and Asad M. Ali",
title = "Making Smart Cards Truly Portable",
journal = j-IEEE-SEC-PRIV,
volume = "8",
number = "2",
pages = "28--34",
month = mar # "\slash " # apr,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2010.56",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu May 13 09:49:48 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Lubacz:2010:VI,
author = "J. Lubacz and W. Mazurczyk and K. Szczypiorski",
title = "Vice over {IP}",
journal = j-IEEE-SPECTRUM,
volume = "47",
number = "2",
pages = "42--47",
month = feb,
year = "2010",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2010.5397787",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Fri Jan 17 18:54:05 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Android VoIP-enabled mobile phones; Communication
networks; contemporary communication networks; Counting
circuits; Internet telephony; Law; Legal factors;
Mobile handsets; Portable computers; Privacy;
Protection; steganography; Steganography",
}
@Article{Lucchese:2010:RPT,
author = "Claudio Lucchese and Michail Vlachos and Deepak Rajan
and Philip S. Yu",
title = "Rights protection of trajectory datasets with
nearest-neighbor preservation",
journal = j-VLDB-J,
volume = "19",
number = "4",
pages = "531--556",
month = aug,
year = "2010",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-010-0178-6",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Wed Aug 18 12:06:22 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Companies frequently outsource datasets to mining
firms, and academic institutions create repositories or
share datasets in the interest of promoting research
collaboration. Still, many practitioners have
reservations about sharing or outsourcing datasets,
primarily because of fear of losing the principal
rights over the dataset. This work presents a way of
convincingly claiming ownership rights over a
trajectory dataset, without, at the same time,
destroying the salient dataset characteristics, which
are important for accurate search operations and
data-mining tasks. The digital watermarking methodology
that we present distorts imperceptibly a collection of
sequences, effectively embedding a secret key, while
retaining as well as possible the neighborhood of each
object, which is vital for operations such as
similarity search, classification, or clustering. A key
contribution in this methodology is a technique for
discovering the maximum distortion that still maintains
such desirable properties. We demonstrate both
analytically and empirically that the proposed dataset
marking techniques can withstand a number of attacks
(such a translation, rotation, noise addition, etc) and
therefore can provide a robust framework for
facilitating the secure dissemination of trajectory
datasets.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
keywords = "Nearest neighbors; Rights protection; Time-series;
Trajectories; Watermarking",
}
@Article{Lysyanskaya:2010:AEC,
author = "Anna Lysyanskaya and Roberto Tamassia and Nikos
Triandopoulos",
title = "Authenticated error-correcting codes with applications
to multicast authentication",
journal = j-TISSEC,
volume = "13",
number = "2",
pages = "17:1--17:??",
month = feb,
year = "2010",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1698750.1698757",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Tue Mar 16 10:18:15 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
articleno = "17",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Mancillas-Lopez:2010:RHI,
author = "C. Mancillas-Lopez and D. Chakraborty and F. Rodriguez
Henriquez",
title = "Reconfigurable Hardware Implementations of Tweakable
Enciphering Schemes",
journal = j-IEEE-TRANS-COMPUT,
volume = "59",
number = "11",
pages = "1547--1561",
month = nov,
year = "2010",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2010.64",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sun Jul 3 11:52:33 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5432161",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Marmol:2010:TPA,
author = "F{\'e}lix G{\'o}mez M{\'a}rmol and Joao Girao and
Gregorio Mart{\'\i}nez P{\'e}rez",
title = "{TRIMS}, a privacy-aware trust and reputation model
for identity management systems",
journal = j-COMP-NET-AMSTERDAM,
volume = "54",
number = "16",
pages = "2899--2912",
day = "15",
month = nov,
year = "2010",
CODEN = "????",
ISSN = "1389-1286",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:41 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Martin:2010:FWL,
author = "Douglas Martin",
title = "{Frank W. Lewis}, Master of the Cryptic Crossword,
Dies at 98",
journal = j-NY-TIMES,
volume = "??",
number = "??",
pages = "??",
day = "3",
month = dec,
year = "2010",
CODEN = "NYTIAO",
ISSN = "0362-4331 (print), 1542-667X, 1553-8095",
ISSN-L = "0362-4331",
bibdate = "Sun Dec 31 07:36:16 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "New York Times",
journal-URL = "http://www.nytimes.com/",
}
@Article{Martin:2010:PCC,
author = "Luther Martin",
title = "Protecting credit card information: encryption vs
tokenisation",
journal = j-NETWORK-SECURITY,
volume = "2010",
number = "6",
pages = "17--19",
month = jun,
year = "2010",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(10)70084-2",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:18 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485810700842",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Martin:2010:XMA,
author = "Luther Martin",
title = "{XTS}: a Mode of {AES} for Encrypting Hard Disks",
journal = j-IEEE-SEC-PRIV,
volume = "8",
number = "3",
pages = "68--69",
month = may # "\slash " # jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2010.111",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed May 26 15:44:06 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Marton:2010:RDC,
author = "Kinga Marton and Alin Suciu and Iosif Ignat",
title = "Randomness in Digital Cryptography: a Survey",
journal = "Romanian Journal of Information Science and
Technology",
volume = "13",
number = "3",
pages = "219--240",
month = "????",
year = "2010",
CODEN = "????",
ISSN = "1453-8245",
ISSN-L = "1453-8245",
bibdate = "Tue Jan 31 15:21:48 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http:www.imt.ro/romjist/Volum13/Number13_3/pdf/KMarton.pdf",
acknowledgement = ack-nhfb,
ajournal = "Rom. J. Inf. Sci. Technol.",
}
@Book{McKay:2010:SLB,
author = "Sinclair McKay",
title = "The secret life of {Bletchley Park}: the history of
the wartime codebreaking centre by the men and women
who were there",
publisher = "Aurum",
address = "London, UK",
pages = "vi + 336 + 8",
year = "2010",
ISBN = "1-84513-539-3 (hardcover)",
ISBN-13 = "978-1-84513-539-3 (hardcover)",
LCCN = "D810.C88 M35 2010x",
bibdate = "Thu May 12 11:15:08 MDT 2011",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Bletchley Park was where one of the war's most famous
and crucial achievements was made: the cracking of
Germany's ``Enigma'' code in which its most important
military communications were couched. This country
house in the Buckinghamshire countryside was home to
Britain's most brilliant mathematical brains, like Alan
Turing, and the scene of immense advances in technology
--- indeed, the birth of modern computing. The military
codes deciphered there were instrumental in turning
both the Battle of the Atlantic and the war in North
Africa. But, though plenty has been written about the
boffins, and the codebreaking, fictional and
non-fiction --- from Robert Harris and Ian McEwan to
Andrew Hodges' biography of Turing --- what of the
thousands of men and women who lived and worked there
during the war? What was life like for them --- an odd,
secret territory between the civilian and the military?
Sinclair McKay's book is the first history for the
general reader of life at Bletchley Park, and an
amazing compendium of memories from people now in their
eighties --- of skating on the frozen lake in the
grounds (a depressed Angus Wilson, the novelist, once
threw himself in) --- of a youthful Roy Jenkins,
useless at codebreaking, of the high jinks at nearby
accommodation hostels --- and of the implacable secrecy
that meant girlfriend and boyfriend working in adjacent
huts knew nothing about each other's work.",
acknowledgement = ack-nhfb,
subject = "World War, 1939-1945; cryptography; electronic
intelligence; Great Britain; Bletchley Park (Milton
Keynes, England); History",
tableofcontents = "Reporting for duty \\
1938--39: the school of codes \\
1939: rounding up the brightest and the best \\
The house and the surrounding country \\
1939: how do you break the unbreakable? \\
1939--40: the Enigma initiation \\
Freezing billets and outdoor loos \\
1940: the first glimmers of light \\
1940: inspiration and intensity \\
1940: the coming of the bombes \\
1940: Enigma and the Blitz \\
Bletchley and the class question \\
1941: the battle of the Atlantic \\
Food, booze and too much tea \\
1941: the wrens and their larks \\
1941: Bletchley and Churchill \\
Military or civilian? \\
1942: grave setbacks and internal strife \\
The rules of attraction \\
1943: a very special relationship \\
1943: the hazards of careless talk \\
Bletchley and the Russians \\
The cultural life of Bletchley Park \\
1943--44: the rise of the Colossus \\
1944--45: D-Day and the end of the war \\
1945 and after: the immediate aftermath \\
Bletchley's intellectual legacy \\
After Bletchley: the silence descends \\
The rescue of the Park",
}
@Article{Meiklejohn:2010:BRB,
author = "Sarah Meiklejohn",
title = "Book Review: {{\booktitle{An Introduction to
Mathematical Cryptography}}, by Jeffrey Hoffstein, Jill
Pipher, and Joseph Silverman Springer-Verlag, 2008}",
journal = j-SIGACT,
volume = "41",
number = "4",
pages = "47--50",
month = dec,
year = "2010",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1907450.1907527",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Mar 20 14:39:00 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Hoffstein:2008:IMC}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Micciancio:2010:FGC,
author = "Daniele Micciancio",
title = "A first glimpse of cryptography's {Holy Grail}",
journal = j-CACM,
volume = "53",
number = "3",
pages = "96--96",
month = mar,
year = "2010",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1666420.1666445",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed May 12 15:13:19 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Michiels:2010:OWB,
author = "Wil Michiels",
title = "Opportunities in White-Box Cryptography",
journal = j-IEEE-SEC-PRIV,
volume = "8",
number = "1",
pages = "64--67",
month = jan # "\slash " # feb,
year = "2010",
DOI = "https://doi.org/10.1109/MSP.2010.44",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu May 13 09:49:48 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Midgley:2010:SEE,
author = "Stephen Midgley",
title = "The state of encryption in {Europe}: some cultural
comparisons",
journal = j-NETWORK-SECURITY,
volume = "2010",
number = "8",
pages = "18--19",
month = aug,
year = "2010",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(10)70107-0",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:20 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485810701070",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@InProceedings{Moghadam:2010:DRN,
author = "I. Zarei Moghadam and A. S. Rostami and M. R.
Tanhatalab",
booktitle = "{2010 International Conference on Computer Design and
Applications (ICCDA)}",
title = "Designing a random number generator with novel
parallel {LFSR} substructure for key stream ciphers",
volume = "5",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "V5--598--V5--601",
year = "2010",
DOI = "https://doi.org/10.1109/ICCDA.2010.5541188",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5541188",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5520349",
}
@Article{Moran:2010:BCP,
author = "Tal Moran and Moni Naor",
title = "Basing cryptographic protocols on tamper-evident
seals",
journal = j-THEOR-COMP-SCI,
volume = "411",
number = "10",
pages = "1283--1310",
day = "4",
month = mar,
year = "2010",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 17:10:24 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Moskowitz:2010:ITE,
author = "I. S. Moskowitz and F. Ahmed and P. A. Lafferty",
title = "Information Theoretic Effects of {JPEG} Compression on
Image Steganography",
journal = j-INT-J-COMPUT-APPL,
volume = "32",
number = "3",
pages = "318--327",
year = "2010",
DOI = "https://doi.org/10.2316/Journal.202.2010.3.202-2736",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:26:37 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2010.3.202-2736",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Mozaffari-Kermani:2010:CSI,
author = "M. Mozaffari-Kermani and A. Reyhani-Masoleh",
title = "Concurrent Structure-Independent Fault Detection
Schemes for the {Advanced Encryption Standard}",
journal = j-IEEE-TRANS-COMPUT,
volume = "59",
number = "5",
pages = "608--622",
month = may,
year = "2010",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2010.33",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sun Jul 3 11:52:28 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5406504",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Mukhamedov:2010:IEP,
author = "Aybek Mukhamedov and Mark D. Ryan",
title = "Identity Escrow Protocol and Anonymity Analysis in the
Applied Pi-Calculus",
journal = j-TISSEC,
volume = "13",
number = "4",
pages = "41:1--41:??",
month = dec,
year = "2010",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1880022.1880035",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Anonymity with identity escrow attempts to allow users
of an online service to remain anonymous, while
providing the possibility that the service owner can
break the anonymity in exceptional circumstances, such
as to assist in a criminal investigation. In the
article, we propose an identity escrow protocol that
distributes user identity among several escrow agents.
The main feature of our scheme is it is based on
standard encryption algorithms and it provides user
anonymity even if all but one escrow holders are
dishonest acting in a coalition. We also present
analysis of the anonymity property of our protocol in
the applied pi-calculus.",
acknowledgement = ack-nhfb,
articleno = "41",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@InProceedings{Murdoch:2010:CPB,
author = "Steven J. Murdoch and Saar Drimer and Ross Anderson
and Mike Bond",
editor = "{IEEE}",
booktitle = "{2010 IEEE Symposium on Security and Privacy, 16--19
May 2010, Oakland, CA, USA}",
title = "Chip and {PIN} is Broken",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "433--446",
year = "2010",
DOI = "https://doi.org/10.1109/SP.2010.33",
ISBN = "1-4244-6894-9",
ISBN-13 = "978-1-4244-6894-2",
ISSN = "1081-6011",
LCCN = "????",
bibdate = "Thu Nov 04 17:55:03 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.cl.cam.ac.uk/~sjm217/papers/oakland10chipbroken.pdf",
abstract = "EMV is the dominant protocol used for smart card
payments worldwide, with over 730 million cards in
circulation. Known to bank customers as ``Chip and
PIN'', it is used in Europe; it is being introduced in
Canada; and there is pressure from banks to introduce
it in the USA too. EMV secures credit and debit card
transactions by authenticating both the card and the
customer presenting it through a combination of
cryptographic authentication codes, digital signatures,
and the entry of a PIN. In this paper we describe and
demonstrate a protocol flaw which allows criminals to
use a genuine card to make a payment without knowing
the card's PIN, and to remain undetected even when the
merchant has an online connection to the banking
network. The fraudster performs a man-in-the-middle
attack to trick the terminal into believing the PIN
verified correctly, while telling the card that no PIN
was entered at all. The paper considers how the flaws
arose, why they remained unknown despite EMV's wide
deployment for the best part of a decade, and how they
might be fixed. Because we have found and validated a
practical attack against the core functionality of EMV,
we conclude that the protocol is broken. This failure
is significant in the field of protocol design, and
also has important public policy implications, in light
of growing reports of fraud on stolen EMV cards.
Frequently, banks deny such fraud victims a refund,
asserting that a card cannot be used without the
correct PIN, and concluding that the customer must be
grossly negligent or lying. Our attack can explain a
number of these cases, and exposes the need for further
research to bridge the gap between the theoretical and
practical security of bank payment systems. It also
demonstrates the need for the next version of EMV to be
engineered properly.",
acknowledgement = ack-nhfb,
keywords = "authentication; bank security; card fraud; Chip and
PIN; EMV; protocol failure; security economics",
}
@Article{Murphy:2010:BRB,
author = "Cillian Murphy",
title = "Book Review: {{\booktitle{Introduction to
Cryptography}}, by Hans Delfs and Helmut Knebl,
Publisher: Springer, 2007, ISBN 978-3-540-49243-6}",
journal = j-SIGACT,
volume = "41",
number = "4",
pages = "42--44",
month = dec,
year = "2010",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1907450.1907523",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Mar 20 14:39:00 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Delfs:2002:ICP,Delfs:2007:ICP}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Book{Naccache:2010:THI,
author = "David Naccache and Ahmad-Reza Sadeghi",
title = "Towards hardware-intrinsic security: foundations and
practice",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvi + 407",
year = "2010",
ISBN = "3-642-14451-9, 3-642-14452-7",
ISBN-13 = "978-3-642-14451-6, 978-3-642-14452-3",
LCCN = "????",
bibdate = "Sat Jun 10 08:35:11 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Information Security and Cryptography",
acknowledgement = ack-nhfb,
tableofcontents = "Physically Unclonable Functions (PUFs) Physically
Unclonable Functions: A Study on the State of the Art
and Future Research Directions / 3 \\
Hardware Intrinsic Security from Physically Unclonable
Functions / 39 \\
From Statistics to Circuits: Foundations for Future
Physical Unclonable Functions / 55 \\
Strong PUFs: Models, Constructions, and Security Proofs
/ 79 \\
Hardware-Based Cryptography Leakage Resilient
Cryptography in Practice / 99 \\
Memory Leakage-Resilient Encryption Based on Physically
Unclonable Functions / 135 \\
Hardware Attacks Hardware Trojan Horses / 167 \\
Extracting Unknown Keys from Unknown Algorithms
Encrypting Unknown Fixed Messages and Returning No
Results / 189 \\
Hardware-Based Policy Enforcement License Distribution
Protocols from Optical Media Fingerprints / 201 \\
And-counterfeiting: Mixing the Physical and the Digital
World / 223 \\
Hardware Security in Contactless Tokens
Anti-counterfeiting, Untraceability and Other Security
Challenges for RFID Systems: Public-Key-Based Protocols
and Hardware / 237 \\
Contactless Security Token Enhanced Security by Using
New Hardware Features in Cryptographic-Based Security
Mechanisms / 259 \\
Enhancing RFID Security and Privacy by Physically
Unclonable Functions / 281 \\
Hardware-Based Security Architectures and Applications
Authentication of Processor Hardware Leveraging
Performance Limits in Detailed Simulations and
Emulations / 309 \\
Signal Authentication in Trusted Satellite Navigation
Receivers / 331 \\
On the Limits of Hypervisor- and Virtual Machine
Monitor-Based Isolation / 349 \\
Efficient Secure Two-Party Computation with Untrusted
Hardware Tokens / 367 \\
Towards Reliable Remote Healthcare Applications Using
Combined Fuzzy Extraction / 387",
}
@Article{Nagy:2010:KDV,
author = "Naya Nagy and Marius Nagy and Selim G. Akl",
title = "Key Distribution Versus Key Enhancement in Quantum
Cryptography",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "3",
pages = "239--250",
month = sep,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000193",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:04 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nagy:2010:OTP,
author = "Naya Nagy and Selim G. Akl",
title = "One-Time Pads Without Prior Encounter",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "3",
pages = "263--273",
month = sep,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626410000211",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:04 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nagy:2010:QCS,
author = "Naya Nagy and Selim G. Akl",
title = "A Quantum Cryptographic Solution to the Problem of
Access Control in a Hierarchy",
journal = j-PARALLEL-PROCESS-LETT,
volume = "20",
number = "3",
pages = "251--261",
month = sep,
year = "2010",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S012962641000020X",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:04 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@InProceedings{Navin:2010:ETU,
author = "A. H. Navin and Z. Navadad and B. Aasadi and M.
Mirnia",
booktitle = "{2010 International Conference on Computational
Intelligence and Communication Networks (CICN)}",
title = "Encrypted Tag by Using Data-Oriented Random Number
Generator to Increase Security in Wireless Sensor
Network",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "335--338",
year = "2010",
DOI = "https://doi.org/10.1109/CICN.2010.75",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5701989",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5701810",
}
@Article{Nikooghadam:2010:EUE,
author = "Morteza Nikooghadam and Ali Zakerolhosseini and Mohsen
Ebrahimi Moghaddam",
title = "Efficient utilization of elliptic curve cryptosystem
for hierarchical access control",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "10",
pages = "1917--1929",
month = oct,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:06 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Book{Novotny:2010:TAE,
author = "Martin Novotny",
title = "Time-area efficient hardware architectures for
cryptography and cryptanalysis",
volume = "12",
publisher = "Europ{\"a}ischer Universit{\"a}tsverlag",
address = "Bochum, Germany",
pages = "xxvi + 194",
year = "2010",
ISBN = "3-89966-351-9",
ISBN-13 = "978-3-89966-351-8",
LCCN = "????",
bibdate = "Fri May 13 07:27:27 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "IT-Security",
acknowledgement = ack-nhfb,
}
@Article{Ntantogian:2010:GME,
author = "Christoforos Ntantogian and Christos Xenakis and
Ioannis Stavrakakis",
title = "A generic mechanism for efficient authentication in
B3G networks",
journal = j-COMPUT-SECUR,
volume = "29",
number = "4",
pages = "460--475",
month = jun,
year = "2010",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:20 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404809001242",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Ogiela:2010:UML,
author = "Marek R. Ogiela and Urszula Ogiela",
title = "The use of mathematical linguistic methods in creating
secret sharing threshold algorithms",
journal = j-COMPUT-MATH-APPL,
volume = "60",
number = "2",
pages = "267--271",
month = jul,
year = "2010",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122110001379",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Otmani:2010:CTM,
author = "Ayoub Otmani and Jean-Pierre Tillich and L{\'e}onard
Dallot",
title = "Cryptanalysis of Two {McEliece} Cryptosystems Based on
Quasi-Cyclic Codes",
journal = j-MATH-COMPUT-SCI,
volume = "3",
number = "2",
pages = "129--140",
month = apr,
year = "2010",
CODEN = "????",
ISSN = "1661-8270 (print), 1661-8289 (electronic)",
ISSN-L = "1661-8270",
bibdate = "Sun Aug 22 09:02:18 MDT 2010",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1661-8270&volume=3&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1661-8270&volume=3&issue=2&spage=129",
abstract = "We cryptanalyse here two variants of the McEliece
cryptosystem based on quasi-cyclic codes. Both aim at
reducing the key size by restricting the public and
secret generator matrices to be in quasi-cyclic form.
The first variant considers subcodes of a primitive BCH
code. The aforementioned constraint on the public and
secret keys implies to choose very structured
permutations. We prove that this variant is not secure
by producing many linear equations that the entries of
the secret permutation matrix have to satisfy by using
the fact that the secret code is a subcode of a known
BCH code. This attack has been implemented and in all
experiments we have performed the solution space of the
linear system was of dimension one and revealed the
permutation matrix. The other variant uses quasi-cyclic
low density parity-check (LDPC) codes. This scheme was
devised to be immune against general attacks working
for McEliece type cryptosystems based on LDPC codes by
choosing in the McEliece scheme more general one-to-one
mappings than permutation matrices. We suggest here a
structural attack exploiting the quasi-cyclic structure
of the code and a certain weakness in the choice of the
linear transformations that hide the generator matrix
of the code. This cryptanalysis adopts a
polynomial-oriented approach and basically consists in
searching for two polynomials of low weight such that
their product is a public polynomial. Our analysis
shows that with high probability a parity-check matrix
of a punctured version of the secret code can be
recovered with time complexity O(n 3) where n is the
length of the considered code. The complete
reconstruction of the secret parity-check matrix of the
quasi-cyclic LDPC codes requires the search of
codewords of low weight which can be done with about $
2^{37} $ operations for the specific parameters
proposed.",
acknowledgement = ack-nhfb,
fjournal = "Mathematics in Computer Science",
journal-URL = "http://www.springerlink.com/content/1661-8270/",
}
@Article{Ou:2010:CPA,
author = "Hsia-Hung Ou and Min-Shiang Hwang and Jinn-Ke Jan",
title = "A cocktail protocol with the {Authentication} and {Key
Agreement} on the {UMTS}",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "2",
pages = "316--325",
month = feb,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Book{Paar:2010:UCT,
author = "Christof Paar and Jan Pelzl",
title = "Understanding Cryptography: a Textbook for Students
and Practitioners",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xviii + 372",
year = "2010",
ISBN = "3-642-04100-0 (hardcover), 3-642-04101-9 (ebk.)",
ISBN-13 = "978-3-642-04100-6 (hardcover), 978-3-642-04101-3
(ebk.)",
LCCN = "Z104 .P33 2010",
bibdate = "Wed Dec 26 10:04:43 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
remark = "Forward by Bart Preneel.",
subject = "cryptography; mathematics; data encryption (computer
science)",
}
@Article{Papadopoulos:2010:CAR,
author = "Stavros Papadopoulos and Yin Yang and Dimitris
Papadias",
title = "Continuous authentication on relational streams",
journal = j-VLDB-J,
volume = "19",
number = "2",
pages = "161--180",
month = apr,
year = "2010",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-009-0145-2",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Wed Apr 21 16:41:50 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "According to the database outsourcing model, a data
owner delegates database functionality to a third-party
service provider, which answers queries received from
clients. Authenticated query processing enables the
clients to verify the correctness of query results.
Despite the abundance of methods for authenticated
processing in conventional databases, there is limited
work on outsourced data streams. Stream environments
pose new challenges such as the need for fast structure
updating, support for continuous query processing and
authentication, and provision for temporal
completeness. Specifically, in addition to the
correctness of individual results, the client must be
able to verify that there are no missing results in
between data updates. This paper presents a
comprehensive set of methods covering relational
streams. We first describe REF, a technique that
achieves correctness and temporal completeness but
incurs false transmissions, i.e., the provider has to
inform the clients whenever there is a data update,
even if their results are not affected. Then, we
propose CADS, which minimizes the processing and
transmission overhead through an elaborate indexing
scheme and a virtual caching mechanism. In addition, we
present an analytical study to determine the optimal
indexing granularity, and extend CADS for the case that
the data distribution changes over time. Finally, we
evaluate the effectiveness of our techniques through
extensive experiments.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
keywords = "Authentication; Continuous monitoring; Data streams;
Database outsourcing",
}
@Article{Papadopoulos:2010:TRM,
author = "Konstantinos Papadopoulos and Ioannis Papaefstathiou",
title = "{Titan-R}: a Multigigabit Reconfigurable Combined
Compression\slash Decompression Unit",
journal = j-TRETS,
volume = "3",
number = "2",
pages = "7:1--7:??",
month = may,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1754386.1754388",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Tue Jun 22 16:00:33 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Data compression techniques can alleviate bandwidth
problems in even multigigabit networks and are
especially useful when combined with encryption. This
article demonstrates a reconfigurable hardware
compressor/decompressor core, the Titan-R, which can
compress/decompress data streams at 8.5 Gb/sec, making
it the fastest reconfigurable such device ever
proposed; the presented full-duplex implementation
allows for fully symmetric compression and
decompression rates at 8.5 Gbps each. Its compression
algorithm is a variation of the most widely used and
efficient such scheme, the Lempel--Ziv (LZ) algorithm
that uses part of the previous input stream as the
dictionary. In order to support this high network
throughput, the Titan-R utilizes a very fine-grained
pipeline and takes advantage of the high bandwidth
provided by the distributed on-chip RAMs of
state-of-the-art FPGAs.",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
keywords = "data compression; FPGA; hardware algorithms;
networking; parallel processing; reconfigurable
computing; Stream processing",
}
@Article{Park:2010:SIC,
author = "Jong Hyuk Park and Sajid Hussain and Guilin Wang and
Yi Mu",
title = "Special issue of computers and mathematics with
applications on {``Advances in cryptography, security
and applications for future computer science''}",
journal = j-COMPUT-MATH-APPL,
volume = "60",
number = "2",
pages = "175--175",
month = jul,
year = "2010",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122110002695",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Paulson:2010:SDO,
author = "Linda Dailey Paulson",
title = "Steganography Development Offers Promise",
journal = j-COMPUTER,
volume = "43",
number = "6",
pages = "18--21",
month = jun,
year = "2010",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Wed Jun 23 19:08:58 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Peng:2010:IWM,
author = "Hong Peng and Jun Wang and Weixing Wang",
title = "Image watermarking method in multiwavelet domain based
on support vector machines",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "8",
pages = "1470--1477",
month = aug,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:06 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Peng:2010:SFW,
author = "Fei Peng and Re-Si Guo and Chang-Tsun Li and Min
Long",
title = "A semi-fragile watermarking algorithm for
authenticating {$2$D} {CAD} engineering graphics based
on log-polar transformation",
journal = j-COMPUT-AIDED-DES,
volume = "42",
number = "12",
pages = "1207--1216",
year = "2010",
CODEN = "CAIDA5",
DOI = "https://doi.org/10.1016/j.cad.2010.08.004",
ISSN = "0010-4485 (print), 1879-2685 (electronic)",
ISSN-L = "0010-4485",
bibdate = "Wed Jan 28 10:08:12 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0010448510001491",
abstract = "Copyright violation and illegal manipulation of
digital data have been acute challenges for many
sectors since the very same set of enabling techniques
for generating and processing digital data started to
emerge. Although traditional protective methods, such
as encryption and digital signatures, have been in use
for decades, their inability to provide protection
after decryption and locating tampering has prompted
the development of digital watermarking. In this paper,
a semi-fragile watermarking algorithm for
authenticating 2D {CAD} engineering graphics based on
log-polar coordinate mapping is proposed. Firstly, the
vertices are divided into groups, and for each group,
the vertices for carrying a watermark are mapped to the
log-polar coordinate system. Then the watermark is
embedded in the mantissa of the real-valued log-polar
coordinates via bit substitution. Theoretical analysis
and experimental results show that the proposed
algorithm is not only robust against incidental global
operations such as rotation, translation and scaling,
but can also detect and locate malicious attacks such
as entity modification and entity addition/deletion.",
acknowledgement = ack-nhfb,
fjournal = "Computer-Aided Design",
journal-URL = "http://www.sciencedirect.com/science/journal/00104485",
keywords = "Benford's Law; Content authentication; Data hiding;
Engineering graphics; Integrity verification;
Semi-fragile watermarking",
}
@InProceedings{Peris-Lopez:2010:CSP,
author = "Pedro Peris-Lopez and Enrique {San Mill{\'a}n} and Jan
C. A. van der Lubbe and Luis A. Entrena",
booktitle = "{2010 International Conference for Internet Technology
and Secured Transactions (ICITST)}",
title = "Cryptographically secure pseudo-random bit generator
for {RFID} tags",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "1--6",
year = "2010",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5678035",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5672505",
}
@Article{Pfleeger:2010:CJD,
author = "Charles P. Pfleeger",
title = "Crypto: Not Just for the Defensive Team",
journal = j-IEEE-SEC-PRIV,
volume = "8",
number = "2",
pages = "63--66",
month = mar # "\slash " # apr,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2010.65",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu May 13 09:49:48 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Poursakidis:2010:TPC,
author = "V. Poursakidis and C. Nikolaou",
title = "Towards a person-centric {Identity Management
Infrastructure (IMI)}",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "25",
number = "1",
pages = "??--??",
month = jan,
year = "2010",
CODEN = "CSSEEI",
ISSN = "0267-6192",
ISSN-L = "0267-6192",
bibdate = "Tue Dec 3 12:04:33 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
}
@Article{Praba:2010:MAC,
author = "V. Lakshmi Praba and G. Arumugam",
title = "Message authentication code algorithm for {IP-SEC}",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "25",
number = "5",
pages = "??--??",
month = sep,
year = "2010",
CODEN = "CSSEEI",
ISSN = "0267-6192",
ISSN-L = "0267-6192",
bibdate = "Tue Dec 3 12:04:33 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
}
@Article{Rahaman:2010:STB,
author = "H. Rahaman and J. Mathew and D. K. Pradhan",
title = "Secure Testable {S}-box Architecture for Cryptographic
Hardware Implementation",
journal = j-COMP-J,
volume = "53",
number = "5",
pages = "581--591",
month = jun,
year = "2010",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxp048",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri May 28 17:07:25 MDT 2010",
bibsource = "http://comjnl.oxfordjournals.org/content/vol53/issue5/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/53/5/581;
http://comjnl.oxfordjournals.org/cgi/reprint/53/5/581",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Rankin:2010:HLH,
author = "Kyle Rankin",
title = "Hack and \slash: lightning hacks---{SSH} strikes
back",
journal = j-LINUX-J,
volume = "2010",
number = "195",
pages = "10:1--10:??",
month = jul,
year = "2010",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Tue Nov 23 11:41:55 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Rao:2010:PAA,
author = "Rajesh P. N. Rao",
title = "Probabilistic Analysis of an Ancient Undeciphered
Script",
journal = j-COMPUTER,
volume = "43",
number = "4",
pages = "76--80",
month = apr,
year = "2010",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2010.112",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Wed May 12 22:57:42 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Ren:2010:CSH,
author = "Yanli Ren and Dawu Gu",
title = "{CCA2} secure (hierarchical) identity-based parallel
key-insulated encryption without random oracles",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "1",
pages = "153--162",
month = jan,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Rhee:2010:TSS,
author = "Hyun Sook Rhee and Jong Hwan Park and Willy Susilo and
Dong Hoon Lee",
title = "Trapdoor security in a searchable public-key
encryption scheme with a designated tester",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "5",
pages = "763--771",
month = may,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Ristenpart:2010:WGR,
author = "Thomas Ristenpart and Scott Yilek",
title = "When good randomness goes bad: Virtual machine reset
vulnerabilities and hedging deployed cryptography",
crossref = "Anonymous:2010:NDS",
pages = "??--??",
year = "2010",
bibdate = "Mon Mar 09 16:01:46 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.isoc.org/isoc/conferences/ndss/10/pdf/15.pdf;
http://www.isoc.org/isoc/conferences/ndss/10/proceedings.shtml",
abstract = "Random number generators (RNGs) are consistently a
weak link in the secure use of cryptography. Routine
cryptographic operations such as encryption and signing
can fail spectacularly given predictable or repeated
randomness, even when using good long-lived key
material. This has proved problematic in prior settings
when RNG implementation bugs, poor design, or
low-entropy sources have resulted in predictable
randomness. We investigate a new way in which RNGs fail
due to reuse of virtual machine (VM) snapshots. We
exhibit such VM reset vulnerabilities in widely-used
TLS clients and servers: the attacker takes advantage
of (or forces) snapshot replay to compromise sessions
or even expose a server's DSA signing key. Our next
contribution is a backwards-compatible framework for
hedging routine cryptographic operations against bad
randomness, thereby mitigating the damage due to
randomness failures. We apply our framework to the
OpenSSL library and experimentally confirm that it has
little overhead.",
acknowledgement = ack-nhfb,
pagecount = "18",
remark = "Cite in \cite[reference 65]{Schneier:2015:SWC}.",
}
@Article{Roh:2010:BSW,
author = "Dongyoung Roh and Sang Geun Hahn",
title = "On the bit security of the weak {Diffie--Hellman}
problem",
journal = j-INFO-PROC-LETT,
volume = "110",
number = "18--19",
pages = "799--802",
day = "15",
month = sep,
year = "2010",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 12:46:44 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Rosen:2010:CCS,
author = "Alon Rosen and Gil Segev",
title = "Chosen-Ciphertext Security via Correlated Products",
journal = j-SIAM-J-COMPUT,
volume = "39",
number = "7",
pages = "3058--3088",
month = "????",
year = "2010",
CODEN = "SMJCAT",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Mon Nov 29 11:59:44 MST 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/39/7;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@Book{Sadeghi:2010:THI,
editor = "Ahmad-Reza. Sadeghi and David Naccache",
title = "Towards Hardware-Intrinsic Security: Foundations and
Practice",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvi + 407",
year = "2010",
DOI = "https://doi.org/10.1007/978-3-642-14452-3",
ISBN = "3-642-14451-9 (hardcover), 3-642-14452-7 (e-book)",
ISBN-13 = "978-3-642-14451-6 (hardcover), 978-3-642-14452-3
(e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "TK7887.5 .T69 2010eb",
bibdate = "Sat Jun 10 08:35:11 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
note = "Foreword by Pim Tuyls.",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/978-3-642-14452-3",
abstract = "Hardware-intrinsic security is a young field dealing
with secure secret key storage. By generating the
secret keys from the intrinsic properties of the
silicon, e.g., from intrinsic Physical Unclonable
Functions (PUFs), no permanent secret key storage is
required anymore, and the key is only present in the
device for a minimal amount of time. The field is
extending to hardware-based security primitives and
protocols such as block ciphers and stream ciphers
entangled with the hardware, thus improving IC
security. While at the application level there is a
growing interest in hardware security for RFID systems
and the necessary accompanying system architectures.
This book brings together contributions from
researchers and practitioners in academia and industry,
an interdisciplinary group with backgrounds in physics,
mathematics, cryptography, coding theory and processor
theory. It will serve as important background material
for students and practitioners, and will stimulate much
further research and development.",
acknowledgement = ack-nhfb,
shorttableofcontents = "pt. 1. Physically unclonable functions (PUFs)
\\
pt. 2. Hardware-based cryptography \\
pt. 3. Hardware attacks \\
pt. 4. Hardware-based policy enforcement \\
pt. 5. Hardware security in contactless tokens \\
pt. 6. Hardware-based security architectures and
applications",
subject = "Computer science; Computer hardware; Data structures
(Computer science); Computer engineering; Data
Structures, Cryptology and Information Theory;
Electrical Engineering; Computer engineering; Computer
input-output equipment; Computer science; Data
structures (Computer science)",
tableofcontents = "Part I Physically Unclonable Functions (PUFs) \\
Physically Unclonable Functions: A Study on the State
of the Art and Future Research Directions / 3 \\
Roel Maes and Ingrid Verbauwhede Hardware Intrinsic
Security from Physically Unclonable Functions / 39 \\
Helena Handschuh, Geert-Jan Schrijen, and Pirn Tuyls
From Statistics to Circuits: Foundations for Future
Physical Unclonable Functions / 55 \\
Inyoung Kim, Abhranil Maiti, Leyla Nazhandali, Patrick
Schaumont, Vignesh Vivekraja, and Huaiye Zhang Strong
PUFs: Models, Constructions, and Security Proofs / 79
\\
Ulrich R{\"u}hrmair, Heike Busch, and Stefan
Katzenbeisser Part II Hardware-Based Cryptography \\
Leakage Resilient Cryptography in Practice / 99 \\
Fran{\c{c}}ois-Xavier Standaert, Olivier Pereira, Yu
Yu, Jean-Jacques Quisquater, Moti Yung, and Elisabeth
Oswald Memory Leakage-Resilient Encryption Based on
Physically Unclonable Functions / 135 \\
Frederik Armknecht, Roel Maes, Ahmad-Reza Sadeghi, Berk
Sunar, and Pirn Tuyls Part III Hardware Attacks \\
Hardware Trojan Horses / 167 \\
Mohammad Tehranipoor and Berk Sunar Extracting Unknown
Keys from Unknown Algorithms Encrypting Unknown Fixed
Messages and Returning No Results / 189 \\
Yoo-Jin Baek, Vanessa Gratzer, Sung-Hyun Kim, and David
Naccache Part IV Hardware-Based Policy Enforcement \\
License Distribution Protocols from Optical Media
Fingerprints / 201 \\
Ghaith Hammouri, Aykutlu Dana, and Berk Sunar
Anti-counterfeiting: Mixing the Physical and the
Digital World / 223 \\
Darko Kirovski Part V Hardware Security in Contactless
Tokens \\
Anti-counterfeiting, Untraceability and Other Security
Challenges for RFID Systems: Public-Key-Based Protocols
and Hardware / 237 \\
Yong Ki Lee, Lejla Batina, Dave Singelee, Bart Preneel,
and Ingrid Verbauwhede Contactless Security Token
Enhanced Security by Using New Hardware Features in
Cryptographic-Based Security Mechanisms / 259 \\
Markus Ullmann and Matthias V{\"o}geler Enhancing RFID
Security and Privacy by Physically Unclonable Functions
/ 281 \\
Ahmad-Reza Sadeghi, Ivan Visconti, and Christian
Wachsmann Part VI Hardware-Based Security Architectures
and Applications \\
Authentication of Processor Hardware Leveraging
Performance Limits in Detailed Simulations and
Emulations / 309 \\
Daniel Y. Deng, Andrew H. Chan, and G. Edward Suh
Signal Authentication in Trusted Satellite Navigation
Receivers / 331 \\
Markus G. Kuhn On the Limits of Hypervisor- and Virtual
Machine Monitor-Based Isolation / 349 \\
Loic Duflot, Olivier Grumelard, Olivier Levillain, and
Benjamin Morin Efficient Secure Two-Party Computation
with Untrusted Hardware Tokens / 367 \\
Kimmo J{\"a}rvinen, Vladimir Kolesnikov, Ahmad-Reza
Sadeghi, and Thomas Schneider Towards Reliable Remote
Healthcare Applications Using Combined Fuzzy Extraction
/ 387 \\
Jorge Guajardo, Muhammad Asim, and Milan Petkovi{\'c}",
}
@Article{Saklikar:2010:IFV,
author = "Samir Saklikar and Subir Saha",
title = "Identity Federation for {VoIP} systems",
journal = j-J-COMP-SECUR,
volume = "18",
number = "4",
pages = "499--540",
month = "????",
year = "2010",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2008-0349",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:24:47 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Saleh:2010:GTF,
author = "Mohamed Saleh and Mourad Debbabi",
title = "A game-theoretic framework for specification and
verification of cryptographic protocols",
journal = j-FORM-ASP-COMPUT,
volume = "22",
number = "5",
pages = "585--609",
month = sep,
year = "2010",
CODEN = "FACME5",
DOI = "https://doi.org/10.1007/s00165-009-0129-4",
ISSN = "0934-5043 (print), 1433-299X (electronic)",
ISSN-L = "0934-5043",
bibdate = "Tue Mar 17 20:58:37 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/formaspcomput.bib",
URL = "http://link.springer.com/article/10.1007/s00165-009-0129-4",
acknowledgement = ack-nhfb,
fjournal = "Formal Aspects of Computing",
journal-URL = "http://link.springer.com/journal/165",
}
@Article{Salvail:2010:STR,
author = "Louis Salvail and Momtchil Peev and Eleni Diamanti and
Romain All{\'e}aume and Norbert L{\"u}tkenhaus and
Thomas L{\"a}nger",
title = "Security of trusted repeater quantum key distribution
networks",
journal = j-J-COMP-SECUR,
volume = "18",
number = "1",
pages = "61--87",
month = "????",
year = "2010",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2010-0373",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:24:34 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Sarier:2010:IAS,
author = "Neyire Deniz Sarier",
title = "Improving the accuracy and storage cost in biometric
remote authentication schemes",
journal = j-J-NETW-COMPUT-APPL,
volume = "33",
number = "3",
pages = "268--274",
month = may,
year = "2010",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:42 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804510000068",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Sarkar:2010:CRM,
author = "Santanu Sarkar and Subhamoy Maitra",
title = "Cryptanalysis of {RSA} with more than one decryption
exponent",
journal = j-INFO-PROC-LETT,
volume = "110",
number = "8--9",
pages = "336--340",
day = "1",
month = apr,
year = "2010",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 12:46:34 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Sarkar:2010:CRT,
author = "Santanu Sarkar and Subhamoy Maitra",
title = "Cryptanalysis of {RSA} with two decryption exponents",
journal = j-INFO-PROC-LETT,
volume = "110",
number = "5",
pages = "178--181",
day = "1",
month = feb,
year = "2010",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 12:46:31 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Sarkar:2010:SGC,
author = "Palash Sarkar",
title = "A Simple and Generic Construction of Authenticated
Encryption with Associated Data",
journal = j-TISSEC,
volume = "13",
number = "4",
pages = "33:1--33:??",
month = dec,
year = "2010",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1880022.1880027",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "We revisit the problem of constructing a protocol for
performing Authenticated Encryption with Associated
Data (AEAD). A technique is described which combines a
collision-resistant hash function with a protocol for
Authenticated Encryption (AE). The technique is both
simple and generic and does not require any additional
key material beyond that of the AE protocol. Concrete
instantiations are shown where a 256-bit hash function
is combined with some known single-pass AE protocols
employing either 128-bit or 256-bit block ciphers. This
results in possible efficiency improvement in the
processing of the header.",
acknowledgement = ack-nhfb,
articleno = "33",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@InProceedings{Saxena:2010:SGC,
author = "N. Saxena and C. Seshadhri",
title = "From {Sylvester--Gallai} Configurations to Rank
Bounds: Improved Black-Box Identity Test for Depth-$3$
Circuits",
crossref = "IEEE:2010:PIA",
pages = "21--29",
year = "2010",
DOI = "https://doi.org/10.1109/FOCS.2010.9",
bibdate = "Thu Apr 12 09:34:12 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/focs2010.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5669376",
}
@InBook{Schoenmakers:2010:VS,
author = "Berry Schoenmakers",
title = "Voting Schemes",
crossref = "Atallah:2010:ATC",
chapter = "15",
pages = "1--21",
year = "2010",
DOI = "https://doi.org/10.1201/9781584888215-c15",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.crcnetbase.com/doi/abs/10.1201/9781584888215-c15",
acknowledgement = ack-nhfb,
}
@Article{Schultz:2010:MMP,
author = "David Schultz and Barbara Liskov and Moses Liskov",
title = "{MPSS}: {Mobile Proactive Secret Sharing}",
journal = j-TISSEC,
volume = "13",
number = "4",
pages = "34:1--34:??",
month = dec,
year = "2010",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1880022.1880028",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "This article describes MPSS, a new way to do proactive
secret sharing. MPSS provides mobility: The group of
nodes holding the shares of the secret can change at
each resharing, which is essential in a long-lived
system. MPSS additionally allows the number of
tolerated faulty shareholders to change when the secret
is moved so that the system can tolerate more (or
fewer) corruptions; this allows reconfiguration
on-the-fly to accommodate changes in the environment.
MPSS includes an efficient protocol that is intended to
be used in practice. The protocol is optimized for the
common case of no or few failures, but degradation when
there are more failures is modest.",
acknowledgement = ack-nhfb,
articleno = "34",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Schutz:2010:DIN,
author = "Simon Sch{\"u}tz and Henrik Abrahamsson and Bengt
Ahlgren and Marcus Brunner",
title = "Design and implementation of the {Node Identity
Internetworking Architecture}",
journal = j-COMP-NET-AMSTERDAM,
volume = "54",
number = "7",
pages = "1142--1154",
day = "17",
month = may,
year = "2010",
CODEN = "????",
ISSN = "1389-1286",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:38 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@InBook{Seberry:2010:CTAa,
author = "Jennifer Seberry and Chris Charnes and Josef Pieprzyk
and Rei Safavi-Naini",
title = "Crypto Topics and Applications {I}",
crossref = "Atallah:2010:ATC",
chapter = "12",
pages = "1--31",
year = "2010",
DOI = "https://doi.org/10.1201/9781584888215-c12",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.crcnetbase.com/doi/abs/10.1201/9781584888215-c12",
acknowledgement = ack-nhfb,
}
@InBook{Seberry:2010:CTAb,
author = "Jennifer Seberry and Chris Charnes and Josef Pieprzyk
and Rei Safavi-Naini",
title = "Crypto Topics and Applications {II}",
crossref = "Atallah:2010:ATC",
chapter = "13",
pages = "1--32",
year = "2010",
DOI = "https://doi.org/10.1201/9781584888215-c13",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.crcnetbase.com/doi/abs/10.1201/9781584888215-c13",
acknowledgement = ack-nhfb,
}
@Article{Shabtai:2010:SAP,
author = "Asaf Shabtai and Yuval Fledel and Yuval Elovici",
title = "Securing {Android}-Powered Mobile Devices Using
{SELinux}",
journal = j-IEEE-SEC-PRIV,
volume = "8",
number = "3",
pages = "36--44",
month = may # "\slash " # jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2009.144",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed May 26 15:44:06 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Shaikh:2010:CTO,
author = "Siraj A. Shaikh and Joseph R. Rabaiotti",
title = "Characteristic trade-offs in designing large-scale
biometric-based identity management systems",
journal = j-J-NETW-COMPUT-APPL,
volume = "33",
number = "3",
pages = "342--351",
month = may,
year = "2010",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:42 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804510000032",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Shakiba:2010:IID,
author = "Mohsen Shakiba and Mohammad Dakhilalian and Hamid
Mala",
title = "An improved impossible differential cryptanalysis of
{Zodiac}",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "4",
pages = "702--709",
month = apr,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Shallit:2010:BRB,
author = "Jeffrey Shallit",
title = "Book Review: {{\booktitle{Cryptographic Applications
of Analytic Number Theory: Lower Bounds and
Pseudorandomness}}, by Igor Shparlinski, Birk{\"a}user,
2003}",
journal = j-SIGACT,
volume = "41",
number = "3",
pages = "44--45",
month = sep,
year = "2010",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1855118.1855128",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Mar 20 14:39:00 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Shparlinski:2003:CAA}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Shoufan:2010:NCA,
author = "A. Shoufan and T. Wink and H. G. Molter and S. A. Huss
and E. Kohnert",
title = "A Novel Cryptoprocessor Architecture for the
{McEliece} Public-Key Cryptosystem",
journal = j-IEEE-TRANS-COMPUT,
volume = "59",
number = "11",
pages = "1533--1546",
month = nov,
year = "2010",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2010.115",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sun Jul 3 11:52:33 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5477413",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Shparlinski:2010:NWP,
author = "Igor E. Shparlinski",
title = "Numbers at Work and Play",
journal = j-NAMS,
volume = "57",
number = "3",
pages = "334--342",
month = mar,
year = "2010",
CODEN = "AMNOAN",
ISSN = "0002-9920 (print), 1088-9477 (electronic)",
ISSN-L = "0002-9920",
bibdate = "Mon Feb 22 15:35:29 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.ams.org/notices/201003/",
acknowledgement = ack-nhfb,
fjournal = "Notices of the American Mathematical Society",
journal-URL = "http://www.ams.org/notices/",
keywords = "algebraic number theory; lattice-based cryptography;
pairing-based cryptography; Pell equations",
}
@Article{Shrestha:2010:KBA,
author = "Anish Prasad Shrestha and Dong-You Choi and Goo Rak
Kwon and Seung-Jo Han",
title = "{Kerberos} based authentication for inter-domain
roaming in wireless heterogeneous network",
journal = j-COMPUT-MATH-APPL,
volume = "60",
number = "2",
pages = "245--255",
month = jul,
year = "2010",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122110000416",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Shyu:2010:VMS,
author = "Shyong Jian Shyu and Kun Chen",
title = "Visual Multiple-Secret Sharing by Circle Random
Grids",
journal = j-SIAM-J-IMAGING-SCI,
volume = "3",
number = "4",
pages = "926--953",
month = "????",
year = "2010",
CODEN = "SJISBI",
DOI = "https://doi.org/10.1137/080722023",
ISSN = "1936-4954",
bibdate = "Fri Mar 4 10:43:16 MST 2011",
bibsource = "http://epubs.siam.org/SIIMS/siims_toc.html/3/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://epubs.siam.org/siims/resource/1/sjisbi/v3/i4/p926_s1",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Imaging Sciences",
journal-URL = "http://epubs.siam.org/siims",
onlinedate = "November 30, 2010",
}
@Article{Simpson:2010:ESB,
author = "Edward Simpson",
title = "{Edward Simpson}: {Bayes} at {Bletchley Park}",
journal = j-SIGNIF,
volume = "7",
number = "2",
pages = "76--80",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1111/j.1740-9713.2010.00424.x",
ISSN = "1740-9705 (print), 1740-9713 (electronic)",
ISSN-L = "1740-9705",
bibdate = "Thu Aug 13 12:03:49 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/significance.bib",
acknowledgement = ack-nhfb,
ajournal = "Signif.",
fjournal = "Significance",
journal-URL = "https://rss.onlinelibrary.wiley.com/journal/17409713",
onlinedate = "18 May 2010",
remark = "From the abstract: ``Here Edward Simpson tells the
hitherto unpublished story of the part that Bayesian
statistics played in breaking two of the enemy
ciphers.''",
}
@InProceedings{Somani:2010:IDS,
author = "U. Somani and K. Lakhani and M. Mundra",
title = "Implementing digital signature with {RSA} encryption
algorithm to enhance the Data Security of cloud in
Cloud Computing",
crossref = "Chaudhuri:2010:PIC",
pages = "211--216",
year = "2010",
DOI = "https://doi.org/10.1109/PDGC.2010.5679895",
bibdate = "Thu Apr 21 10:52:19 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Article{Sopka:2010:BTS,
author = "Katherine R. Sopka and Elisabeth M. Sopka",
title = "The {Bonebrake Theological Seminary}: Top-Secret
{Manhattan Project} Site",
journal = j-PHYS-PERSPECT,
volume = "12",
number = "3",
pages = "338--349",
month = sep,
year = "2010",
CODEN = "PHPEF2",
DOI = "https://doi.org/10.1007/s00016-010-0019-4",
ISSN = "1422-6944 (print), 1422-6960 (electronic)",
ISSN-L = "1422-6944",
bibdate = "Thu Jun 27 20:50:40 MDT 2013",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1422-6944&volume=12&issue=3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/physperspect.bib",
URL = "http://link.springer.com/article/10.1007/s00016-010-0019-4",
acknowledgement = ack-nhfb,
fjournal = "Physics in Perspective (PIP)",
journal-URL = "http://link.springer.com/journal/16",
}
@Article{Sorniotti:2010:PSS,
author = "Alessandro Sorniotti and Refik Molva",
title = "A provably secure secret handshake with dynamic
controlled matching",
journal = j-COMPUT-SECUR,
volume = "29",
number = "5",
pages = "619--627",
month = jul,
year = "2010",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:21 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404809001370",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Stanton:2010:FAD,
author = "Paul T. Stanton and Benjamin McKeown and Randal Burns
and Giuseppe Ateniese",
title = "{FastAD}: an authenticated directory for billions of
objects",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "45--49",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740401",
ISSN = "0163-5980",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "We develop techniques that make authenticated
directories efficient and scalable toward the goal of
managing tens of billions of objects in a single
directory. Internet storage services have already
realized this scale: Amazon's S3 contained more than 52
billion objects as of April 2009 [1]. Our contributions
include defining on-disk, block-oriented data
structures and algorithms for authenticated directories
that exceed memory capacity and optimizations that
reduce the I/O required to insert and access entries in
the directory.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@TechReport{Svaba:2010:PKC,
author = "Pavol Svaba and Tran van Trung",
title = "Public key cryptosystem {MST\_1tn3}: cryptanalysis and
realization",
type = "Technical report",
number = "2010,2",
institution = "Institut f{\"u}r Experimentelle Mathematik,
Universit{\"a}t Duisburg-Essen",
address = "Duisburg, Germany",
pages = "37",
year = "2010",
bibdate = "Fri May 13 06:50:43 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Article{Szalachowski:2010:CCG,
author = "P. Szalachowski and B. Ksiezopolski and Z. Kotulski",
title = "{CMAC}, {CCM} and {GCM/GMAC}: {Advanced} modes of
operation of symmetric block ciphers in wireless sensor
networks",
journal = j-INFO-PROC-LETT,
volume = "110",
number = "7",
pages = "247--251",
day = "1",
month = mar,
year = "2010",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 12:46:33 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Misc{Tarnovsky:2010:DSP,
author = "Christopher Tarnovsky",
title = "Deconstructing a secure processor",
howpublished = "BlackHat Briefings",
year = "2010",
bibdate = "Mon Mar 09 16:07:19 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 74]{Schneier:2015:SWC}.",
}
@Article{Tsai:2010:RLI,
author = "H.-H. Tsai and H.-C. Tseng and Y.-S. Lai",
title = "Robust lossless image watermarking based on $ \alpha
$-trimmed mean algorithm and support vector machine",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "6",
pages = "1015--1028",
month = jun,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Tsang:2010:BRR,
author = "Patrick P. Tsang and Man Ho Au and Apu Kapadia and
Sean W. Smith",
title = "{BLAC}: Revoking Repeatedly Misbehaving Anonymous
Users without Relying on {TTPs}",
journal = j-TISSEC,
volume = "13",
number = "4",
pages = "39:1--39:??",
month = dec,
year = "2010",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1880022.1880033",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Several credential systems have been proposed in which
users can authenticate to service providers
anonymously. Since anonymity can give users the license
to misbehave, some variants allow the selective
deanonymization (or linking) of misbehaving users upon
a complaint to a Trusted Third Party (TTP). The ability
of the TTP to revoke a user's privacy at any time,
however, is too strong a punishment for misbehavior. To
limit the scope of deanonymization, some systems have
been proposed in which users can be deanonymized only
if they authenticate ``too many times,'' such as
``double spending'' with electronic cash. While useful
in some applications, such techniques cannot be
generalized to more subjective definitions of
misbehavior, for example, using such schemes it is not
possible to block anonymous users who ``deface too many
Web pages'' on a Web site.",
acknowledgement = ack-nhfb,
articleno = "39",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Tuan:2010:AWB,
author = "Do Van Tuan and Ui-Pil Chong",
title = "Audio Watermarking Based on Advanced {Wigner}
Distribution and Important Frequency Peaks",
journal = j-IJHPCA,
volume = "24",
number = "2",
pages = "154--163",
month = may,
year = "2010",
CODEN = "IHPCFL",
DOI = "https://doi.org/10.1177/1094342009106597",
ISSN = "1094-3420 (print), 1741-2846 (electronic)",
ISSN-L = "1094-3420",
bibdate = "Tue Aug 31 09:59:46 MDT 2010",
bibsource = "http://hpc.sagepub.com/content/24/2.toc;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://hpc.sagepub.com/content/24/2/154.full.pdf+html",
acknowledgement = ack-nhfb,
journal-URL = "http://hpc.sagepub.com/content/by/year",
}
@Article{Vetter:2010:ABV,
author = "Ron Vetter",
title = "Authentication by Biometric Verification",
journal = j-COMPUTER,
volume = "43",
number = "2",
pages = "28--29",
month = feb,
year = "2010",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2010.31",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Wed May 12 22:57:42 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@PhdThesis{Vuagnoux:2010:CAC,
author = "Martin Vuagnoux",
title = "Computer Aided Cryptanalysis from Ciphers to Side
Channels",
type = "Th{\`e}se",
school = "{\'E}cole polytechnique f{\'e}d{\'e}rale de Lausanne
(EPFL)",
address = "Lausanne",
pages = "191",
year = "2010",
DOI = "https://doi.org/10.5075/epfl-thesis-4769",
bibdate = "Fri May 13 06:36:07 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
advisor = "Serge Vaudenay",
}
@InBook{Wagstaff:2010:C,
author = "Samuel S. {Wagstaff, Jr.}",
title = "Cryptanalysis",
crossref = "Atallah:2010:ATC",
chapter = "11",
pages = "1--16",
year = "2010",
DOI = "https://doi.org/10.1201/9781584888215-c11",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.crcnetbase.com/doi/abs/10.1201/9781584888215-c11",
acknowledgement = ack-nhfb,
}
@Article{Wang:2010:DVT,
author = "Xiaofeng Wang and Philippe Golle and Markus Jakobsson
and Alex Tsow",
title = "Deterring voluntary trace disclosure in re-encryption
mix-networks",
journal = j-TISSEC,
volume = "13",
number = "2",
pages = "18:1--18:??",
month = feb,
year = "2010",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1698750.1698758",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Tue Mar 16 10:18:15 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
articleno = "18",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Wang:2010:IIB,
author = "Xu An Wang and Xiaoyuan Yang",
title = "On the Insecurity of an Identity Based Proxy
Re-encryption Scheme",
journal = j-FUND-INFO,
volume = "98",
number = "2--3",
pages = "277--281",
month = apr,
year = "2010",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2010-227",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:09:55 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Wang:2010:NSB,
author = "Xiang Wang",
editor = "Cheng-Xiang Wang",
booktitle = "{Proceedings of the 2010 International Conference on
Communications and Mobile Computing (CMC). 12--14 April
2010, Shenzhen, China}",
title = "A New {SDVS} Based on {NTRUSign}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "205--??",
year = "2010",
DOI = "https://doi.org/10.1109/CMC.2010.258",
ISBN = "1-4244-6327-0",
ISBN-13 = "978-1-4244-6327-5",
LCCN = "????",
bibdate = "Thu Apr 21 11:09:21 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.gbv.de:20011/gvk",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=5471195",
abstract = "In this paper, we propose a new strong designated
verifier signature scheme. It is constructed by the
NTRUSign signature algorithm whose security is based on
the hardness of closest vector problem (CVP). We
analyze the security of this scheme in great details
and conclude that it has the characters of strong
designated verifier signature schemes. Therefore, it is
believed that the new scheme will have a bright
future.",
acknowledgement = ack-nhfb,
keywords = "ANSI X9.98-2010; NTRUSign",
}
@Article{Wright:2010:USP,
author = "Charles V. Wright and Lucas Ballard and Scott E. Coull
and Fabian Monrose and Gerald M. Masson",
title = "Uncovering Spoken Phrases in Encrypted Voice over {IP}
Conversations",
journal = j-TISSEC,
volume = "13",
number = "4",
pages = "35:1--35:??",
month = dec,
year = "2010",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1880022.1880029",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Although Voice over IP (VoIP) is rapidly being
adopted, its security implications are not yet fully
understood. Since VoIP calls may traverse untrusted
networks, packets should be encrypted to ensure
confidentiality. However, we show that it is possible
to identify the phrases spoken within encrypted VoIP
calls when the audio is encoded using variable bit rate
codecs. To do so, we train a hidden Markov model using
only knowledge of the phonetic pronunciations of words,
such as those provided by a dictionary, and search
packet sequences for instances of specified phrases.
Our approach does not require examples of the speaker's
voice, or even example recordings of the words that
make up the target phrase. We evaluate our techniques
on a standard speech recognition corpus containing over
2,000 phonetically rich phrases spoken by 630 distinct
speakers from across the continental United States. Our
results indicate that we can identify phrases within
encrypted calls with an average accuracy of 50\%, and
with accuracy greater than 90\% for some phrases.
Clearly, such an attack calls into question the
efficacy of current VoIP encryption standards. In
addition, we examine the impact of various features of
the underlying audio on our performance and discuss
methods for mitigation.",
acknowledgement = ack-nhfb,
articleno = "35",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Wu:2010:EUA,
author = "Tsu-Yang Wu and Yuh-Min Tseng",
title = "An efficient user authentication and key exchange
protocol for mobile client--server environment",
journal = j-COMP-NET-AMSTERDAM,
volume = "54",
number = "9",
pages = "1520--1530",
day = "17",
month = jun,
year = "2010",
CODEN = "????",
ISSN = "1389-1286",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:38 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Wu:2010:IBM,
author = "Tsu-Yang Wu and Yuh-Min Tseng",
title = "An {ID}-Based Mutual Authentication and Key Exchange
Protocol for Low-Power Mobile Devices",
journal = j-COMP-J,
volume = "53",
number = "7",
pages = "1062--1070",
month = sep,
year = "2010",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxp083",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Aug 3 15:48:45 MDT 2010",
bibsource = "http://comjnl.oxfordjournals.org/content/vol53/issue7/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/53/7/1062;
http://comjnl.oxfordjournals.org/cgi/reprint/53/7/1062",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Xiao:2010:TAT,
author = "Xiaokui Xiao and Yufei Tao and Nick Koudas",
title = "Transparent anonymization: {Thwarting} adversaries who
know the algorithm",
journal = j-TODS,
volume = "35",
number = "2",
pages = "8:1--8:??",
month = apr,
year = "2010",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/1735886.1735887",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Apr 28 13:44:08 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Numerous generalization techniques have been proposed
for privacy-preserving data publishing. Most existing
techniques, however, implicitly assume that the
adversary knows little about the anonymization
algorithm adopted by the data publisher. Consequently,
they cannot guard against privacy attacks that exploit
various characteristics of the anonymization mechanism.
This article provides a practical solution to this
problem. First, we propose an analytical model for
evaluating disclosure risks, when an adversary knows
{\em everything\/} in the anonymization process, except
the sensitive values. Based on this model, we develop a
privacy principle, {\em transparent l-diversity}, which
ensures privacy protection against such powerful
adversaries. We identify three algorithms that achieve
transparent $l$-diversity, and verify their
effectiveness and efficiency through extensive
experiments with real data.",
acknowledgement = ack-nhfb,
articleno = "8",
fjournal = "ACM Transactions on Database Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
keywords = "generalization; l-diversity; Privacy-preserving data
publishing",
}
@InProceedings{Xin:2010:IEB,
author = "Hong Xin and Zhu Shujing and Chen Weibin and Jian
Chongjun",
booktitle = "{2010 International Conference on Computer Application
and System Modeling (ICCASM)}",
title = "An image encryption base on non-linear pseudo-random
number generator",
volume = "9",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "V9--238--V9--241",
year = "2010",
DOI = "https://doi.org/10.1109/ICCASM.2010.5623043",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5623043",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5602791",
}
@Article{Yang:2010:CRS,
author = "Cheng-Hsing Yang and Shiuh-Jeng Wang and Chi-Yao
Weng",
title = "Capacity-Raising Steganography Using Multi-Pixel
Differencing and Pixel-Value Shifting Operations",
journal = j-FUND-INFO,
volume = "98",
number = "2--3",
pages = "321--336",
month = apr,
year = "2010",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2010-229",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:09:55 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Yao:2010:ASP,
author = "Yurong Yao and Edward Watson and Beverly K. Kahn",
title = "Application service providers: market and adoption
decisions",
journal = j-CACM,
volume = "53",
number = "7",
pages = "113--117",
month = jul,
year = "2010",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1785414.1785447",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Jul 15 17:10:30 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Introduction\par
IT outsourcing has been a viable business strategy
since the late 1950s when companies began to invest
significant resources in outside computing services. As
IT managers increasingly used time sharing, contract
programming, and facilities management, the next few
decades saw accompanying increases in efficiency in
software applications and services, not to mention
decreased operations costs. In 1989, when Kodak
outsourced its entire IT department to IBM and EDS, the
business world had to scramble to get over its initial
shock. Seemingly overnight, 'software' and 'service'
had become strange bedfellows. The rules of the game
had radically changed.\par
Since the mid-1990s, the explosion in Internet
connectivity, increased bandwidth, and the ubiquitous
nature of computing have made the delivery of software
applications from remote data centers both
technologically feasible and economically attractive. A
relatively new form of IS outsourcing, Application
Services Provision (ASP), provides applications to
multiple entities from its data center across a wide
area network. Similar to the telephone services model,
clients pay a monthly fee to access online applications
from an ASP. Advances in encryption and firewall
technology remove a client's security concerns for
using remotely hosted services. Active research on ASP
outsourcing (also called NetSourcing) has attracted
academic scholars and business practitioners alike, but
few have investigated the specifics of the market and
the decision process to adopt the ASP model.\par
ASPs today are quite different from what they were five
years ago, in large part because this dynamic industry
has experienced significant merger and acquisition
activity. Forty percent of ASPs active in 2001 were no
longer in business in 2004. Traditional software
companies also have jumped on the ASP bandwagon,
developing new technologies to deliver on-demand
services. The scope of hosted applications for ASPs has
also shifted significantly as certain applications were
scrapped for lack of profitability, for example,
overall enterprise system hosting with no specific
industrial solutions. However, a Forrester report
predicted that as eCommerce continued to grow 30\% -
40\% in 2005, the demand for licensed software products
would decrease while demand for hosted services
increases. This prediction seems to be reality, as ASP
hosting solutions are increasingly viable and
attractive business models.\par
Thus, to update our knowledge of the rapidly changing
ASP market and to help practitioners make
better-informed ASP adoption decisions, this article
addresses two central questions: What is the structure
of the current market? And what factors should clients
consider in their ASP adoption decisions?",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Yao:2010:IDA,
author = "Lin Yao and Lei Wang and Xiangwei Kong and Guowei Wu
and Feng Xia",
title = "An inter-domain authentication scheme for pervasive
computing environment",
journal = j-COMPUT-MATH-APPL,
volume = "60",
number = "2",
pages = "234--244",
month = jul,
year = "2010",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122110000210",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Ye:2010:ACC,
author = "Guodong Ye",
title = "Another Constructed Chaotic Image Encryption Scheme
Based on {Toeplitz} Matrix and {Hankel} Matrix",
journal = j-FUND-INFO,
volume = "101",
number = "4",
pages = "321--333",
month = dec,
year = "2010",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2010-291",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:10:40 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Yeh:2010:TRR,
author = "Kuo-Hui Yeh and Chunhua Su and N. W. Lo and Yingjiu Li
and Yi-Xiang Hung",
title = "Two robust remote user authentication protocols using
smart cards",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "12",
pages = "2556--2565",
month = dec,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Mon Nov 1 11:40:41 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Book{Yekhanin:2010:LDC,
author = "Sergey Yekhanin",
title = "Locally Decodable Codes and Private Information
Retrieval Schemes",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 82",
year = "2010",
DOI = "https://doi.org/10.1007/978-3-642-14358-8",
ISBN = "3-642-14357-1 (hardcover), 3-642-14358-X (e-book)",
ISBN-13 = "978-3-642-14357-1 (hardcover), 978-3-642-14358-8
(e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.A25 Y45 2010eb",
bibdate = "Sat Jun 10 08:35:07 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/978-3-642-14358-8",
abstract = "Locally decodable codes (LDCs) are codes that
simultaneously provide efficient random access
retrieval and high noise resilience by allowing
reliable reconstruction of an arbitrary bit of a
message by looking at only a small number of randomly
chosen codeword bits. Local decodability comes with a
certain loss in terms of efficiency - specifically,
locally decodable codes require longer codeword lengths
than their classical counterparts. Private information
retrieval (PIR) schemes are cryptographic protocols
designed to safeguard the privacy of database users.
They allow clients to retrieve records from public
databases while completely hiding the identity of the
retrieved records from database owners. In this book
the author provides a fresh algebraic look at the
theory of locally decodable codes and private
information retrieval schemes, obtaining new families
of each which have much better parameters than those of
previously known constructions, and he also proves
limitations of two server PIRs in a restricted setting
that covers all currently known schemes. The author's
related thesis won the ACM Dissertation Award in 2007,
and this book includes some expanded sections and
proofs, and notes on recent developments.",
acknowledgement = ack-nhfb,
shorttableofcontents = "Introduction \\
Locally Decodable Codes via the the Point Removal
Method \\
Limitations of the Point Removal Method \\
Private Information Retrieval \\
References \\
Index",
subject = "Computer science; Data structures (Computer science);
Fehlerkorrekturcode; swd; Information Retrieval;
Kryptologie; Privatsph{\"a}re; Sicherheitsprotokoll;
Computer science; Data structures (Computer science);
Fehlerkorrekturcode; Information Retrieval;
Kryptologie; Privatsph{\"a}re; Sicherheitsprotokoll;
Sicherheitsprotokoll; Information Retrieval;
Privatsph{\"a}re; Kryptologie; Fehlerkorrekturcode.",
tableofcontents = "Introduction / 1 \\
1.1 Locally decodable codes / 1 \\
1.1.1 Hadamard code / 2 \\
1.1.2 A code based on polynomial interpolation / 3 \\
1.2 Private information retrieval schemes / 4 \\
1.2.1 A PIR scheme based on polynomial interpolation /
5 \\
1.3 The history of LDCs and PIR schemes / 6 \\
1.3.1 The first generation: interpolation / 7 \\
1.3.2 The second generation: recursion / 8 \\
1.3.3 The third generation: point removal / 9 \\
1.3.4 Lower bounds / 12 \\
1.4 Applications of LDCs and PIR schemes / 13 \\
1.4.1 Secure multiparty computation / 13 \\
1.4.2 Other models of private information retrieval /
14 \\
1.4.3 Average-case complexity / 16 \\
1.5 Organization of the book / 16 \\
1.6 Addendum / 17 \\
2 Locally decodable codes via the point removal method
/ 19 \\
2.1 Notation / 19 \\
2.2 Locally decodable codes / 20 \\
2.3 Binary LDCs via point removal / 20 \\
2.3.1 Regular intersecting families of sets / 21 \\
2.3.2 Basic construction / 22 \\
2.3.3 The main construction: point removal / 24 \\
2.4 General LDCs via point removal / 26 \\
2.5 Combinatorially nice subsets of $\mathbb{F}_p$ / 30
\\
2.6 Algebraically nice subsets of $\mathbb{F}^*_p$ / 32
\\
2.6.1 3-dependences between p-th roots: sufficient
conditions / 34 \\
2.6.2 $k$-dependences between p-th roots: a sufficient
condition / 35 \\
2.6.3 Summary / 39 \\
2.7 Results / 39 \\
2.7.1 Results for three-query binary codes / 40 \\
2.7.2 Results for general codes / 41 \\
2.8 Addendum / 42 \\
2.8.1 The code / 44 \\
3 Limitations of the point removal method / 47 \\
3.1 Attaining subexponential length requires a nice
sequence / 47 \\
3.1.1 Point removal method / 47 \\
3.1.2 Point removal and bounds for $P(r^t 1)$ / 48 \\
3.1.3 Our results / 48 \\
3.2 A nice sequence yields short dependences between
p-th roots / 49 \\
3.2.1 Algebraically nice subsets of $\mathbb{F}^*_q$ /
50 \\
3.2.2 Combinatorially nice subsets of $\mathbb{F}^*_q$
/ 53 \\
3.2.3 Summary / 55 \\
3.3 $k$-dependences between p-ih roots: a necessary
condition / 56 \\
3.4 3-dependences between p-th roots: a necessary
condition / 57 \\
3.5 Summary / 58 \\
3.6 Conclusions / 59 \\
3.7 Addendum / 59 \\
4 Private information retrieval / 61 \\
4.1 Preliminaries / 61 \\
4.2 From LDCs to PIR schemes / 62 \\
4.2.1 Upper bounds for three-server binary PIR schemes
/ 64 \\
4.2.2 Upper bounds for general PIR schemes / 65 \\
4.3 A combinatorial view of two-server PIR / 66 \\
4.3.1 Bilinear PIR / 69 \\
4.3.2 Group-based PIR / 69 \\
4.4 Complexity of bilinear group-based PIR / 70 \\
4.4.1 Algebraic preliminaries / 70 \\
4.4.2 Algebraic formulation / 71 \\
4.4.3 Low-dimensional principal ideals in group
algebras / 72 \\
4.5 Summary of lower bounds for two-server PIR / 73 \\
4.6 Addendum / 74 \\
References / 75 \\
Index / 81",
}
@Article{Yoo:2010:IRR,
author = "Sang-Kyung Yoo and Deniz Karakoyunlu and Berk Birand
and Berk Sunar",
title = "Improving the Robustness of Ring Oscillator {TRNGs}",
journal = j-TRETS,
volume = "3",
number = "2",
pages = "9:1--9:??",
month = may,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1754386.1754390",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Tue Jun 22 16:00:33 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "A ring oscillator-based true-random number generator
design (Rings design) was introduced in Sunar et al.
[2007]. The design was rigorously analyzed under a
simple mathematical model and its performance
characteristics were established. In this article we
focus on the practical aspects of the Rings design on a
reconfigurable logic platform and determine their
implications on the earlier analysis framework. We make
recommendations for avoiding pitfalls in real-life
implementations by considering ring interaction,
transistor-level effects, narrow signal rejection,
transmission line attenuation, and sampler bias.
Furthermore, we present experimental results showing
that changing operating conditions such as the power
supply voltage or the operating temperature may affect
the output quality when the signal is subsampled.
Hence, an attacker may shift the operating point via a
simple noninvasive influence and easily bias the TRNG
output. Finally, we propose modifications to the design
which significantly improve its robustness against
attacks, alleviate implementation-related problems, and
simultaneously improve its area, throughput, and power
performance.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
keywords = "cryptography; Oscillator rings; true random number
generators",
}
@Article{Yu:2010:IBF,
author = "Jia Yu and Rong Hao and Fanyu Kong and Xiangguo Cheng
and Huawei Zhao and Chen Yangkui",
title = "Identity-Based Forward Secure Threshold Signature
Scheme Based on Mediated {RSA}",
journal = j-INT-J-COMPUT-APPL,
volume = "32",
number = "4",
pages = "469--475",
year = "2010",
DOI = "https://doi.org/10.2316/Journal.202.2010.4.202-2927",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:26:51 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2010.4.202-2927",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Yu:2010:PSI,
author = "Gang Yu and Xiaoxiao Ma and Yong Shen and Wenbao Han",
title = "Provable secure identity based generalized
signcryption scheme",
journal = j-THEOR-COMP-SCI,
volume = "411",
number = "40--42",
pages = "3614--3624",
day = "6",
month = sep,
year = "2010",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Aug 31 09:12:46 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Zafar:2010:GRN,
author = "Fahad Zafar and Marc Olano and Aaron Curtis",
editor = "????",
booktitle = "HPG '10 Proceedings of the Conference on High
Performance Graphics, Saarbrucken, Germany, June
25--27, 2010",
title = "{GPU} random numbers via the {Tiny Encryption
Algorithm}",
publisher = "Eurographics Association",
address = "Aire-la-Ville, Switzerland",
pages = "133--141",
year = "2010",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Sun Dec 18 09:52:12 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.cs.umbc.edu/~olano/papers/GPUTEA.pdf",
acknowledgement = ack-nhfb,
}
@Article{Zhang:2010:ASL,
author = "Youtao Zhang and Jun Yang and Weijia Li and Linzhang
Wang and Lingling Jin",
title = "An authentication scheme for locating compromised
sensor nodes in {WSNs}",
journal = j-J-NETW-COMPUT-APPL,
volume = "33",
number = "1",
pages = "50--62",
month = jan,
year = "2010",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:38 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804509000976",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Zhang:2010:EMO,
author = "Lei Zhang and Bo Qin and Qianhong Wu and Futai Zhang",
title = "Efficient many-to-one authentication with
certificateless aggregate signatures",
journal = j-COMP-NET-AMSTERDAM,
volume = "54",
number = "14",
pages = "2482--2491",
day = "6",
month = oct,
year = "2010",
CODEN = "????",
ISSN = "1389-1286",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:40 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Zhang:2010:ESP,
author = "Jianhong Zhang and Chenglian Liu and Yixian Yang",
title = "An efficient secure proxy verifiably encrypted
signature scheme",
journal = j-J-NETW-COMPUT-APPL,
volume = "33",
number = "1",
pages = "29--34",
month = jan,
year = "2010",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:38 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804509001039",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Zhang:2010:NSS,
author = "Qing Zhang and John McCullough and Justin Ma and Nabil
Schear and Michael Vrable and Amin Vahdat and Alex C.
Snoeren and Geoffrey M. Voelker and Stefan Savage",
title = "{Neon}: system support for derived data management",
journal = j-SIGPLAN,
volume = "45",
number = "7",
pages = "63--74",
month = jul,
year = "2010",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1735997.1736008",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Fri Oct 8 17:55:01 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Modern organizations face increasingly complex
information management requirements. A combination of
commercial needs, legal liability and regulatory
imperatives has created a patchwork of mandated
policies. Among these, personally identifying customer
records must be carefully access-controlled, sensitive
files must be encrypted on mobile computers to guard
against physical theft, and intellectual property must
be protected from both exposure and 'poisoning.'
However, enforcing such policies can be quite difficult
in practice since users routinely share data over
networks and derive new files from these
inputs--incidentally laundering any policy
restrictions. In this paper, we describe a virtual
machine monitor system called Neon that transparently
labels derived data using byte-level 'tints' and tracks
these labels end to end across commodity applications,
operating systems and networks. Our goal with Neon is
to explore the viability and utility of transparent
information flow tracking within conventional networked
systems when used in the manner in which they were
intended. We demonstrate that this mechanism allows the
enforcement of a variety of data management policies,
including data-dependent confinement, mandatory I/O
encryption, and intellectual property management.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "difc; memory tainting; qemu; virtualization; xen",
}
@Article{Zhao:2010:IFU,
author = "Xi Zhao and Anthony Tung Shuen Ho and Yun Q. Shi",
title = "Image Forensics Using Generalised {Benford's Law} for
Improving Image Authentication Detection Rates in
Semi-Fragile Watermarking",
journal = "International Journal of Digital Crime and Forensics",
volume = "2",
number = "2",
pages = "1--20",
month = "????",
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.4018/jdcf.2010040101",
ISSN = "1941-6210 (print), 1941-6229 (electronic)",
ISSN-L = "1941-6210",
bibdate = "Wed Mar 29 09:27:49 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://dblp.org/db/journals/ijdcf/ijdcf2.html#ZhaoHS10",
acknowledgement = ack-nhfb,
ajournal = "Int. J. Digit. Crime Forensics",
dblp-key = "journals/ijdcf/ZhaoHS10",
dblp-mdate = "2020-08-12",
fjournal = "International Journal of Digital Crime and Forensics",
journal-URL = "https://www.igi-global.com/gateway/journal/1112",
}
@Article{Zhao:2010:PSA,
author = "Jianjie Zhao and Dawu Gu",
title = "Provably secure authenticated key exchange protocol
under the {CDH} assumption",
journal = j-J-SYST-SOFTW,
volume = "83",
number = "11",
pages = "2297--2304",
month = nov,
year = "2010",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Mon Nov 1 11:40:40 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Book{Zheng:2010:PS,
editor = "Yuliang Zheng and Moti Yung and Alexander W. Dent",
title = "Practical Signcryption",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xviii + 274",
year = "2010",
DOI = "https://doi.org/10.1007/978-3-540-89411-7",
ISBN = "3-540-89409-8, 3-540-89411-X (e-book)",
ISBN-13 = "978-3-540-89409-4, 978-3-540-89411-7 (e-book)",
LCCN = "QA76. 9. A25 P73 2010",
bibdate = "Sat Jun 10 08:34:52 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Information Security and Cryptography",
acknowledgement = ack-nhfb,
subject = "Cryptography; Elektronische Unterschrift;
Public-Key-Kryptosystem; COMPUTERS; Internet; Security;
Networking; Security; General; Aufsatzsammlung; Data
encryption (Computer science)",
tableofcontents = "Front Matter / i--xviii \\
Introduction / Yuliang Zheng / 1--18 \\
Security Models for Signcryption \\
Front Matter / 19--19 \\
Security for Signcryption: The Two-User Model / Jee Hea
An, Tal Rabin / 21--42 \\
Security for Signcryption: The Multi--User Model /
Joonsang Baek, Ron Steinfeld / 43--53 \\
Signcryption Schemes \\
Front Matter / 55--55 \\
Signcryption Schemes Based on the Diffie Hellman
Problem / Paulo S. L. M. Barreto, Beno{\^\i}t Libert,
Noel McCullagh, Jean-Jacques Quisquater / 57--69 \\
Signcryption Schemes Based on Bilinear Maps / Paulo S.
L. M. Barreto, Beno{\^\i}t Libert, Noel McCullagh,
Jean-Jacques Quisquater / 71--97 \\
Signcryption Schemes Based on the RSA Problem /
Alexander W. Dent, John Malone-Lee / 99--117 \\
Construction Techniques \\
Front Matter / 119--119 \\
Hybrid Signcryption / Tor E. Bj{\o}rstad / 121--147 \\
Concealment and Its Applications to Authenticated
Encryption / Yevgeniy Dodis / 149--173 \\
Parallel Signcryption / Josef Pieprzyk, David
Pointcheval / 175--192 \\
Extensions of Signcryption \\
Front Matter / 193--193 \\
Identity-Based Signcryption / Xavier Boyen / 195--216
\\
Key Establishment Using Signcryption Techniques /
Alexander W. Dent / 217--240 \\
Applications of Signcryption / Yang Cui, Goichiro
Hanaoka / 241--256 \\
Back Matter / 257--274",
}
@Article{Zimand:2010:SEC,
author = "Marius Zimand",
title = "Simple extractors via constructions of cryptographic
pseudo-random generators",
journal = j-THEOR-COMP-SCI,
volume = "411",
number = "10",
pages = "1236--1250",
day = "4",
month = mar,
year = "2010",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 17:10:24 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Book{Aczel:2011:SWL,
author = "Amir D. Aczel",
title = "A Strange Wilderness: the Lives of the Great
Mathematicians",
publisher = "Sterling",
address = "New York, NY, USA",
pages = "xix + 284",
year = "2011",
ISBN = "1-4027-8584-4 (hardback), 1-4027-9085-6 (e-book)",
ISBN-13 = "978-1-4027-8584-9 (hardback), 978-1-4027-9085-0
(e-book)",
LCCN = "QA21 .A29 2011",
bibdate = "Thu Jun 7 16:36:39 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
z3950.loc.gov:7090/Voyager",
abstract = "Bestselling popular science author Amir Aczel selects
the most fascinating individuals and stories in the
history of mathematics, presenting a colorful narrative
that explores the quirky personalities behind some of
the most profound, enduring theorems. Through such
mathematical geniuses as Archimedes, Leonardo of Pisa
(a.k.a. Fibonacci), Tartaglia (`the stutterer'),
Descartes, Gottfried Leibniz, Carl Gauss, Joseph
Fourier (Napoleon's mathematician), Evariste Galois,
Georg Cantor, Ramanujan, and `Nicholas Bourbaki,' we
gather little known details about the alliances and
rivalries that profoundly impacted the development of
what the scheming doctor-turned-mathematician Geronimo
Girolamo called `The Great Art'. This story of
mathematics is not your dry `college textbook' account;
tales of duels, battlefield heroism, flamboyant
arrogance, pranks, secret societies, imprisonment,
feuds, theft, and even some fatal errors of judgment
fill these pages (clearly, genius doesn't guarantee
street smarts). Ultimately, readers will come away from
this book entertained, with a newfound appreciation of
the tenacity, complexity, eccentricity, and brilliance
of the mathematical genius",
acknowledgement = ack-nhfb,
subject = "Mathematics; History; Mathematicians",
tableofcontents = "Hellenic foundations \\
God is number \\
Plato's Academy \\
Alexandria \\
The East \\
The House of Wisdom \\
Medieval China \\
Renaissance mathematics \\
Italian shenanigans \\
Heresy \\
To calculus and beyond \\
The gentleman soldier \\
The greatest rivalry \\
Geniuses of the Enlightenment \\
Upheaval in France \\
Napoleon's mathematicians \\
Duel at dawn \\
Toward a new mathematics \\
Infinity and mental illness \\
Unlikely heroes \\
The strangest wilderness",
}
@Article{Adikari:2011:HBT,
author = "Jithra Adikari and Vassil S. Dimitrov and Laurent
Imbert",
title = "Hybrid Binary-Ternary Number System for Elliptic Curve
Cryptosystems",
journal = j-IEEE-TRANS-COMPUT,
volume = "60",
number = "2",
pages = "254--265",
month = feb,
year = "2011",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2010.138",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sun Feb 20 19:15:33 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Afanasyev:2011:PPN,
author = "Mikhail Afanasyev and Tadayoshi Kohno and Justin Ma
and Nick Murphy and Stefan Savage and Alex C. Snoeren
and Geoffrey M. Voelker",
title = "Privacy-preserving network forensics",
journal = j-CACM,
volume = "54",
number = "5",
pages = "78--87",
month = may,
year = "2011",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1941487.1941508",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Apr 25 18:29:06 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Privacy-preserving attribution of IP packets can help
balance forensics with an individual's right to
privacy.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "cryptography; digital signatures; fingerprints; Intel
Processor Serial Number (PSN) (1999); privacy",
}
@Article{Ahmadi:2011:SKC,
author = "Hadi Ahmadi and Reihaneh Safavi-Naini",
title = "Secret Keys from Channel Noise",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6632",
pages = "266--283",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-20465-4_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 17:44:03 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-20465-4_16",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Aldrich:2011:GUS,
author = "Richard J. (Richard James) Aldrich",
title = "{GCHQ}: the uncensored story of {Britain}'s most
secret intelligence agency",
publisher = "HarperPress",
address = "London, UK",
pages = "666 + 16",
year = "2011",
ISBN = "0-00-727847-0 (hardcover), 0-00-731265-2 (paperback),
0-00-731266-0 (paperback)",
ISBN-13 = "978-0-00-727847-3 (hardcover), 978-0-00-731265-8
(paperback), 978-0-00-731266-5 (paperback)",
LCCN = "JN329.I6 A43 2011; UB251.G7 A54 2010",
bibdate = "Tue Aug 28 17:14:08 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
abstract = "GCHQ is the successor to the famous Bletchley Park
wartime code-breaking organisation and is the largest
and most secretive intelligence organisation in the
country. During the war, it commanded more staff than
MI5 and MI6 combined and has produced a number of
intelligence triumphs as well as some notable failures.
Since the end of the Cold War, it has played a pivotal
role in shaping Britain's secret state. Still, we know
almost nothing about it. In this fascinating new book,
Richard J. Aldrich traces GCHQ's evolvement from a
wartime code breaking operation based in the
Bedfordshire countryside to one of the world's leading
espionage organisations. Focusing in part on GCHQ's
remarkably intimate relationship with its American
partner, the National Security Agency (NSA), Aldrich
also examines both the impact of the Second World War
on GCHQ and the breakthroughs made after the war was
over. Today's GCHQ struggles with some of the most
difficult issues of our time. A leading force of the
state's security efforts against militant terrorist
organisations like Al-Qaeda, they are also involved in
fundamental issues that will mould the future of
British society. Compelling and revealing, this is
historical writing of the utmost importance.",
acknowledgement = ack-nhfb,
author-dates = "1961--",
subject = "Intelligence service; Great Britain; History; 20th
century; cryptography",
tableofcontents = "1: Schooldays \\
2: Friends and Allies \\
3: Every War Must Have an End \\
4: KGB and the Venona Project \\
5: UKUSA \\
Creating the Global Sigint Alliance \\
6: `Elint' and the Soviet Nuclear Target \\
7: Voyages of HMS Tiopin \\
8: Sigint in the Sun \\
GCHQ's Overseas Empire \\
9: Blake, Bugs and the Berlin Tunnel \\
10: Embassy Wars \\
11: Harold Macmillan \\
Shootdowns, Cyphers and Spending \\
12: Harold Wilson \\
Security Scandals and Spy Revelations \\
13: Intelligence for Doomsday \\
14: Staying Ahead \\
Sigint Ships and Spy Planes \\
15: Trouble with Henry \\
16: Disaster at Kizildere \\
17: Turmoil on Cyprus \\
18: Unmasking GCHQ: The ABC Trial \\
19: Geoffrey Prime \\
The GCHQ Mole \\
20: Surprise Attack \\
The Falklands War \\
21: Thatcher and the GCHQ Trade Union Ban \\
22: NSA and the Zircon Project \\
23: From Cold War to Hot Peace \\
The Gulf War and Bosnia \\
24: New Age of Ubiquitous Computing \\
25: 9/11 Attacks and the Iraq War \\
26: From Bletchley Park to a Brave New World?",
}
@Article{Alshammari:2011:CET,
author = "Riyad Alshammari and A. Nur Zincir-Heywood",
title = "Can encrypted traffic be identified without port
numbers, {IP} addresses and payload inspection?",
journal = j-COMP-NET-AMSTERDAM,
volume = "55",
number = "6",
pages = "1326--1350",
day = "25",
month = apr,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2010.12.002",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Feb 4 10:22:35 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128610003695",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Manual{Anonymous:2011:AXL,
author = "Anonymous",
title = "{ANSI X9.98-2010}: Lattice-Based Polynomial Public Key
Establishment Algorithm for the Financial Services
Industry",
organization = pub-ANSI,
address = pub-ANSI:adr,
month = apr,
year = "2011",
bibdate = "Thu Apr 21 09:46:45 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
price = "US\$100",
URL = "http://webstore.ansi.org/RecordDetail.aspx?sku=ANSI+X9.98-2010",
abstract = "Specifies the cryptographic functions for establishing
symmetric keys using a lattice-based polynomial public
key encryption algorithm and the associated parameters
for key generation. The mechanism supported is key
transport, where one party selects keying material and
conveys it to the other party with cryptographic
protection. The keying material may consist of one or
more individual keys used to provide other
cryptographic services outside the scope of this
Standard, e.g., data confidentiality, data integrity,
or symmetric-key-based key establishment. The standard
also specifies key pair generators and corresponding
key pair validation methods supporting the key
transport schemes.",
acknowledgement = ack-nhfb,
keywords = "ANSI X9.98-2010; NTRUEncrypt",
remark = "News stories in April 2011 claim speedups of 1000 to
100,000 over RSA and ECC (elliptic curve cryptography)
for NTRUEncrypt.",
}
@Article{Anonymous:2011:MCB,
author = "Anonymous",
title = "Memorial for codebreakers at {Bletchley Park}",
journal = "BBC News",
day = "27",
month = apr,
year = "2011",
bibdate = "Fri May 27 12:30:05 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.bbc.co.uk/news/uk-england-beds-bucks-herts-13208090",
abstract = "A memorial is to commemorate the work of codebreakers
at Bletchley Park in Milton Keynes during World War
II.",
acknowledgement = ack-nhfb,
}
@Article{Au:2011:PPT,
author = "M. Ho Au and P. P. Tsang and A. Kapadia",
title = "{PEREA}: Practical {TTP}-free revocation of repeatedly
misbehaving anonymous users",
journal = j-TISSEC,
volume = "14",
number = "4",
pages = "29:1--29:??",
month = dec,
year = "2011",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2043628.2043630",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Dec 22 18:15:07 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "Several anonymous authentication schemes allow servers
to revoke a misbehaving user's ability to make future
accesses. Traditionally, these schemes have relied on
powerful Trusted Third Parties (TTPs) capable of
deanonymizing (or linking) users' connections. Such
TTPs are undesirable because users' anonymity is not
guaranteed, and users must trust them to judge
misbehaviors fairly. Recent schemes such as
Blacklistable Anonymous Credentials (BLAC) and Enhanced
Privacy ID (EPID) support ``privacy-enhanced
revocation''--- servers can revoke misbehaving users
without a TTP's involvement, and without learning the
revoked users' identities. In BLAC and EPID, however,
the computation required for authentication at the
server is linear in the size (L) of the revocation
list, which is impractical as the size approaches
thousands of entries.",
acknowledgement = ack-nhfb,
articleno = "29",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Aumasson:2011:CHF,
author = "Jean-Philippe Aumasson and Raphael C.-W. Phan",
title = "On the cryptanalysis of the hash function {Fugue}:
{Partitioning} and inside-out distinguishers",
journal = j-INFO-PROC-LETT,
volume = "111",
number = "11",
pages = "512--515",
day = "15",
month = may,
year = "2011",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 12:47:01 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Bachrach:2011:ISS,
author = "Mayra Bachrach and Frank Y. Shih",
title = "Image steganography and steganalysis",
journal = j-WIRES,
volume = "3",
number = "5",
pages = "251--259",
month = may # "\slash " # jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1002/wics.152",
ISSN = "1939-0068 (print), 1939-5108 (electronic)",
ISSN-L = "1939-0068",
bibdate = "Fri Jun 19 13:52:59 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/wires.bib",
acknowledgement = ack-nhfb,
ajournal = "WIREs",
fjournal = "WIREs Computational Statistics",
journal-URL = "https://onlinelibrary.wiley.com/journal/19390068",
onlinedate = "10 March 2011",
}
@Article{Backstrom:2011:WAT,
author = "Lars Backstrom and Cynthia Dwork and Jon Kleinberg",
title = "Wherefore art thou {R3579X}?: anonymized social
networks, hidden patterns, and structural
steganography",
journal = j-CACM,
volume = "54",
number = "12",
pages = "133--141",
month = dec,
year = "2011",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2043174.2043199",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Nov 29 11:53:53 MST 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Bahi:2011:ECS,
author = "Jacques M. Bahi and Rapha{\"e}l Couturier and
Christophe Guyeux and Pierre-Cyrille H{\'e}am",
title = "Efficient and Cryptographically Secure Generation of
Chaotic Pseudorandom Numbers on {GPU}",
journal = "arxiv.org",
volume = "??",
number = "??",
pages = "??--??",
day = "22",
month = dec,
year = "2011",
bibdate = "Thu Jan 19 17:58:12 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://arxiv.org/abs/1112.5239",
abstract = "In this paper we present a new pseudorandom number
generator (PRNG) on graphics processing units (GPU).
This PRNG is based on the so-called chaotic iterations.
It is firstly proven to be chaotic according to the
Devaney's formulation. We thus propose an efficient
implementation for GPU that successfully passes the
BigCrush tests, deemed to be the hardest battery of
tests in TestU01. Experiments show that this PRNG can
generate about 20 billion of random numbers per second
on Tesla C1060 and NVidia GTX280 cards. It is then
established that, under reasonable assumptions, the
proposed PRNG can be cryptographically secure. A
chaotic version of the Blum--Goldwasser asymmetric key
encryption scheme is finally proposed.",
acknowledgement = ack-nhfb,
}
@Book{Basin:2011:AIS,
author = "David Basin and Patrick Schaller and Michael
Schl{\"a}pfer",
title = "Applied information security: a hands-on approach",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 202",
year = "2011",
ISBN = "3-642-24473-4 (hardcover)",
ISBN-13 = "978-3-642-24473-5 (hardcover)",
LCCN = "QA76.9.A25 B37 2011",
bibdate = "Tue May 7 09:12:31 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
}
@Article{Basso:2011:BWC,
author = "Alessandro Basso and Davide Cavagnino and Victor
Pomponiu and Annamaria Vernone",
title = "Blind Watermarking of Color Images Using
{Karhunen--Lo{\`e}ve} Transform Keying",
journal = j-COMP-J,
volume = "54",
number = "7",
pages = "1076--1090",
month = jul,
year = "2011",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxq052",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Jun 27 11:03:57 MDT 2011",
bibsource = "http://comjnl.oxfordjournals.org/content/54/7.toc;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/54/7/1076.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "June 16, 2010",
}
@Article{Bendlin:2011:SHE,
author = "Rikke Bendlin and Ivan Damga{\aa}rd and Claudio
Orlandi and Sarah Zakarias",
title = "Semi-homomorphic Encryption and Multiparty
Computation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6632",
pages = "169--188",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-20465-4_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 17:44:03 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-20465-4_11",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bernstein:2011:HSH,
author = "D. Bernstein and N. Duif and T. Lange and P. Schwabe
and B. Yang",
title = "High-speed high-security signatures",
journal = "Journal of Cryptographic Engineering",
volume = "2",
number = "2",
pages = "77--89",
month = sep,
year = "2011",
DOI = "",
bibdate = "Wed Aug 20 16:59:21 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://ed25519.cr.yp.to/ed25519-20110926.pdf",
acknowledgement = ack-nhfb,
}
@TechReport{Bertoni:2011:CSF,
author = "Guido Bertoni and Joan Daemen and Micha{\"e}l
Peeters",
title = "Cryptographic sponge functions",
type = "Report",
institution = "STMicroelectronics",
address = "Antwerp, Belgium (??)",
pages = "93",
day = "14",
month = jan,
year = "2011",
bibdate = "Fri Dec 14 15:25:32 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://sponge.noekeon.org/CSF-0.1.pdf",
acknowledgement = ack-nhfb,
lastaccess = "14 December 2012",
}
@TechReport{Bogdanov:2011:BCF,
author = "Andrey Bogdanov and Dmitry Khovratovich and Christian
Rechberger",
title = "Biclique cryptanalysis of the full {AES}",
type = "Report",
institution = "Microsoft Research",
address = "Redmon, WA, USA",
year = "2011",
bibdate = "Wed Aug 24 17:07:16 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "To appear at ASIACRYPT 2011.",
URL = "http://research.microsoft.com/en-us/projects/cryptanalysis/aes.aspx;
http://research.microsoft.com/en-us/projects/cryptanalysis/aesbc.pdf;
http://rump2011.cr.yp.to/d41bd80f6680cfd2323e53fbb9a62a81.pdf",
abstract = "Since Rijndael was chosen as the Advanced Encryption
Standard, improving upon 7-round attacks on the 128-bit
key variant or upon 8-round attacks on the 192/256-bit
key variants has been one of the most difficult
challenges in the cryptanalysis of block ciphers for
more than a decade. In this paper we present a novel
technique of block cipher cryptanalysis with bicliques,
which leads to the following results:\par
-- The first key recovery attack on the full AES-128
with computational complexity $ 2^{126.1} $.\par
-- The first key recovery attack on the full AES-192
with computational complexity $ 2^{189.7} $.\par
-- The first key recovery attack on the full AES-256
with computational complexity $ 2^{254.4} $.\par
-- Attacks with lower complexity on the reduced-round
versions of AES not considered before, including an
attack on 8-round AES-128 with complexity $ 2^{124.9}
$.\par
Preimage attacks on compression functions based on the
full AES versions.\par
In contrast to most shortcut attacks on AES variants,
we do not need to assume related-keys. Most of our
attacks only need a very small part of the codebook and
have small memory requirements, and are practically
verified to a large extent. As our attacks are of high
computational complexity, they do not threaten the
practical use of AES in any way.",
acknowledgement = ack-nhfb,
keywords = "AES; bicliques; block ciphers; key recovery;
preimage",
remark = "This paper may be the first demonstration of an attack
on an arbitrary AES key that reduces the attack
complexity to that for a key two bits shorter than the
original.",
}
@Article{Bohli:2011:RAP,
author = "Jens-Matthias Bohli and Andreas Pashalidis",
title = "Relations among privacy notions",
journal = j-TISSEC,
volume = "14",
number = "1",
pages = "4:1--4:??",
month = may,
year = "2011",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1952982.1952986",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 2 07:27:23 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "This article presents a hierarchy of privacy notions
that covers multiple anonymity and unlinkability
variants. The underlying definitions, which are based
on the idea of indistinguishability between two worlds,
provide new insights into the relation between, and the
fundamental structure of, different privacy notions. We
furthermore place previous privacy definitions
concerning group signature, anonymous communication,
and secret voting systems in the context of our
hierarchy; this renders these traditionally
disconnected notions comparable.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Bouman:2011:SAW,
author = "Niek J. Bouman and Serge Fehr",
title = "Secure Authentication from a Weak Key, without Leaking
Information",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6632",
pages = "246--265",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-20465-4_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 17:44:03 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-20465-4_15",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bowyer:2011:WSD,
author = "Kevin W. Bowyer",
title = "What Surprises Do Identical Twins Have for Identity
Science?",
journal = j-COMPUTER,
volume = "44",
number = "7",
pages = "100--102",
month = jul,
year = "2011",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2011.221",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Jul 19 16:44:44 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@InProceedings{Brakerski:2011:EFH,
author = "Z. Brakerski and V. Vaikuntanathan",
title = "Efficient Fully Homomorphic Encryption from (Standard)
{LWE}",
crossref = "IEEE:2011:PIA",
pages = "97--106",
year = "2011",
DOI = "https://doi.org/10.1109/FOCS.2011.12",
bibdate = "Thu Apr 12 09:34:22 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/focs2010.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6108120",
}
@Book{Briggs:2011:SDC,
author = "Asa Briggs",
title = "Secret days: code-breaking in {Bletchley Park}",
publisher = "Frontline Books",
address = "London, UK",
pages = "xix + 202 + 26",
year = "2011",
ISBN = "1-84832-615-7",
ISBN-13 = "978-1-84832-615-6",
LCCN = "D810.C88 B75 2011",
bibdate = "Mon Sep 3 17:58:14 MDT 2012",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/contempphys.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptologia.bib",
acknowledgement = ack-nhfb,
subject = "Briggs, Asa; Lorenz cipher system; World War,
1939--1945; Cryptography; Secret service; Great
Britain; Electronic intelligence; Personal narratives,
British; Dechiffrierung; Weltkrieg (1939--1945);
Bletchley Park (Milton Keynes, England); History;
Bletchley Park; Gro{\ss}britannien",
subject-dates = "1921--",
}
@Article{Broemeling:2011:AES,
author = "Lyle D. Broemeling",
title = "An Account of Early Statistical Inference in {Arab}
Cryptology",
journal = j-AMER-STAT,
volume = "65",
number = "4",
pages = "255--257",
month = nov,
year = "2011",
CODEN = "ASTAAJ",
DOI = "https://doi.org/10.1198/tas.2011.10191",
ISSN = "0003-1305 (print), 1537-2731 (electronic)",
ISSN-L = "0003-1305",
bibdate = "Fri Jan 27 07:07:40 MST 2012",
bibsource = "http://www.amstat.org/publications/tas/;
https://www.math.utah.edu/pub/tex/bib/amstat.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "The American Statistician",
journal-URL = "http://www.tandfonline.com/loi/utas20",
}
@Article{Buchmann:2011:XPF,
author = "Johannes Buchmann and Eeik Dahmen and Andreas
H{\"u}lsing",
title = "{XMSS} --- A Practical Forward Secure Signature Scheme
Based on Minimal Security Assumptions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7071",
pages = "117--129",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25405-5_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 31 16:07:32 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://link.springer.com/chapter/10.1007/978-3-642-25405-5_8",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
journal-URL = "http://link.springer.com/bookseries/558",
remark = "Proceedings of the 4th International Workshop on
Post-Quantum Cryptography (PQCrypto 11)",
}
@TechReport{Burke:2011:AMD,
author = "Colin Burke",
title = "{Agnes Meyer Driscoll} vs. the {Enigma} and the
{Bombe}",
type = "Report",
institution = "University of Maryland, Baltimore County",
address = "1000 Hilltop Circle Baltimore, MD 21250, USA",
pages = "132",
day = "7",
month = jan,
year = "2011",
bibdate = "Fri Dec 29 08:56:21 2017",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://userpages.umbc.edu/~burke/driscoll1-2011.pdf",
abstract = "Documents in Britain's National Archives\slash Public
Record Office and in the U.S. National Archive's Record
Groups RG457 and RG38 indicate that in mid-1941 the
United States Navy's codebreaking organization, OP-20-G
ignored an opportunity to gain full knowledge of
Britain's anti-Enigma methods and machines. Spending a
year and one-half working on what it felt was a unique
and much more effective method --- but one that failed
--- OP-20-G's staff, at a critical time in
U.S.--British relations, did not inform America's
decision makers of Britain's willingness to share its
crypto-secrets . As a result, American leaders believed
that England's GC\&CS had deliberately withheld vital
information that would have allowed the development of
an independent American attack on Naval Enigma. That
belief lasted throughout the war and caused friction
between the two nations. Other consequences of
OP-20-G's mid-1941 decision were to delay the adoption
of the British Bombe and its allied methods and to
waste perhaps six months of the vital time of the new
team of cryptanalysts and engineers assigned, in early
1942, to develop an American Bombe.",
acknowledgement = ack-nhfb,
keywords = "Banburismus; Bombe; catalog; cold-point; Currier;
Denniston; Driscoll; Engstrom; Enigma; GC&CS;
hot-point; OP-20-G; Safford; Tiltman; Weeks; Wenger",
}
@Article{Burmester:2011:LRA,
author = "Mike Burmester and Jorge Munilla",
title = "Lightweight {RFID} authentication with forward and
backward security",
journal = j-TISSEC,
volume = "14",
number = "1",
pages = "11:1--11:??",
month = may,
year = "2011",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1952982.1952993",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 2 07:27:23 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "We propose a lightweight RFID authentication protocol
that supports forward and backward security. The only
cryptographic mechanism that this protocol uses is a
pseudorandom number generator (PRNG) that is shared
with the backend Server. Authentication is achieved by
exchanging a few numbers (3 or 5) drawn from the PRNG.
The lookup time is constant, and the protocol can be
easily adapted to prevent online man-in-the-middle
relay attacks. Security is proven in the UC security
framework.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Byun:2011:SMC,
author = "Jin Wook Byun and Dong Hoon Lee",
title = "On a security model of conjunctive keyword search over
encrypted relational database",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "8",
pages = "1364--1372",
month = aug,
year = "2011",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Jun 21 10:22:32 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Book{Carlson:2011:JRW,
author = "Elliot Carlson",
title = "{Joe Rochefort}'s war: the odyssey of the codebreaker
who outwitted {Yamamoto} at {Midway}",
publisher = "Naval Institute Press",
address = "Annapolis, MD, US",
pages = "????",
year = "2011",
ISBN = "1-61251-060-4 (hardcover)",
ISBN-13 = "978-1-61251-060-6 (hardcover)",
LCCN = "D774.M5 C28 2011",
bibdate = "Mon Sep 3 17:46:27 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Rochefort, Joe; Midway, Battle of, 1942;
Cryptographers; United States; Biography; World War,
1939-1945; Cryptography; Electronic intelligence;
Military intelligence; Naval operations, American;
Naval operations, Japanese",
subject-dates = "1900--1976",
}
@Book{Carstensen:2011:AAA,
author = "Celine Carstensen and Benjamin Fine and Gerhard
Rosenberger",
title = "Abstract algebra: applications to {Galois} theory,
algebraic geometry, and cryptography",
volume = "11",
publisher = pub-GRUYTER,
address = pub-GRUYTER:adr,
pages = "????",
year = "2011",
ISBN = "3-11-025008-X",
ISBN-13 = "978-3-11-025008-4",
LCCN = "QA162 .C375 2011",
bibdate = "Mon Jan 10 18:22:47 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Sigma series in pure mathematics",
acknowledgement = ack-nhfb,
subject = "Algebra, Abstract; Galois theory; Geometry, Algebraic;
Cryptography",
}
@Article{Chandra:2011:AST,
author = "Shalini Chandra and Raees Ahmad Khan",
title = "Availability state transition model",
journal = j-SIGSOFT,
volume = "36",
number = "3",
pages = "1--3",
month = may,
year = "2011",
CODEN = "SFENDP",
DOI = "https://doi.org/10.1145/1968587.1968603",
ISSN = "0163-5948 (print), 1943-5843 (electronic)",
ISSN-L = "0163-5948",
bibdate = "Wed Aug 1 17:16:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsoft2010.bib",
abstract = "Several security mechanisms such as digital signature,
timestamp audits and trails, encryption, throttling,
filtering, protect secrets etc. are available. These
security mechanisms are not completely able to stop
malicious attacks. For malicious hackers and attackers
it is comparatively easy to exploit security loopholes
at the user's end side. Behind such type of problem the
main reason is bad software design and its
implementation without proper risk analysis and
mitigation. So, an idea to model availability states an
Availability State Transition Model (ASTM) has been
proposed in this article. In ASTM methodology, only
design level details is required which can be easily
retrieved from the software's design.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGSOFT Software Engineering Notes",
journal-URL = "https://dl.acm.org/citation.cfm?id=J728",
}
@Article{Chang:2011:DEQ,
author = "Tao-Ku Chang and Gwan-Hwan Hwang",
title = "Developing an efficient query system for encrypted
{XML} documents",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "8",
pages = "1292--1305",
month = aug,
year = "2011",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Jun 21 10:22:32 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chang:2011:RSB,
author = "Chin-Chen Chang and Chih-Yang Lin and Yi-Hsuan Fan",
title = "Reversible Steganography for {BTC}-compressed Images",
journal = j-FUND-INFO,
volume = "109",
number = "2",
pages = "121--134",
month = apr,
year = "2011",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2011-500",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:13:16 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Chang:2011:SFW,
author = "Chin-Chen Chang and Kuo-Nan Chen and Chin-Feng Lee and
Li-Jen Liu",
title = "A secure fragile watermarking scheme based on
chaos-and-{Hamming} code",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "9",
pages = "1462--1470",
month = sep,
year = "2011",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.02.029",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:22 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211000549",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chen:2011:ARI,
author = "Chien-Chang Chen and Yao-Hong Tsai",
title = "Adaptive reversible image watermarking scheme",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "3",
pages = "428--434",
month = mar,
year = "2011",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Jun 21 10:22:26 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chen:2011:EAA,
author = "Tien-Ho Chen and Yen-Chiu Chen and Wei-Kuan Shih and
Hsin-Wen Wei",
title = "An efficient anonymous authentication protocol for
mobile {pay-TV}",
journal = j-J-NETW-COMPUT-APPL,
volume = "34",
number = "4",
pages = "1131--1137",
month = jul,
year = "2011",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:59 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804510002031",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Chen:2011:IBT,
author = "Xiaofeng Chen and Willy Susilo and Fangguo Zhang and
Haibo Tian and Jin Li",
title = "Identity-based trapdoor mercurial commitments and
applications",
journal = j-THEOR-COMP-SCI,
volume = "412",
number = "39",
pages = "5498--5512",
day = "9",
month = sep,
year = "2011",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Aug 30 18:51:54 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Chen:2011:SEI,
author = "Tien-Ho Chen and Han-Cheng Hsiang and Wei-Kuan Shih",
title = "Security enhancement on an improvement on two remote
user authentication schemes using smart cards",
journal = j-FUT-GEN-COMP-SYS,
volume = "27",
number = "4",
pages = "377--380",
month = apr,
year = "2011",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Aug 30 11:43:29 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Chen:2011:TVS,
author = "Tzung-Her Chen and Kai-Hsiang Tsao",
title = "Threshold visual secret sharing by random grids",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "7",
pages = "1197--1208",
month = jul,
year = "2011",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Jun 21 10:22:31 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chhabra:2011:NSN,
author = "Siddhartha Chhabra and Yan Solihin",
title = "{i-NVMM}: a secure non-volatile main memory system
with incremental encryption",
journal = j-COMP-ARCH-NEWS,
volume = "39",
number = "3",
pages = "177--188",
month = jun,
year = "2011",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/2024723.2000086",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Mon Sep 5 17:15:11 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Book{Chin:2011:ACS,
author = "Shiu-Kai Chin and Susan Beth Older",
title = "Access control, security, and trust: a logical
approach",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
pages = "????",
year = "2011",
ISBN = "1-58488-862-8",
ISBN-13 = "978-1-58488-862-8",
LCCN = "QA76.9.A25 C446 2011",
bibdate = "Mon Jan 10 18:23:10 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Chapman and Hall/CRC cryptography and network
security",
acknowledgement = ack-nhfb,
subject = "Computers; Access control; System design",
}
@Article{Chuang:2011:LMA,
author = "Ming-Chin Chuang and Jeng-Farn Lee",
title = "A lightweight mutual authentication mechanism for
network mobility in {IEEE 802.16e} wireless networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "55",
number = "16",
pages = "3796--3809",
day = "10",
month = nov,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2011.05.027",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Feb 4 10:22:57 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128611002052",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Cilardo:2011:EPT,
author = "Alessandro Cilardo",
title = "Exploring the Potential of Threshold Logic for
Cryptography-Related Operations",
journal = j-IEEE-TRANS-COMPUT,
volume = "60",
number = "4",
pages = "452--462",
month = apr,
year = "2011",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2010.116",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Jun 29 10:26:18 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Coull:2011:ACO,
author = "Scott E. Coull and Matthew Green and Susan
Hohenberger",
title = "Access controls for oblivious and anonymous systems",
journal = j-TISSEC,
volume = "14",
number = "1",
pages = "10:1--10:??",
month = may,
year = "2011",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1952982.1952992",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 2 07:27:23 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "The use of privacy-enhancing cryptographic protocols,
such as anonymous credentials and oblivious transfer,
could have a detrimental effect on the ability of
providers to effectively implement access controls on
their content. In this article, we propose a stateful
anonymous credential system that allows the provider to
implement nontrivial, real-world access controls on
oblivious protocols conducted with anonymous users. Our
system models the behavior of users as a state machine
and embeds that state within an anonymous credential to
restrict access to resources based on the state
information. The use of state machine models of user
behavior allows the provider to restrict the users'
actions according to a wide variety of access control
models without learning anything about the users'
identities or actions.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Crampton:2011:PEC,
author = "Jason Crampton",
title = "Practical and efficient cryptographic enforcement of
interval-based access control policies",
journal = j-TISSEC,
volume = "14",
number = "1",
pages = "14:1--14:??",
month = may,
year = "2011",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1952982.1952996",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 2 07:27:23 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "The enforcement of access control policies using
cryptography has received considerable attention in
recent years and the security of such enforcement
schemes is increasingly well understood. Recent work in
the area has considered the efficient enforcement of
temporal and geo-spatial access control policies, and
asymptotic results for the time and space complexity of
efficient enforcement schemes have been obtained.
However, for practical purposes, it is useful to have
explicit bounds for the complexity of enforcement
schemes. In this article we consider interval-based
access control policies, of which temporal and
geo-spatial access control policies are special cases.
We define enforcement schemes for interval-based access
control policies for which it is possible, in almost
all cases, to obtain exact values for the schemes'
complexity, thereby subsuming a substantial body of
work in the literature.",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Book{Cremers:2011:OSV,
author = "Cas Cremers and Sjouke Mauw",
title = "Operational Semantics and Verification of Security
Protocols",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 172 + 59",
year = "2011",
DOI = "https://doi.org/10.1007/978-3-540-78636-8",
ISBN = "3-540-78635-X (print), 3-540-78636-8 (e-book),
3-642-43053-8",
ISBN-13 = "978-3-540-78635-1 (print), 978-3-540-78636-8 (e-book),
978-3-642-43053-4",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.A25 C74 2012; QA76.9.D35",
bibdate = "Sat Jun 10 08:34:47 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/978-3-540-78636-8",
abstract = "Security protocols are widely used to ensure secure
communications over insecure networks, such as the
internet or airwaves. These protocols use strong
cryptography to prevent intruders from reading or
modifying the messages. However, using cryptography is
not enough to ensure their correctness. Combined with
their typical small size, which suggests that one could
easily assess their correctness, this often results in
incorrectly designed protocols. The authors present a
methodology for formally describing security protocols
and their environment. This methodology includes a
model for describing protocols, their execution model,
and the intruder model. The models are extended with a
number of well-defined security properties, which
capture the notions of correct protocols, and secrecy
of data. The methodology can be used to prove that
protocols satisfy these properties. Based on the model
they have developed a tool set called Scyther that can
automatically find attacks on security protocols or
prove their correctness. In case studies they show the
application of the methodology as well as the
effectiveness of the analysis tool. The methodology's
strong mathematical basis, the strong separation of
concerns in the model, and the accompanying tool set
make it ideally suited both for researchers and
graduate students of information security or formal
methods and for advanced professionals designing
critical security protocols.",
acknowledgement = ack-nhfb,
shorttableofcontents = "Introduction \\
Preliminaries \\
Operational Semantics \\
Security Properties \\
Verification \\
Multiprotocol Attacks \\
Generalizing NSL for Multiparty Authentication \\
Related Work \\
Conclusions and Future Work \\
Index",
subject = "Architektur; Datenstruktur; Rechnernetz; Software
Engineering; Computer networks; Security measures;
Computer network protocols; Computer security;
Methodology",
tableofcontents = "Operational Semantics and Verification of Security
Protocols \\
Preface \\
Contents \\
List of Figures \\
List of Tables \\
1: Introduction \\
1.1 Historical Context \\
1.2 Black-Box Security Protocol Analysis \\
1.3 Purpose and Approach \\
1.4 Overview \\
1.4.1 The Protocol Analysis Model \\
1.4.2 Applications of the Model \\
2: Preliminaries \\
2.1 Sets and Relations \\
2.2 BNF Grammars \\
2.3 Labelled Transition Systems \\
3: Operational Semantics \\
3.1 Analysis of the Problem Domain \\
Cryptographic Primitives \\
Protocol Specification \\
Agent Model \\
Communication and Threat Model \\
Security Requirements \\
3.2 Security Protocol Specification \\
3.2.1 Role Terms \\
3.2.2 Protocol Specification \\
3.2.3 Event Order \\
3.3 Describing Protocol Execution \\
3.3.1 Runs \\
3.3.2 Matching \\
3.3.3 Run Events \\
3.3.4 Threat Model \\
3.4 Operational Semantics \\
3.5 Example Protocol Specification \\
3.6 Problems \\
4: Security Properties \\
4.1 Security Properties as Claim Events \\
4.2 Secrecy \\
4.3 Authentication \\
4.3.1 Aliveness \\
4.3.2 Synchronisation \\
4.3.3 Non-injective Synchronisation \\
4.3.4 Injective Synchronisation \\
4.3.5 Message Agreement \\
4.4 Authentication Hierarchy \\
4.5 Breaking and Fixing the Needham--Schroeder Protocol
Proof of claim 7: Secrecy of nr for the responder \\
Note Proof of claim 5 \\
4.6 Summary \\
4.7 Problems \\
5: Verification \\
5.1 Patterns \\
5.2 Verification Algorithm \\
5.2.1 Well-Typed Patterns \\
5.2.2 Realisable Patterns \\
5.2.3 Empty Patterns and Redundant Patterns \\
5.2.4 Algorithm Overview \\
5.2.5 Pattern Refinement \\
5.3 Example of Search Space Traversal \\
5.4 Verifying Security Properties Using Pattern
Refinement \\
Analysis of Secrecy \\
Characterisation of Security Protocols \\
Analysis of Authentication Properties \\
5.5 Heuristics and Parameter Choices \\
5.5.1 Heuristics \\
5.5.2 Choosing a Bound on the Number of Runs \\
5.5.3 Performance \\
5.6 Verifying Injectivity \\
5.6.1 Injective Synchronisation \\
5.6.2 The LOOP Property \\
5.6.3 Model Assumptions \\
5.7 Further Features of the Scyther Tool \\
Data Agreement \\
Adversary Models \\
Applications \\
5.8 Problems \\
Problems \\
6: Multi-protocol Attacks \\
6.1 Multi-protocol Attacks \\
6.2 Experiments \\
6.3 Results \\
6.3.1 Strict Type Matching: No Type Flaws \\
6.3.2 Simple Type Matching: Basic Type Flaws Only \\
6.3.3 Untyped Matching: All Type Flaws \\
6.3.4 Attack Example \\
6.4 Attack Scenarios \\
6.4.1 Protocol Updates \\
6.4.2 Ambiguous Authentication \\
6.5 Preventing Multi-protocol Attacks \\
Strict Type Detection \\
Tagging \\
Verification \\
6.6 Summary \\
6.7 Problems \\
Problems \\
7: Generalising NSL for Multi-party Authentication \\
7.1 A Multi-party Authentication Protocol \\
7.2 Analysis \\
7.2.1 Initial Observations \\
7.2.2 Proof of Correctness \\
Proof Outline \\
7.2.3 Secrecy of Nonces Created in Role rp0 \\
7.2.4 Non-injective Synchronisation of Role r0 \\
7.2.5 Secrecy of Nonces Created in Role rpx for x>0 \\
7.2.6 Non-injective Synchronisation of Role rpx for
x>0",
xxpages = "xii + 172",
xxyear = "2012",
}
@Article{Curtmola:2011:SSE,
author = "Reza Curtmola and Juan Garay and Seny Kamara and
Rafail Ostrovsky",
title = "Searchable symmetric encryption: Improved definitions
and efficient constructions",
journal = j-J-COMP-SECUR,
volume = "19",
number = "5",
pages = "895--934",
month = "????",
year = "2011",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2011-0426",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:25:15 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Book{Davies:2011:IST,
author = "Joshua Dennis Davies",
title = "Implementing {SSL\slash TLS} using cryptography and
{PKI}",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "????",
year = "2011",
ISBN = "0-470-92041-6 (paperback)",
ISBN-13 = "978-0-470-92041-1 (paperback)",
LCCN = "????",
bibdate = "Mon Jan 10 18:23:31 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
}
@Article{Dew:2011:BRB,
author = "Nicholas Dew",
title = "Book Review: {{\booktitle{The Information Master:
Jean-Baptiste Colbert's Secret State Intelligence
System}}}",
journal = j-ISIS,
volume = "102",
number = "4",
pages = "765--765",
month = dec,
year = "2011",
CODEN = "ISISA4",
DOI = "https://doi.org/10.1086/664857",
ISSN = "0021-1753 (print), 1545-6994 (electronic)",
ISSN-L = "0021-1753",
bibdate = "Tue Jul 30 21:20:41 MDT 2013",
bibsource = "http://www.jstor.org/action/showPublication?journalCode=isis;
http://www.jstor.org/stable/10.1086/663595;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/isis2010.bib",
URL = "http://www.jstor.org/stable/10.1086/664857",
acknowledgement = ack-nhfb,
fjournal = "Isis",
journal-URL = "http://www.jstor.org/page/journal/isis/about.html",
xxtitle = "Book Review: {{\booktitle{Jacob Soll. The Information
Master: Jean-Baptiste Colbert's Secret State
Intelligence System.}}}",
}
@Article{Dini:2011:LLA,
author = "Gianluca Dini and Ida M. Savino",
title = "{LARK}: a Lightweight Authenticated {ReKeying} Scheme
for Clustered Wireless Sensor Networks",
journal = j-TECS,
volume = "10",
number = "4",
pages = "41:1--41:??",
month = nov,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2043662.2043665",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Dec 19 15:49:06 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Group communication has proven a powerful paradigm for
designing applications and services in Wireless Sensor
Networks (WSNs). Given the tight interaction between
WSNs and the physical world, a security infringement
may translate into a safety infringement. Therefore, in
order to fully exploit the group communication paradigm
we need to secure it. Traditionally, this requirement
has been formalized in terms of backward and forward
security and fulfilled by means of rekeying. In WSNs,
group rekeying becomes particularly a complex problem
because communication takes place over an easily
accessible wireless medium and because sensor nodes
have severe limitations in terms of computing, storage,
energy, and tamper-resistance capabilities for cost
reasons.",
acknowledgement = ack-nhfb,
articleno = "41",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
}
@InProceedings{Dodis:2011:SSC,
author = "Y. Dodis and A. Lewko and B. Waters and D. Wichs",
title = "Storing Secrets on Continually Leaky Devices",
crossref = "IEEE:2011:PIA",
pages = "688--697",
year = "2011",
DOI = "https://doi.org/10.1109/FOCS.2011.35",
bibdate = "Thu Apr 12 09:34:29 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/focs2010.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6108120",
}
@Article{Dong:2011:SSE,
author = "Changyu Dong and Giovanni Russello and Naranker
Dulay",
title = "Shared and searchable encrypted data for untrusted
servers",
journal = j-J-COMP-SECUR,
volume = "19",
number = "3",
pages = "367--397",
month = "????",
year = "2011",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2010-0415",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:25:07 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Misc{Duong:2011:CWC,
author = "Thai Duong and J. Rizzo",
title = "Cryptography in the {Web}: The Case of Cryptographic
Design Flaws in {ASP.NET}",
howpublished = "Unknown",
month = may,
year = "2011",
bibdate = "Mon Mar 09 11:54:27 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 29]{Schneier:2015:SWC}.",
}
@Article{Durmuth:2011:DEN,
author = "Markus D{\"u}rmuth and David Mandell Freeman",
title = "Deniable Encryption with Negligible Detection
Probability: An Interactive Construction",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6632",
pages = "610--626",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-20465-4_33",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 17:44:03 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-20465-4_33",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Eslami:2011:SIS,
author = "Z. Eslami and J. Zarepour Ahmadabadi",
title = "Secret image sharing with authentication-chaining and
dynamic embedding",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "5",
pages = "803--809",
month = may,
year = "2011",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Jun 21 10:22:28 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Fang:2011:ICP,
author = "Liming Fang and Willy Susilo and Chunpeng Ge and
Jiandong Wang",
title = "Interactive conditional proxy re-encryption with fine
grain policy",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "12",
pages = "2293--2302",
month = dec,
year = "2011",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.06.045",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211001579",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Feng:2011:GDA,
author = "Xiutao Feng and Zhenqing Shi and Chuankun Wu and
Dengguo Feng",
title = "On Guess and Determine Analysis of {Rabbit}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1283--1296",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008714",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Rabbit is a stream cipher proposed by M. Boesgaard et
al., and has been selected into the final portfolio
after three evaluation phases of the ECRYPT Stream
Cipher Project (eSTREAM). So far only a few papers
studied its security besides a series of white papers
by the designers of Rabbit. Recently we presented a new
idea to evaluate the security of a word-oriented stream
cipher algorithm from a smaller data granularity
instead of its original data granularity and applied it
successfully to the stream cipher SOSEMANUK. In this
work we apply the same idea to the Rabbit algorithm and
analyze its security in resistance against the guess
and determine attack from the view point of byte units.
As a result, we present two new approaches of solving
all $ x_{j, t + 1} $'s and $ g_{j, t} $'s from the
next-state function and the extraction scheme of
Rabbit, whose complexities are $ 2^{166} $ and $
2^{140.68} $ respectively, which are dramatically lower
than those proposed by Lu et al. ($ 2^{192} $ and $
2^{174} $ resp.) at ISC 2008. Finally based on the
above new results we propose a byte-based guess and
determine attack on Rabbit, which only needs a small
segment of known keystream to recover the whole
internal state of Rabbit with time complexity $ 2^{242}
$. Though the complexity of our attack is far higher
than that of a brute force ($ 2^{128}$), we believe
that some new techniques adopted in this paper are of
interest for future work on Rabbit.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Feng:2011:VBF,
author = "Keqin Feng and Jing Yang",
title = "Vectorial {Boolean} Functions with Good Cryptographic
Properties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1271--1282",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008702",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fuchsbauer:2011:CSV,
author = "Georg Fuchsbauer",
title = "Commuting Signatures and Verifiable Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6632",
pages = "224--245",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-20465-4_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 17:44:03 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-20465-4_14",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fuglerud:2011:SIA,
author = "Kristin Fuglerud and {\O}ystein Dale",
title = "Secure and Inclusive Authentication with a Talking
Mobile One-Time-Password Client",
journal = j-IEEE-SEC-PRIV,
volume = "9",
number = "2",
pages = "27--34",
month = mar # "\slash " # apr,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2010.204",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Apr 1 22:34:08 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Geetha:2011:VRN,
author = "S. Geetha and V. Kabilan and S. P. Chockalingam and N.
Kamaraj",
title = "Varying radix numeral system based adaptive image
steganography",
journal = j-INFO-PROC-LETT,
volume = "111",
number = "16",
pages = "792--797",
day = "30",
month = aug,
year = "2011",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2011.05.013",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Feb 4 08:08:39 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019011001414",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Gentry:2011:FHE,
author = "C. Gentry and S. Halevi",
title = "Fully Homomorphic Encryption without Squashing Using
Depth-$3$ Arithmetic Circuits",
crossref = "IEEE:2011:PIA",
pages = "107--109",
year = "2011",
DOI = "https://doi.org/10.1109/FOCS.2011.94",
bibdate = "Thu Apr 12 09:34:22 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/focs2010.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6108120",
}
@Article{Gentry:2011:IGF,
author = "Craig Gentry and Shai Halevi",
title = "Implementing {Gentry}'s Fully-Homomorphic Encryption
Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6632",
pages = "129--148",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-20465-4_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 17:44:03 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-20465-4_9",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Giot:2011:UKD,
author = "Romain Giot and Mohamad El-Abed and Baptiste Hemery
and Christophe Rosenberger",
title = "Unconstrained keystroke dynamics authentication with
shared secret",
journal = j-COMPUT-SECUR,
volume = "30",
number = "6--7",
pages = "427--445",
month = sep # "\slash " # oct,
year = "2011",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404811000502",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Glassey:2011:MIM,
author = "Olivier Glassey",
title = "Metadata For Identity Management of Population
Registers",
journal = j-FUTURE-INTERNET,
volume = "3",
number = "2",
pages = "130--143",
day = "18",
month = apr,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi3020130",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:46 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/3/2/130",
abstract = "A population register is an inventory of residents
within a country, with their characteristics (date of
birth, sex, marital status, etc.) and other
socio-economic data, such as occupation or education.
However, data on population are also stored in numerous
other public registers such as tax, land, building and
housing, military, foreigners, vehicles, etc.
Altogether they contain vast amounts of personal and
sensitive information. Access to public information is
granted by law in many countries, but this transparency
is generally subject to tensions with data protection
laws. This paper proposes a framework to analyze data
access (or protection) requirements, as well as a model
of metadata for data exchange.",
acknowledgement = ack-nhfb,
}
@Article{Goodrich:2011:EAD,
author = "Michael T. Goodrich and Roberto Tamassia and Nikos
Triandopoulos",
title = "Efficient Authenticated Data Structures for Graph
Connectivity and Geometric Search Problems",
journal = j-ALGORITHMICA,
volume = "60",
number = "3",
pages = "505--552",
month = jul,
year = "2011",
CODEN = "ALGOEJ",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Fri Jun 17 18:57:02 MDT 2011",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=60&issue=3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=60&issue=3&spage=505",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Gorantla:2011:MKC,
author = "M. C. Gorantla and Colin Boyd and Juan Manuel
Gonz{\'a}lez Nieto and Mark Manulis",
title = "Modeling key compromise impersonation attacks on group
key exchange protocols",
journal = j-TISSEC,
volume = "14",
number = "4",
pages = "28:1--28:??",
month = dec,
year = "2011",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2043628.2043629",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Dec 22 18:15:07 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "Two-party key exchange (2PKE) protocols have been
rigorously analyzed under various models considering
different adversarial actions. However, the analysis of
group key exchange (GKE) protocols has not been as
extensive as that of 2PKE protocols. Particularly, an
important security attribute called key compromise
impersonation (KCI) resilience has been completely
ignored for the case of GKE protocols. Informally, a
protocol is said to provide KCI resilience if the
compromise of the long-term secret key of a protocol
participant A does not allow the adversary to
impersonate an honest participant B to A. In this
paper, we argue that KCI resilience for GKE protocols
is at least as important as it is for 2PKE protocols.",
acknowledgement = ack-nhfb,
articleno = "28",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Gordon:2011:CFS,
author = "S. Dov Gordon and Carmit Hazay and Jonathan Katz and
Yehuda Lindell",
title = "Complete Fairness in Secure {Two-Party} Computation",
journal = j-J-ACM,
volume = "58",
number = "6",
pages = "24:1--24:??",
month = dec,
year = "2011",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/2049697.2049698",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Thu Dec 15 09:33:01 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "In the setting of secure two-party computation, two
mutually distrusting parties wish to compute some
function of their inputs while preserving, to the
extent possible, various security properties such as
privacy, correctness, and more. One desirable property
is fairness which guarantees, informally, that if one
party receives its output, then the other party does
too. Cleve [1986] showed that complete fairness cannot
be achieved in general without an honest majority.
Since then, the accepted folklore has been that nothing
non-trivial can be computed with complete fairness in
the two-party setting. We demonstrate that this
folklore belief is false by showing completely fair
protocols for various nontrivial functions in the
two-party setting based on standard cryptographic
assumptions.",
acknowledgement = ack-nhfb,
articleno = "24",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@InProceedings{Goyal:2011:SCP,
author = "V. Goyal and H. K. Maji",
title = "Stateless Cryptographic Protocols",
crossref = "IEEE:2011:PIA",
pages = "678--687",
year = "2011",
DOI = "https://doi.org/10.1109/FOCS.2011.74",
bibdate = "Thu Apr 12 09:34:29 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/focs2010.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6108120",
}
@Article{Greengard:2011:MRM,
author = "Samuel Greengard",
title = "In Memoriam: {Robert Morris, 1932--2011}",
journal = j-CACM,
volume = "54",
number = "9",
pages = "17--17",
month = sep,
year = "2011",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1995376.1995383",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Aug 25 17:24:35 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Cryptographer and Unix operating system co-creator
Robert Morris died June 26 in Lebanon, NH, at the age
of 78 from complications of dementia. Morris was a
pioneer in developing operating systems and computer
security. He also purportedly played a role in one of
the world's first cyberattacks during the 1991 Persian
Gulf War.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Grigg:2011:CCN,
author = "Ian Grigg and Peter Gutmann",
title = "The Curse of Cryptographic Numerology",
journal = j-IEEE-SEC-PRIV,
volume = "9",
number = "3",
pages = "70--72",
month = may # "\slash " # jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2011.69",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed May 25 15:29:11 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Gross-Amblard:2011:QPW,
author = "David Gross-Amblard",
title = "Query-preserving watermarking of relational databases
and {XML} documents",
journal = j-TODS,
volume = "36",
number = "1",
pages = "3:1--3:??",
month = mar,
year = "2011",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/1929934.1929937",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Mar 16 09:42:23 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Watermarking allows robust and unobtrusive insertion
of information in a digital document. During the last
few years, techniques have been proposed for
watermarking relational databases or Xml documents,
where information insertion must preserve a specific
measure on data (for example the mean and variance of
numerical attributes). In this article we investigate
the problem of watermarking databases or Xml while
preserving a set of parametric queries in a specified
language, up to an acceptable distortion. We first show
that unrestricted databases can not be watermarked
while preserving trivial parametric queries. We then
exhibit query languages and classes of structures that
allow guaranteed watermarking capacity, namely (1)
local query languages on structures with bounded degree
Gaifman graph, and (2) monadic second-order queries on
trees or treelike structures.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Database Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
}
@Article{Guerra-Casanova:2011:SOT,
author = "J. Guerra-Casanova and C. S{\'a}nchez-{\'A}vila and A.
{de Santos Sierra} and G. Bailador del Pozo",
title = "Score optimization and template updating in a
biometric technique for authentication in mobiles based
on gestures",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "11",
pages = "2013--2021",
month = nov,
year = "2011",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.05.059",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:26 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211001427",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Gunson:2011:UPS,
author = "Nancie Gunson and Diarmid Marshall and Hazel Morton
and Mervyn Jack",
title = "User perceptions of security and usability of
single-factor and two-factor authentication in
automated telephone banking",
journal = j-COMPUT-SECUR,
volume = "30",
number = "4",
pages = "208--220",
month = jun,
year = "2011",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:24 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404810001148",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Guo:2011:EDA,
author = "Hua Guo and Zhoujun Li and Yi Mu and Fan Zhang and
Chuankun Wu and Jikai Teng",
title = "An efficient dynamic authenticated key exchange
protocol with selectable identities",
journal = j-COMPUT-MATH-APPL,
volume = "61",
number = "9",
pages = "2518--2527",
month = may,
year = "2011",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:54 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122111001404",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Guo:2011:ISS,
author = "Fuchun Guo and Yi Mu and Willy Susilo",
title = "Improving security of $q$-{SDH} based digital
signatures",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "10",
pages = "1783--1790",
month = oct,
year = "2011",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.05.023",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211001233",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Haitner:2011:PRI,
author = "Iftach Haitner and Danny Harnik and Omer Reingold",
title = "On the Power of the Randomized Iterate",
journal = j-SIAM-J-COMPUT,
volume = "40",
number = "6",
pages = "1486--1528",
month = "????",
year = "2011",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/080721820",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Thu Feb 9 07:15:10 MST 2012",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/40/6;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
URL = "http://epubs.siam.org/sicomp/resource/1/smjcat/v40/i6/p1486_s1",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
keywords = "cryptography; hardness amplification; one-way
functions; pseudorandom generator",
onlinedate = "December 06, 2011",
}
@Article{Halevi:2011:TBH,
author = "Tzipora Halevi and Nitesh Saxena and Shai Halevi",
title = "Tree-based {HB} protocols for privacy-preserving
authentication of {RFID} tags",
journal = j-J-COMP-SECUR,
volume = "19",
number = "2",
pages = "343--363",
month = "????",
year = "2011",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2010-0404",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:25:03 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Hamdy:2011:HPB,
author = "Omar Hamdy and Issa Traor{\'e}",
title = "Homogeneous physio-behavioral visual and mouse-based
biometric",
journal = j-TOCHI,
volume = "18",
number = "3",
pages = "12:1--12:??",
month = jul,
year = "2011",
CODEN = "ATCIF4",
DOI = "https://doi.org/10.1145/1993060.1993062",
ISSN = "1073-0516",
ISSN-L = "1073-0516",
bibdate = "Wed Aug 17 09:31:44 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/tochi/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "In this research, we propose a novel biometric system
for static user authentication that homogeneously
combines mouse dynamics, visual search capability and
short-term memory effect. The proposed system
introduces the visual search capability, and short-term
memory effect to the biometric-based security world for
the first time. The use of a computer mouse for its
dynamics, and as an input sensor for the other two
biometrics, means no additional hardware is required
than the standard mouse. Experimental evaluation showed
the system effectiveness using variable or one-time
passwords. All of these attributes qualify the proposed
system to be effectively deployed as a static
authentication mechanism.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Computer-Human Interaction",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J756",
}
@Article{Hammerle-Uhl:2011:RWI,
author = "Jutta H{\"a}mmerle-Uhl and Karl Raab and Andreas Uhl",
title = "Robust watermarking in iris recognition: application
scenarios and impact on recognition performance",
journal = j-SIGAPP,
volume = "11",
number = "3",
pages = "6--18",
month = aug,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2034594.2034595",
ISSN = "1559-6915 (print), 1931-0161 (electronic)",
ISSN-L = "1559-6915",
bibdate = "Thu Jan 23 10:24:54 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigapp.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/2034594.2034595",
abstract = "Watermarking has been suggested as a means to improve
security of biometric systems. We discuss application
scenarios for resolving various security issues in this
context. As embedding watermarks changes biometric
data, degraded recognition performance \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGAPP Applied Computing Review",
journal-URL = "https://dl.acm.org/loi/sigapp",
}
@Article{Han:2011:PEB,
author = "Yiliang Han and Xiaolin Gui and Xuguang Wu and
Xiaoyuan Yang",
title = "Proxy encryption based secure multicast in wireless
mesh networks",
journal = j-J-NETW-COMPUT-APPL,
volume = "34",
number = "2",
pages = "469--477",
month = mar,
year = "2011",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:52 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804510000974",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Hanka:2011:DPK,
author = "Oliver Hanka and Michael Eichhorn and Martin
Pfannenstein and J{\"o}rg Ebersp{\"a}cher and Eckehard
Steinbach",
title = "A Distributed Public Key Infrastructure Based on
Threshold Cryptography for the {HiiMap} Next Generation
{Internet} Architecture",
journal = j-FUTURE-INTERNET,
volume = "3",
number = "1",
pages = "14--30",
day = "01",
month = feb,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi3010014",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:46 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/3/1/14",
abstract = "In this article, a security extension for the HiiMap
Next Generation Internet Architecture is presented. We
regard a public key infrastructure which is integrated
into the mapping infrastructure of the
locator/identifier-split addressing scheme. The
security approach is based on Threshold Cryptography
which enables a sharing of keys among the mapping
servers. Hence, a more trustworthy and fair approach
for a Next Generation Internet Architecture as compared
to the state of the art approach is fostered.
Additionally, we give an evaluation based on IETF AAA
recommendations for security-related systems.",
acknowledgement = ack-nhfb,
remark = "Special Issue Semantics in the Future Internet.",
}
@Article{Hao:2011:NTV,
author = "Rong Hao and Jia Yu and Zhiling Song",
title = "A Note On a Threshold Verifiable Multi-Secret Sharing
Scheme",
journal = j-INT-J-COMPUT-APPL,
volume = "33",
number = "4",
pages = "330--334",
year = "2011",
DOI = "https://doi.org/10.2316/Journal.202.2011.4.202-3074",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:27:36 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2011.4.202-3074",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Harn:2011:FDM,
author = "Lein Harn and Chia-Yin Lee and Changlu Lin and
Chin-Chen Chang",
title = "Fully Deniable Message Authentication Protocols
Preserving Confidentiality",
journal = j-COMP-J,
volume = "54",
number = "10",
pages = "1688--1699",
month = oct,
year = "2011",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr081",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Oct 1 18:10:35 MDT 2011",
bibsource = "http://comjnl.oxfordjournals.org/content/54/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/54/10/1688.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 23, 2011",
}
@Article{Herranz:2011:RBS,
author = "Javier Herranz and Fabien Laguillaumie and Carla
R{\`a}fols",
title = "Relations between semantic security and anonymity in
identity-based encryption",
journal = j-INFO-PROC-LETT,
volume = "111",
number = "10",
pages = "453--460",
day = "30",
month = apr,
year = "2011",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 12:47:00 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Heys:2011:PSC,
author = "Howard M. Heys and Liang Zhang",
title = "Pipelined Statistical Cipher Feedback: a New Mode for
High-Speed Self-Synchronizing Stream Encryption",
journal = j-IEEE-TRANS-COMPUT,
volume = "60",
number = "11",
pages = "1581--1595",
month = nov,
year = "2011",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2010.167",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Sep 27 07:57:50 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5499465",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Hinkelmann:2011:CPA,
author = "Markus Hinkelmann and Andreas Jakoby and Nina Moebius
and Tiark Rompf and Peer Stechert",
title = "A cryptographically $t$-private auction system",
journal = j-CCPE,
volume = "23",
number = "12",
pages = "1399--1413",
day = "25",
month = aug,
year = "2011",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.1684",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Dec 5 10:08:57 MST 2011",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "7 Dec 2010",
}
@Article{Ho:2011:EIB,
author = "Chen-Han Ho and Garret Staus and Aaron Ulmer and
Karthikeyan Sankaralingam",
title = "Exploring the Interaction Between Device Lifetime
Reliability and Security Vulnerabilities",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "10",
number = "2",
pages = "37--40",
month = jul # "\slash " # dec,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1109/L-CA.2011.16",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "As technology scales, device reliability is becoming a
fundamental problem. Even though manufacture test can
guarantee product quality, due to various types of
wearout and failure modes, permanent faults appearing
in the filed is becoming an increasingly important and
real problem. Such types of wear-out creates permanent
faults in devices after release to the user during
their lifetime. In this paper, we perform a formal
investigation of the impact of permanent faults on
security, examine empirical evidence, and demonstrate a
real attack. Our results show that permanent stuck-at
faults may leave security holes in microprocessors. We
show that an adversary with knowledge of a fault can
launch attacks which can obtain critical secrets such
as a private key in 30 seconds.",
acknowledgement = ack-nhfb,
affiliation = "Ho, CH (Reprint Author), Univ Wisconsin, Madison, WI
53706 USA. Ho, Chen-Han; Staus, Garret; Ulmer, Aaron;
Sankaralingam, Karthikeyan, Univ Wisconsin, Madison, WI
53706 USA.",
da = "2019-06-20",
doc-delivery-number = "855NW",
fjournal = "IEEE Computer Architecture Letters",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "Permanent Fault; Reliability; Security",
number-of-cited-references = "13",
research-areas = "Computer Science",
times-cited = "0",
unique-id = "Ho:2011:EIB",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@InProceedings{Holenstein:2011:ERO,
author = "Thomas Holenstein and Robin K{\"u}nzler and Stefano
Tessaro",
title = "The equivalence of the random oracle model and the
ideal cipher model, revisited",
crossref = "ACM:2011:PAI",
pages = "89--98",
year = "2011",
DOI = "https://doi.org/10.1145/1993636.1993650",
bibdate = "Tue Jun 7 18:53:27 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Article{Hsu:2011:NIB,
author = "Chien-Lung Hsu and Han-Yu Lin",
title = "New identity-based key-insulated convertible
multi-authenticated encryption scheme",
journal = j-J-NETW-COMPUT-APPL,
volume = "34",
number = "5",
pages = "1724--1731",
month = sep,
year = "2011",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:03 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804511001172",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Hsu:2011:NLM,
author = "Ching-Fang Hsu and Guo-Hua Cui and Qi Cheng and Jing
Chen",
title = "A novel linear multi-secret sharing scheme for group
communication in wireless mesh networks",
journal = j-J-NETW-COMPUT-APPL,
volume = "34",
number = "2",
pages = "464--468",
month = mar,
year = "2011",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:52 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S108480451000055X",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Hsu:2011:WLC,
author = "Francis Hsu and Hao Chen and Sridhar Machiraju",
title = "{WebCallerID}: Leveraging cellular networks for {Web}
authentication",
journal = j-J-COMP-SECUR,
volume = "19",
number = "5",
pages = "869--893",
month = "????",
year = "2011",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2011-0424",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:25:15 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Huang:2011:GFT,
author = "Xinyi Huang and Yang Xiang and Ashley Chonka and
Jianying Zhou and Robert H. Deng",
title = "A Generic Framework for Three-Factor Authentication:
Preserving Security and Privacy in Distributed
Systems",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "22",
number = "8",
pages = "1390--1397",
month = aug,
year = "2011",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2010.206",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Fri Jul 22 07:55:10 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Huang:2011:IBS,
author = "Qiong Huang and Guomin Yang and Duncan S. Wong and
Willy Susilo",
title = "Identity-based strong designated verifier signature
revisited",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "1",
pages = "120--129",
month = jan,
year = "2011",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Jun 21 10:22:23 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Huang:2011:ISL,
author = "Y.-L. Huang and F.-Y. Leu and C.-H. Chiu and I.-L.
Lin",
title = "Improving Security Levels of {IEEE802.16e}
Authentication by Involving {Diffie--Hellman} {PKDS}",
journal = j-J-UCS,
volume = "17",
number = "6",
pages = "891--??",
month = "????",
year = "2011",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Fri Apr 6 05:52:29 MDT 2012",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.jucs.org/jucs_17_6/improving_security_levels_of",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Hwang:2011:CDA,
author = "Shin-Jia Hwang and Yun-Hao Sung",
title = "Confidential deniable authentication using promised
signcryption",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "10",
pages = "1652--1659",
month = oct,
year = "2011",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.04.024",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211000999",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Hwang:2011:NIB,
author = "Jung Yeon Hwang",
title = "A note on an identity-based ring signature scheme with
signer verifiability",
journal = j-THEOR-COMP-SCI,
volume = "412",
number = "8--10",
pages = "796--804",
day = "4",
month = mar,
year = "2011",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Aug 31 10:15:30 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Islam:2011:MDA,
author = "Salekul Islam and Jean-Charles Gr{\'e}goire",
title = "Multi-domain authentication for {IMS} services",
journal = j-COMP-NET-AMSTERDAM,
volume = "55",
number = "12",
pages = "2689--2704",
day = "25",
month = aug,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2011.04.012",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Feb 4 10:22:46 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128611001423",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Islam:2011:MES,
author = "Sk. Hafizul Islam and G. P. Biswas",
title = "A more efficient and secure {ID}-based remote mutual
authentication with key agreement scheme for mobile
devices on elliptic curve cryptosystem",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "11",
pages = "1892--1898",
month = nov,
year = "2011",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.06.061",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:26 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211001646",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Jie:2011:RGA,
author = "Wei Jie and Junaid Arshad and Richard Sinnott and Paul
Townend and Zhou Lei",
title = "A review of grid authentication and authorization
technologies and support for federated access control",
journal = j-COMP-SURV,
volume = "43",
number = "2",
pages = "12:1--12:26",
month = jan,
year = "2011",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/1883612.1883619",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sun Jan 30 14:27:08 MST 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Grid computing facilitates resource sharing typically
to support distributed virtual organizations (VO). The
multi-institutional nature of a grid environment
introduces challenging security issues, especially with
regard to authentication and authorization. This
article presents a state-of-the-art review of major
grid authentication and authorization technologies. In
particular we focus upon the Internet2 Shibboleth
technologies and their use to support federated
authentication and authorization to support
interinstitutional sharing of remote grid resources
that are subject to access control. We outline the
architecture, features, advantages, limitations,
projects, and applications of Shibboleth in a grid
environment.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Kai:2011:CIS,
author = "Hiroshi Kai and Shigenobu Inoue",
title = "Cheater identification on a secret sharing scheme
using {GCD}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "119--120",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016585",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "A method to identify cheaters on the Shamir's (k, n)
threshold secret sharing scheme is proposed using
rational interpolation. When a rational interpolant is
computed for $l$ shares $ D_i, i = 1, \ldots {}, l$,
where $ l = k + 2 s$, then $s$ unattainable points of
the rational interpolant may identify $s$ cheaters. The
cheaters can be computed by GCD of the numerator
polynomial and the denominator polynomial.",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
}
@Article{Kallel:2011:SMM,
author = "Mohamed Kallel and Mohamed-Salim Bouhlel and
Jean-Christophe Lapayre",
title = "Security of the Medical Media Using a Hybrid and
Multiple Watermark Technique",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "11",
number = "1",
pages = "103--115",
month = jan,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467811004019",
ISSN = "0219-4678",
bibdate = "Tue Mar 8 10:11:09 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Book{Kapera:2011:SPD,
author = "Zdzis{\l}aw Jan Kapera",
title = "In the Shadow of {Pont du Gard}: the {Polish Enigma}
in {Vichy France (June 1940 to November 1942)}",
volume = "7",
publisher = "The Enigma Press",
address = "Krak{\'o}w, Poland",
pages = "111 + 1 + 16",
year = "2011",
ISBN = "83-86110-72-4",
ISBN-13 = "978-83-86110-72-8",
ISSN = "0867-8693",
LCCN = "????",
bibdate = "Mon Sep 3 18:03:34 MDT 2012",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptologia.bib",
series = "The Enigma Bulletin",
acknowledgement = ack-nhfb,
author-dates = "(1942-- )",
}
@Article{Karger:2011:LLB,
author = "Paul Karger and Suzanne McIntosh and Elaine Palmer and
David Toll and Samuel Weber",
title = "Lessons Learned: Building the {Caernarvon}
High-Assurance Operating System",
journal = j-IEEE-SEC-PRIV,
volume = "9",
number = "1",
pages = "22--30",
month = jan # "\slash " # feb,
year = "2011",
DOI = "https://doi.org/10.1109/MSP.2010.169",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Feb 8 15:50:31 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
keywords = "Evaluation Assurance Level 7 (EAL7); ISO 7816-4:2005
(Identification Cards --- Integrated Circuits with
Contacts); Smart-card chip O/S",
}
@Article{Kemshall:2011:WMT,
author = "Andy Kemshall",
title = "Why mobile two-factor authentication makes sense",
journal = j-NETWORK-SECURITY,
volume = "2011",
number = "4",
pages = "9--12",
month = apr,
year = "2011",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(11)70038-1",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:28 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485811700381",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Kiani:2011:MPD,
author = "Soheila Kiani and Mohsen Ebrahimi Moghaddam",
title = "A multi-purpose digital image watermarking using
fractal block coding",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "9",
pages = "1550--1562",
month = sep,
year = "2011",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.03.019",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:22 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211000707",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Kiltz:2011:EAH,
author = "Eike Kiltz and Krzysztof Pietrzak and David Cash and
Abhishek Jain and Daniele Venturi",
title = "Efficient Authentication from Hard Learning Problems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6632",
pages = "7--26",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-20465-4_3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 17:44:03 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-20465-4_3",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kim:2011:LBA,
author = "Hyun Sung Kim",
title = "Location-based authentication protocol for first
cognitive radio networking standard",
journal = j-J-NETW-COMPUT-APPL,
volume = "34",
number = "4",
pages = "1160--1167",
month = jul,
year = "2011",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:59 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804510002286",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Kim:2011:SSE,
author = "Changhoon Kim and Matthew Caesar and Jennifer
Rexford",
title = "{SEATTLE}: a {Scalable Ethernet Architecture for Large
Enterprises}",
journal = j-TOCS,
volume = "29",
number = "1",
pages = "1:1--1:35",
month = feb,
year = "2011",
CODEN = "ACSYEC",
DOI = "https://doi.org/10.1145/1925109.1925110",
ISSN = "0734-2071",
ISSN-L = "0734-2071",
bibdate = "Mon Feb 28 16:17:43 MST 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/tocs/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "IP networks today require massive effort to configure
and manage. Ethernet is vastly simpler to manage, but
does not scale beyond small local area networks. This
article describes an alternative network architecture
called SEATTLE that achieves the best of both worlds:
The scalability of IP combined with the simplicity of
Ethernet. SEATTLE provides plug-and-play functionality
via flat addressing, while ensuring scalability and
efficiency through shortest-path routing and hash-based
resolution of host information. In contrast to previous
work on identity-based routing, SEATTLE ensures path
predictability, controllability, and stability, thus
simplifying key network-management operations, such as
capacity planning, traffic engineering, and
troubleshooting. We performed a simulation study driven
by real-world traffic traces and network topologies,
and used Emulab to evaluate a prototype of our design
based on the Click and XORP open-source routing
platforms.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Computer Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J774",
}
@Article{King:2011:BBB,
author = "Valerie King and Jared Saia",
title = "Breaking the {$ O(n^2) $} bit barrier: {Scalable}
{Byzantine} agreement with an adaptive adversary",
journal = j-J-ACM,
volume = "58",
number = "4",
pages = "18:1--18:24",
month = jul,
year = "2011",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/1989727.1989732",
ISSN = "0004-5411",
ISSN-L = "0004-5411",
bibdate = "Mon Jul 18 12:34:51 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "We describe an algorithm for Byzantine agreement that
is scalable in the sense that each processor sends only
$ {\~ O}(\sqrt {n}) $ bits, where $n$ is the total
number of processors. Our algorithm succeeds with high
probability against an adaptive adversary, which can
take over processors at any time during the protocol,
up to the point of taking over arbitrarily close to a $
1 / 3$ fraction. We assume synchronous communication
but a rushing adversary. Moreover, our algorithm works
in the presence of flooding: processors controlled by
the adversary can send out any number of messages. We
assume the existence of private channels between all
pairs of processors but make no other cryptographic
assumptions.",
acknowledgement = ack-nhfb,
articleno = "18",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Kinkelin:2011:UTS,
author = "Holger Kinkelin and Ralph Holz and Heiko Niedermayer
and Simon Mittelberger and Georg Carle",
title = "On Using {TPM} for Secure Identities in Future Home
Networks",
journal = j-FUTURE-INTERNET,
volume = "3",
number = "1",
pages = "1--13",
day = "07",
month = jan,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi3010001",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:46 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/3/1/1",
abstract = "Security should be integrated into future networks
from the beginning, not as an extension. Secure
identities and authentication schemes are an important
step to fulfill this quest. In this article, we argue
that home networks are a natural trust anchor for such
schemes. We describe our concept of home networks as a
universal point of reference for authentication, trust
and access control, and show that our scheme can be
applied to any next generation network. As home
networks are no safe place, we apply Trusted Computing
technology to prevent the abuse of identities, i.e.,
identity theft.",
acknowledgement = ack-nhfb,
remark = "Special Issue Semantics in the Future Internet.",
}
@Book{Knudsen:2011:BCC,
author = "Lars R. Knudsen and Matthew J. B. Robshaw",
title = "The Block Cipher Companion",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 267",
year = "2011",
DOI = "https://doi.org/10.1007/978-3-642-17342-4",
ISBN = "3-642-17341-1, 3-642-17342-X (e-book)",
ISBN-13 = "978-3-642-17341-7, 978-3-642-17342-4 (e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.A25 K58 2011; QA76.9.D35",
bibdate = "Sat Jun 10 08:35:13 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Information Security and Cryptography",
abstract = "Block ciphers encrypt blocks of plaintext, messages,
into blocks of ciphertext under the action of a secret
key, and the process of encryption is reversed by
decryption which uses the same user-supplied key. Block
ciphers are fundamental to modern cryptography, in fact
they are the most widely used cryptographic primitive -
useful in their own right, and in the construction of
other cryptographic mechanisms. In this book the
authors provide a technically detailed, yet readable,
account of the state of the art of block cipher
analysis, design, and deployment. The authors first
describe the most prominent block ciphers and give
insights into their design. They then consider the role
of the cryptanalyst, the adversary, and provide an
overview of some of the most important cryptanalytic
methods. The book will be of value to graduate and
senior undergraduate students of cryptography and to
professionals engaged in cryptographic design. An
important feature of the presentation is the authors'
exhaustive bibliography of the field, each chapter
closing with comprehensive supporting notes.",
acknowledgement = ack-nhfb,
author-dates = "1962--",
shorttableofcontents = "Introduction \\
Data Encryption Standard (DES) \\
Advanced Encryption Standard (AES) \\
Using Block Ciphers \\
Brute-Force Attacks \\
Differential Cryptanalysis \\
Linear Cryptanalysis \\
Advanced Topics \\
A Short Survey and Five Prominent Ciphers \\
Bibliography",
subject = "Data encryption (Computer science); Cryptography;
Computer Science; Data Structures, Cryptology and
Information Theory; Mathematics of Computing;
Informatique; Cryptography; Data encryption (Computer
science)",
tableofcontents = "1: Introduction / 1 \\
1.1 Cryptographic Algorithms / 3 \\
1.2 Block Ciphers / 4 \\
1.3 Cryptographer and Cryptanalyst / 5 \\
1.4 Security / 10 \\
1.5 Summary / 11 \\
2: DES / 13 \\
2.1 DES Description / 14 \\
2.1.1 The Round Function / 17 \\
2.2 Design Features / 23 \\
2.3 Structural Properties / 27 \\
2.3.1 The Complementation Property / 27 \\
2.3.2 Weak and Semi-Weak Keys / 28 \\
2.4 DES Variants / 29 \\
2.4.1 Triple-DES / 30 \\
2.4.2 DESX / 32 \\
2.5 DES in Context / 33 \\
2.6 Getting to the Source / 34 \\
3: AES / 35 \\
3.1 AES Description / 36 \\
3.1.1 Arithmetic in GF($2^n$) / 37 \\
3.1.2 Encryption with the AES / 38 \\
3.1.3 Decryption with the AES / 42 \\
3.1.4 AES Key Schedule / 45 \\
3.1.5 AES Design Features / 50 \\
3.2 AES State of the Art / 54 \\
3.2.1 Differential and Linear Cryptanalysis / 54 \\
3.2.2 Structural Attacks / 54 \\
3.2.3 Algebraic Analysis / 59 \\
3.2.4 Related-Key Cryptanalysis / 62 \\
3.2.5 Side-Channel Cryptanalysis / 63 \\
3.3 AES in Context / 63 \\
3.4 Getting to the Source / 64 \\
4: Using Block Ciphers / 65 \\
4.1 Block Encryption / 66 \\
4.1.1 Electronic Code Book Mode / 66 \\
4.1.2 Cipher Block Chaining Mode / 67 \\
4.2 Stream Encryption / 69 \\
4.2.1 Cipher Feedback Mode / 69 \\
4.2.2 Output Feedback Mode / 70 \\
4.2.3 Counter Mode / 73 \\
4.3 Starting and Finishing / 74 \\
4.3.1 Choosing the IV / 74 \\
4.3.2 Padding / 75 \\
4.3.3 Ciphertext Stealing / 76 \\
4.4 Authentication / 77 \\
4.4.1 CBC-MAC / 78 \\
4.4.2 OMAC / 80 \\
4.5 Authenticated Encryption / 82 \\
4.5.1 CCMMode / 83 \\
4.5.2 EAX Mode / 84 \\
4.6 Hashing / 86 \\
4.6.1 Three Important Constructions / 86 \\
4.6.2 Double Block Length Constructions / 90 \\
4.6.3 The SHA-3 Competition / 92 \\
4.7 Getting to the Source / 93 \\
5: Brute Force Attacks / 95 \\
5.1 Time-Memory Trade-offs / 96 \\
5.1.1 Hellman's Time-Memory Trade-off / 96 \\
5.1.2 More Advanced Considerations / 100 \\
5.2 Meet-in-the-Middle Attacks / 103 \\
5.2.1 Double Encryption / 103 \\
5.2.2 Triple Encryption / 105 \\
5.3 Getting to the Source / 108 \\
6: Differential Cryptanalysis: The Idea / 109 \\
6.1 Getting Started / 110 \\
6.1.1 Working with Less Certainty / 113 \\
6.2 Introducing Characteristics / 116 \\
6.2.1 Joining Characteristics / 117 \\
6.2.2 Introducing Differentials / 122 \\
6.3 Filtering / 124 \\
6.3.1 Recovering Key Information / 125 \\
6.4 Getting to the Source / 126 \\
7: Linear Cryptanalysis: The Idea / 127 \\
7.1 Getting Started / 128 \\
7.2 Joining Approximations / 131 \\
7.2.1 Deducing More Key / 135 \\
7.3 Putting Things Together / 137 \\
7.3.1 Introducing Linear Hulls / 141 \\
7.3.2 A Unified Measure / 143 \\
7.4 Getting to the Source / 144 \\
8: Advanced Topics / 145 \\
8.1 Differential Cryptanalysis Revisited / 145 \\
8.1.1 Joining Components / 146 \\
8.1.2 Key Equivalence / 148 \\
8.1.3 Key Recovery and Data Complexity / 148 \\
8.1.4 Enhancements to the Basic Differential Attack /
154 \\
8.2 Linear Cryptanalysis Revisited / 165 \\
8.2.1 Joining Components / 166 \\
8.2.2 Key Equivalence / 168 \\
8.2.3 Key Recovery and Data Complexity / 169 \\
8.2.4 Enhancements to the Basic Linear Attack / 172 \\
8.3 Differential-Linear Cryptanalysis / 174 \\
8.4 The Interpolation Attack / 177 \\
8.5 The Key Schedule / 178 \\
8.6 The Impact of Analysis on Design / 180 \\
8.6.1 Block Cipher Topology / 181 \\
8.6.2 Resistance to Differential and Linear
Cryptanalysis / 184 \\
8.6.3 S-Box Properties / 187 \\
8.7 Getting to the Source / 192 \\
9: A Short Survey and Six Prominent Ciphers / 193 \\
9.1 From DES to the AES / 193 \\
9.2 The AES Process and Finalists / 196 \\
9.3 After the AES / 197 \\
9.3.1 Other Competitions and Standardisation Efforts /
197 \\
9.3.2 Niche Proposals / 199 \\
9.3.3 Lightweight Block Ciphers / 199 \\
9.4 Six Prominent Block Ciphers / 201 \\
9.4.1 FEAL / 202 \\
9.4.2 IDEA / 205 \\
9.4.3 KASUMI / 207 \\
9.4.4 RC5 / 212 \\
9.4.5 Skipjack / 214 \\
9.4.6 PRESENT / 217 \\
9.5 Getting to the Source / 219 \\
Index / 221 References / 225",
}
@Article{Koblitz:2011:ECC,
author = "Ann Hibner Koblitz and Neal Koblitz and Alfred
Menezes",
title = "Elliptic curve cryptography: the serpentine course of
a paradigm shift",
journal = j-J-NUMBER-THEORY,
volume = "131",
number = "5",
pages = "781--814",
month = may,
year = "2011",
CODEN = "JNUTA9",
DOI = "https://doi.org/10.1016/j.jnt.2009.01.006",
ISSN = "0022-314X (print), 1096-1658 (electronic)",
ISSN-L = "0022-314X",
bibdate = "Wed Jul 15 08:48:47 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnumbertheory2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022314X09000481",
acknowledgement = ack-nhfb,
ajournal = "J. Number Theory",
fjournal = "Journal of Number Theory",
journal-URL = "http://www.sciencedirect.com/science/journal/0022314X",
}
@Article{Kushwah:2011:EIB,
author = "Prashant Kushwah and Sunder Lal",
title = "An efficient identity based generalized signcryption
scheme",
journal = j-THEOR-COMP-SCI,
volume = "412",
number = "45",
pages = "6382--6389",
day = "21",
month = oct,
year = "2011",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2011.08.009",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Nov 29 19:11:39 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397511006700",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Kuznetsov:2011:APP,
author = "A. Kuznetsov",
title = "Analytic Proof of {Pecherskii--Rogozin} Identity and
{Wiener--Hopf} Factorization",
journal = j-THEORY-PROBAB-APPL,
volume = "55",
number = "3",
pages = "432--443",
month = "????",
year = "2011",
CODEN = "TPRBAU",
DOI = "https://doi.org/10.1137/S0040585X97984929",
ISSN = "0040-585X (print), 1095-7219 (electronic)",
ISSN-L = "0040-585X",
bibdate = "Sat Dec 17 09:29:30 MST 2011",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toc/TVP/55/3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/theoryprobabappl.bib",
URL = "http://epubs.siam.org/tvp/resource/1/tprbau/v55/i3/p432_s1",
acknowledgement = ack-nhfb,
fjournal = "Theory of Probability and its Applications",
journal-URL = "http://epubs.siam.org/tvp",
}
@Article{Lafitte:2011:CBF,
author = "Fr{\'e}d{\'e}ric Lafitte and Dirk {Van Heule} and
Julien {Van hamme}",
title = "Cryptographic {Boolean} Functions with {R}",
journal = j-R-JOURNAL,
volume = "3",
number = "1",
pages = "44--47",
month = jun,
year = "2011",
CODEN = "????",
ISSN = "2073-4859",
bibdate = "Thu Aug 13 15:54:57 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/rjournal.bib",
URL = "http://journal.r-project.org/archive/2011-1/RJournal_2011-1_Lafitte~et~al.pdf",
acknowledgement = ack-r-project,
fjournal = "The R Journal",
journal-URL = "http://journal.r-project.org/",
}
@Article{Langsworth:2011:USA,
author = "Anthony Langsworth",
title = "Using static analysis tools to detect and correct
non-compliant cryptography",
journal = j-SIGSOFT,
volume = "36",
number = "6",
pages = "1--7",
month = nov,
year = "2011",
CODEN = "SFENDP",
DOI = "https://doi.org/10.1145/2047414.2047427",
ISSN = "0163-5948 (print), 1943-5843 (electronic)",
ISSN-L = "0163-5948",
bibdate = "Wed Aug 1 17:16:07 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsoft2010.bib",
abstract = "Security is an increasing concern for application
developers, whether they are targeting internal
customers, organizations or the general public.
Particularly for the US public sector with requirements
like FIPS 140, developers need to identify and remove
superseded cryptography in both legacy applications and
new development. This paper outlines a mechanism using
static analysis tools to find outdated or improper
cryptography and suggest corrections or correct code.
This prevents the need for manual inspection and
correction by developers familiar with cryptography and
is more accurate than text searches.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGSOFT Software Engineering Notes",
journal-URL = "https://dl.acm.org/citation.cfm?id=J728",
}
@Article{Le:2011:RMA,
author = "Duc-Phong Le and Chao-Liang Liu",
title = "Refinements of {Miller}'s Algorithm over {Weierstrass}
Curves Revisited",
journal = j-COMP-J,
volume = "54",
number = "10",
pages = "1582--1591",
month = oct,
year = "2011",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr039",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Oct 1 18:10:35 MDT 2011",
bibsource = "http://comjnl.oxfordjournals.org/content/54/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/54/10/1582.full.pdf+html",
abstract = "In 1986, Victor Miller described an algorithm for
computing the Weil pairing in his unpublished
manuscript. This algorithm has then become the core of
all pairing-based cryptosystems. Many improvements of
the algorithm have been presented. Most of them involve
a choice of elliptic curves of a special form to
exploit a possible twist during Tate pairing
computation. Other improvements involve a reduction of
the number of iterations in the Miller's algorithm. For
the generic case, Blake, Murty and Xu proposed three
refinements to Miller's algorithm over Weierstrass
curves. Though their refinements, which only reduce the
total number of vertical lines in Miller's algorithm,
did not give an efficient computation as other
optimizations, they can be applied for computing both
Weil and Tate pairings on all pairing-friendly elliptic
curves. In this paper, we extend the Blake--Murty--Xu's
method and show how to perform an elimination of all
vertical lines in Miller's algorithm during computation
of Weil\slash Tate pairings, on general elliptic
curves. Experimental results show that our algorithm is
faster by $ \approx $25\% in comparison with the
original Miller's algorithm.",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "May 6, 2011",
}
@Article{Lee:2011:IMS,
author = "Jung-San Lee and Ming-Huang Hsieh",
title = "An interactive mobile {SMS} confirmation method using
secret sharing technique",
journal = j-COMPUT-SECUR,
volume = "30",
number = "8",
pages = "830--839",
month = nov,
year = "2011",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404811000836",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Lee:2011:PSE,
author = "Tian-Fu Lee and Tzonelih Hwang",
title = "Provably secure and efficient authentication
techniques for the global mobility network",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "10",
pages = "1717--1725",
month = oct,
year = "2011",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.05.006",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211001099",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Lee:2011:TAT,
author = "Cheng-Chi Lee and Chun-Ta Li and Shun-Der Chen",
title = "Two Attacks on a Two-Factor User Authentication in
Wireless Sensor Networks",
journal = j-PARALLEL-PROCESS-LETT,
volume = "21",
number = "1",
pages = "21--26",
month = mar,
year = "2011",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626411000047",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:06 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Leng:2011:DKB,
author = "Lu Leng and Jiashu Zhang",
title = "Dual-key-binding cancelable palmprint cryptosystem for
palmprint protection and information security",
journal = j-J-NETW-COMPUT-APPL,
volume = "34",
number = "6",
pages = "1979--1989",
month = nov,
year = "2011",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:06 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804511001287",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Lewko:2011:DAB,
author = "Allison Lewko and Brent Waters",
title = "Decentralizing Attribute-Based Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6632",
pages = "568--588",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-20465-4_31",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 17:44:03 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-20465-4_31",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lewko:2011:UHA,
author = "Allison Lewko and Brent Waters",
title = "Unbounded {HIBE} and Attribute-Based Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6632",
pages = "547--567",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-20465-4_30",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 17:44:03 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-20465-4_30",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Li:2011:CIB,
author = "Xiong Li and Jian-Wei Niu and Jian Ma and Wen-Dong
Wang and Cheng-Lian Liu",
title = "Cryptanalysis and improvement of a biometrics-based
remote user authentication scheme using smart cards",
journal = j-J-NETW-COMPUT-APPL,
volume = "34",
number = "1",
pages = "73--79",
month = jan,
year = "2011",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:49 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804510001657",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Li:2011:NIW,
author = "Li Li and He-Huan Xu and Chin-Chen Chang and Ying-Ying
Ma",
title = "A novel image watermarking in redistributed invariant
wavelet domain",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "6",
pages = "923--929",
month = jun,
year = "2011",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Jun 21 10:22:30 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Li:2011:NRA,
author = "Guangsong Li and Jianfeng Ma and Qi Jiang and Xi
Chen",
title = "A novel re-authentication scheme based on tickets in
wireless local area networks",
journal = j-J-PAR-DIST-COMP,
volume = "71",
number = "7",
pages = "906--914",
month = jul,
year = "2011",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2011.03.002",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Sat Feb 25 09:11:34 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib;
http://www.sciencedirect.com/science/journal/07437315",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731511000554",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Lim:2011:NAN,
author = "Chae Hoon Lim",
title = "A note on the average number of {RSA} fixed points",
journal = j-THEOR-COMP-SCI,
volume = "412",
number = "35",
pages = "4729--4737",
day = "12",
month = aug,
year = "2011",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Aug 30 18:51:47 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Lin:2011:CRN,
author = "Huijia Lin and Rafael Pass",
title = "Constant-round non-malleable commitments from any
one-way function",
crossref = "ACM:2011:PAI",
pages = "705--714",
year = "2011",
DOI = "https://doi.org/10.1145/1993636.1993730",
bibdate = "Tue Jun 7 18:53:27 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Article{Lin:2011:ICA,
author = "Han-Yu Lin and Chien-Lung Hsu and Shih-Kun Huang",
title = "Improved convertible authenticated encryption scheme
with provable security",
journal = j-INFO-PROC-LETT,
volume = "111",
number = "13",
pages = "661--666",
day = "1",
month = jul,
year = "2011",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2011.03.021",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Feb 4 08:08:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019011000846",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Lin:2011:NIB,
author = "Han-Yu Lin and Chien-Lung Hsu",
title = "A Novel Identity-Based Key-Insulated Convertible
Authenticated Encryption Scheme",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "3",
pages = "739--756",
month = apr,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008325",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:20 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Liu:2011:DBA,
author = "Qingzhong Liu and Andrew H. Sung and Mengyu Qiao",
title = "Derivative-based audio steganalysis",
journal = j-TOMCCAP,
volume = "7",
number = "3",
pages = "18:1--18:??",
month = aug,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2000486.2000492",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Mon Sep 5 17:00:22 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
articleno = "18",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Liu:2011:NJD,
author = "Qingzhong Liu and Andrew H. Sung and Mengyu Qiao",
title = "Neighboring joint density-based {JPEG} steganalysis",
journal = j-TIST,
volume = "2",
number = "2",
pages = "16:1--16:??",
month = feb,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/1899412.1899420",
ISSN = "2157-6904 (print), 2157-6912 (electronic)",
ISSN-L = "2157-6904",
bibdate = "Thu Oct 1 16:23:55 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tist.bib/",
abstract = "The threat posed by hackers, spies, terrorists, and
criminals, etc. using steganography for stealthy
communications and other illegal purposes is a serious
concern of cyber security. Several steganographic
systems that have been developed and made readily
available utilize JPEG images as carriers. Due to the
popularity of JPEG images on the Internet, effective
steganalysis techniques are called for to counter the
threat of JPEG steganography. In this article, we
propose a new approach based on feature mining on the
discrete cosine transform (DCT) domain and machine
learning for steganalysis of JPEG images. First,
neighboring joint density features on both intra-block
and inter-block are extracted from the DCT coefficient
array and the absolute array, respectively; then a
support vector machine (SVM) is applied to the features
for detection. An evolving neural-fuzzy inference
system is employed to predict the hiding amount in JPEG
steganograms. We also adopt a feature selection method
of support vector machine recursive feature elimination
to reduce the number of features. Experimental results
show that, in detecting several JPEG-based
steganographic systems, our method prominently
outperforms the well-known Markov-process based
approach.",
acknowledgement = ack-nhfb,
articleno = "16",
fjournal = "ACM Transactions on Intelligent Systems and Technology
(TIST)",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1318",
}
@Article{Liu:2011:PIA,
author = "Guangjie Liu and Junwen Wang and Shiguo Lian and
Zhiquan Wang",
title = "A passive image authentication scheme for detecting
region-duplication forgery with rotation",
journal = j-J-NETW-COMPUT-APPL,
volume = "34",
number = "5",
pages = "1557--1565",
month = sep,
year = "2011",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:03 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804510001621",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Liu:2011:SBA,
author = "Yu Liu and Kaijie Wu and Ramesh Karri",
title = "Scan-based attacks on linear feedback shift register
based stream ciphers",
journal = j-TODAES,
volume = "16",
number = "2",
pages = "20:1--20:??",
month = mar,
year = "2011",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/1929943.1929952",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Apr 1 16:07:45 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Stream cipher is an important class of encryption
algorithm that encrypts plaintext messages one bit at a
time. Various stream ciphers are deployed in wireless
telecommunication applications because they have simple
hardware circuitry, are generally fast and consume very
low power. On the other hand, scan-based
Design-for-Test (DFT) is one of the most popular
methods to test IC devices. All flip-flops in the
Design Under Test are connected to one or more scan
chains and the states of the flip-flops can be scanned
out through these chains. In this paper, we present an
attack on stream cipher implementations by determining
the scan chain structure of the Linear Feedback Shift
Registers in their implementations.",
acknowledgement = ack-nhfb,
articleno = "20",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems (TODAES)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Malkin:2011:ECS,
author = "Tal Malkin and Isamu Teranishi and Moti Yung",
title = "Efficient Circuit-Size Independent Public Key
Encryption with {KDM} Security",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6632",
pages = "507--526",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-20465-4_28",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 17:44:03 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-20465-4_28",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Mannan:2011:LPD,
author = "Mohammad Mannan and P. C. van Oorschot",
title = "Leveraging personal devices for stronger password
authentication from untrusted computers",
journal = j-J-COMP-SECUR,
volume = "19",
number = "4",
pages = "703--750",
month = "????",
year = "2011",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2010-0412",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:25:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Book{McGrayne:2011:TWH,
author = "Sharon Bertsch McGrayne",
title = "The theory that would not die: how {Bayes}' rule
cracked the {Enigma} code, hunted down {Russian}
submarines, and emerged triumphant from two centuries
of controversy",
publisher = pub-YALE,
address = pub-YALE:adr,
pages = "xiii + 320",
year = "2011",
ISBN = "0-300-16969-8",
ISBN-13 = "978-0-300-16969-0",
LCCN = "QA279.5 2011",
bibdate = "Thu May 5 09:40:39 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.gbv.de:20011/gvk",
URL = "http://yalepress.yale.edu/yupbooks/book.asp?isbn=9780300169690",
abstract = "Bayes' rule appears to be a straightforward, one-line
theorem: by updating our initial beliefs with objective
new information, we get a new and improved belief. To
its adherents, it is an elegant statement about
learning from experience. To its opponents, it is
subjectivity run amok.\par
In the first-ever account of Bayes' rule for general
readers, Sharon Bertsch McGrayne explores this
controversial theorem and the human obsessions
surrounding it. She traces its discovery by an amateur
mathematician in the 1740s through its development into
roughly its modern form by French scientist Pierre
Simon Laplace. She reveals why respected statisticians
rendered it professionally taboo for 150 years---at the
same time that practitioners relied on it to solve
crises involving great uncertainty and scanty
information, even breaking Germany's Enigma code during
World War II, and explains how the advent of
off-the-shelf computer technology in the 1980s proved
to be a game-changer. Today, Bayes' rule is used
everywhere from DNA de-coding to Homeland
Security.\par
Drawing on primary source material and interviews with
statisticians and other scientists, {\em The Theory
That Would Not Die\/} is the riveting account of how a
seemingly simple theorem ignited one of the greatest
controversies of all time.",
acknowledgement = ack-nhfb,
subject = "Bayesian statistical decision theory; History; science
/ History; mathematics / History and Philosophy",
}
@Book{McKay:2011:SLB,
author = "Sinclair McKay",
title = "The secret life of {Bletchley Park}: the history of
the wartime codebreaking centre by the men and women
who were there",
publisher = "Gardners Books",
pages = "????",
year = "2011",
ISBN = "1-84513-633-0",
ISBN-13 = "978-1-84513-633-8",
LCCN = "????",
bibdate = "Thu May 12 11:15:08 MDT 2011",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Article{Milo:2011:FGB,
author = "Fabrizio Milo and Massimo Bernaschi and Mauro Bisson",
title = "A fast, {GPU} based, dictionary attack to {OpenPGP}
secret keyrings",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "12",
pages = "2088--2096",
month = dec,
year = "2011",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.05.027",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211001270",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Mizuki:2011:ASN,
author = "Takaaki Mizuki and Satoru Nakayama and Hideaki Sone",
title = "An Application of {ST}-Numbering to Secret Key
Agreement",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "1211--1227",
month = aug,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008659",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mohanty:2011:RTP,
author = "Saraju P. Mohanty and Elias Kougianos",
title = "Real-time perceptual watermarking architectures for
video broadcasting",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "5",
pages = "724--738",
month = may,
year = "2011",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Jun 21 10:22:28 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Mukhopadhyay:2011:PEA,
author = "Debdeep Mukhopadhyay and Dipanwita Roy Chowdhury",
title = "A Parallel Efficient Architecture for Large
Cryptographically Robust $ n \times k (k \geq n / 2) $
Mappings",
journal = j-IEEE-TRANS-COMPUT,
volume = "60",
number = "3",
pages = "375--385",
month = mar,
year = "2011",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2010.136",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Jun 29 10:26:18 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Nguyen:2011:APB,
author = "L. H. Nguyen and A. W. Roscoe",
title = "Authentication protocols based on low-bandwidth
unspoofable channels: A comparative survey",
journal = j-J-COMP-SECUR,
volume = "19",
number = "1",
pages = "139--201",
month = "????",
year = "2011",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2010-0403",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:24:58 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Nose:2011:SWA,
author = "Peter Nose",
title = "Security weaknesses of authenticated key agreement
protocols",
journal = j-INFO-PROC-LETT,
volume = "111",
number = "14",
pages = "687--696",
day = "31",
month = jul,
year = "2011",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2011.04.007",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Feb 4 08:08:39 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019011001074",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Obana:2011:AOC,
author = "Satoshi Obana",
title = "Almost Optimum $t$-Cheater Identifiable Secret Sharing
Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6632",
pages = "284--302",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-20465-4_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 17:44:03 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-20465-4_17",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Oggier:2011:ACA,
author = "Fr{\'e}d{\'e}rique Oggier and Hanane Fathi",
title = "An authentication code against pollution attacks in
network coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "19",
number = "6",
pages = "1587--1596",
month = dec,
year = "2011",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2126592",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:42:19 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Systems exploiting network coding to increase their
throughput suffer greatly from pollution attacks, which
consist of injecting malicious packets in the network.
The pollution attacks are amplified by the network
coding process, resulting in a greater damage than
under traditional routing. In this paper, we address
this issue by designing an unconditionally secure
authentication code (that is, which does not rely on
computational assumptions) suitable for multicast
network coding, where the keying material is initially
computed and distributed by a trusted authority to the
destinations and intermediate nodes. The proposed
scheme allows not only destinations, but also
intermediate nodes, to verify the integrity and origin
of the packets received without having to decode, and
thus detect and discard the malicious messages in
transit that fail the verification. This way, the
pollution is canceled out before reaching the
destinations. The proposed scheme is robust against
pollution attacks from outsiders, as well as coalitions
of malicious insider nodes, which have the ability to
perform the integrity check, but instead get corrupted
and use their knowledge to themselves attack the
network. We analyze the performance of the scheme in
terms of both throughput and goodput and show that the
price to pay for tolerating inside attackers is a high
decrease in throughput (it is inversely proportional to
the number of insider attackers that can collude). We
finally discuss applications to file distribution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Oligeri:2011:REA,
author = "Gabriele Oligeri and Stefano Chessa and Roberto {Di
Pietro} and Gaetano Giunta",
title = "Robust and efficient authentication of video stream
broadcasting",
journal = j-TISSEC,
volume = "14",
number = "1",
pages = "5:1--5:??",
month = may,
year = "2011",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1952982.1952987",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 2 07:27:23 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "We present a novel video stream authentication scheme
which combines signature amortization by means of hash
chains and an advanced watermarking technique. We
propose a new hash chain construction, the Duplex Hash
Chain, which allows us to achieve bit-by-bit
authentication that is robust to low bit error rates.
This construction is well suited for wireless broadcast
communications characterized by low packet losses such
as in satellite networks. Moreover, neither hardware
upgrades nor specific end-user equipment are needed to
enjoy the authentication services. The computation
overhead experienced on the receiver only sums to two
hashes per block of pictures and one digital signature
verification for the whole received stream.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Book{Oppliger:2011:CC,
author = "Rolf Oppliger",
title = "Contemporary cryptography",
publisher = pub-ARTECH,
address = pub-ARTECH:adr,
edition = "Second",
pages = "612 (est.)",
year = "2011",
ISBN = "1-60807-145-6",
ISBN-13 = "978-1-60807-145-6",
LCCN = "????",
bibdate = "Thu May 12 10:18:59 MDT 2011",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.artechhouse.com/Detail.aspx?strIsbn=978-1-60807-145-6",
acknowledgement = ack-nhfb,
tableofcontents = "Introduction \\
Cryptographic Systems \\
Unkeyed Cryptosystems One-Way Functions \\
Cryptographic Hash Functions \\
Random Bit Generators \\
Secret Key Cryptosystems Symmetric Encryption Systems
\\
Message Authentication Codes \\
Pseudo-Random Bit Generators \\
Pseudo-Random Functions \\
Public Key Cryptosystems Asymmetric Encryption Systems
\\
Digital Signature Systems \\
Key Establishment \\
Entity Authentication \\
Secure Multiparty Computation \\
Epilogue Key Management \\
Conclusions \\
Outlook \\
Appendixes Discrete Mathematics \\
Probability Theory \\
Information Theory \\
Complexity Theory \\
Abbreviations and Acronyms \\
Mathematical Notation \\
About the Author",
}
@Article{Ozen:2011:MIS,
author = "Mehmet {\"O}zen and Vedat {\c{S}}iap",
title = "The {MacWilliams} identity for $m$-spotty weight
enumerators of linear codes over finite fields",
journal = j-COMPUT-MATH-APPL,
volume = "61",
number = "4",
pages = "1000--1004",
month = feb,
year = "2011",
CODEN = "CMAPDK",
DOI = "https://doi.org/10.1016/j.camwa.2010.12.048",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
MRclass = "94B05",
MRnumber = "2770504",
bibdate = "Wed Mar 1 21:50:50 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122110009533",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Park:2011:ACC,
author = "Ki-Woong Park and Kyu Ho Park",
title = "{ACCENT}: Cognitive cryptography plugged compression
for {SSL\slash TLS-based} cloud computing services",
journal = j-TOIT,
volume = "11",
number = "2",
pages = "7:1--7:??",
month = dec,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2049656.2049659",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 15 09:10:08 MST 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Book{Pearson:2011:NWC,
editor = "Joss Pearson",
title = "{Neil Webster}'s cribs for victory: the untold story
of {Bletchley Park}'s secret room",
publisher = "Polperro Heritage",
address = "Clifton-upon-Teme, UK",
pages = "????",
year = "2011",
ISBN = "0-9559541-8-5 (paperback)",
ISBN-13 = "978-0-9559541-8-4 (paperback)",
LCCN = "????",
bibdate = "Mon Sep 3 18:01:22 MDT 2012",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptologia.bib",
acknowledgement = ack-nhfb,
subject = "Webster, Neil; World War, 1939-1945; Great Britain;
Electronic intelligence; Enigma cipher system; History;
Military intelligence; Bletchley Park (Milton Keynes,
England); 20th century",
}
@Article{Perez:2011:FDS,
author = "Alejandro P{\'e}rez and Gabriel L{\'o}pez and
{\'O}scar C{\'a}novas and Antonio F.
G{\'o}mez-Skarmeta",
title = "Formal description of the {SWIFT} identity management
framework",
journal = j-FUT-GEN-COMP-SYS,
volume = "27",
number = "8",
pages = "1113--1123",
month = oct,
year = "2011",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Aug 30 13:14:22 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Peterson:2011:SWS,
author = "Heather R. Peterson",
title = "The shape of the world: the story of {Spanish}
expansion and the secret science of cosmography",
journal = j-STUD-HIST-PHILOS-SCI,
volume = "42",
number = "1",
pages = "223--226",
month = mar,
year = "2011",
CODEN = "SHPSB5",
DOI = "https://doi.org/10.1016/j.shpsa.2010.11.012",
ISSN = "0039-3681 (print), 1879-2510 (electronic)",
ISSN-L = "0039-3681",
bibdate = "Mon Nov 7 12:12:03 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/shps-a.bib;
http://www.sciencedirect.com/science/journal/00393681",
URL = "http://www.sciencedirect.com/science/article/pii/S0039368110000919",
acknowledgement = ack-nhfb,
fjournal = "Studies in History and Philosophy of Science Part A",
journal-URL = "http://www.sciencedirect.com/science/journal/00393681",
}
@Misc{Prins:2011:DCA,
author = "{JR Prins} and {Business Unit Cybercrime}",
title = "DigiNotar certificate authority breach {``Operation
Black Tulip''}",
howpublished = "Unknown",
month = nov,
year = "2011",
bibdate = "Mon Mar 09 16:00:06 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "Fox-IT",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 63]{Schneier:2015:SWC}.",
}
@Article{Rawat:2011:CBR,
author = "Sanjay Rawat and Balasubramanian Raman",
title = "A Chaos-Based Robust Watermarking Algorithm for
Rightful Ownership Protection",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "11",
number = "4",
pages = "471--493",
month = oct,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467811004263",
ISSN = "0219-4678",
bibdate = "Wed Feb 8 18:48:57 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Reeder:2011:WPD,
author = "Robert W. Reeder and Stuart Schechter",
title = "When the Password Doesn't Work: Secondary
Authentication for Websites",
journal = j-IEEE-SEC-PRIV,
volume = "9",
number = "2",
pages = "43--49",
month = mar # "\slash " # apr,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2011.1",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Apr 1 22:34:08 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@InProceedings{Regev:2011:QOW,
author = "Oded Regev and Bo'az Klartag",
title = "Quantum one-way communication can be exponentially
stronger than classical communication",
crossref = "ACM:2011:PAI",
pages = "31--40",
year = "2011",
DOI = "https://doi.org/10.1145/1993636.1993642",
bibdate = "Tue Jun 7 18:53:27 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Article{Rifa-Pous:2011:CEC,
author = "Helena Rif{\`a}-Pous and Jordi
Herrera-Joancomart{\'\i}",
title = "Computational and Energy Costs of Cryptographic
Algorithms on Handheld Devices",
journal = j-FUTURE-INTERNET,
volume = "3",
number = "1",
pages = "31--48",
day = "14",
month = feb,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi3010031",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:46 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/3/1/31",
abstract = "Networks are evolving toward a ubiquitous model in
which heterogeneous devices are interconnected.
Cryptographic algorithms are required for developing
security solutions that protect network activity.
However, the computational and energy limitations of
network devices jeopardize the actual implementation of
such mechanisms. In this paper, we perform a wide
analysis on the expenses of launching symmetric and
asymmetric cryptographic algorithms, hash chain
functions, elliptic curves cryptography and pairing
based cryptography on personal agendas, and compare
them with the costs of basic operating system
functions. Results show that although cryptographic
power costs are high and such operations shall be
restricted in time, they are not the main limiting
factor of the autonomy of a device.",
acknowledgement = ack-nhfb,
remark = "Special Issue The Internet of Things.",
}
@Article{Robert-Inacio:2011:SAP,
author = "Fr{\'e}d{\'e}rique Robert-Inacio and Alain Tr{\'e}meau
and Mike Fournigault and Yannick Teglia and Pierre-Yvan
Liardet",
title = "Shape analysis for power signal cryptanalysis on
secure components",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "5",
pages = "753--762",
month = may,
year = "2011",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Jun 21 10:22:28 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Romero:2011:FSW,
author = "J. J. Romero",
title = "Fast start for world's biggest biometrics {ID}
project",
journal = j-IEEE-SPECTRUM,
volume = "48",
number = "5",
pages = "11--12",
month = may,
year = "2011",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2011.5753227",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Fri Jan 17 18:54:05 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Biometrics; biometrics (access control); biometrics ID
project; Databases; Government policies; ID cards;
Identification of persons; India; legal documents;
legal identity; public administration",
}
@TechReport{Rose:2011:KBT,
author = "Greg Rose",
title = "{KISS}: a Bit Too Simple",
type = "Report",
number = "??",
institution = "Qualcomm Inc.",
address = "San Diego, CA, USA",
day = "18",
month = apr,
year = "2011",
bibdate = "Wed Jun 22 08:40:22 2011",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://eprint.iacr.org/2011/007.pdf",
abstract = "KISS (`Keep it Simple Stupid') is an efficient
pseudo-random number generator originally specified by
G. Marsaglia and A. Zaman in 1993. G. Marsaglia in 1998
posted a C version to various USENET newsgroups,
including sci.crypt. Marsaglia himself has never
claimed cryptographic security for the KISS generator,
but others have made the intellectual leap and claimed
that it is of cryptographic quality. In this paper we
show a number of reasons why the generator does not
meet some of the KISS authors' claims, why it is not
suitable for use as a stream cipher, and that it is not
cryptographically secure. Our best attack requires
about 70 words of generated output and a few hours of
computation to recover the initial state. In early
2011, G. Marsaglia posted a new version of KISS, which
falls to a simple divide-and-conquer attack.",
acknowledgement = ack-nhfb,
xxnumber = "??",
}
@Article{Sabri:2011:AFS,
author = "Khair Eddin Sabri and Ridha Khedri",
title = "Algebraic Framework for the Specification and Analysis
of Cryptographic-Key Distribution",
journal = j-FUND-INFO,
volume = "112",
number = "4",
pages = "305--335",
month = dec,
year = "2011",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2011-592",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:14:15 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Safavi-Naini:2011:USC,
author = "Reihaneh Safavi-Naini and Shaoquan Jiang",
title = "Unconditionally Secure Conference Key Distribution:
Security Notions, Bounds and Constructions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1369--1393",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008763",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@InProceedings{Salmon:2011:PRN,
author = "John K. Salmon and Mark A. Moraes and Ron O. Dror and
David E. Shaw",
title = "Parallel random numbers: as easy as $ 1, 2, 3 $",
crossref = "Lathrop:2011:SPI",
pages = "16:1--16:12",
year = "2011",
DOI = "https://doi.org/10.1145/2063384.2063405",
bibdate = "Fri Dec 16 11:05:47 MST 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jstatsoft.bib;
https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/supercomputing2011.bib;
https://www.math.utah.edu/pub/tex/bib/tomacs.bib",
abstract = "Most pseudorandom number generators (PRNGs) scale
poorly to massively parallel high-performance
computation because they are designed as sequentially
dependent state transformations. We demonstrate that
independent, keyed transformations of counters produce
a large alternative class of PRNGs with excellent
statistical properties (long period, no discernable
structure or correlation). These counter-based PRNGs
are ideally suited to modern multicore CPUs, GPUs,
clusters, and special-purpose hardware because they
vectorize and parallelize well, and require little or
no memory for state. We introduce several counter-based
PRNGs: some based on cryptographic standards (AES,
Threefish) and some completely new (Philox). All our
PRNGs pass rigorous statistical tests (including
TestU01's BigCrush) and produce at least 264 unique
parallel streams of random numbers, each with period
2128 or more. In addition to essentially unlimited
parallel scalability, our PRNGs offer excellent
single-chip performance: Philox is faster than the
CURAND library on a single NVIDIA GPU.",
acknowledgement = ack-nhfb,
articleno = "16",
remark-1 = "From the article, page 3: ``The period of any useful
PRNG must be sufficiently long that the state space of
the PRNG will not be exhausted by any application, even
if run on large parallel machines for long periods of
time. One million cores, generating 10 billion random
numbers per second, will take about half an hour to
generate $2^{64}$ random numbers, which raises doubts
about the long-term viability of a single,
unpararameterized PRNG with a periods of `only'
$2^{64}$. On the other hand, exhausting the state space
of a multistreamable family of $2^{32}$ such
generators, or a single generator with a period of
$2^{128}$, is far beyond the capability of any
technology remotely like that in current computers.''",
remark-2 = "From the article, page 5: ``only a few conventional
PRNGs pass even one complete battery of Crush tests.
The multiple recursive generators, the multiplicative
lagged Fibonacci generators, and some combination
generators are reported to do so. On the other hand,
many of the most widely used PRNGs fail quite
dramatically, including all of the linear congruential
generators, such as drand48() and the C-language
rand(). The linear and general feedback shift register
generators, including the Mersenne Twister, always fail
the tests of linear dependence, and some fail many
more.''",
remark-3 = "This article has a good discussion of the issues of
parallel random-number generation. The authors note
that large internal state (e.g., the Mersenne Twister
needs 2496 bytes) is impractical with a million cores,
or with GPUs that require awkward memory transfers
between GPU and CPU memory. They propose methods that
require little state, and are based on cryptographic
algorithms. They point out that a generator based on
the Advanced Encryption Standard with Intel AES-NI
hardware support becomes competitive with other
generators. The comparative Table 2 on page 8 shows
that the Threefish, Threefry, and Philox generators
require only 0.7 to 4.3 cycles per byte.",
}
@Article{Sarkar:2011:TES,
author = "Palash Sarkar",
title = "Tweakable enciphering schemes using only the
encryption function of a block cipher",
journal = j-INFO-PROC-LETT,
volume = "111",
number = "19",
pages = "945--955",
day = "15",
month = oct,
year = "2011",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2011.06.014",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Feb 4 08:08:40 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019011001852",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Schwartz:2011:IMP,
author = "Ari Schwartz",
title = "Identity management and privacy: a rare opportunity to
get it right",
journal = j-CACM,
volume = "54",
number = "6",
pages = "22--24",
month = jun,
year = "2011",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1953122.1953134",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed Jun 1 18:12:20 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@InProceedings{Seyedzadeh:2011:IEA,
author = "Seyed Mohammad Seyedzadeh and Yasaman Hashemi",
booktitle = "{2011 11th International Conference on Intelligent
Systems Design and Applications (ISDA)}",
title = "Image encryption algorithm based on {Choquet Fuzzy
Integral} with self-adaptive pseudo-random number
generator",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "642--647",
year = "2011",
DOI = "https://doi.org/10.1109/ISDA.2011.6121728",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6121728",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6112291",
}
@InProceedings{Seyedzadeh:2011:IES,
author = "S. M. Seyedzadeh and S. Mirzakuchaki",
booktitle = "{2011 International Symposium on Artificial
Intelligence and Signal Processing (AISP)}",
title = "Image encryption scheme based on {Choquet} fuzzy
integral with pseudo-random keystream generator",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "101--106",
year = "2011",
DOI = "https://doi.org/10.1109/AISP.2011.5960982",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5960982",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5955054",
}
@InProceedings{Shaolan:2011:EDE,
author = "Zhang Shaolan and Xing Guobo and Yang Yixian",
title = "An Efficient Domain Extension to Construct a
Cryptographic Hash Function",
crossref = "IEEE:2011:ICI",
volume = "2",
pages = "424--427",
month = mar,
year = "2011",
DOI = "https://doi.org/10.1109/ICICTA.2011.390",
bibdate = "Fri Mar 13 09:17:57 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
keywords = "collision resistance; collision resistance preserving;
Computer science; cryptographic hash function;
Cryptography; cryptography; Encoding; encoding; hash
functions; Merkle--Damgaard transform; Merkle-Damgaard;
prefix free encoding; pseudorandom function;
pseudorandom oracle preserving property; Radio
frequency; random oracle; Resistance; Transforms",
}
@Article{Shim:2011:SAT,
author = "K.-A. Shim",
title = "Security Analysis of Three Password Authentication
Schemes",
journal = j-J-UCS,
volume = "17",
number = "11",
pages = "1623--??",
month = "????",
year = "2011",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Fri Apr 6 05:52:31 MDT 2012",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.jucs.org/jucs_17_11/security_analysis_of_three",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Smith:2011:RBA,
author = "Sean W. Smith",
title = "Room at the Bottom: Authenticated Encryption on Slow
Legacy Networks",
journal = j-IEEE-SEC-PRIV,
volume = "9",
number = "4",
pages = "60--63",
month = jul # "\slash " # aug,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2011.89",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Nov 16 15:22:23 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Smith:2011:SMC,
author = "Matthew Smith and Christian Schridde and Bj{\"o}rn
Agel and Bernd Freisleben",
title = "Secure mobile communication via identity-based
cryptography and server-aided computations",
journal = j-J-SUPERCOMPUTING,
volume = "55",
number = "2",
pages = "284--306",
month = feb,
year = "2011",
CODEN = "JOSUED",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Tue Sep 6 21:50:38 MDT 2011",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=55&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=55&issue=2&spage=284",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Book{Smith:2011:SSX,
author = "Michael Smith",
title = "The secrets of {Station X}: how the {Bletchley Park}
codebreakers helped win the war",
publisher = "Biteback Pub.",
address = "London, UK",
pages = "328 + 16",
year = "2011",
ISBN = "1-84954-095-0 (paperback)",
ISBN-13 = "978-1-84954-095-7 (paperback)",
LCCN = "D810.C88 S659 2011",
bibdate = "Mon Sep 3 17:53:01 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Military intelligence; Great Britain; History; 20th
century; World War, 1939-1945; Cryptography; Bletchley
(Buckinghamshire, England)",
}
@Article{Sood:2011:SDI,
author = "Sandeep K. Sood and Anil K. Sarje and Kuldip Singh",
title = "A secure dynamic identity based authentication
protocol for multi-server architecture",
journal = j-J-NETW-COMPUT-APPL,
volume = "34",
number = "2",
pages = "609--618",
month = mar,
year = "2011",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:52 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804510002092",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Srivatsa:2011:ESA,
author = "Mudhakar Srivatsa and Ling Liu and Arun Iyengar",
title = "{EventGuard}: a System Architecture for Securing
Publish--Subscribe Networks",
journal = j-TOCS,
volume = "29",
number = "4",
pages = "10:1--10:??",
month = dec,
year = "2011",
CODEN = "ACSYEC",
DOI = "https://doi.org/10.1145/2063509.2063510",
ISSN = "0734-2071 (print), 1557-7333 (electronic)",
ISSN-L = "0734-2071",
bibdate = "Fri Dec 30 17:52:02 MST 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/tocs/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tocs.bib",
abstract = "Publish-subscribe (pub-sub) is an emerging paradigm
for building a large number of distributed systems. A
wide area pub-sub system is usually implemented on an
overlay network infrastructure to enable information
dissemination from publishers to subscribers. Using an
open overlay network raises several security concerns
such as: confidentiality and integrity, authentication,
authorization and Denial-of-Service (DoS) attacks. In
this article we present EventGuard, a framework for
building secure wide-area pub-sub systems. The
EventGuard architecture is comprised of three key
components: (1) a suite of security guards that can be
seamlessly plugged-into a content-based pub-sub system,
(2) a scalable key management algorithm to enforce
access control on subscribers, and (3) a resilient
pub-sub network design that is capable of scalable
routing, handling message dropping-based DoS attacks,
and node failures.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Computer Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J774",
}
@Article{Stallings:2011:C,
author = "William Stallings",
title = "Ciphers",
journal = j-WIRES,
volume = "3",
number = "5",
pages = "239--250",
month = may # "\slash " # jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1002/wics.156",
ISSN = "1939-0068 (print), 1939-5108 (electronic)",
ISSN-L = "1939-0068",
bibdate = "Fri Jun 19 13:52:59 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/wires.bib",
acknowledgement = ack-nhfb,
ajournal = "WIREs",
fjournal = "WIREs Computational Statistics",
journal-URL = "https://onlinelibrary.wiley.com/journal/19390068",
onlinedate = "08 March 2011",
}
@Book{Stallings:2011:CNS,
author = "William Stallings",
title = "Cryptography and network security: principles and
practice",
publisher = pub-PH,
address = pub-PH:adr,
edition = "Fifth",
pages = "xxiii + 719",
year = "2011",
ISBN = "0-13-609704-9",
ISBN-13 = "978-0-13-609704-4",
LCCN = "TK5105.59 .S713 2011",
bibdate = "Mon Jan 10 17:41:35 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computer networks; Security measures; Data encryption
(Computer science); Coding theory; Computer security",
}
@Book{Stanoyevitch:2011:ICM,
author = "Alexander Stanoyevitch",
title = "Introduction to cryptography with mathematical
foundations and computer implementations",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
pages = "xix + 649",
year = "2011",
ISBN = "1-4398-1763-4 (hardcover)",
ISBN-13 = "978-1-4398-1763-6 (hardcover)",
LCCN = "QA268 .S693 2011",
bibdate = "Sun Feb 3 11:39:29 MST 2013",
bibsource = "cat.libraries.psu.edu:2200/Unicorn;
https://www.math.utah.edu/pub/tex/bib/adabooks.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Discrete mathematics and its applications",
acknowledgement = ack-nhfb,
subject = "Coding theory; Cryptography; Data processing;
Mathematics; Data encryption (Computer science)",
tableofcontents = "1. An Overview of the Subject \\
Basic Concepts \\
Functions \\
One-to-One and Onto Functions, Bijections \\
Inverse Functions \\
Substitution Ciphers \\
Attacks on Cryptosystems \\
The Vigenere Cipher \\
The Playfair Cipher \\
The One-Time Pad, Perfect Secrecy \\
Chapter 1. Exercises \\
Chapter 1. Computer Implementations and Exercises \\
Vector/String Conversions \\
Integer/Text Conversions \\
Programming Basic Ciphers with Integer Arithmetic \\
Computer-Generated Random Numbers \\
2. Divisibility and Modular Arithmetic \\
Divisibility \\
Primes \\
Greatest Common Divisors and Relatively Prime Integers
\\
The Division Algorithm \\
The Euclidean Algorithm \\
Modular Arithmetic and Congruences \\
Modular Integer Systems \\
Modular Inverses \\
Extended Euclidean Algorithm \\
Solving Linear Congruences \\
Summary of Procedure for Solving the Single Linear
Congruence (Equation 2.2) \\
The Chinese Remainder Theorem \\
Chapter 2. Exercises \\
Chapter 2. Computer Implementations and Exercises \\
3. The Evolution of Codemaking until the Computer Era
\\
Ancient Codes \\
Formal Definition of a Cryptosystem \\
Affine Ciphers \\
Steganography \\
Nulls \\
Homophones \\
Composition of Functions \\
Tabular Form Notation for Permutations \\
The Enigma Machines \\
Cycles (Cyclic Permutations) \\
Dissection of the Enigma Machine into Permutations \\
Special Properties of All Enigma Machines \\
Chapter 3. Exercises \\
Chapter 3. Computer Implementations and Exercises \\
Computer Representations of Permutations \\
4. Matrices and the Hill Cryptosystem \\
The Anatomy of a Matrix \\
Matrix Addition, Subtraction, and Scalar Multiplication
\\
Matrix Multiplication \\
Preview of the Fact That Matrix Multiplication is
Associative \\
Matrix Arithmetic \\
Definition of an Invertible (Square) Matrix \\
The Determinant of a Square Matrix \\
Inverses of 2 and times; 2 Matrices \\
The Transpose of a Matrix \\
Modular Integer Matrices \\
The Classical Adjoint (for Matrix Inversions) \\
The Hill Cryptosystem \\
Chapter 4. Exercises \\
Chapter 4. Computer Implementations and Exercises \\
5. The Evolution of Codebreaking until the Computer Era
\\
Frequency Analysis Attacks \\
The Demise of the Vigenere Cipher \\
The Babbage/Kasiski Attack \\
The Fridman Attack \\
The Index of Coincidence \\
Expected Values of the Index of Coincidence \\
How Enigmas Were Attacked \\
German Usage Protocols for Enigmas \\
The Polish Codebreakers \\
Rejewski's Attack \\
Invariance of Cycle Decomposition Form \\
Alan Turing and Bletchley Park \\
Chapter 5. Exercises \\
Chapter 5. Computer Implementations and Exercises \\
Programs to Aid in Frequency Analysis \\
Programs to Aid in the Babbage/Kasiski Attack \\
Programs Related to the Friedman Attack \\
6. Representation and Arithmetic of Integers in
Different Bases \\
Representation of Integers in Different Bases \\
Hex(adecimal) and Binary Expansions \\
Addition Algorithm with Base b Expansions \\
Subtraction Algorithm in Base b Expansions \\
Multiplication Algorithm in Base b Expansions \\
Arithmetic with Large Integers \\
Fast Modular Exponentiation \\
Chapter 6. Exercises \\
Chapter 6. Computer Implementations and Exercises \\
7. Block Cryptosystems and the Data Encryption Standard
(DES) \\
The Evolution of Computers into Cryptosystems \\
DES is Adopted to Fulfill an Important Need \\
The XOR Operation \\
Feistel Cryptosystems \\
A Scaled-Down Version of DES \\
DES \\
The Fall of DES \\
Triple DES \\
Modes of Operation for Block Cryptosystems \\
Electronic Codebook (ECB) Mode \\
Cipherblock Chaining (CBC) Mode \\
Cipher Feedback (CFB) Mode \\
Output Feedback (OFB) Mode \\
Chapter 7. Exercises \\
Chapter 7. Computer Implementations and Exercises \\
8. Some Number Theory and Algorithms \\
The Prime Number Theorem \\
Fermat's Little Theorem \\
The Euler Phi Function \\
Euler's Theorem \\
Modular Orders of Invertible Modular Integers \\
Primitive Roots \\
Existence of Primitive Roots \\
Determination of Primitive Roots \\
Order of Powers Formula \\
Prime Number Generation \\
Fermat's Primality Test \\
Carmichael Numbers \\
The Miller-Rabin Test \\
The Miller-Rabin Test with a Factoring Enhancement \\
The Pollard p - 1 Factoring Algorithm \\
Chapter 8. Exercises \\
Chapter 8. Computer Implementations and Exercises \\
9. Public Key Cryptography \\
An Informal Analogy for a Public Key Cryptosystem \\
The Quest for Secure Electronic Key Exchange \\
One-Way Functions \\
Review of the Discrete Logarithm Problem \\
The Diffie-Hellman Key Exchange \\
The Quest for a Complete Public Key Cryptosystem \\
The RSA Cryptosystem \\
Digital Signatures and Authentication \\
The EIGamal Cryptosystem \\
Digital Signatures with EIGamal \\
Knapsack Problems \\
The Merkle-Hellman Knapsack Cryptosystem \\
Government Controls on Cryptography \\
A Security Guarantee for RSA \\
Chapter 9. Exercises \\
Chapter 9. Computer Implementations and Exercises \\
10. Finite Fields in General, and GF(28) in Particular
\\
Binary Operations \\
Rings \\
Fields \\
Zp[X] = the Polynomials with Coefficients in Zp \\
Addition and Multiplication of Polynomials in Zp[X] \\
Vector Representation of Polynomials \\
Zp[X] is a Ring \\
Divisibility in Zp[X] \\
The Division Algorithm for Zp[X] \\
Congruences in Zp[X] Modulo a Fixed Polynomial \\
Building Finite Fields from Zp[X] \\
The Fields GF(24) and GF(28) \\
The Euclidean Algorithm for Polynomials \\
Chapter 10. Exercises \\
Chapter 10. Computer Implementations and Exercises \\
11. The Advanced Encryption Standard (AES) Protocol \\
An Open Call for a Replacement to DES \\
Nibbles \\
A Scaled-Down Version of AES \\
Decryption in the Scaled-Down Version of AES \\
AES \\
Byte Representation and Arithmetic \\
The AES Encryption Algorithm \\
The AES Decryption Algorithm \\
Security of the AES \\
Chapter 11. Exercises \\
Chapter 11. Computer Implementations and Exercises \\
12. Elliptic Curve Cryptography \\
Elliptic Curves over the Real Numbers \\
The Addition Operation for Elliptic Curves \\
Groups \\
Elliptic Curves over Zp \\
The Variety of Sizes of Modular Elliptic Curves \\
The Addition Operation for Elliptic Curves over Zp \\
The Discrete Logarithm Problem on Modular Elliptic
Curves \\
An Elliptic Curve Version of the Diffie-Hellman Key
Exchange \\
Fast Integer Multiplication of Points on Modular
Elliptic Curves \\
Representing Plaintexts on Modular Elliptic Curves \\
An Elliptic Curve Version of the EIGamal Cryptosystem
\\
A Factoring Algorithm Based on Elliptic Curves \\
Chapter 12. Exercises \\
Chapter 12. Computer Implementations and Exercises \\
Appendices \\
Appendix A. Sets and Basic Counting Principles \\
Concepts and Notations for Sets \\
Two Basic Counting Principles \\
Appendix B. Randomness and Probability \\
Probability Terminology and Axioms \\
Conditional Probability \\
Conditioning and Bayes' Formula \\
Random Variables \\
Appendix C. Solutions to All Exercises for the Reader
\\
Chapter 1. An Overview of the Subject \\
Chapter 2. Divisibility and Modular Arithmetic \\
Chapter 3. The Evolution of Codemaking until the
Computer Era \\
Chapter 4. Matrices and the Hill Cryptosystem \\
Chapter 5. The Evolution of Codebreaking until the
Computer Era \\
Chapter 6. Representation and Arithmetic of Integers in
Different Bases \\
Chapter 7. Block Cryptosystems and the Data Encryption
Standard (DES) \\
Chapter 8. Some Number Theory and Algorithms \\
Chapter 9. Public Key Cryptography \\
Chapter 10. Finite Fields in General, and GF(28) in
Particular \\
Chapter 11. The Advanced Encryption Standard (AES)
Protocol \\
Chapter 12. Elliptic Curve Cryptography \\
Appendix D. Answers and Brief Solutions to Selected
Odd-Numbered Exercises \\
Chapter 1 \\
Chapter 2 \\
Chapter 3 \\
Chapter 4 \\
Chapter 5 \\
Chapter 6 \\
Chapter 7 \\
Chapter 8 \\
Chapter 9 \\
Chapter 10 \\
Chapter 11 \\
Chapter 12 \\
Appendix E. Suggestions for Further Reading \\
Synopsis \\
History of Cryptography \\
Mathematical Foundations \\
Computer Implementations \\
Elliptic Curves \\
Additional Topics in Cryptography",
}
@Book{Stewart:2011:CCI,
author = "James Michael Stewart and Ed Tittel and Mike Chapple",
title = "{CISSP}: Certified Information Systems Security
Professional Study Guide",
publisher = pub-WILEY,
address = pub-WILEY:adr,
edition = "Fifth",
pages = "????",
year = "2011",
ISBN = "0-470-94498-6",
ISBN-13 = "978-0-470-94498-1",
LCCN = "QA76.3 .T5735 2011",
bibdate = "Mon Jan 10 18:23:52 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://catalogimages.wiley.com/images/db/jimages/9780470944981.jpg",
abstract = "This comprehensive book will guide readers through
CISSP exam topics, including: Access Control
Application Development, Security Business Continuity
and Disaster Recovery Planning, Cryptography
Information Security Governance and Risk Management,
Legal, Regulations, Investigations and Compliance
Operations Security, Physical (Environmental) Security,
Security Architecture and Design, Telecommunications
and Network Security. This study guide will be complete
with 100\% coverage of the exam objectives, real world
scenarios, hands-on exercises, and challenging review
questions, both in the book and on the CD.",
acknowledgement = ack-nhfb,
subject = "Electronic data processing personnel; Certification;
Computer networks; Examinations; Study guides; Computer
security; COMPUTERS / Certification Guides / General",
tableofcontents = "1 Accountability and Access Control \\
2 Attacks and Monitoring \\
3 ISO Model, Protocols, Network Security, and Network
Infrastructure \\
4 Communications Security and Countermeasures \\
5 Security Management Concepts and Principles \\
6 Asset Value, Policies, and Roles \\
7 Data and Application Security Issues \\
8 Malicious Code and Application Attacks \\
9 Cryptography and Private Key Algorithms \\
10 PKI and Cryptographic Applications \\
11 Principles of Computer Design \\
12 Principles of Security Models \\
13 Administrative Management \\
14 Auditing and Monitoring \\
15 Business Continuity Planning \\
16 Disaster Recovery Planning \\
17 Law and Investigations \\
18 Incidents and Ethics \\
19 Physical Security Requirements",
}
@InProceedings{Stipcevic:2011:QRN,
author = "M. Stipcevic",
booktitle = "{2011 Proceedings of the 34th International Convention
MIPRO}",
title = "Quantum random number generators and their use in
cryptography",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "1474--1479",
year = "2011",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5967293",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5945021",
}
@Article{Sung:2011:DCE,
author = "Jaechul Sung",
title = "Differential cryptanalysis of eight-round {SEED}",
journal = j-INFO-PROC-LETT,
volume = "111",
number = "10",
pages = "474--478",
day = "30",
month = apr,
year = "2011",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 12:47:00 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Szaban:2011:IQB,
author = "Miroslaw Szaban and Franciszek Seredynski",
title = "Improving quality of {DES} {S}-boxes by cellular
automata-based {S}-boxes",
journal = j-J-SUPERCOMPUTING,
volume = "57",
number = "2",
pages = "216--226",
month = aug,
year = "2011",
CODEN = "JOSUED",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Tue Sep 6 21:51:16 MDT 2011",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=57&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=57&issue=2&spage=216",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Tan:2011:CTA,
author = "Zuowen Tan",
title = "Comments on a Threshold Authenticated Encryption
Scheme",
journal = j-INT-J-COMPUT-APPL,
volume = "33",
number = "2",
pages = "132--136",
year = "2011",
DOI = "https://doi.org/10.2316/Journal.202.2011.2.202-2858",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:27:14 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2011.2.202-2858",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Tang:2011:IDC,
author = "Xuehai Tang and Bing Sun and Ruilin Li and Chao Li",
title = "Impossible differential cryptanalysis of 13-round
{CLEFIA-128}",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "7",
pages = "1191--1196",
month = jul,
year = "2011",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Jun 21 10:22:31 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Tartary:2011:EIT,
author = "Christophe Tartary and Huaxiong Wang and Yun Zhang",
title = "An Efficient and Information Theoretically Secure
Rational Secret Sharing Scheme Based on Symmetric
Bivariate Polynomials",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1395--1416",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008775",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Taylor:2011:CAS,
author = "Ken Taylor and Scott Rickard and Konstantinos
Drakakis",
title = "{Costas} Arrays: Survey, Standardization, and {MATLAB}
Toolbox",
journal = j-TOMS,
volume = "37",
number = "4",
pages = "41:1--41:31",
month = feb,
year = "2011",
CODEN = "ACMSCU",
DOI = "https://doi.org/10.1145/1916461.1916465",
ISSN = "0098-3500 (print), 1557-7295 (electronic)",
ISSN-L = "0098-3500",
bibdate = "Tue Mar 1 16:05:18 MST 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toms/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toms.bib",
abstract = "A Costas array is an arrangement of N dots on an
N-by-N grid, one per row, one per column, such that no
two dots share the same displacement vector with any
other pair. Costas arrays have applications in
SONAR\slash RADAR systems, communication systems,
cryptography, and other areas. We present a
standardization of notation and language which can be
used to discuss Costas array generation techniques and
array manipulations. Using this standardization we can
concisely and clearly state various theorems about
Costas arrays, including several new theorems about the
symmetries of Costas arrays. We also define labels for
each array (generated, emergent, and sporadic), which
describe whether the array is generated using a known
technique, generated using a semiempirical variation of
a known technique, or of unexplained origin.",
acknowledgement = ack-nhfb,
articleno = "41",
fjournal = "ACM Transactions on Mathematical Software (TOMS)",
journal-URL = "http://dl.acm.org/pub.cfm?id=J782",
}
@Article{Taylor:2011:DR,
author = "Greg Taylor and George Cox",
title = "Digital randomness",
journal = j-IEEE-SPECTRUM,
volume = "48",
number = "9",
pages = "32--58",
month = sep,
year = "2011",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2011.5995897",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Thu Sep 01 15:46:04 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://spectrum.ieee.org/semiconductors/processors/behind-intels-new-randomnumber-generator/",
abstract = "Imagine that it's 1995 and you're about to make your
very first online purchase. You open your Netscape
browser, sipping coffee as the home page slowly loads.
You then navigate to Amazon.com, a new online bookstore
your friend told you about. As you proceed to make your
purchase and enter your payment information, the
address your browser points to changes from one
starting with ``http'' to one that begins with
``https.'' That signals that your computer has
established an encrypted connection with Amazon's
server. This allows you to send credit card information
to the server without worrying that an identity thief
will intercept the transmission.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
onlinedate = "22 August 2011",
remark = "Issue cover story.",
}
@Article{Terai:2011:BRB,
author = "Saif Terai",
title = "Book Review: {{\booktitle{Foundations of Logic and
Mathematics Applications to Computer Science and
Cryptography}}, by Yves Nievergelt}",
journal = j-SIGACT,
volume = "42",
number = "4",
pages = "17--21",
month = dec,
year = "2011",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2078162.2078165",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Mar 20 14:39:02 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Nievergelt:2002:FLM}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Terrovitis:2011:LGR,
author = "Manolis Terrovitis and Nikos Mamoulis and Panos
Kalnis",
title = "Local and global recoding methods for anonymizing
set-valued data",
journal = j-VLDB-J,
volume = "20",
number = "1",
pages = "83--106",
month = feb,
year = "2011",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-010-0192-8",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Mon Feb 7 10:43:36 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "In this paper, we study the problem of protecting
privacy in the publication of set-valued data. Consider
a collection of supermarket transactions that contains
detailed information about items bought together by
individuals. Even after removing all personal
characteristics of the buyer, which can serve as links
to his identity, the publication of such data is still
subject to privacy attacks from adversaries who have
partial knowledge about the set. Unlike most previous
works, we do not distinguish data as sensitive and
non-sensitive, but we consider them both as potential
quasi-identifiers and potential sensitive data,
depending on the knowledge of the adversary.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
}
@Article{Ulutas:2011:MIS,
author = "Mustafa Ulutas and G{\"u}zin Ulutas and Vasif V.
Nabiyev",
title = "Medical image security and {EPR} hiding using
{Shamir}'s secret sharing scheme",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "3",
pages = "341--353",
month = mar,
year = "2011",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Jun 21 10:22:26 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Vaikuntanathan:2011:CBN,
author = "V. Vaikuntanathan",
title = "Computing Blindfolded: New Developments in Fully
Homomorphic Encryption",
crossref = "IEEE:2011:PIA",
pages = "5--16",
year = "2011",
DOI = "https://doi.org/10.1109/FOCS.2011.98",
bibdate = "Thu Apr 12 09:34:22 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/focs2010.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6108120",
}
@Article{Vembuselvi:2011:LLL,
author = "C. Vembuselvi and S. Selvakumar",
title = "{LISISAP}: link level signature based secure anonymous
protocol for prevention of traffic analysis attacks",
journal = j-SIGSOFT,
volume = "36",
number = "2",
pages = "1--10",
month = mar,
year = "2011",
CODEN = "SFENDP",
DOI = "https://doi.org/10.1145/1943371.1943392",
ISSN = "0163-5948 (print), 1943-5843 (electronic)",
ISSN-L = "0163-5948",
bibdate = "Wed Aug 1 17:16:00 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsoft2010.bib",
abstract = "For any communication (wired or wireless) such as
control and data, the identity of source and
destination is revealed in the header portion of the
packet. Adversaries obtain sensitive information such
as the identity, location of a critical node, route,
data, etc., during communication by using traffic
analysis attacks, viz., similarity attack, data
integrity attack, packet counting attack, latency
attack, and clogging attack. Anonymous communication
prevents adversaries from doing traffic analysis
against the routing information embedded in the routing
messages and data packets. In order to thwart such
traffic analysis, anonymous communication protocols
were developed. In this paper, the existing anonymous
communication protocols were analyzed in terms of
techniques used, challenges, and applications.
Anonymous Routing protocol with Multiple Routes (ARMR)
is one of the existing protocols that achieves better
route anonymity using fake routes and multiple paths.
However, in ARMR, adversaries can modify the data with
genuine user pseudonyms and send the modified data to
the destination. In order to prevent data modification
by adversary at link level, in this paper a Link level
SIgnature based Secure Anonymous Protocol (LISISAP)
protocol is proposed. In LISISAP, source node generates
a signature for the data and sends the signature along
with the encrypted data to the next node. Further, the
next node verifies the signature. If signature matches,
it generates its own signature and sends the encrypted
data to its next node. Otherwise, it discards the
packet. Verified data and signature are sent by each
intermediate node until it reaches the destination. In
LISISAP, even if adversaries modify the data, every
node in the route including the destination node
verifies the data and discards the data if there is no
match in the signature. Similarity attacks can be
prevented by making the data look different on each hop
which could be achieved by encrypting the data with
link key. Proposed protocol, LISISAP is implemented and
tested in Smart and Secure Network. From the
experimental results, it is evident that the data
generated by source node is sent anonymously to the
destination. Thus, in LISISAP protocol, communication
is secure between nodes without revealing the node
identities. Anonymous properties such as identity
privacy, location privacy, route anonymity, and
robustness against several attacks were achieved.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGSOFT Software Engineering Notes",
journal-URL = "https://dl.acm.org/citation.cfm?id=J728",
}
@Article{Wang:2011:CHI,
author = "Xu An Wang and Jian Weng and Xiaoyuan Yang and Minqing
Zhang",
title = "Cryptanalysis of an (hierarchical) identity based
parallel key-insulated encryption scheme",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "2",
pages = "219--225",
month = feb,
year = "2011",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Jun 21 10:22:24 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Wang:2011:CIB,
author = "Xu An Wang and Jian Weng and Xiaoyuan Yang and
Yanjiang Yang",
title = "Cryptanalysis of an identity based broadcast
encryption scheme without random oracles",
journal = j-INFO-PROC-LETT,
volume = "111",
number = "10",
pages = "461--464",
day = "30",
month = apr,
year = "2011",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 12:47:00 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Wang:2011:HAB,
author = "Guojun Wang and Qin Liu and Jie Wu and Minyi Guo",
title = "Hierarchical attribute-based encryption and scalable
user revocation for sharing data in cloud servers",
journal = j-COMPUT-SECUR,
volume = "30",
number = "5",
pages = "320--331",
month = jul,
year = "2011",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:24 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404811000678",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Wang:2011:MMW,
author = "Yini Wang and Sheng Wen and Silvio Cesare and Wanlei
Zhou and Yang Xiang",
title = "The Microcosmic Model of Worm Propagation",
journal = j-COMP-J,
volume = "54",
number = "10",
pages = "1700--1720",
month = oct,
year = "2011",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr082",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Oct 1 18:10:35 MDT 2011",
bibsource = "http://comjnl.oxfordjournals.org/content/54/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/54/10/1700.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 19, 2011",
}
@Article{Wang:2011:RBM,
author = "Kai Wang and Guillaume Lavou{\'e} and Florence Denis
and Atilla Baskurt",
title = "Robust and blind mesh watermarking based on volume
moments",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "35",
number = "1",
pages = "1--19",
month = feb,
year = "2011",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/j.cag.2010.09.010",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Mon Feb 13 16:42:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00978493",
URL = "http://www.sciencedirect.com/science/article/pii/S0097849310001433",
acknowledgement = ack-nhfb,
fjournal = "Computers and Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@Article{Wang:2011:RDA,
author = "Xiang-yang Wang and Pan-pan Niu and Ming-yu Lu",
title = "A robust digital audio watermarking scheme using
wavelet moment invariance",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "8",
pages = "1408--1421",
month = aug,
year = "2011",
CODEN = "JSSODM",
ISSN = "0164-1212",
ISSN-L = "0164-1212",
bibdate = "Tue Jun 21 10:22:32 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Ward:2011:CCM,
author = "Mark Ward",
title = "Code-cracking machine returned to life",
journal = "BBC News",
day = "27",
month = may,
year = "2011",
bibdate = "Fri May 27 12:26:57 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.bbc.co.uk/news/technology-13566878",
abstract = "The National Museum of Computing has finished
restoring a Tunny machine --- a key part of Allied
code-cracking during World War II.\par
Tunny machines helped to unscramble Allied
interceptions of the encrypted orders Hitler sent to
his generals.\par
The rebuild was completed even though almost no circuit
diagrams or parts of the original machines
survived.\par
Intelligence gathered via code-cracking at Bletchley
underpinned the success of Allied operations to end
WWII.",
acknowledgement = ack-nhfb,
}
@Article{Weissman:2011:LLB,
author = "Clark Weissman and Timothy Levin",
title = "Lessons Learned from Building a High-Assurance Crypto
Gateway",
journal = j-IEEE-SEC-PRIV,
volume = "9",
number = "1",
pages = "31--39",
month = jan # "\slash " # feb,
year = "2011",
DOI = "https://doi.org/10.1109/MSP.2010.201",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Feb 8 15:50:31 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
keywords = "CCEVS (Common Criteria Evaluation and Validation
Scheme)",
}
@Article{Wen:2011:DSH,
author = "Yamin Wen and Fangguo Zhang",
title = "Delegatable secret handshake scheme",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "12",
pages = "2284--2292",
month = dec,
year = "2011",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.06.046",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211001580",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Willyard:2011:MM,
author = "C. Willyard",
title = "Me, myself, or {I}",
journal = j-IEEE-SPECTRUM,
volume = "48",
number = "6",
pages = "52--84",
month = jun,
year = "2011",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2011.5779792",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Fri Jan 17 18:54:05 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "bizarre e-mails; Browsers; data privacy; Facebook;
Facebook account; Hotmail account; online identity;
Privacy; privacy-related minidramas; Social factors;
Social network services; social networking (online);
social networks; Web sites",
}
@Article{Wu:2011:HQI,
author = "Chia-Chun Wu and Shang-Juh Kao and Min-Shiang Hwang",
title = "A high quality image sharing with steganography and
adaptive authentication scheme",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "12",
pages = "2196--2207",
month = dec,
year = "2011",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.06.021",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211001488",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Xing-Yuan:2011:PRS,
author = "Wang Xing-Yuan and Qin Xue and Xie Yi-Xin",
title = "Pseudo-Random Sequences Generated by a Class of
One-Dimensional Smooth Map",
journal = j-CHIN-PHYS-LETT,
volume = "28",
number = "8",
pages = "080501",
year = "2011",
CODEN = "CPLEEU",
DOI = "https://doi.org/10.1088/0256-307X/28/8/080501",
ISSN = "0256-307X (print), 1741-3540 (electronic)",
ISSN-L = "0256-307X",
bibdate = "Wed Feb 22 08:59:20 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://stacks.iop.org/0256-307X/28/i=8/a=080501",
abstract = "We extend a class of a one-dimensional smooth map. We
make sure that for each desired interval of the
parameter the map's Lyapunov exponent is positive. Then
we propose a novel parameter perturbation method based
on the good property of the extended one-dimensional
smooth map. We perturb the parameter $r$ in each
iteration by the real number $ x_i$ generated by the
iteration. The auto-correlation function and NIST
statistical test suite are taken to illustrate the
method's randomness finally. We provide an application
of this method in image encryption. Experiments show
that the pseudo-random sequences are suitable for this
application.",
acknowledgement = ack-nhfb,
fjournal = "Chinese Physics Letters",
}
@Article{Xiong:2011:CIB,
author = "Hu Xiong and Zhiguang Qin and Fagen Li",
title = "Cryptanalysis of an Identity Based Signcryption
without Random Oracles",
journal = j-FUND-INFO,
volume = "107",
number = "1",
pages = "105--109",
month = jan,
year = "2011",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2011-395",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:11:40 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Yang:2011:ACD,
author = "Yang Yang and Xiaohu Tang and Udaya Parampalli",
title = "Authentication Codes from Difference Balanced
Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1417--1429",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008787",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yang:2011:CCK,
author = "Guomin Yang and Chik How Tan",
title = "Certificateless cryptography with {KGC} trust level
$3$",
journal = j-THEOR-COMP-SCI,
volume = "412",
number = "39",
pages = "5446--5457",
day = "9",
month = sep,
year = "2011",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Aug 30 18:51:54 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Yang:2011:CPK,
author = "Guomin Yang and Chik How Tan",
title = "Certificateless public key encryption: a new generic
construction and two pairing-free schemes",
journal = j-THEOR-COMP-SCI,
volume = "412",
number = "8--10",
pages = "662--674",
day = "4",
month = mar,
year = "2011",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Aug 31 10:15:30 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Yang:2011:GSS,
author = "Ching-Nung Yang and Yu-Ying Chu",
title = "A general $ (k, n) $ scalable secret image sharing
scheme with the smooth scalability",
journal = j-J-SYST-SOFTW,
volume = "84",
number = "10",
pages = "1726--1733",
month = oct,
year = "2011",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.05.008",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211001105",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Yengisetty:2011:AVC,
author = "Subba Rao V. Yengisetty and Bimal K. Roy",
title = "Applications of visual cryptography",
journal = j-INT-J-PAR-EMER-DIST-SYS,
volume = "26",
number = "5",
pages = "429--442",
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1080/17445760.2011.574628",
ISSN = "1744-5760 (print), 1744-5779 (electronic)",
ISSN-L = "1744-5760",
bibdate = "Sun Nov 4 10:46:55 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjparemerdistsys.bib;
http://www.tandfonline.com/toc/gpaa20/26/5",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Parallel, Emergent and
Distributed Systems: IJPEDS",
journal-URL = "http://www.tandfonline.com/loi/gpaa20",
onlinedate = "28 Oct 2011",
}
@Article{Yong:2011:SPP,
author = "J. Yong",
title = "Security and Privacy Preservation for Mobile
{E}-Learning via Digital Identity Attributes",
journal = j-J-UCS,
volume = "17",
number = "2",
pages = "296--??",
month = "????",
year = "2011",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Fri Apr 6 05:52:28 MDT 2012",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.jucs.org/jucs_17_2/security_and_privacy_preservation",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Yoon:2011:SBC,
author = "Eun-Jun Yoon and Kee-Young Yoo",
title = "A secure broadcasting cryptosystem and its application
to grid computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "27",
number = "5",
pages = "620--626",
month = may,
year = "2011",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Aug 30 13:10:40 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Yu:2011:CLE,
author = "Yong Yu and Yi Mu and Guilin Wang and Ying Sun",
title = "Cryptanalysis of an Off-Line Electronic Cash Scheme
Based on Proxy Blind Signature",
journal = j-COMP-J,
volume = "54",
number = "10",
pages = "1645--1651",
month = oct,
year = "2011",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr068",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Oct 1 18:10:35 MDT 2011",
bibsource = "http://comjnl.oxfordjournals.org/content/54/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/54/10/1645.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "July 27, 2011",
}
@Article{Yu:2011:FSI,
author = "Jia Yu and Fanyu Kong and Xiangguo Cheng and Rong Hao
and Jianxi Fan",
title = "Forward-Secure Identity-Based Public-Key Encryption
without Random Oracles",
journal = j-FUND-INFO,
volume = "111",
number = "2",
pages = "241--256",
month = apr,
year = "2011",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2011-562",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:13:50 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
note = "See erratum \cite{Yu:2012:EPF}.",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Yum:2011:ACO,
author = "Dae Hyun Yum and Pil Joong Lee",
title = "On the average cost of order-preserving encryption
based on hypergeometric distribution",
journal = j-INFO-PROC-LETT,
volume = "111",
number = "19",
pages = "956--959",
day = "15",
month = oct,
year = "2011",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2011.07.004",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Feb 4 08:08:40 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019011001906",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Zhang:2011:AGK,
author = "Lei Zhang and Qianhong Wu and Bo Qin and Josep
Domingo-Ferrer and {\'U}rsula
Gonz{\'a}lez-Nicol{\'a}s",
title = "Asymmetric group key agreement protocol for open
networks and its application to broadcast encryption",
journal = j-COMP-NET-AMSTERDAM,
volume = "55",
number = "15",
pages = "3246--3255",
day = "27",
month = oct,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2011.06.016",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Feb 4 10:22:52 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128611002283",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Zhang:2011:EPK,
author = "Bo Zhang and Fangguo Zhang",
title = "An efficient public key encryption with
conjunctive-subset keywords search",
journal = j-J-NETW-COMPUT-APPL,
volume = "34",
number = "1",
pages = "262--267",
month = jan,
year = "2011",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:49 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804510001293",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Zhang:2011:FBP,
author = "Meng Zhang and Niraj K. Jha",
title = "{FinFET}-Based Power Management for Improved {DPA}
Resistance with Low Overhead",
journal = j-JETC,
volume = "7",
number = "3",
pages = "10:1--10:??",
month = aug,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2000502.2000503",
ISSN = "1550-4832",
ISSN-L = "1550-4832",
bibdate = "Thu Aug 18 12:25:13 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/jetc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Differential power analysis (DPA) is a side-channel
attack that statistically analyzes the power
consumption of a cryptographic system to obtain secret
information. This type of attack is well known as a
major threat to information security. Effective
solutions with low energy and area cost for improved
DPA resistance are urgently needed, especially for
energy-constrained modern devices that are often in the
physical proximity of attackers. This article presents
a novel countermeasure against DPA attacks on smart
cards and other digital ICs based on FinFETs, an
emerging substitute for bulk CMOS at the 22nm
technology node and beyond. We exploit the adaptive
power management characteristic of FinFETs to generate
a high level of noise at critical moments in the
execution of a cryptosystem to thwart DPA attacks.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Journal on Emerging Technologies in Computing
Systems (JETC)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J967",
}
@Article{Zhang:2011:PFB,
author = "Peng Zhang and Jiankun Hu and Cai Li and Mohammed
Bennamoun and Vijayakumar Bhagavatula",
title = "A pitfall in fingerprint bio-cryptographic key
generation",
journal = j-COMPUT-SECUR,
volume = "30",
number = "5",
pages = "311--319",
month = jul,
year = "2011",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:24 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404811000459",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Zhang:2011:SIR,
author = "Jun Zhang and Yang Xiang and Wanlei Zhou and Lei Ye
and Yi Mu",
title = "Secure Image Retrieval Based on Visual Content and
Watermarking Protocol",
journal = j-COMP-J,
volume = "54",
number = "10",
pages = "1661--1674",
month = oct,
year = "2011",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr078",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Oct 1 18:10:35 MDT 2011",
bibsource = "http://comjnl.oxfordjournals.org/content/54/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/54/10/1661.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 7, 2011",
}
@Article{Zhang:2011:TNT,
author = "Zhenxia Zhang and Azzedine Boukerche and Hussam
Ramadan",
title = "{TEASE}: a novel {Tunnel-based sEcure Authentication
SchemE} to support smooth handoff in {IEEE 802.11}
wireless networks",
journal = j-J-PAR-DIST-COMP,
volume = "71",
number = "7",
pages = "897--905",
month = jul,
year = "2011",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2010.12.003",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Sat Feb 25 09:11:34 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib;
http://www.sciencedirect.com/science/journal/07437315",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731510002686",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Zhou:2011:PSA,
author = "Tao Zhou and Jing Xu",
title = "Provable secure authentication protocol with anonymity
for roaming service in global mobility networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "55",
number = "1",
pages = "205--213",
day = "7",
month = jan,
year = "2011",
CODEN = "????",
ISSN = "1389-1286",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:42 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Book{Abbate:2012:RGWa,
author = "Janet Abbate",
title = "Recoding Gender: Women's Changing Participation in
Computing",
publisher = pub-MIT,
address = pub-MIT:adr,
pages = "x + 247",
year = "2012",
ISBN = "0-262-01806-3 (hardcover), 0-262-30546-1 (e-book),
1-283-95309-9",
ISBN-13 = "978-0-262-01806-7 (hardcover), 978-0-262-30546-4
(e-book), 978-1-283-95309-2",
LCCN = "QA76.9.W65 A33 2012",
bibdate = "Fri Jan 17 13:38:13 MST 2020",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "History of computing",
URL = "http://mitpress.mit.edu/9780262018067",
abstract = "Today, women earn a relatively low percentage of
computer science degrees and hold proportionately few
technical computing jobs. Meanwhile, the stereotype of
the male ``computer geek'' seems to be everywhere in
popular culture. Few people know that women were a
significant presence in the early decades of computing
in both the United States and Britain. Indeed,
programming in postwar years was considered woman's
work (perhaps in contrast to the more manly task of
building the computers themselves). In Recoding Gender,
Janet Abbate explores the untold history of women in
computer science and programming from the Second World
War to the late twentieth century. Demonstrating how
gender has shaped the culture of computing, she offers
a valuable historical perspective on today's concerns
over women's underrepresentation in the field. Abbate
describes the experiences of women who worked with the
earliest electronic digital computers: Colossus, the
wartime codebreaking computer at Bletchley Park outside
London, and the American ENIAC, developed to calculate
ballistics. She examines postwar methods for recruiting
programmers, and the 1960s redefinition of programming
as the more masculine ``software engineering.'' She
describes the social and business innovations of two
early software entrepreneurs, Elsie Shutt and Stephanie
Shirley; and she examines the career paths of women in
academic computer science. Abbate's account of the bold
and creative strategies of women who loved computing
work, excelled at it, and forged successful careers
will provide inspiration for those working to change
gendered computing culture.",
acknowledgement = ack-nhfb,
subject = "Women in computer science; Computer industry;
COMPUTERS; Computer Literacy.; Computer Science.; Data
Processing.; Hardware; General.; Information
Technology.; Machine Theory.; Reference.; History.;
Computer industry.; Women in computer science.",
tableofcontents = "Introduction: Rediscovering Women's History in
Computing \\
1. Breaking Codes and Finding Trajectories: Women at
the Dawn of the Digital Age \\
2. Seeking the Perfect Programmer: Gender and Skill in
Early Data Processing \\
3. Software Crisis or Identity Crisis? Gender, Labor,
and Programming Methods \\
4. Female Entrepreneurs: Reimagining Software as a
Business \\
5. Gender in Academic Computing: Alternative Career
Paths and Norms \\
Appendix: Oral History Interviews Conducted for This
Project",
}
@Article{Abdalla:2012:LBH,
author = "Michel Abdalla and Angelo {De Caro} and Karina
Mochetti",
title = "Lattice-Based Hierarchical Inner Product Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7533",
pages = "121--138",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33481-8_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33481-8_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33481-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33481-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Abdalla:2012:LRS,
author = "Michel Abdalla and Jill-J{\^e}nn Vie",
title = "Leakage-Resilient Spatial Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7533",
pages = "78--99",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33481-8_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33481-8_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33481-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33481-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Abe:2012:TBG,
author = "Masayuki Abe",
title = "Tools over Bilinear Groups for Modular Design of
Cryptographic Tasks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7496",
pages = "1--1",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33272-2_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-33272-2_1",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33272-2",
book-URL = "http://www.springerlink.com/content/978-3-642-33272-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ahmadi:2012:SKE,
author = "Hadi Ahmadi and Reihaneh Safavi-Naini",
title = "Secret Key Establishment over Noisy Channels",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6888",
pages = "132--147",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27901-0_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:19:37 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27901-0_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27901-0",
book-URL = "http://www.springerlink.com/content/978-3-642-27901-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Aizatulin:2012:VCC,
author = "Mihhail Aizatulin and Fran{\c{c}}ois Dupressoir",
title = "Verifying Cryptographic Code in {C}: Some Experience
and the {Csec} Challenge",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7140",
pages = "1--20",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29420-4_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:55 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29420-4_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29420-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29420-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Al-Qarni:2012:EII,
author = "Garsah Farhan Al-Qarni and Farzin Deravi",
title = "Explicit Integration of Identity Information from Skin
Regions to Improve Face Recognition",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7325",
pages = "30--37",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31298-4_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:06 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31298-4_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31298-4",
book-URL = "http://www.springerlink.com/content/978-3-642-31298-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Al-Sinani:2012:UCB,
author = "Haitham S. Al-Sinani and Chris J. Mitchell",
title = "A Universal Client-Based Identity Management Tool",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7163",
pages = "49--74",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29804-2_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29804-2_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29804-2",
book-URL = "http://www.springerlink.com/content/978-3-642-29804-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Albrecht:2012:SDL,
author = "Alexander Albrecht and Felix Naumann",
title = "Schema Decryption for Large Extract-Transform-Load
Systems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7532",
pages = "116--125",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34002-4_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34002-4_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34002-4",
book-URL = "http://www.springerlink.com/content/978-3-642-34002-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{AlMashrafi:2012:AIM,
author = "Mufeed AlMashrafi and Harry Bartlett and Leonie
Simpson and Ed Dawson and Kenneth Koon-Ho Wong",
title = "Analysis of Indirect Message Injection for {MAC}
Generation Using Stream Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7372",
pages = "138--151",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31448-3_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:08 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31448-3_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31448-3",
book-URL = "http://www.springerlink.com/content/978-3-642-31448-3",
fjournal = "Lecture Notes in Computer Science",
remark = "Yes, first author's family name is spelled ALMashrafi
in the paper's author list.",
}
@Article{Alomair:2012:AEH,
author = "Basel Alomair",
title = "Authenticated Encryption: How Reordering Can Impact
Performance",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7341",
pages = "84--99",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31284-7_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31284-7_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31284-7",
book-URL = "http://www.springerlink.com/content/978-3-642-31284-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Alvarez:2012:CAB,
author = "Rafael {\'A}lvarez and Francisco Mart{\'\i}nez and
Jos{\'e}-Francisco Vicent and Antonio Zamora",
title = "Cryptographic Applications of $ 3 \times 3 $ Block
Upper Triangular Matrices",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7209",
pages = "97--104",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28931-6_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28931-6_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28931-6",
book-URL = "http://www.springerlink.com/content/978-3-642-28931-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ambrose:2012:RII,
author = "Jude A. Ambrose and Roshan G. Ragel and Sri
Parameswaran",
title = "Randomized Instruction Injection to Counter Power
Analysis Attacks",
journal = j-TECS,
volume = "11",
number = "3",
pages = "69:1--69:??",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2345770.2345782",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Oct 22 10:44:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Side-channel attacks in general and power analysis
attacks in particular are becoming a major security
concern in embedded systems. Countermeasures proposed
against power analysis attacks are data and table
masking, current flattening, dummy instruction
insertion and bit-flips balancing. All these techniques
are either susceptible to multi-order power analysis
attack, not sufficiently generic to cover all
encryption algorithms, or burden the system with high
area, run-time or energy cost. In this article, we
propose a randomized instruction injection technique (
RIJID ) that overcomes the pitfalls of previous
countermeasures. RIJID scrambles the power profile of a
cryptographic application by injecting random
instructions at random points of execution and
therefore protects the system against power analysis
attacks. Two different ways of triggering the
instruction injection are also presented: (1)
softRIJID, a hardware/software approach, where special
instructions are used in the code for triggering the
injection at runtime; and (2) autoRIJID, a hardware
approach, where the code injection is triggered by the
processor itself via detecting signatures of encryption
routines at runtime. A novel signature detection
technique is also introduced for identifying encryption
routines within application programs at runtime.
Further, a simple obfuscation metric (RIJIDindex) based
on cross-correlation that measures the scrambling
provided by any code injection technique is introduced,
which coarsely indicates the level of scrambling
achieved. Our processor models cost 1.9\% additional
area in the hardware/software approach and 1.2\% in the
hardware approach for a RISC based processor, and costs
on average 29.8\% in runtime and 27.1\% in energy for
the former and 25.0\% in runtime and 28.5\% in energy
for the later, for industry standard cryptographic
applications.",
acknowledgement = ack-nhfb,
articleno = "69",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
}
@Article{Andreeva:2012:SAS,
author = "Elena Andreeva and Andrey Bogdanov and Bart Mennink
and Bart Preneel and Christian Rechberger",
title = "On security arguments of the second round {SHA-3}
candidates",
journal = j-INT-J-INFO-SEC,
volume = "11",
number = "2",
pages = "103--120",
month = apr,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-012-0156-7",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Tue Jan 23 16:01:37 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib",
URL = "http://link.springer.com/article/10.1007/s10207-012-0156-7",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
keywords = "Classification; Differential attacks; Hash functions;
Security reductions; SHA-3 competition; US National
Institute for Standards and Technology (NIST)
cryptographic hash algorithm design competition",
}
@TechReport{Anonymous:2012:SHS,
author = "Anonymous",
key = "FIPS-180-4",
title = "{Secure Hash Standard (SHS)}",
type = "{Federal Information Processing Standards}
Publication",
number = "FIPS Pub 180-4",
institution = pub-NIST,
address = pub-NIST:adr,
pages = "v + 30",
month = mar,
year = "2012",
bibdate = "Wed Jan 30 09:27:44 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://csrc.nist.gov/publications/fips/fips180-4/fips-180-4.pdf;
http://csrc.nist.gov/publications/PubsFIPS.html#fips180-4",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography; Federal Information
Processing Standards; hash algorithm; hash function;
message digest; Secure Hash Standard",
}
@Article{Anzala-Yamajako:2012:RAC,
author = "Alexandre Anzala-Yamajako",
title = "Review of {{\booktitle{Algorithmic Cryptanalysis}}, by
Antoine Joux}",
journal = j-SIGACT,
volume = "43",
number = "4",
pages = "13--16",
month = dec,
year = "2012",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2421119.2421122",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Sun May 5 10:25:40 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Anzala-Yamajako:2012:RBC,
author = "Alexandre Anzala-Yamajako",
title = "Review of {{\booktitle{Algorithmic Cryptanalysis}}, by
Antoine Joux}",
journal = j-SIGACT,
volume = "43",
number = "4",
pages = "13--16",
month = dec,
year = "2012",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2421119.2421122",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Sun May 5 10:25:40 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Apavatjrut:2012:EEA,
author = "Anya Apavatjrut and Wassim Znaidi and Antoine
Fraboulet and Claire Goursaud and Katia
Jaffr{\`e}s-Runser and C{\'e}dric Lauradoux and Marine
Minier",
title = "Energy efficient authentication strategies for network
coding",
journal = j-CCPE,
volume = "24",
number = "10",
pages = "1086--1107",
month = jul,
year = "2012",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.1767",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Nov 5 07:44:49 MST 2012",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "22 Jun 2011",
}
@Article{Arapinis:2012:RET,
author = "Myrto Arapinis and Sergiu Bursuc and Mark D. Ryan",
title = "Reduction of Equational Theories for Verification of
Trace Equivalence: Re-encryption, Associativity and
Commutativity",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7215",
pages = "169--188",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28641-4_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:29 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28641-4_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28641-4",
book-URL = "http://www.springerlink.com/content/978-3-642-28641-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Armknecht:2012:STH,
author = "Frederik Armknecht and Stefan Katzenbeisser and
Andreas Peter",
title = "Shift-Type Homomorphic Encryption and Its Application
to Fully Homomorphic Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7374",
pages = "234--251",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31410-0_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31410-0_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31410-0",
book-URL = "http://www.springerlink.com/content/978-3-642-31410-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Arnold:2012:ICC,
author = "T. W. Arnold and C. Buscaglia and F. Chan and V.
Condorelli and J. Dayka and W. Santiago-Fernandez and
N. Hadzic and M. D. Hocker and M. Jordan and T. E.
Morris and K. Werner",
title = "{IBM 4765} cryptographic coprocessor",
journal = j-IBM-JRD,
volume = "56",
number = "1",
pages = "10:1--10:13",
month = "????",
year = "2012",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/JRD.2011.2178736",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Fri Apr 13 09:44:32 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Arora:2012:ILM,
author = "Divya Arora and Najwa Aaraj and Anand Raghunathan and
Niraj K. Jha",
title = "{INVISIOS}: a Lightweight, Minimally Intrusive Secure
Execution Environment",
journal = j-TECS,
volume = "11",
number = "3",
pages = "60:1--60:??",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2345770.2345772",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Oct 22 10:44:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Many information security attacks exploit
vulnerabilities in ``trusted'' and privileged software
executing on the system, such as the operating system
(OS). On the other hand, most security mechanisms
provide no immunity to security-critical user
applications if vulnerabilities are present in the
underlying OS. While technologies have been proposed
that facilitate isolation of security-critical
software, they require either significant computational
resources and are hence not applicable to many
resource-constrained embedded systems, or necessitate
extensive redesign of the underlying processors and
hardware. In this work, we propose INVISIOS: a
lightweight, minimally intrusive hardware-software
architecture to make the execution of security-critical
software invisible to the OS, and hence protected from
its vulnerabilities. The INVISIOS software architecture
encapsulates the security-critical software into a
self-contained software module. While this module is
part of the kernel and is run with kernel-level
privileges, its code, data, and execution are
transparent to and protected from the rest of the
kernel. The INVISIOS hardware architecture consists of
simple add-on hardware components that are responsible
for bootstrapping the secure core, ensuring that it is
exercised by applications in only permitted ways, and
enforcing the isolation of its code and data. We
implemented INVISIOS by enhancing a full-system
emulator and Linux to model the proposed software and
hardware enhancements, and applied it to protect a
commercial cryptographic library. Our experiments
demonstrate that INVISIOS is capable of facilitating
secure execution at very small overheads, making it
suitable for resource-constrained embedded systems and
systems-on-chip.",
acknowledgement = ack-nhfb,
articleno = "60",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
}
@Article{Arriaga:2012:JSS,
author = "Afonso Arriaga and Manuel Barbosa and Pooya Farshim",
title = "On the Joint Security of Signature and Encryption
Schemes under Randomness Reuse: Efficiency and Security
Amplification",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7341",
pages = "206--223",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31284-7_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31284-7_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31284-7",
book-URL = "http://www.springerlink.com/content/978-3-642-31284-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Arsalan:2012:IRW,
author = "Muhammad Arsalan and Sana Ambreen Malik and Asifullah
Khan",
title = "Intelligent reversible watermarking in integer wavelet
domain for medical images",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "4",
pages = "883--894",
month = apr,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.11.005",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri Feb 17 07:42:13 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211002858",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Attrapadung:2012:ABE,
author = "Nuttapong Attrapadung and Javier Herranz and Fabien
Laguillaumie and Beno{\^\i}t Libert and Elie de
Panafieu and Carla R{\`a}fols",
title = "Attribute-based encryption schemes with constant-size
ciphertexts",
journal = j-THEOR-COMP-SCI,
volume = "422",
number = "1",
pages = "15--38",
day = "9",
month = mar,
year = "2012",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2011.12.004",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Feb 2 08:49:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397511009649",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Avoine:2012:PFS,
author = "Gildas Avoine and Xavier Carpent and Benjamin Martin",
title = "Privacy-friendly synchronized ultralightweight
authentication protocols in the storm",
journal = j-J-NETW-COMPUT-APPL,
volume = "35",
number = "2",
pages = "826--843",
month = mar,
year = "2012",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:13 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804511002335",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Ayday:2012:DAA,
author = "Erman Ayday and Farshid Delgosha and Faramarz Fekri",
title = "Data authenticity and availability in multihop
wireless sensor networks",
journal = j-TOSN,
volume = "8",
number = "2",
pages = "10:1--10:??",
month = mar,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2140522.2140523",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Fri Apr 6 18:38:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Security services such as data confidentiality,
authenticity, and availability are critical in wireless
sensor networks (WSNs) deployed in adversarial
environments. Due to the resource constrain's of sensor
nodes, the existing protocols currently in use in adhoc
networks cannot be employed in WSNs. In this article,
we propose a protocol called location-aware
network-coding security (LNCS) that provides all the
aforementioned security services. By dividing the
terrain into nonoverlapping cells, the nodes take
advantage of the location information to derive
different location-binding keys. The key idea in LNCS
is that all the nodes involved in the protocol
collaborate in every phase. We employ random network
coding in order to provide data availability
significantly higher than that in other schemes. A hash
tree-based authentication mechanism is utilized to
filter the bogus packets enroute. We provide a
comparison between our scheme and previously proposed
schemes. The results reveal significant improvement in
data availability while maintaining the same level of
data confidentiality and authenticity.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Ayub:2012:BRB,
author = "Abu Mohammad Omar Shehab Uddin Ayub",
title = "Book Review: {{\booktitle{The Cryptoclub: Using
Mathematics to Make and Break Secret Codes}}, by Janet
Beissinger and Vera Pless}",
journal = j-SIGACT,
volume = "43",
number = "1",
pages = "9--14",
month = mar,
year = "2012",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2160649.2160652",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Mar 20 14:39:02 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Beissinger:2006:CUM}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Backes:2012:GCP,
author = "Michael Backes and Matteo Maffei and Kim Pecina",
title = "{G2C}: Cryptographic Protocols from Goal-Driven
Specifications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6993",
pages = "57--77",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27375-9_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:58 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27375-9_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27375-9",
book-URL = "http://www.springerlink.com/content/978-3-642-27375-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Baelde:2012:TPR,
author = "David Baelde and Pierre Courtieu and David
Gross-Amblard and Christine Paulin-Mohring",
title = "Towards Provably Robust Watermarking",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7406",
pages = "201--216",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32347-8_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:53 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32347-8_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32347-8",
book-URL = "http://www.springerlink.com/content/978-3-642-32347-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bahi:2012:SCS,
author = "Jacques M. Bahi and Jean-Fran{\c{c}}ois Couchot and
Christophe Guyeux",
title = "Steganography: a Class of Secure and Robust
Algorithms",
journal = j-COMP-J,
volume = "55",
number = "6",
pages = "653--666",
month = jun,
year = "2012",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr116",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed May 30 11:20:33 MDT 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/55/6.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/55/6/653.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 18, 2011",
}
@Article{Bai:2012:SSR,
author = "Yu Bai and Yanlong Liu",
title = "A Synchronization Strengthen {RFID} Authentication
Protocol Based on Key Array",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7530",
pages = "113--119",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33478-8_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:25 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33478-8_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33478-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33478-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bailin:2012:ERG,
author = "David Bailin",
title = "Essay Review: The geese that never cackled.
{{\booktitle{Secret Days: Codebreaking in Bletchley
Park}}, by Asa Briggs. ISBN 978-1-84832-615-6},
{Scope}: review. {Level}: general readership",
journal = j-CONTEMP-PHYS,
volume = "53",
number = "3",
pages = "256--262",
year = "2012",
CODEN = "CTPHAF",
DOI = "https://doi.org/10.1080/00107514.2012.657248",
ISSN = "0010-7514 (print), 1366-5812 (electronic)",
ISSN-L = "0010-7514",
bibdate = "Thu Feb 18 20:08:52 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/contempphys.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Contemporary Physics",
journal-URL = "http://www.tandfonline.com/loi/tcph20",
}
@Article{Balfanz:2012:FA,
author = "Dirk Balfanz and Richard Chow and Ori Eisen and Markus
Jakobsson and Steve Kirsch and Scott Matsumoto and
Jesus Molina and Paul van Oorschot",
title = "The Future of Authentication",
journal = j-IEEE-SEC-PRIV,
volume = "10",
number = "1",
pages = "22--27",
month = jan # "\slash " # feb,
year = "2012",
DOI = "https://doi.org/10.1109/MSP.2012.24",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Feb 15 12:40:29 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Banik:2012:DFA,
author = "Subhadeep Banik and Subhamoy Maitra and Santanu
Sarkar",
title = "A Differential Fault Attack on the Grain Family of
Stream Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7428",
pages = "122--139",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33027-8_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33027-8_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33027-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33027-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Barak:2012:IPO,
author = "Boaz Barak and Oded Goldreich and Russell Impagliazzo
and Steven Rudich and Amit Sahai and Salil Vadhan and
Ke Yang",
title = "On the (im)possibility of obfuscating programs",
journal = j-J-ACM,
volume = "59",
number = "2",
pages = "6:1--6:48",
month = apr,
year = "2012",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/2160158.2160159",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Fri Apr 27 16:20:34 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "Informally, an obfuscator $O$ is an (efficient,
probabilistic) ``compiler'' that takes as input a
program (or circuit) $P$ and produces a new program $
O(P)$ that has the same functionality as $P$ yet is
``unintelligible'' in some sense. Obfuscators, if they
exist, would have a wide variety of cryptographic and
complexity-theoretic applications, ranging from
software protection to homomorphic encryption to
complexity-theoretic analogues of Rice's theorem. Most
of these applications are based on an interpretation of
the ``unintelligibility'' condition in obfuscation as
meaning that $ O(P)$ is a ``virtual black box,'' in the
sense that anything one can efficiently compute given $
O(P)$, one could also efficiently compute given oracle
access to $P$. In this work, we initiate a theoretical
investigation of obfuscation. Our main result is that,
even under very weak formalizations of the above
intuition, obfuscation is impossible. We prove this by
constructing a family of efficient programs $P$ that
are unobfuscatable in the sense that (a) given any
efficient program $P$ ' that computes the same function
as a program $ P \in p$, the ``source code'' $P$ can be
efficiently reconstructed, yet (b) given oracle access
to a (randomly selected) program $ P \in p$, no
efficient algorithm can reconstruct $P$ (or even
distinguish a certain bit in the code from random)
except with negligible probability. We extend our
impossibility result in a number of ways, including
even obfuscators that (a) are not necessarily
computable in polynomial time, (b) only approximately
preserve the functionality, and (c) only need to work
for very restricted models of computation (TC$^0$). We
also rule out several potential applications of
obfuscators, by constructing ``unobfuscatable''
signature schemes, encryption schemes, and pseudorandom
function families.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Barbay:2012:BRB,
author = "J{\'e}r{\'e}my Barbay",
title = "Book Review: {{\booktitle{Understanding and Applying
Cryptography and Data Security}}, by Adam J. Elbirt}",
journal = j-SIGACT,
volume = "43",
number = "1",
pages = "18--21",
month = mar,
year = "2012",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2160649.2160655",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Mar 20 14:39:02 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Elbirt:2009:UAC}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Barthe:2012:ACA,
author = "Gilles Barthe and Benjamin Gr{\'e}goire and C{\'e}sar
Kunz",
title = "Automation in Computer-Aided Cryptography: Proofs,
Attacks and Designs",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7679",
pages = "7--8",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35308-6_3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:48 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-35308-6_3",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35308-6",
book-URL = "http://www.springerlink.com/content/978-3-642-35308-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Barthe:2012:CACa,
author = "Gilles Barthe and Juan Manuel Crespo and Benjamin
Gr{\'e}goire and C{\'e}sar Kunz",
title = "Computer-Aided Cryptographic Proofs",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7406",
pages = "11--27",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32347-8_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:53 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32347-8_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32347-8",
book-URL = "http://www.springerlink.com/content/978-3-642-32347-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Barthe:2012:CACb,
author = "Gilles Barthe and Benjamin Gr{\'e}goire and Santiago
Zanella B{\'e}guelin",
title = "Computer-Aided Cryptographic Proofs",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7460",
pages = "1--2",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33125-1_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:03 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-33125-1_1",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33125-1",
book-URL = "http://www.springerlink.com/content/978-3-642-33125-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bas:2012:BLK,
author = "Patrick Bas and Teddy Furon",
title = "Are 128 Bits {Long} Keys Possible in Watermarking?",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7394",
pages = "191--191",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32805-3_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-32805-3_15",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32805-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32805-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Basin:2012:PRI,
author = "David Basin and Cas Cremers and Simon Meier",
title = "Provably Repairing the {ISO\slash IEC 9798} Standard
for Entity Authentication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7215",
pages = "129--148",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28641-4_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:29 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28641-4_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28641-4",
book-URL = "http://www.springerlink.com/content/978-3-642-28641-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Batina:2012:HEB,
author = "Lejla Batina and Stefaan Seys and Dave Singel{\'e}e
and Ingrid Verbauwhede",
title = "Hierarchical {ECC}-Based {RFID} Authentication
Protocol",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7055",
pages = "183--201",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25286-0_12",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:19 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-25286-0_12/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-25286-0",
book-URL = "http://www.springerlink.com/content/978-3-642-25286-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Battistello:2012:TBA,
author = "Patrick Battistello and Joaquin Garcia-Alfaro and
Cyril Del{\'e}tr{\'e}",
title = "Transaction-based authentication and key agreement
protocol for inter-domain {VoIP}",
journal = j-J-NETW-COMPUT-APPL,
volume = "35",
number = "5",
pages = "1579--1597",
month = sep,
year = "2012",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:23 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804512000653",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Bayrak:2012:AII,
author = "Ali Galip Bayrak and Nikola Velickovic and Paolo Ienne
and Wayne Burleson",
title = "An architecture-independent instruction shuffler to
protect against side-channel attacks",
journal = j-TACO,
volume = "8",
number = "4",
pages = "20:1--20:??",
month = jan,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2086696.2086699",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Sat Jan 21 07:49:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
abstract = "Embedded cryptographic systems, such as smart cards,
require secure implementations that are robust to a
variety of low-level attacks. Side-Channel Attacks
(SCA) exploit the information such as power
consumption, electromagnetic radiation and acoustic
leaking through the device to uncover the secret
information. Attackers can mount successful attacks
with very modest resources in a short time period.
Therefore, many methods have been proposed to increase
the security against SCA. Randomizing the execution
order of the instructions that are independent, i.e.,
random shuffling, is one of the most popular among
them. Implementing instruction shuffling in software is
either implementation specific or has a significant
performance or code size overhead.",
acknowledgement = ack-nhfb,
articleno = "20",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Behnia:2012:SEI,
author = "Rouzbeh Behnia and Swee-Huay Heng and Che-Sheng Gan",
title = "Short and Efficient Identity-Based Undeniable
Signature Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7449",
pages = "143--148",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32287-7_12",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32287-7_12/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32287-7",
book-URL = "http://www.springerlink.com/content/978-3-642-32287-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Beimel:2012:SSS,
author = "Amos Beimel and Oriol Farr{\`a}s and Yuval Mintz",
title = "Secret Sharing Schemes for Very Dense Graphs",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7417",
pages = "144--161",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32009-5_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:07 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32009-5_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32009-5",
book-URL = "http://www.springerlink.com/content/978-3-642-32009-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bellare:2012:IBL,
author = "Mihir Bellare and Eike Kiltz and Chris Peikert and
Brent Waters",
title = "Identity-Based (Lossy) Trapdoor Functions and
Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "228--245",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_14;
https://doi.org/10.1007/978-3-642-29011-4_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-29011-4_14;
http://link.springer.com/chapter/10.1007/978-3-642-29011-4_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bellare:2012:MIS,
author = "Mihir Bellare and Thomas Ristenpart and Stefano
Tessaro",
title = "Multi-instance Security and Its Application to
Password-Based Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7417",
pages = "312--329",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32009-5_19",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:07 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32009-5_19/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32009-5",
book-URL = "http://www.springerlink.com/content/978-3-642-32009-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bencsath:2012:CSD,
author = "Boldizs{\'a}r Bencs{\'a}th and G{\'a}bor P{\'e}k and
Levente Butty{\'a}n and M{\'a}rk F{\'e}legyh{\'a}zi",
title = "The Cousins of {Stuxnet}: {Duqu}, {Flame}, and
{Gauss}",
journal = j-FUTURE-INTERNET,
volume = "4",
number = "4",
pages = "971--1003",
day = "06",
month = nov,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi4040971",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:49 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/4/4/971",
abstract = "Stuxnet was the first targeted malware that received
worldwide attention for causing physical damage in an
industrial infrastructure seemingly isolated from the
onlineworld. Stuxnet was a powerful targeted
cyber-attack, and soon other malware samples were
discovered that belong to this family. In this paper,
we will first present our analysis of Duqu, an
information-collecting malware sharing striking
similarities with Stuxnet. We describe our
contributions in the investigation ranging from the
original detection of Duquvia finding the dropper file
to the design of a Duqu detector toolkit. We then
continue with the analysis of the Flame advanced
information-gathering malware. Flame is unique in the
sense that it used advanced cryptographic techniques to
masquerade as a legitimate proxy and we are currently
collecting intelligence information to be able to break
its very special encryption mechanism. Besides
explaining the operation of these pieces of malware, we
also examine if and how they could have been detected
by vigilant system administrators manually or in a
semi-automated manner using available tools. Finally,
we discuss lessons that the community can learn from
these incidents. We focus on technical issues, and
avoid speculations on the origin of these threats and
other geopolitical questions.",
acknowledgement = ack-nhfb,
remark = "Special Issue Aftermath of Stuxnet.",
}
@Article{Bender:2012:DSP,
author = "Jens Bender and {\"O}zg{\"u}r Dagdelen and Marc
Fischlin and Dennis K{\"u}gler",
title = "Domain-Specific Pseudonymous Signatures for the
{German} Identity Card",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7483",
pages = "104--119",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33383-5_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33383-5_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33383-5",
book-URL = "http://www.springerlink.com/content/978-3-642-33383-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Berghel:2012:ITF,
author = "Hal Berghel",
title = "Identity Theft and Financial Fraud: Some Strangeness
in the Proportions",
journal = j-COMPUTER,
volume = "45",
number = "1",
pages = "86--89",
month = jan,
year = "2012",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2012.16",
ISSN = "0018-9162",
ISSN-L = "0018-9162",
bibdate = "Tue Jan 24 17:27:23 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Bergsma:2012:PAW,
author = "Timothy T. Bergsma and Michael S. Smith",
title = "\pkg{Sumo}: An Authenticating {Web} Application with
an Embedded {R} Session",
journal = j-R-JOURNAL,
volume = "4",
number = "1",
pages = "60--63",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2073-4859",
bibdate = "Thu Aug 13 15:54:57 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/rjournal.bib",
URL = "http://journal.r-project.org/archive/2012-1/RJournal_2012-1_Bergsma+Smith.pdf",
acknowledgement = ack-r-project,
fjournal = "The R Journal",
journal-URL = "http://journal.r-project.org/",
}
@Article{Bernstein:2012:SIN,
author = "Daniel J. Bernstein and Tanja Lange and Peter
Schwabe",
title = "The Security Impact of a New Cryptographic Library",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7533",
pages = "159--176",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33481-8_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33481-8_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33481-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33481-8",
fjournal = "Lecture Notes in Computer Science",
}
@TechReport{Bertoni:2012:KIO,
author = "Guido Bertoni and Joan Daemen and Micha{\"e}l Peeters
and Gilles {Van Assche} and Ronny {Van Keer}",
title = "{{\sc Keccak}} implementation overview",
type = "Report",
institution = "STMicroelectronics",
address = "Antwerp, Belgium (??)",
pages = "59",
day = "29",
month = may,
year = "2012",
bibdate = "Fri Dec 14 15:25:32 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://keccak.noekeon.org/Keccak-implementation-3.2.pdf",
acknowledgement = ack-nhfb,
keywords = "hash function; Keccak (`catch-ack'); NIST Secure Hash
Algorithm (SHA-3)",
lastaccess = "14 December 2012",
}
@Misc{Bertoni:2012:KSF,
author = "Guido Bertoni and Joan Daemen and Micha{\"e}l Peeters
and Gilles {Van Assche}",
title = "The {Keccak} sponge function family",
howpublished = "Web site",
day = "24",
month = oct,
year = "2012",
bibdate = "Fri Dec 14 10:18:19 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://keccak.noekeon.org/",
abstract = "From the Web site: ``Keccak is a family of sponge
functions. The sponge function is a generalization of
the concept of cryptographic hash function with
infinite output and can perform quasi all symmetric
cryptographic functions, from hashing to pseudo-random
number generation to authenticated encryption.''",
acknowledgement = ack-nhfb,
lastaccess = "14 December 2012",
}
@Article{Bhargavan:2012:VCI,
author = "Karthikeyan Bhargavan and C{\'e}dric Fournet and
Ricardo Corin and Eugen Zalinescu",
title = "Verified Cryptographic Implementations for {TLS}",
journal = j-TISSEC,
volume = "15",
number = "1",
pages = "3:1--3:??",
month = mar,
year = "2012",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2133375.2133378",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Sat Mar 24 09:45:43 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "We narrow the gap between concrete implementations of
cryptographic protocols and their verified models. We
develop and verify a small functional implementation of
the Transport Layer Security protocol (TLS 1.0). We
make use of the same executable code for
interoperability testing against mainstream
implementations for automated symbolic cryptographic
verification and automated computational cryptographic
verification. We rely on a combination of recent tools
and also develop a new tool for extracting
computational models from executable code. We obtain
strong security guarantees for TLS as used in typical
deployments.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Bhatnagar:2012:IVE,
author = "Gaurav Bhatnagar and Q. M. Jonathan Wu and
Balasubramanian Raman",
title = "Image and Video Encryption based on Dual Space-Filling
Curves",
journal = j-COMP-J,
volume = "55",
number = "6",
pages = "667--685",
month = jun,
year = "2012",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxs009",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed May 30 11:20:33 MDT 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/55/6.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/55/6/667.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "February 16, 2012",
}
@Article{Bhatnagar:2012:NRA,
author = "Gaurav Bhatnagar and Q. M. Jonathan Wu and
Balasubramanian Raman",
title = "A new robust adjustable logo watermarking scheme",
journal = j-COMPUT-SECUR,
volume = "31",
number = "1",
pages = "40--58",
month = feb,
year = "2012",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:27 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404811001398",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Biagioli:2012:CCS,
author = "Mario Biagioli",
title = "From ciphers to confidentiality: secrecy, openness and
priority in science",
journal = j-BRITISH-J-HIST-SCI,
volume = "45",
number = "2",
pages = "213--233",
month = jun,
year = "2012",
CODEN = "BJHSAT",
DOI = "https://doi.org/10.1017/S0007087412000088",
ISSN = "0007-0874 (print), 1474-001X (electronic)",
ISSN-L = "0007-0874",
bibdate = "Sat Jun 23 14:42:27 MDT 2012",
bibsource = "http://journals.cambridge.org/action/displayJournal?jid=BJH;
https://www.math.utah.edu/pub/tex/bib/bjhs2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
ajournal = "British J. Hist. Sci.",
fjournal = "British Journal for the History of Science",
journal-URL = "http://journals.cambridge.org/action/displayJournal?jid=BJH",
onlinedate = "20 March 2012",
}
@Article{Bichsel:2012:DMA,
author = "Patrik Bichsel and Jan Camenisch and Bart {De Decker}
and Jorn Lapon and Vincent Naessens",
title = "Data-Minimizing Authentication Goes Mobile",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7394",
pages = "55--71",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32805-3_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32805-3_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32805-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32805-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Biddle:2012:GPL,
author = "Robert Biddle and Sonia Chiasson and P. C. {Van
Oorschot}",
title = "Graphical passwords: {Learning} from the first twelve
years",
journal = j-COMP-SURV,
volume = "44",
number = "4",
pages = "19:1--19:??",
month = aug,
year = "2012",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2333112.2333114",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Sep 6 09:45:45 MDT 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Starting around 1999, a great many graphical password
schemes have been proposed as alternatives to
text-based password authentication. We provide a
comprehensive overview of published research in the
area, covering both usability and security aspects as
well as system evaluation. The article first catalogues
existing approaches, highlighting novel features of
selected schemes and identifying key usability or
security advantages. We then review usability
requirements for knowledge-based authentication as they
apply to graphical passwords, identify security threats
that such systems must address and review known
attacks, discuss methodological issues related to
empirical evaluation, and identify areas for further
research and improved methodology.",
acknowledgement = ack-nhfb,
articleno = "19",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Biskup:2012:RBR,
author = "Joachim Biskup and Cornelia Tadros",
title = "Revising Belief without Revealing Secrets",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7153",
pages = "51--70",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28472-4_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28472-4_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28472-4",
book-URL = "http://www.springerlink.com/content/978-3-642-28472-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Biswas:2012:IBA,
author = "Subir Biswas and Jelena Misi{\'c} and Vojislav
Misi{\'c}",
title = "An identity-based authentication scheme for safety
messages in {WAVE}-enabled {VANETs}",
journal = j-INT-J-PAR-EMER-DIST-SYS,
volume = "27",
number = "6",
pages = "541--562",
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1080/17445760.2011.641965",
ISSN = "1744-5760 (print), 1744-5779 (electronic)",
ISSN-L = "1744-5760",
bibdate = "Sun Nov 4 10:46:57 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjparemerdistsys.bib;
http://www.tandfonline.com/toc/gpaa20/27/6",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Parallel, Emergent and
Distributed Systems: IJPEDS",
journal-URL = "http://www.tandfonline.com/loi/gpaa20",
onlinedate = "12 Jan 2012",
}
@Book{Blanchette:2012:BPC,
author = "Jean-Fran{\c{c}}ois Blanchette",
title = "Burdens of Proof: Cryptographic Culture and Evidence
Law in the Age of Electronic Documents",
publisher = pub-MIT,
address = pub-MIT:adr,
pages = "276",
year = "2012",
ISBN = "0-262-01751-2 (hardcover)",
ISBN-13 = "978-0-262-01751-0 (hardcover)",
LCCN = "K2269.5 .B58 2012",
bibdate = "Tue May 7 10:56:16 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Electronic evidence; Data encryption (Computer
science); Law and legislation",
tableofcontents = "Introduction \\
Communication in the presence of adversaries \\
On the brink of a revolution \\
The equivalent of a written signature \\
Written proof \\
Paper and state \\
The Cryptographic imagination \\
Epilogue",
}
@Article{Blasco:2012:FAS,
author = "Jorge Blasco and Julio Cesar Hernandez-Castro and
Jos{\'e} Mar{\'\i}a de Fuentes and Benjam{\'\i}n
Ramos",
title = "A framework for avoiding steganography usage over
{HTTP}",
journal = j-J-NETW-COMPUT-APPL,
volume = "35",
number = "1",
pages = "491--501",
month = jan,
year = "2012",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:09 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804511001901",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Blomer:2012:TKG,
author = "Johannes Bl{\"o}mer",
title = "{Turing und Kryptografie}. ({German}) [{Turing} and
cryptography]",
journal = j-INFORMATIK-SPEKTRUM,
volume = "35",
number = "4",
pages = "261--270",
month = aug,
year = "2012",
CODEN = "INSKDW",
DOI = "https://doi.org/10.1007/s00287-012-0622-7",
ISSN = "0170-6012 (print), 1432-122X (electronic)",
ISSN-L = "0170-6012",
bibdate = "Fri Jul 13 07:26:18 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.springerlink.com/content/0170-6012/",
note = "Special Issue: Alan Turing",
URL = "http://www.springerlink.com/content/703t016671n87094/",
acknowledgement = ack-nhfb,
fjournal = "Informatik Spektrum",
language = "German",
}
@Article{Bogdanov:2012:KAC,
author = "Andrey Bogdanov and Lars R. Knudsen and Gregor Leander
and Francois-Xavier Standaert",
title = "Key-Alternating Ciphers in a Provable Setting:
Encryption Using a Small Number of Public
Permutations",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "45--62",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_4;
https://doi.org/10.1007/978-3-642-29011-4_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-29011-4_4;
http://link.springer.com/chapter/10.1007/978-3-642-29011-4_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bogdanov:2012:UTC,
author = "Dan Bogdanov and Roman Jagom{\"a}gis and Sven Laur",
title = "A Universal Toolkit for Cryptographically Secure
Privacy-Preserving Data Mining",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7299",
pages = "112--126",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-30428-6_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:19:32 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012d.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-30428-6_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-30428-6",
book-URL = "http://www.springerlink.com/content/978-3-642-30428-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bogdanov:2012:ZCL,
author = "Andrey Bogdanov and Meiqin Wang",
title = "Zero-Correlation Linear Cryptanalysis with Reduced
Data Complexity",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7549",
pages = "29--48",
year = "2012",
DOI = "https://doi.org/10.1007/978-3-642-34047-5_3",
bibdate = "Fri Jan 31 08:05:18 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012.bib",
acknowledgement = ack-nhfb,
keywords = "TEA (Tiny Encryption Algorithm)",
remark = "Fast Software Encryption 2012",
}
@Article{Boldi:2012:IUG,
author = "Paolo Boldi and Francesco Bonchi and Aristides Gionis
and Tamir Tassa",
title = "Injecting uncertainty in graphs for identity
obfuscation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1376--1387",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Data collected nowadays by social-networking
applications create fascinating opportunities for
building novel services, as well as expanding our
understanding about social structures and their
dynamics. Unfortunately, publishing social-network
graphs is considered an ill-advised practice due to
privacy concerns. To alleviate this problem, several
anonymization methods have been proposed, aiming at
reducing the risk of a privacy breach on the published
data, while still allowing to analyze them and draw
relevant conclusions. In this paper we introduce a new
anonymization approach that is based on injecting
uncertainty in social graphs and publishing the
resulting uncertain graphs. While existing approaches
obfuscate graph data by adding or removing edges
entirely, we propose using a finer-grained perturbation
that adds or removes edges partially: this way we can
achieve the same desired level of obfuscation with
smaller changes in the data, thus maintaining higher
utility. Our experiments on real-world networks confirm
that at the same level of identity obfuscation our
method provides higher usefulness than existing
randomized methods that publish standard graphs.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
}
@TechReport{Boldyreva:2012:NPG,
author = "Alexandra Boldyreva and Virendra Kumar",
title = "A New Pseudorandom Generator from Collision-Resistant
Hash Functions",
type = "Report",
institution = "School of Computer Science, Georgia Institute of
Technology",
address = "Atlanta, GA, USA",
day = "6",
month = feb,
year = "2012",
bibdate = "Wed Feb 15 10:44:11 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://eprint.iacr.org/2012/056",
abstract = "We present a new hash-function-based pseudorandom
generator (PRG). Our PRG is reminiscent of the
classical constructions iterating a function on a
random seed and extracting Goldreich-Levin hardcore
bits at each iteration step. The latest PRG of this
type that relies on reasonable assumptions (regularity
and one-wayness) is due to Haitner et al. In addition
to a regular one-way function, each iteration in their
``randomized iterate'' scheme uses a new
pairwise-independent function, whose descriptions are
part of the seed of the PRG. Our construction does not
use pairwise-independent functions and is thus more
efficient, requiring less computation and a
significantly shorter seed. Our scheme's security
relies on the standard notions of collision-resistance
and regularity of the underlying hash function, where
the collision-resistance is required to be {\em
exponential}. In particular, any polynomial-time
adversary should have less than $ 2^{-n / 2} $
probability of finding collisions, where $n$ is the
output size of the hash function. We later show how to
relax the regularity assumption by introducing a new
notion that we call {\em worst-case regularity}, which
lower bounds the size of preimages of different
elements from the range (while the common regularity
assumption requires all such sets to be of equal size).
Unlike previous results, we provide a concrete security
statement.",
acknowledgement = ack-nhfb,
remark = "A preliminary version appears in Proceedings of the
2012 Cryptographers' Track of the RSA Conference
(CT-RSA '12).",
}
@Article{Boldyreva:2012:SSE,
author = "Alexandra Boldyreva and Jean Paul Degabriele and
Kenneth G. Paterson and Martijn Stam",
title = "Security of Symmetric Encryption in the Presence of
Ciphertext Fragmentation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "682--699",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_39;
https://doi.org/10.1007/978-3-642-29011-4_40",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-29011-4_39;
http://link.springer.com/chapter/10.1007/978-3-642-29011-4_40/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Boneh:2012:FEN,
author = "Dan Boneh and Amit Sahai and Brent Waters",
title = "Functional encryption: a new vision for public-key
cryptography",
journal = j-CACM,
volume = "55",
number = "11",
pages = "56--64",
month = nov,
year = "2012",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2366316.2366333",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Oct 25 09:59:18 MDT 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Decryption keys allow users to learn a specific
function of the encrypted data and nothing else.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Boneh:2012:PBC,
author = "Dan Boneh",
title = "Pairing-Based Cryptography: Past, Present, and
Future",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7658",
pages = "1--1",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34961-4_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:20 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-34961-4_1",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34961-4",
book-URL = "http://www.springerlink.com/content/978-3-642-34961-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Borghoff:2012:PLL,
author = "Julia Borghoff and Anne Canteaut and Tim G{\"u}neysu
and Elif Bilge Kavun and Miroslav Knezevic",
title = "{PRINCE} --- a Low-Latency Block Cipher for Pervasive
Computing Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7658",
pages = "208--225",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34961-4_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:20 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34961-4_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34961-4",
book-URL = "http://www.springerlink.com/content/978-3-642-34961-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bosch:2012:SDR,
author = "Christoph B{\"o}sch and Qiang Tang and Pieter Hartel
and Willem Jonker",
title = "Selective Document Retrieval from Encrypted Database",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7483",
pages = "224--241",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33383-5_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33383-5_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33383-5",
book-URL = "http://www.springerlink.com/content/978-3-642-33383-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bouti:2012:SCB,
author = "Adil Bouti and J{\"o}rg Keller",
title = "Securing cloud-based computations against malicious
providers",
journal = j-OPER-SYS-REV,
volume = "46",
number = "2",
pages = "38--42",
month = jul,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2331576.2331583",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jul 13 12:36:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Security in clouds often focuses on preventing clients
from gaining information about other clients'
computations. However, cloud providers might also be a
source for loss of confidentiality. We present a
protocol to delegate computations into clouds with
encrypted data. The protocol is based on homomorphic
properties of encryption algorithms. The protocol can
also be used to amend existing applications by software
patches of binaries. We evaluate the protocol by a
proof-of-concept implementation to investigate
practicability, and discuss variants and extensions to
increase the prototype's efficiency.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Braun:2012:ULA,
author = "Bastian Braun and Stefan Kucher and Martin Johns and
Joachim Posegga",
title = "A User-Level Authentication Scheme to Mitigate {Web}
Session-Based Vulnerabilities",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7449",
pages = "17--29",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32287-7_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32287-7_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32287-7",
book-URL = "http://www.springerlink.com/content/978-3-642-32287-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Brennan:2012:ASC,
author = "Michael Brennan and Sadia Afroz and Rachel
Greenstadt",
title = "Adversarial stylometry: Circumventing authorship
recognition to preserve privacy and anonymity",
journal = j-TISSEC,
volume = "15",
number = "3",
pages = "12:1--12:??",
month = nov,
year = "2012",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2382448.2382450",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Nov 28 17:25:14 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "The use of stylometry, authorship recognition through
purely linguistic means, has contributed to literary,
historical, and criminal investigation breakthroughs.
Existing stylometry research assumes that authors have
not attempted to disguise their linguistic writing
style. We challenge this basic assumption of existing
stylometry methodologies and present a new area of
research: adversarial stylometry. Adversaries have a
devastating effect on the robustness of existing
classification methods. Our work presents a framework
for creating adversarial passages including
obfuscation, where a subject attempts to hide her
identity, and imitation, where a subject attempts to
frame another subject by imitating his writing style,
and translation where original passages are obfuscated
with machine translation services. This research
demonstrates that manual circumvention methods work
very well while automated translation methods are not
effective. The obfuscation method reduces the
techniques' effectiveness to the level of random
guessing and the imitation attempts succeed up to 67\%
of the time depending on the stylometry technique used.
These results are more significant given the fact that
experimental subjects were unfamiliar with stylometry,
were not professional writers, and spent little time on
the attacks. This article also contributes to the field
by using human subjects to empirically validate the
claim of high accuracy for four current techniques
(without adversaries). We have also compiled and
released two corpora of adversarial stylometry texts to
promote research in this field with a total of 57
unique authors. We argue that this field is important
to a multidisciplinary approach to privacy, security,
and anonymity.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Brooks:2012:QCE,
author = "M. Brooks",
title = "Quantum cash and the end of counterfeiting",
journal = j-IEEE-SPECTRUM,
volume = "49",
number = "6",
pages = "58--59",
month = jun,
year = "2012",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2012.6203970",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Encryption; fake bills; fundamental particles;
high-tech inks; holograms; holography; National banks;
Online banking; paper; paper money; Particle
measurements; Photonics; printing presses; public key
cryptography; quantum cash; Quantum computing; quantum
cryptography; Quantum mechanics; quantum physicists;
watermarking; watermarks",
}
@Article{Broustis:2012:GAN,
author = "Ioannis Broustis and Ganapathy S. Sundaram and Harish
Viswanathan",
title = "Group Authentication: a New Paradigm for Emerging
Applications",
journal = j-BELL-LABS-TECH-J,
volume = "17",
number = "3",
pages = "157--173",
month = dec,
year = "2012",
CODEN = "BLTJFD",
DOI = "https://doi.org/10.1002/bltj.21566",
ISSN = "1089-7089 (print), 1538-7305 (electronic)",
ISSN-L = "1089-7089",
bibdate = "Thu Mar 7 07:32:06 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bstj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Bell Labs Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
onlinedate = "27 Dec 2012",
}
@Article{Brumley:2012:SFI,
author = "Billy Bob Brumley",
title = "Secure and Fast Implementations of Two Involution
Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7127",
pages = "269--282",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27937-9_19",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:40 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27937-9_19/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27937-9",
book-URL = "http://www.springerlink.com/content/978-3-642-27937-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Caballero-Gil:2012:LAR,
author = "C. Caballero-Gil and P. Caballero-Gil and A.
Peinado-Dom{\'\i}nguez and J. Molina-Gil",
title = "Lightweight Authentication for {RFID} Used in
{VANETs}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6928",
pages = "493--500",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27579-1_64",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Dec 24 07:14:13 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-27579-1_64",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27579-1",
book-URL = "http://www.springerlink.com/content/978-3-642-27579-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Camenisch:2012:EAA,
author = "Jan Camenisch and Thomas Gro{\ss}",
title = "Efficient Attributes for Anonymous Credentials",
journal = j-TISSEC,
volume = "15",
number = "1",
pages = "4:1--4:??",
month = mar,
year = "2012",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2133375.2133379",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Sat Mar 24 09:45:43 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "We extend the Camenisch-Lysyanskaya anonymous
credential system such that selective disclosure of
attributes becomes highly efficient. The resulting
system significantly improves upon existing approaches,
which suffer from a linear number of modular
exponentiations in the total number of attributes. This
limitation makes them unfit for many practical
applications, such as electronic identity cards. Our
novel approach can incorporate a large number of binary
and finite-set attributes without significant
performance impact. It compresses all such attributes
into a single attribute base and, thus, boosts the
efficiency of all proofs of possession. The core idea
is to encode discrete binary and finite-set values as
prime numbers. We then use the divisibility property
for efficient proofs of their presence or absence. In
addition, we contribute efficient methods for
conjunctions and disjunctions. The system builds on the
strong RSA assumption. We demonstrate the aptness of
our method in realistic application scenarios, notably
electronic identity cards, and show its advantages for
small devices, such as smartcards and cell phones.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Cao:2012:ITM,
author = "Zhen Cao and Hui Deng and Zhi Guan and Zhong Chen",
title = "Information-theoretic modeling of false data filtering
schemes in wireless sensor networks",
journal = j-TOSN,
volume = "8",
number = "2",
pages = "14:1--14:??",
month = mar,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2140522.2140527",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Fri Apr 6 18:38:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "False data filtering schemes are designed to filter
out false data injected by malicious sensors; they keep
the network immune to bogus event reports. Theoretic
understanding of false data filtering schemes and
guidelines to further improve their designs are still
lacking. This article first presents an
information-theoretic model of false data filtering
schemes. From the information-theoretic view, we define
the scheme's filtering capacity C$_{F i}$ as the
uncertainty-reduction ratio of the target input
variable, given the output. This metric not only
performs better than existing metrics but also implies
that only by optimizing the false negative rate and
false positive rate simultaneously, can we promote a
scheme's overall performance. Based on the
investigation from the modeling efforts, we propose
HiFi, a hybrid authentication-based false data
filtering scheme. HiFi leverages the benefits of both
symmetric and asymmetric cryptography and achieves a
high filtering capacity, as well as low computation and
communication overhead. Performance analysis
demonstrates that our proposed metric is rational and
useful, and that HiFi is effective and energy
efficient.",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Cao:2012:SRH,
author = "Jin Cao and Hui Li and Maode Ma and Yueyu Zhang and
Chengzhe Lai",
title = "A simple and robust handover authentication between
{HeNB} and {eNB} in {LTE} networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "56",
number = "8",
pages = "2119--2131",
day = "24",
month = may,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2012.02.012",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Fri May 18 08:27:51 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S138912861200076X",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Carota:2012:FFI,
author = "Serenella Carota and Flavio Corradini and Damiano
Falcioni and Maria Laura Maggiulli",
title = "{FedCohesion}: Federated Identity Management in the
{Marche} Region",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7452",
pages = "112--124",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32701-8_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32701-8_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32701-8",
book-URL = "http://www.springerlink.com/content/978-3-642-32701-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Cevallos:2012:USR,
author = "Alfonso Cevallos and Serge Fehr and Rafail Ostrovsky
and Yuval Rabani",
title = "Unconditionally-Secure Robust Secret Sharing with
Compact Shares",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "195--208",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_12;
https://doi.org/10.1007/978-3-642-29011-4_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-29011-4_12;
http://link.springer.com/chapter/10.1007/978-3-642-29011-4_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chadha:2012:AVE,
author = "Rohit Chadha and {\c{S}}tefan Ciob{\^a}c{\u{a}} and
Steve Kremer",
title = "Automated Verification of Equivalence Properties of
Cryptographic Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7211",
pages = "108--127",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28869-2_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:23 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28869-2_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28869-2",
book-URL = "http://www.springerlink.com/content/978-3-642-28869-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chang:2012:GBP,
author = "Ting-Yi Chang and Cheng-Jung Tsai and Jyun-Hao Lin",
title = "A graphical-based password keystroke dynamic
authentication system for touch screen handheld mobile
devices",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "5",
pages = "1157--1165",
month = may,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.12.044",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 27 06:33:47 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211003256",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chang:2012:PRS,
author = "Shih-Ying Chang and Yue-Hsun Lin and Hung-Min Sun and
Mu-En Wu",
title = "Practical {RSA} signature scheme based on periodical
rekeying for wireless sensor networks",
journal = j-TOSN,
volume = "8",
number = "2",
pages = "13:1--13:??",
month = mar,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2140522.2140526",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Fri Apr 6 18:38:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Broadcast is an efficient communication channel on
wireless sensor networks. Through authentic broadcast,
deployed sensors can perform legitimate actions issued
by a base station. According to previous literature, a
complete solution for authentic broadcast is digital
signature based on asymmetric cryptography. However,
asymmetric cryptography utilizes expensive operations,
which result in computational bottlenecks. Among these
cryptosystems, Elliptic Curve Cryptography (ECC) seems
to be the most efficient and the most popular choice.
Unfortunately, signature verification in ECC is not
efficient enough. In this article, we propose an
authentic broadcast scheme based on RSA. Unlike
conventional approaches, the proposed scheme adopts
short moduli to enhance performance. Meanwhile, the
weakness of short moduli can be fixed with rekeying
strategies. To minimize the rekeying overhead, a
Multi-Modulus RSA generation algorithm, which can
reduce communication overhead by 50\%, is proposed. We
implemented the proposed scheme on MICAz. On 512-bit
moduli, each verification spends at most 0.077 seconds,
which is highly competitive with other public-key
cryptosystems.",
acknowledgement = ack-nhfb,
articleno = "13",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@TechReport{Chang:2012:TRR,
author = "S.-j. Chang and R. Perlner and W. E. Burr and M. S.
Turan and J. M. Kelsey and S. Paul and L. E. Bassham",
title = "Third-Round Report of the {SHA-3} Cryptographic Hash
Algorithm Competition",
type = "Report",
institution = pub-NIST,
address = pub-NIST:adr,
year = "2012",
bibdate = "Tue Mar 18 10:58:02 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@Article{Che:2012:WAM,
author = "Xiangjiu Che and Zhanheng Gao",
title = "Watermarking algorithm for {$3$D} mesh based on
multi-scale radial basis functions",
journal = j-INT-J-PAR-EMER-DIST-SYS,
volume = "27",
number = "2",
pages = "133--141",
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1080/17445760.2011.574631",
ISSN = "1744-5760 (print), 1744-5779 (electronic)",
ISSN-L = "1744-5760",
bibdate = "Sun Nov 4 10:46:56 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjparemerdistsys.bib;
http://www.tandfonline.com/toc/gpaa20/27/2",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Parallel, Emergent and
Distributed Systems: IJPEDS",
journal-URL = "http://www.tandfonline.com/loi/gpaa20",
onlinedate = "03 Oct 2011",
}
@Article{Chen:2012:AIB,
author = "Yu Chen and Zongyang Zhang and Dongdai Lin and Zhenfu
Cao",
title = "Anonymous Identity-Based Hash Proof System and Its
Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7496",
pages = "143--160",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33272-2_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33272-2_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33272-2",
book-URL = "http://www.springerlink.com/content/978-3-642-33272-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chen:2012:CKS,
author = "Zhenhua Chen and Chunying Wu and Daoshun Wang and
Shundong Li",
title = "Conjunctive Keywords Searchable Encryption with
Efficient Pairing, Constant Ciphertext and Short
Trapdoor",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7299",
pages = "176--189",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-30428-6_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:19:32 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012d.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-30428-6_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-30428-6",
book-URL = "http://www.springerlink.com/content/978-3-642-30428-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chen:2012:DCC,
author = "Jian Chen and Jeffrey S. Rosenthal",
title = "Decrypting classical cipher text using {Markov} chain
{Monte Carlo}",
journal = j-STAT-COMPUT,
volume = "22",
number = "2",
pages = "397--413",
month = mar,
year = "2012",
CODEN = "STACE3",
DOI = "https://doi.org/10.1007/s11222-011-9232-5",
ISSN = "0960-3174 (print), 1573-1375 (electronic)",
ISSN-L = "0960-3174",
bibdate = "Sat Jan 31 12:22:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/statcomput.bib",
URL = "http://link.springer.com/article/10.1007/s11222-011-9232-5",
acknowledgement = ack-nhfb,
fjournal = "Statistics and Computing",
journal-URL = "http://link.springer.com/journal/11222",
}
@Article{Chen:2012:FAA,
author = "Yuanmi Chen and Phong Q. Nguyen",
title = "Faster Algorithms for Approximate Common Divisors:
Breaking Fully-Homomorphic-Encryption Challenges over
the Integers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "502--519",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_29;
https://doi.org/10.1007/978-3-642-29011-4_30",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-29011-4_29;
http://link.springer.com/chapter/10.1007/978-3-642-29011-4_30/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chen:2012:FSD,
author = "Cheng Chen and Zhenfeng Zhang and Dengguo Feng",
title = "Fully Secure Doubly-Spatial Encryption under Simple
Assumptions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7496",
pages = "253--263",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33272-2_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33272-2_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33272-2",
book-URL = "http://www.springerlink.com/content/978-3-642-33272-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chen:2012:IBE,
author = "Yu Chen and Zongyang Zhang and Dongdai Lin and Zhenfu
Cao",
title = "Identity-Based Extractable Hash Proofs and Their
Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7341",
pages = "153--170",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31284-7_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31284-7_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31284-7",
book-URL = "http://www.springerlink.com/content/978-3-642-31284-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chen:2012:IDC,
author = "Jiazhe Chen and Meiqin Wang and Bart Preneel",
title = "Impossible Differential Cryptanalysis of the
Lightweight Block Ciphers {TEA}, {XTEA} and {HIGHT}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7374",
pages = "117--137",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31410-0_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31410-0_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31410-0",
book-URL = "http://www.springerlink.com/content/978-3-642-31410-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chen:2012:NCB,
author = "Yu Chen and Song Luo and Jianbin Hu and Zhong Chen",
title = "A Novel Commutative Blinding Identity Based Encryption
Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6888",
pages = "73--89",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27901-0_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:19:37 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27901-0_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27901-0",
book-URL = "http://www.springerlink.com/content/978-3-642-27901-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chen:2012:SRF,
author = "Fan Chen and Hongjie He and Yaoran Huo and Hongxia
Wang",
title = "Self-recovery Fragile Watermarking Scheme with
Variable Watermark Payload",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "142--155",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Cheng:2012:PAI,
author = "Pengqi Cheng and Yan Gu and Zihong Lv and Jianfei Wang
and Wenlei Zhu and Zhen Chen and Jiwei Huang",
title = "A Performance Analysis of Identity-Based Encryption
Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7222",
pages = "289--303",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32298-3_19",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:17:56 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32298-3_19/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32298-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32298-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chiasson:2012:MWB,
author = "Sonia Chiasson and Chris Deschamps",
title = "The {MVP} {Web}-Based Authentication Framework",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7397",
pages = "16--24",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32946-3_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32946-3_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32946-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32946-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chien:2012:IAM,
author = "Hung-Yu Chien",
title = "Improved Anonymous Multi-receiver Identity-Based
Encryption",
journal = j-COMP-J,
volume = "55",
number = "4",
pages = "439--446",
month = apr,
year = "2012",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr086",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Mar 27 18:19:58 MDT 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/55/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "See comment on insecurity \cite{Wang:2014:IIA}.",
URL = "http://comjnl.oxfordjournals.org/content/55/4/439.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 15, 2011",
}
@Article{Chmiel:2012:EPC,
author = "Krzysztof Chmiel and Anna Grocholewska-Czurylo and
Janusz Stoklosa",
title = "Evaluation of {PP-1} Cipher Resistance against
Differential and Linear Cryptanalysis in Comparison to
a {DES}-like Cipher",
journal = j-FUND-INFO,
volume = "114",
number = "3--4",
pages = "239--269",
month = aug,
year = "2012",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2012-627",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:14:51 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Cho:2012:CBF,
author = "Jung-Sik Cho and Young-Sik Jeong and Sang Oh Park",
title = "Consideration on the Brute-force Attack Cost and
Retrieval Cost: a Hash-based radio-frequency
identification ({RFID}) {Tag Mutual Authentication
Protocol}",
journal = j-COMPUT-MATH-APPL,
volume = "69",
number = "1",
pages = "58--65",
month = jan,
year = "2012",
CODEN = "CMAPDK",
DOI = "https://doi.org/10.1016/j.camwa.2012.02.025",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 01 07:38:57 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "See cryptanalysis \cite{Safkhani:2014:CCA}.",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122112001393",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Choi:2012:LTF,
author = "Seung Geol Choi and Hoeteck Wee",
title = "Lossy trapdoor functions from homomorphic reproducible
encryption",
journal = j-INFO-PROC-LETT,
volume = "112",
number = "20",
pages = "794--798",
day = "31",
month = oct,
year = "2012",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2012.07.012",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri Aug 3 09:47:38 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019012002001",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Chow:2012:EPV,
author = "Yang-Wai Chow and Willy Susilo and Duncan S. Wong",
title = "Enhancing the Perceived Visual Quality of a Size
Invariant Visual Cryptography Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7618",
pages = "10--21",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34129-8_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:56 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34129-8_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34129-8",
book-URL = "http://www.springerlink.com/content/978-3-642-34129-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chung:2012:CBI,
author = "Yu-Fang Chung and Zhen-Yu Wu",
title = "Casting Ballots over {Internet} Connection Against
Bribery and Coercion",
journal = j-COMP-J,
volume = "55",
number = "10",
pages = "1169--1179",
month = oct,
year = "2012",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxs003",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Oct 26 08:44:19 MDT 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/55/10.toc;
https://www.math.utah.edu/pub/tex/bib/comp2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/55/10/1169.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "February 5, 2012",
}
@Misc{Clark:2012:RLA,
author = "Liat Clark and Ian Steadman",
title = "The Rich Legacy of {Alan Turing}",
howpublished = "Wired UK Web site.",
day = "18",
month = jun,
year = "2012",
bibdate = "Wed Jun 20 10:22:53 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.wired.com/wiredscience/2012/06/alan-turing-legacy/",
acknowledgement = ack-nhfb,
keywords = "Delilah telephone encoder/decoder; Fibonacci sequence;
Manchester Mark 1; morphogenesis; MOSAIC (Ministry of
Supply Automatic Integrator and Computer); National
Physical Laboratory (NPL); Naval Bombe; Pilot ACE
(Automatic Computing Engine); SIGSALY telephone
encoder/decoder; speech encryption; Turbochamp
(computer chess); Turing machine",
remark = "From the article: ``Alan Turing [in 1943] had
developed the Naval Bombe, an adaptation of his
decryption Bombe device capable of laying bare the
secrets of the complex German Naval Enigma. Churchill
would later comment that Turing had made the single
biggest contribution to Allied victory in the war.''",
}
@Article{Clear:2012:CPA,
author = "Michael Clear and Karl Reid and Desmond Ennis and
Arthur Hughes and Hitesh Tewari",
title = "Collaboration-Preserving Authenticated Encryption for
Operational Transformation Systems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7483",
pages = "204--223",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33383-5_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33383-5_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33383-5",
book-URL = "http://www.springerlink.com/content/978-3-642-33383-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Constantin:2012:RSN,
author = "Lucian Constantin",
title = "Researchers set new cryptanalysis world record for
pairing-based cryptography",
journal = j-NETWORK-WORLD,
day = "19",
month = jun,
year = "2012",
ISSN = "0887-7661 (print), 1944-7655 (electronic)",
ISSN-L = "0887-7661",
bibdate = "Sat Jun 23 12:09:08 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.networkworld.com/news/2012/061912-researchers-set-new-cryptanalysis-world-260338.html",
abstract = "Researchers from Fujitsu Laboratories, Japan's
National Institute of Information and Communications
Technology (NICT) and Kyushu University have set a new
cryptanalysis world record by cracking a 278-digit-long
(923-bit) key used in a pairing-based cryptography
system, Japanese IT services provider Fujitsu said
Monday.\par
The cryptanalysts who worked on this project cracked
the 923-bit encryption key in 148.2 days by using 21
computers with a total of 252 cores. It had been
previously estimated that pairing-based cryptography of
this length would require several hundred thousand
years to break, the researchers said.",
acknowledgement = ack-nhfb,
fjournal = "Network World",
}
@Article{Cordeiro:2012:IMB,
author = "Weverton Luis da Costa Cordeiro and Fl{\'a}vio Roberto
Santos and Gustavo Huff Mauch and Marinho Pilla
Barcelos and Luciano Paschoal Gaspary",
title = "Identity management based on adaptive puzzles to
protect {P2P} systems from {Sybil} attacks",
journal = j-COMP-NET-AMSTERDAM,
volume = "56",
number = "11",
pages = "2569--2589",
day = "31",
month = jul,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2012.03.026",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Fri Jun 29 12:23:11 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128612001417",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Coron:2012:PKC,
author = "Jean-S{\'e}bastien Coron and David Naccache and Mehdi
Tibouchi",
title = "Public Key Compression and Modulus Switching for Fully
Homomorphic Encryption over the Integers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "446--464",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_26;
https://doi.org/10.1007/978-3-642-29011-4_27",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-29011-4_26;
http://link.springer.com/chapter/10.1007/978-3-642-29011-4_27/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Courtland:2012:VCG,
author = "Rachel Courtland",
title = "Virtual currency gets real",
journal = j-IEEE-SPECTRUM,
volume = "49",
number = "6",
pages = "52--53",
month = jun,
year = "2012",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2012.6204182",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Cryptography; Currency; Digital systems; Exchange
rates; Government policies; Online banking; Privacy",
}
@Article{Coutinho:2012:RPT,
author = "S. C. Coutinho",
title = "Review of {{\booktitle{Primality Testing and Integer
Factorization in Public Key Cryptography}} by Song Y.
Yan}",
journal = j-SIGACT,
volume = "43",
number = "2",
pages = "33--35",
month = jun,
year = "2012",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2261417.2261426",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Nov 6 17:32:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Dacosta:2012:OTC,
author = "Italo Dacosta and Saurabh Chakradeo and Mustaque
Ahamad and Patrick Traynor",
title = "One-time cookies: Preventing session hijacking attacks
with stateless authentication tokens",
journal = j-TOIT,
volume = "12",
number = "1",
pages = "1:1--1:??",
month = jun,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2220352.2220353",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Jul 10 18:01:14 MDT 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
abstract = "HTTP cookies are the de facto mechanism for session
authentication in Web applications. However, their
inherent security weaknesses allow attacks against the
integrity of Web sessions. HTTPS is often recommended
to protect cookies, but deploying full HTTPS support
can be challenging due to performance and financial
concerns, especially for highly distributed
applications. Moreover, cookies can be exposed in a
variety of ways even when HTTPS is enabled. In this
article, we propose one-time cookies (OTC), a more
robust alternative for session authentication. OTC
prevents attacks such as session hijacking by signing
each user request with a session secret securely stored
in the browser. Unlike other proposed solutions, OTC
does not require expensive state synchronization in the
Web application, making it easily deployable in highly
distributed systems. We implemented OTC as a plug-in
for the popular WordPress platform and as an extension
for Firefox and Firefox for mobile browsers. Our
extensive experimental analysis shows that OTC
introduces a latency of less than 6 ms when compared to
cookies --- a negligible overhead for most Web
applications. Moreover, we show that OTC can be
combined with HTTPS to effectively add another layer of
security to Web applications. In so doing, we
demonstrate that one-time cookies can significantly
improve the security of Web applications with minimal
impact on performance and scalability.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Das:2012:DPB,
author = "Ashok Kumar Das and Pranay Sharma and Santanu
Chatterjee and Jamuna Kanta Sing",
title = "A dynamic password-based user authentication scheme
for hierarchical wireless sensor networks",
journal = j-J-NETW-COMPUT-APPL,
volume = "35",
number = "5",
pages = "1646--1656",
month = sep,
year = "2012",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:23 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804512000926",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Dautrich:2012:SLU,
author = "Jonathan L. Dautrich and Chinya V. Ravishankar",
title = "Security Limitations of Using Secret Sharing for Data
Outsourcing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7371",
pages = "145--160",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31540-4_12",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:06 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31540-4_12/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31540-4",
book-URL = "http://www.springerlink.com/content/978-3-642-31540-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{David:2012:PRE,
author = "C. David and J. Wu",
title = "Pseudoprime Reductions of Elliptic Curves",
journal = j-CAN-J-MATH,
volume = "64",
number = "1",
pages = "81--101",
month = feb,
year = "2012",
CODEN = "CJMAAB",
DOI = "https://doi.org/10.4153/CJM-2011-044-x",
ISSN = "0008-414X (print), 1496-4279 (electronic)",
ISSN-L = "0008-414X",
bibdate = "Sat Feb 4 10:03:45 MST 2012",
bibsource = "http://cms.math.ca/cjm/v64/;
https://www.math.utah.edu/pub/tex/bib/canjmath2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Let $E$ be an elliptic curve over $ \mathbb Q$ without
complex multiplication, and for each prime $p$ of good
reduction, let $ n_E(p) = | E(\mathbb F_p) |$. For any
integer $b$, we consider elliptic pseudoprimes to the
base $b$. More precisely, let $ Q_{E, b}(x)$ be the
number of primes $ p \leq x$ such that $ b^{n_E(p)}
\equiv b \, ({\rm mod} \, n_E(p))$, and let $ \pi_{E,
b}^{\operatorname {pseu}}(x)$ be the number of
compositive $ n_E(p)$ such that $ b^{n_E(p)} \equiv b
\, ({\rm mod} \, n_E(p))$ (also called elliptic curve
pseudoprimes). Motivated by cryptography applications,
we address the problem of finding upper bounds for $
Q_{E, b}(x)$ and $ \pi_{E, b}^{\operatorname
{pseu}}(x)$, generalising some of the literature for
the classical pseudoprimes to this new setting.",
acknowledgement = ack-nhfb,
fjournal = "Canadian Journal of Mathematics = Journal canadien de
math{\'e}matiques",
journal-URL = "http://cms.math.ca/cjm/",
}
@Article{David:2012:UCO,
author = "Bernardo Machado David and Anderson C. A. Nascimento",
title = "Universally Composable Oblivious Transfer from Lossy
Encryption and the {McEliece} Assumptions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7412",
pages = "80--99",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32284-6_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:00 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32284-6_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32284-6",
book-URL = "http://www.springerlink.com/content/978-3-642-32284-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{delRey:2012:EDI,
author = "A. Mart{\'\i}n del Rey and G. Rodr{\'\i}guez
S{\'a}nchez and A. de la Villa Cuenca",
title = "Encrypting Digital Images Using Cellular Automata",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7209",
pages = "78--88",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28931-6_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28931-6_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28931-6",
book-URL = "http://www.springerlink.com/content/978-3-642-28931-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Demme:2012:SCV,
author = "John Demme and Robert Martin and Adam Waksman and
Simha Sethumadhavan",
title = "Side-channel vulnerability factor: a metric for
measuring information leakage",
journal = j-COMP-ARCH-NEWS,
volume = "40",
number = "3",
pages = "106--117",
month = jun,
year = "2012",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/2366231.2337172",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Thu Sep 6 10:21:07 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "ISCA '12 conference proceedings.",
abstract = "There have been many attacks that exploit side-effects
of program execution to expose secret information and
many proposed countermeasures to protect against these
attacks. However there is currently no systematic,
holistic methodology for understanding information
leakage. As a result, it is not well known how design
decisions affect information leakage or the
vulnerability of systems to side-channel attacks. In
this paper, we propose a metric for measuring
information leakage called the Side-channel
Vulnerability Factor (SVF). SVF is based on our
observation that all side-channel attacks ranging from
physical to microarchitectural to software rely on
recognizing leaked execution patterns. SVF quantifies
patterns in attackers' observations and measures their
correlation to the victim's actual execution patterns
and in doing so captures systems' vulnerability to
side-channel attacks. In a detailed case study of
on-chip memory systems, SVF measurements help expose
unexpected vulnerabilities in whole-system designs and
shows how designers can make performance-security
trade-offs. Thus, SVF provides a quantitative approach
to secure computer architecture.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Deng:2012:VIA,
author = "Aidong Deng and Jianeng Tang and Li Zhao and Cairong
Zou",
title = "The variable-interval arithmetic coding using
asymptotic deterministic randomness for data
compression and encryption",
journal = j-J-STAT-COMPUT-SIMUL,
volume = "82",
number = "10",
pages = "1545--1555",
year = "2012",
CODEN = "JSCSAJ",
DOI = "https://doi.org/10.1080/00949655.2011.587423",
ISSN = "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
ISSN-L = "0094-9655",
bibdate = "Tue Apr 22 09:13:07 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Statistical Computation and Simulation",
journal-URL = "http://www.tandfonline.com/loi/gscs20",
}
@Article{Diem:2012:UES,
author = "Claus Diem",
title = "On the use of expansion series for stream ciphers",
journal = j-LMS-J-COMPUT-MATH,
volume = "15",
pages = "326--340",
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1112/S146115701200109X",
ISSN = "1461-1570",
bibdate = "Mon Nov 5 05:57:20 MST 2012",
bibsource = "http://journals.cambridge.org/action/displayJournal?jid=JCM;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lms-j-comput-math.bib",
acknowledgement = ack-nhfb,
ajournal = "LMS J. Comput. Math.",
fjournal = "LMS Journal of Computation and Mathematics",
journal-URL = "http://journals.cambridge.org/action/displayJournal?jid=JCM",
onlinedate = "24 September 2012",
}
@Article{Ding:2012:CLS,
author = "Lin Ding and Jie Guan",
title = "Cryptanalysis of {Loiss} Stream Cipher",
journal = j-COMP-J,
volume = "55",
number = "10",
pages = "1192--1201",
month = oct,
year = "2012",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxs047",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Oct 26 08:44:19 MDT 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/55/10.toc;
https://www.math.utah.edu/pub/tex/bib/comp2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/55/10/1192.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "May 21, 2012",
}
@Article{Ding:2012:NRR,
author = "L. Ding and J. Guan and W.-l. Sun",
title = "New Results of Related-key Attacks on All {Py}-Family
of Stream Ciphers",
journal = j-J-UCS,
volume = "18",
number = "12",
pages = "1741--??",
month = "????",
year = "2012",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Nov 8 12:03:11 MST 2012",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_18_12/new_results_of_related",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Diong:2012:DAU,
author = "Mouhamadou L. Diong and Patrick Bas and Chlo{\'e}
Pelle and Wadih Sawaya",
title = "Document Authentication Using {$2$D} Codes: Maximizing
the Decoding Performance Using Statistical Inference",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7394",
pages = "39--54",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32805-3_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32805-3_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32805-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32805-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Djebbar:2012:ASB,
author = "Fatiha Djebbar and Beghdad Ayad",
title = "Audio Steganalysis Based on Lossless Data-Compression
Techniques",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7618",
pages = "1--9",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34129-8_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:56 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34129-8_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34129-8",
book-URL = "http://www.springerlink.com/content/978-3-642-34129-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Dodis:2012:MAR,
author = "Yevgeniy Dodis and Eike Kiltz and Krzysztof Pietrzak
and Daniel Wichs",
title = "Message Authentication, Revisited",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "355--374",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_21;
https://doi.org/10.1007/978-3-642-29011-4_22",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-29011-4_21;
http://link.springer.com/chapter/10.1007/978-3-642-29011-4_22/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Dolev:2012:ATC,
author = "Shlomi Dolev and Marina Kopeetsky",
title = "Anonymous transactions in computer networks",
journal = j-TAAS,
volume = "7",
number = "2",
pages = "26:1--26:??",
month = jul,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2240166.2240176",
ISSN = "1556-4665 (print), 1556-4703 (electronic)",
ISSN-L = "1556-4665",
bibdate = "Tue Nov 6 19:20:32 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/taas.bib",
abstract = "We present schemes for providing anonymous
transactions while privacy and anonymity are preserved,
providing user's anonymous authentication in
distributed networks such as the Internet. We first
present a practical scheme for anonymous transactions
while the transaction resolution is assisted by a
Trusted Authority. This practical scheme is extended to
a theoretical scheme where a Trusted Authority is not
involved in the transaction resolution. Both schemes
assume that all the players interact over anonymous
secure channels. Given authority that generates for
each player hard to produce evidence EVID (e.g.,
problem instance with or without a solution) to each
player, the identity of a user U is defined by the
ability to prove possession of aforementioned evidence.
We use zero-knowledge proof techniques to repeatedly
identify U by providing a proof that U has evidence
EVID, without revealing EVID, therefore avoiding
identity theft. In both schemes the authority provides
each user with a unique random string. A player U may
produce a unique user name and password for each other
player S using a one-way function over the random
string and the IP address of S. The player does not
have to maintain any information in order to reproduce
the user name and password used for accessing a player
S. Moreover, the player U may execute transactions with
a group of players S$^U$ in two phases; in the first
phase the player interacts with each server without
revealing information concerning its identity and
without possibly identifying linkability among the
servers in S$^U$. In the second phase the player allows
linkability and therefore transaction commitment with
all servers in S$^U$, while preserving anonymity (for
future transactions).",
acknowledgement = ack-nhfb,
articleno = "26",
fjournal = "ACM Transactions on Autonomous and Adaptive Systems
(TAAS)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1010",
}
@Article{Domnitser:2012:NMC,
author = "Leonid Domnitser and Aamer Jaleel and Jason Loew and
Nael Abu-Ghazaleh and Dmitry Ponomarev",
title = "Non-monopolizable caches: Low-complexity mitigation of
cache side channel attacks",
journal = j-TACO,
volume = "8",
number = "4",
pages = "35:1--35:??",
month = jan,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2086696.2086714",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Sat Jan 21 07:49:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
abstract = "We propose a flexibly-partitioned cache design that
either drastically weakens or completely eliminates
cache-based side channel attacks. The proposed
Non-Monopolizable (NoMo) cache dynamically reserves
cache lines for active threads and prevents other
co-executing threads from evicting reserved lines.
Unreserved lines remain available for dynamic sharing
among threads. NoMo requires only simple modifications
to the cache replacement logic, making it
straightforward to adopt. It requires no software
support enabling it to automatically protect
pre-existing binaries. NoMo results in performance
degradation of about 1\% on average. We demonstrate
that NoMo can provide strong security guarantees for
the AES and Blowfish encryption algorithms.",
acknowledgement = ack-nhfb,
articleno = "35",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Dong:2012:KKD,
author = "Le Dong and Wenling Wu and Shuang Wu and Jian Zou",
title = "Known-Key Distinguisher on Round-Reduced {$3$D} Block
Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7115",
pages = "55--69",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27890-7_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:29 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27890-7_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27890-7",
book-URL = "http://www.springerlink.com/content/978-3-642-27890-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Dong:2012:NCV,
author = "Deshuai Dong and Longjiang Qu and Shaojing Fu and Chao
Li",
title = "New Constructions of Vectorial {Boolean} Functions
with Good Cryptographic Properties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "3",
pages = "749--??",
month = apr,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500086",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:16:05 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dong:2012:NDI,
author = "Huanhe Dong and Xiangrong Wang and Wencai Zhao",
title = "A new $4$-dimensional implicit vector-form loop
algebra with arbitrary constants and the corresponding
computing formula of constant $ \gamma $ in the
{Variation} identity",
journal = j-APPL-MATH-COMP,
volume = "218",
number = "22",
pages = "10998--11008",
day = "15",
month = jul,
year = "2012",
CODEN = "AMHCBQ",
DOI = "https://doi.org/10.1016/j.amc.2012.04.061",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jun 25 12:18:46 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00963003",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300312004602",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Dong:2012:UAS,
author = "Qi Dong and Donggang Liu",
title = "Using Auxiliary Sensors for Pairwise Key Establishment
in {WSN}",
journal = j-TECS,
volume = "11",
number = "3",
pages = "59:1--59:??",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2345770.2345771",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Oct 22 10:44:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Many techniques have been developed recently for
establishing pairwise keys in sensor networks. However,
some of them are vulnerable to a few compromised sensor
nodes, while others could involve expensive protocols
for establishing keys. This article introduces a much
better alternative that can achieve both high
resilience to node compromises and high efficiency in
key establishment. The main idea is to deploy a small
number of additional sensor nodes, called assisting
nodes, to help key establishment between sensor nodes.
The proposed approach has many advantages over existing
approaches. In particular, a sensor node only needs to
make a few local communications and perform a few
efficient hash operations to setup a key with any other
sensor node in the network at a very high probability.
The majority of sensor nodes only need to store a
single key. Besides, it also provides high resilience
to node compromises. The theoretical analysis,
simulation studies, and experiments on TelosB sensor
motes also demonstrate the advantages of this key
establishment protocol in sensor networks.",
acknowledgement = ack-nhfb,
articleno = "59",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
}
@Article{Dorn:2012:ECE,
author = "Michael Dorn and Peter Wackersreuther and Christian
B{\"o}hm",
title = "Efficient Comparison of Encrypted Biometric
Templates",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7449",
pages = "129--142",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32287-7_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32287-7_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32287-7",
book-URL = "http://www.springerlink.com/content/978-3-642-32287-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Doss:2012:MDA,
author = "Robin Doss and Wanlei Zhou and Saravanan Sundaresan
and Shui Yu and Longxiang Gao",
title = "A minimum disclosure approach to authentication and
privacy in {RFID} systems",
journal = j-COMP-NET-AMSTERDAM,
volume = "56",
number = "15",
pages = "3401--3416",
day = "15",
month = oct,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2012.06.018",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Thu Sep 6 10:36:22 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128612002447",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Drosou:2012:SAH,
author = "Anastasios Drosou and Dimosthenis Ioannidis and
Konstantinos Moustakas and Dimitrios Tzovaras",
title = "Spatiotemporal analysis of human activities for
biometric authentication",
journal = j-COMP-VIS-IMAGE-UNDERSTANDING,
volume = "116",
number = "3",
pages = "411--421",
month = mar,
year = "2012",
CODEN = "CVIUF4",
DOI = "https://doi.org/10.1016/j.cviu.2011.08.009",
ISSN = "1077-3142 (print), 1090-235X (electronic)",
ISSN-L = "1077-3142",
bibdate = "Wed Mar 7 19:09:52 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
http://www.sciencedirect.com/science/journal/10773142",
URL = "http://www.sciencedirect.com/science/article/pii/S1077314211002098",
acknowledgement = ack-nhfb,
fjournal = "Computer Vision and Image Understanding: CVIU",
journal-URL = "http://www.sciencedirect.com/science/journal/10773142",
}
@Article{Duncan:2012:CAI,
author = "Christian A. Duncan and Vir V. Phoha",
title = "On the Complexity of Aggregating Information for
Authentication and Profiling",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7122",
pages = "58--71",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28879-1_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28879-1_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28879-1",
book-URL = "http://www.springerlink.com/content/978-3-642-28879-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Dunkelman:2012:MCE,
author = "Orr Dunkelman and Nathan Keller and Adi Shamir",
title = "Minimalism in Cryptography: The {Even--Mansour} Scheme
Revisited",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "336--354",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_20;
https://doi.org/10.1007/978-3-642-29011-4_21",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-29011-4_20;
http://link.springer.com/chapter/10.1007/978-3-642-29011-4_21/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Dunkelman:2012:MEK,
author = "Orr Dunkelman",
title = "From Multiple Encryption to Knapsacks --- Efficient
Dissection of Composite Problems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7668",
pages = "16--16",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34931-7_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-34931-7_2",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34931-7",
book-URL = "http://www.springerlink.com/content/978-3-642-34931-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Eisenbarth:2012:CIP,
author = "Thomas Eisenbarth and Zheng Gong and Tim G{\"u}neysu
and Stefan Heyse and Sebastiaan Indesteege",
title = "Compact Implementation and Performance Evaluation of
Block Ciphers in {ATtiny} Devices",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7374",
pages = "172--187",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31410-0_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31410-0_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31410-0",
book-URL = "http://www.springerlink.com/content/978-3-642-31410-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ekberg:2012:AEP,
author = "Jan-Erik Ekberg and Alexandra Afanasyeva and N.
Asokan",
title = "Authenticated Encryption Primitives for
Size-Constrained Trusted Computing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7344",
pages = "1--18",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-30921-2_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:31 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-30921-2_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-30921-2",
book-URL = "http://www.springerlink.com/content/978-3-642-30921-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{ElBansarkhani:2012:ELB,
author = "Rachid {El Bansarkhani} and Mohammed Meziani",
title = "An Efficient Lattice-Based Secret Sharing
Construction",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7322",
pages = "160--168",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-30955-7_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:02 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-30955-7_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-30955-7",
book-URL = "http://www.springerlink.com/content/978-3-642-30955-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Engels:2012:HLA,
author = "Daniel Engels and Markku-Juhani O. Saarinen and Peter
Schweitzer",
title = "The {Hummingbird-$2$} Lightweight Authenticated
Encryption Algorithm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7055",
pages = "19--31",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25286-0_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:19 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-25286-0_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-25286-0",
book-URL = "http://www.springerlink.com/content/978-3-642-25286-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Erguler:2012:PAI,
author = "Imran Erguler and Emin Anarim",
title = "Practical attacks and improvements to an efficient
radio frequency identification authentication
protocol",
journal = j-CCPE,
volume = "24",
number = "17",
pages = "2069--2080",
day = "10",
month = dec,
year = "2012",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.1838",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Nov 5 07:44:57 MST 2012",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "2 Oct 2011",
}
@Article{Everett:2012:EC,
author = "Bernard Everett",
title = "The encryption conundrum",
journal = j-NETWORK-SECURITY,
volume = "2012",
number = "4",
pages = "15--18",
month = apr,
year = "2012",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(12)70027-2",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485812700272",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@InProceedings{Fahl:2012:WEM,
author = "Sascha Fahl and Marian Harbach and Thomas Muders and
Lars Baumg{\"a}rtner and Bernd Freisleben and Matthew
Smith",
editor = "????",
booktitle = "{ACM Conference on Computer and Communications
Security}",
title = "Why {Eve} and {Mallory} love {Android}: An analysis of
{Android SSL} (in)security",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "50--61",
year = "2012",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:59:36 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference ]{Schneier:2015:SWC}.",
}
@Article{Fang:2012:CCS,
author = "Liming Fang and Willy Susilo and Chunpeng Ge and
Jiandong Wang",
title = "Chosen-ciphertext secure anonymous conditional proxy
re-encryption with keyword search",
journal = j-THEOR-COMP-SCI,
volume = "462",
number = "1",
pages = "39--58",
day = "30",
month = nov,
year = "2012",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2012.08.017",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Oct 24 08:35:00 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397512007906",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Fanyang:2012:SAK,
author = "Fanyang and Naixue Xiong and Jong Hyuk Park",
title = "A self-adaptive {$K$} selection mechanism for
re-authentication load balancing in large-scale
systems",
journal = j-J-SUPERCOMPUTING,
volume = "61",
number = "1",
pages = "166--188",
month = jul,
year = "2012",
CODEN = "JOSUED",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Fri Oct 26 07:41:32 MDT 2012",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=61&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=61&issue=1&spage=166",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Farras:2012:LTM,
author = "Oriol Farr{\`a}s and Ignacio Gracia and Sebasti{\`a}
Mart{\'\i}n and Carles Padr{\'o}",
title = "Linear threshold multisecret sharing schemes",
journal = j-INFO-PROC-LETT,
volume = "112",
number = "17--18",
pages = "667--673",
day = "30",
month = sep,
year = "2012",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2012.05.008",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri Jul 6 11:52:37 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019012001378",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Faust:2012:PLR,
author = "Sebastian Faust and Krzysztof Pietrzak and Joachim
Schipper",
title = "Practical Leakage-Resilient Symmetric Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7428",
pages = "213--232",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33027-8_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33027-8_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33027-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33027-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fei:2012:GTK,
author = "Han Fei and Qin Jing and Zhao Huawei and Hu Jiankun",
title = "A General Transformation from {KP-ABE} to Searchable
Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7672",
pages = "165--178",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35362-8_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35362-8_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35362-8",
book-URL = "http://www.springerlink.com/content/978-3-642-35362-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Feng:2012:CAO,
author = "Hui Feng and Hefei Ling and Fuhao Zou and Weiqi Yan
and Zhengding Lu",
title = "A collusion attack optimization strategy for digital
fingerprinting",
journal = j-TOMCCAP,
volume = "8",
number = "2S",
pages = "36:1--36:??",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2344436.2344442",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Nov 6 18:13:05 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Collusion attack is a cost-efficient attack for
digital fingerprinting. In this article, we propose a
novel collusion attack strategy, Iterative Optimization
Collusion Attack (IOCA), which is based upon the
gradient attack and the principle of informed watermark
embedding. We evaluate the performance of the proposed
collusion attack strategy in defeating four typical
fingerprinting schemes under a well-constructed
evaluation framework. The simulation results show that
the proposed strategy performs more effectively than
the gradient attack, and adopting no more than three
fingerprinted copies can sufficiently collapse examined
fingerprinting schemes. Meanwhile, the content resulted
from the proposed attack still preserves high
perceptual quality.",
acknowledgement = ack-nhfb,
articleno = "36",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Feng:2012:USD,
author = "XiaoXiao Feng and Koichi Matsumoto and Shigeo
Sugimoto",
title = "Uncovering the Secrets of {Daoism} {{\em Fus}} Using
Digital {Dao-Fa Hui-Yuan}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7634",
pages = "1--10",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34752-8_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:16 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34752-8_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34752-8",
book-URL = "http://www.springerlink.com/content/978-3-642-34752-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fernandez-Mir:2012:SRA,
author = "Albert Fern{\`a}ndez-Mir and Rolando Trujillo-Rasua",
title = "A Scalable {RFID} Authentication Protocol Supporting
Ownership Transfer and Controlled Delegation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7055",
pages = "147--162",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25286-0_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:19 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-25286-0_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-25286-0",
book-URL = "http://www.springerlink.com/content/978-3-642-25286-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fleischmann:2012:MFA,
author = "Ewan Fleischmann and Christian Forler and Stefan
Lucks",
title = "{McOE}: a Family of Almost Foolproof On-Line
Authenticated Encryption Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7549",
pages = "196--215",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34047-5_12",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:44 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34047-5_12/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34047-5",
book-URL = "http://www.springerlink.com/content/978-3-642-34047-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fokkink:2012:TCG,
author = "Robbert Fokkink",
title = "Tossing Coins to Guess a Secret Number",
journal = j-AMER-MATH-MONTHLY,
volume = "119",
number = "4",
pages = "337--339",
month = apr,
year = "2012",
CODEN = "AMMYAE",
DOI = "https://doi.org/10.4169/amer.math.monthly.119.04.337",
ISSN = "0002-9890 (print), 1930-0972 (electronic)",
ISSN-L = "0002-9890",
bibdate = "Thu Nov 8 07:34:14 MST 2012",
bibsource = "http://www.jstor.org/journals/00029890.html;
http://www.jstor.org/stable/10.4169/amermathmont.119.issue-4;
https://www.math.utah.edu/pub/tex/bib/amermathmonthly2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.jstor.org/stable/pdfplus/10.4169/amer.math.monthly.119.04.337.pdf",
acknowledgement = ack-nhfb,
fjournal = "American Mathematical Monthly",
journal-URL = "https://www.jstor.org/journals/00029890.htm",
}
@Article{Forler:2012:DAC,
author = "Christian Forler and Stefan Lucks and Jakob Wenzel",
title = "Designing the {API} for a Cryptographic Library",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7308",
pages = "75--88",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-30598-6_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:19:45 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-30598-6_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-30598-6",
book-URL = "http://www.springerlink.com/content/978-3-642-30598-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fraczek:2012:MSI,
author = "W. Fraczek and W. Mazurczyk and K. Szczypiorski",
title = "Multilevel Steganography: Improving Hidden
Communication in Networks",
journal = j-J-UCS,
volume = "18",
number = "14",
pages = "1967--??",
month = "????",
year = "2012",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Nov 8 12:03:13 MST 2012",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_18_14/multilevel_steganography_improving_hidden",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Fridrich:2012:MTS,
author = "Jessica Fridrich",
title = "Modern Trends in Steganography and Steganalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "1--1",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-32205-1_1",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fu:2012:EHA,
author = "Anmin Fu and Yuqing Zhang and Zhenchao Zhu and Qi Jing
and Jingyu Feng",
title = "An efficient handover authentication scheme with
privacy preservation for {IEEE} 802.16m network",
journal = j-COMPUT-SECUR,
volume = "31",
number = "6",
pages = "741--749",
month = sep,
year = "2012",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:29 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404812001009",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Fujioka:2012:SEI,
author = "Atsushi Fujioka and Taiichi Saito and Keita Xagawa",
title = "Security Enhancement of Identity-Based Identification
with Reversibility",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7618",
pages = "202--213",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34129-8_18",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:56 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34129-8_18/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34129-8",
book-URL = "http://www.springerlink.com/content/978-3-642-34129-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fujioka:2012:SEP,
author = "Atsushi Fujioka and Taiichi Saito and Keita Xagawa",
title = "Security Enhancements by {OR}-Proof in Identity-Based
Identification",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7341",
pages = "135--152",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31284-7_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31284-7_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31284-7",
book-URL = "http://www.springerlink.com/content/978-3-642-31284-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fujioka:2012:SHI,
author = "Atsushi Fujioka and Taiichi Saito and Keita Xagawa",
title = "Secure Hierarchical Identity-Based Identification
without Random Oracles",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7483",
pages = "258--273",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33383-5_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33383-5_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33383-5",
book-URL = "http://www.springerlink.com/content/978-3-642-33383-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gagne:2012:AVB,
author = "Martin Gagn{\'e} and Pascal Lafourcade and Yassine
Lakhnech and Reihaneh Safavi-Naini",
title = "Automated Verification of Block Cipher Modes of
Operation, an Improved Method",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6888",
pages = "23--31",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27901-0_3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:19:37 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27901-0_3/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27901-0",
book-URL = "http://www.springerlink.com/content/978-3-642-27901-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gao:2012:DES,
author = "Chong-zhi Gao and Dongqing Xie and Baodian Wei",
title = "Deniable Encryptions Secure against Adaptive Chosen
Ciphertext Attack",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7232",
pages = "46--62",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29101-2_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:09 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29101-2_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29101-2",
book-URL = "http://www.springerlink.com/content/978-3-642-29101-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gao:2012:RHC,
author = "Xifeng Gao and Caiming Zhang and Yan Huang and Zhigang
Deng",
title = "A robust high-capacity affine-transformation-invariant
scheme for watermarking {$3$D} geometric models",
journal = j-TOMCCAP,
volume = "8",
number = "2S",
pages = "34:1--34:??",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2344436.2344440",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Nov 6 18:13:05 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "In this article we propose a novel, robust, and
high-capacity watermarking method for 3D meshes with
arbitrary connectivities in the spatial domain based on
affine invariants. Given a 3D mesh model, a watermark
is embedded as affine-invariant length ratios of one
diagonal segment to the residing diagonal intersected
by the other one in a coplanar convex quadrilateral. In
the extraction process, a watermark is recovered by
combining all the watermark pieces embedded in length
ratios through majority voting. Extensive experimental
results demonstrate the robustness, high computational
efficiency, high capacity, and
affine-transformation-invariant characteristics of the
proposed approach.",
acknowledgement = ack-nhfb,
articleno = "34",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Garcia:2012:ERP,
author = "Sergio Sanchez Garcia and Ana Gomez Oliva and Emilia
Perez-Belleboni",
title = "Is {Europe} Ready for a Pan-{European} Identity
Management System?",
journal = j-IEEE-SEC-PRIV,
volume = "10",
number = "4",
pages = "44--49",
month = jul # "\slash " # aug,
year = "2012",
DOI = "https://doi.org/10.1109/MSP.2012.58",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Aug 29 17:25:32 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Gaspar:2012:SEF,
author = "Lubos Gaspar and Viktor Fischer and Lilian Bossuet and
Robert Fouquet",
title = "Secure Extension of {FPGA} General Purpose Processors
for Symmetric Key Cryptography with Partial
Reconfiguration Capabilities",
journal = j-TRETS,
volume = "5",
number = "3",
pages = "16:1--16:??",
month = oct,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2362374.2362380",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Tue Nov 6 18:07:44 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
abstract = "In data security systems, general purpose processors
(GPPs) are often extended by a cryptographic
accelerator. The article presents three ways of
extending GPPs for symmetric key cryptography
applications. Proposed extensions guarantee secure key
storage and management even if the system is facing
protocol, software and cache memory attacks. The system
is partitioned into processor, cipher, and key memory
zones. The three security zones are separated at
protocol, system, architecture and physical levels. The
proposed principle was validated on Altera NIOS II,
Xilinx MicroBlaze and Microsemi Cortex M1 soft-core
processor extensions. We show that stringent separation
of the cipher zone is helpful for partial
reconfiguration of the security module, if the
enciphering algorithm needs to be dynamically changed.
However, the key zone including reconfiguration
controller must remain static in order to maintain the
high level of security required. We demonstrate that
the principle is feasible in partially reconfigurable
field programmable gate arrays (FPGAs) such as Altera
Stratix V or Xilinx Virtex 6 and also to some extent in
FPGAs featuring hardwired general purpose processors
such as Cortex M3 in Microsemi SmartFusion FPGA.
Although the three GPPs feature different data
interfaces, we show that the processors with their
extensions reach the required high security level while
maintaining partial reconfiguration capability.",
acknowledgement = ack-nhfb,
articleno = "16",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
}
@Article{Gazi:2012:EOS,
author = "Peter Ga{\v{z}}i and Stefano Tessaro",
title = "Efficient and Optimally Secure Key-Length Extension
for Block Ciphers via Randomized Cascading",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "63--80",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29011-4_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gentry:2012:FHE,
author = "Craig Gentry and Shai Halevi and Nigel P. Smart",
title = "Fully Homomorphic Encryption with Polylog Overhead",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "465--482",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_27;
https://doi.org/10.1007/978-3-642-29011-4_28",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-29011-4_27;
http://link.springer.com/chapter/10.1007/978-3-642-29011-4_28/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gentry:2012:RSB,
author = "Craig Gentry and Shai Halevi and Chris Peikert and
Nigel P. Smart",
title = "Ring Switching in {BGV}-Style Homomorphic Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7485",
pages = "19--37",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32928-9_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:35 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32928-9_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32928-9",
book-URL = "http://www.springerlink.com/content/978-3-642-32928-9",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Georgiev:2012:MDC,
author = "Martin Georgiev and Subodh Iyengar and Suman Jana and
Rishita Anubhai and Dan Boneh and Vitaly Shmatikov",
editor = "????",
booktitle = "{ACM Conference on Computer and Communications
Security}",
title = "The most dangerous code in the world: Validating {SSL}
certificates in non-browser software",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "??--??",
year = "2012",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 12:03:58 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 38]{Schneier:2015:SWC}.",
}
@Article{Gibson-Robinson:2012:AAL,
author = "Thomas Gibson-Robinson and Gavin Lowe",
title = "Analysing Applications Layered on Unilaterally
Authenticating Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7140",
pages = "164--181",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29420-4_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:55 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29420-4_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29420-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29420-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gierlichs:2012:ICD,
author = "Benedikt Gierlichs and J{\"o}rn-Marc Schmidt and
Michael Tunstall",
title = "Infective Computation and Dummy Rounds: Fault
Protection for Block Ciphers without
Check-before-Output",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7533",
pages = "305--321",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33481-8_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33481-8_17/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33481-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33481-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gligor:2012:SLT,
author = "Virgil Gligor",
title = "Street-Level Trust Semantics for Attribute
Authentication (Transcript of Discussion)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7622",
pages = "116--125",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35694-0_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35694-0_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35694-0",
book-URL = "http://www.springerlink.com/content/978-3-642-35694-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Godor:2012:HBM,
author = "Gy{\H{o}}z{\H{o}} G{\'o}dor and S{\'a}ndor Imre",
title = "Hash-Based Mutual Authentication Protocol for Low-Cost
{RFID} Systems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7479",
pages = "76--87",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32808-4_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32808-4_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32808-4",
book-URL = "http://www.springerlink.com/content/978-3-642-32808-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gong:2012:KNF,
author = "Zheng Gong and Svetla Nikova and Yee Wei Law",
title = "{KLEIN}: a New Family of Lightweight Block Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7055",
pages = "1--18",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25286-0_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:19 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-25286-0_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-25286-0",
book-URL = "http://www.springerlink.com/content/978-3-642-25286-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gonzalez-Pardo:2012:CID,
author = "Antonio Gonz{\'a}lez-Pardo and Pablo Varona and David
Camacho and Francisco de Borja Rodriguez Ortiz",
title = "Communication by identity discrimination in
bio-inspired multi-agent systems",
journal = j-CCPE,
volume = "24",
number = "6",
pages = "589--603",
month = "????",
year = "2012",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.1866",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Wed Apr 4 09:18:01 MDT 2012",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Prac\-tice and
Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "12 Oct 2011",
}
@Misc{Goodin:2012:CBS,
author = "Dan Goodin",
title = "Crypto breakthrough shows {Flame} was designed by
world-class scientists: The spy malware achieved an
attack unlike any cryptographers have seen before",
howpublished = "Web document.",
day = "7",
month = jun,
year = "2012",
bibdate = "Fri Sep 19 11:38:24 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://arstechnica.com/security/2012/06/flame-crypto-breakthrough/",
acknowledgement = ack-nhfb,
remark = "The article describes how a chosen plaintext combined
with a forced collision on the MD5 checksum algorithm
was used to create fraudulent digital signatures that
allowed the attackers to inject hostile malware into
the Microsoft Windows update system.",
}
@Article{Goodrich:2012:EVW,
author = "Michael T. Goodrich and Charalampos Papamanthou and
Duy Nguyen and Roberto Tamassia and Cristina Videira
Lopes and Olga Ohrimenko and Nikos Triandopoulos",
title = "Efficient verification of web-content searching
through authenticated web crawlers",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "920--931",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "We consider the problem of verifying the correctness
and completeness of the result of a keyword search. We
introduce the concept of an authenticated web crawler
and present its design and prototype implementation. An
authenticated web crawler is a trusted program that
computes a specially-crafted signature over the web
contents it visits. This signature enables (i) the
verification of common Internet queries on web pages,
such as conjunctive keyword searches---this guarantees
that the output of a conjunctive keyword search is
correct and complete; (ii) the verification of the
content returned by such Internet queries---this
guarantees that web data is authentic and has not been
maliciously altered since the computation of the
signature by the crawler. In our solution, the search
engine returns a cryptographic proof of the query
result. Both the proof size and the verification time
are proportional only to the sizes of the query
description and the query result, but do not depend on
the number or sizes of the web pages over which the
search is performed. As we experimentally demonstrate,
the prototype implementation of our system provides a
low communication overhead between the search engine
and the user, and fast verification of the returned
results by the user.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
}
@Article{Gorawski:2012:EAS,
author = "Marcin Gorawski and Michal Lorek and Michal Gorawski",
title = "Encrypted Adaptive Storage Model --- Analysis and
Performance Tests",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7449",
pages = "118--128",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32287-7_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32287-7_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32287-7",
book-URL = "http://www.springerlink.com/content/978-3-642-32287-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gorbunov:2012:FEB,
author = "Sergey Gorbunov and Vinod Vaikuntanathan and Hoeteck
Wee",
title = "Functional Encryption with Bounded Collusions via
Multi-party Computation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7417",
pages = "162--179",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32009-5_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:07 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32009-5_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32009-5",
book-URL = "http://www.springerlink.com/content/978-3-642-32009-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gouvea:2012:HSI,
author = "Conrado P. L. Gouv{\^e}a and Julio L{\'o}pez",
title = "High Speed Implementation of Authenticated Encryption
for the {MSP430X} Microcontroller",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7533",
pages = "288--304",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33481-8_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33481-8_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33481-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33481-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Grossschadl:2012:EJI,
author = "Johann Gro{\ss}sch{\"a}dl and Dan Page and Stefan
Tillich",
title = "Efficient {Java} Implementation of Elliptic Curve
Cryptography for {J2ME}-Enabled Mobile Devices",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7322",
pages = "189--207",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-30955-7_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:02 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-30955-7_17/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-30955-7",
book-URL = "http://www.springerlink.com/content/978-3-642-30955-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Groth:2012:NTN,
author = "Jens Groth and Rafail Ostrovsky and Amit Sahai",
title = "New Techniques for Noninteractive Zero-Knowledge",
journal = j-J-ACM,
volume = "59",
number = "3",
pages = "11:1--11:??",
month = jun,
year = "2012",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/2220357.2220358",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Mon Jul 9 16:30:52 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "Noninteractive zero-knowledge (NIZK) proof systems are
fundamental primitives used in many cryptographic
constructions, including public-key encryption secure
against chosen ciphertext attack, digital signatures,
and various other cryptographic protocols. We introduce
new techniques for constructing NIZK proofs based on
groups with a bilinear map. Compared to previous
constructions of NIZK proofs, our techniques yield
dramatic reduction in the length of the common
reference string (proportional to security parameter)
and the size of the proofs (proportional to security
parameter times the circuit size). Our novel techniques
allow us to answer several long-standing open questions
in the theory of noninteractive proofs. We construct
the first perfect NIZK argument system for all NP. We
construct the first universally composable NIZK
argument for all NP in the presence of an adaptive
adversary. We construct a non-interactive zap for all
NP, which is the first that is based on a standard
cryptographic security assumption.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Guo:2012:AKE,
author = "Yanfei Guo and Zhenfeng Zhang",
title = "Authenticated Key Exchange with Entities from
Different Settings and Varied Groups",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7496",
pages = "276--287",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33272-2_18",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33272-2_18/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33272-2",
book-URL = "http://www.springerlink.com/content/978-3-642-33272-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Guo:2012:EBP,
author = "Lifeng Guo and Lei Hu",
title = "Efficient bidirectional proxy re-encryption with
direct chosen-ciphertext security",
journal = j-COMPUT-MATH-APPL,
volume = "63",
number = "1",
pages = "151--157",
month = jan,
year = "2012",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:51:03 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122111009680",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Guo:2012:ETD,
author = "Teng Guo and Feng Liu and ChuanKun Wu",
title = "On the Equivalence of Two Definitions of Visual
Cryptography Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7232",
pages = "217--227",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29101-2_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:09 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29101-2_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29101-2",
book-URL = "http://www.springerlink.com/content/978-3-642-29101-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gupta:2012:CDF,
author = "Swati Gupta and Seongho Cho and C.-C. Jay Kuo",
title = "Current Developments and Future Trends in Audio
Authentication",
journal = j-IEEE-MULTIMEDIA,
volume = "19",
number = "1",
pages = "50--59",
month = jan # "\slash " # mar,
year = "2012",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2011.74",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Thu Mar 1 14:21:05 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
}
@Article{Hamamreh:2012:RPA,
author = "Rushdi Hamamreh",
title = "Routing path authentication in link-state routing
protocols",
journal = j-NETWORK-SECURITY,
volume = "2012",
number = "5",
pages = "14--20",
month = may,
year = "2012",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(12)70037-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485812700375",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Han:2012:ERI,
author = "Qi Han and Yinghui Zhang and Xiaofeng Chen and Hui Li
and Jiaxiang Quan",
title = "Efficient and Robust Identity-Based Handoff
Authentication in Wireless Networks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7645",
pages = "180--191",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34601-9_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:17:59 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34601-9_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34601-9",
book-URL = "http://www.springerlink.com/content/978-3-642-34601-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Han:2012:MIA,
author = "Fengling Han and Ron van Schyndel",
title = "{M}-Identity and Its Authentication Protocol for
Secure Mobile Commerce Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7672",
pages = "1--10",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35362-8_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35362-8_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35362-8",
book-URL = "http://www.springerlink.com/content/978-3-642-35362-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Han:2012:PPD,
author = "Jinguang Han and Willy Susilo and Yi Mu and Jun Yan",
title = "Privacy-Preserving Decentralized Key-Policy
Attribute-Based Encryption",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "23",
number = "11",
pages = "2150--2162",
month = nov,
year = "2012",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2012.50",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Oct 22 08:15:38 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Book{Hanyok:2012:EHH,
author = "Robert J. Hanyok",
title = "Eavesdropping on {Hell}: historical guide to {Western}
communications intelligence and the {Holocaust},
1939--1945",
publisher = pub-DOVER,
address = pub-DOVER:adr,
edition = "Second",
pages = "xxi + 196",
year = "2012",
ISBN = "0-486-48127-1",
ISBN-13 = "978-0-486-48127-2",
LCCN = "D810.C88 H36 2012",
bibdate = "Thu Dec 28 09:30:45 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://catdir.loc.gov/catdir/enhancements/fy1108/2011011467-d.html;
http://www.loc.gov/catdir/enhancements/fy1318/2011011467-t.html",
acknowledgement = ack-nhfb,
remark = "Originally published: Fort Meade, Md. : Center for
Cryptologic History, National Security Agency, 2005.
With new pref.",
subject = "World War, 1939--1945; Cryptography; Eavesdropping;
United States; Great Britain; Holocaust, Jewish
(1939--1945); Confidential communications; Germany;
Military intelligence; Electronic intelligence",
tableofcontents = "Background \\
The context of European and Nazi anti-Semitism \\
Overview of the Western Communications Intelligence
System During World War II \\
Step 1: setting the requirements, priorities, and
divisions of effort \\
Step 2: intercepting the messages \\
Step 3: Processing the intercept \\
Step 4: Disseminating the COMINT \\
From intercept to decryption \\
The story of one German police message \\
Selected Topics of the Holocaust \\
The general course of the Holocaust and the Allied
COMINT \\
Jewish refugees, the Holocaust, and the growing strife
in Palestine \\
The Vichy regime and the Jews \\
The destruction of Hungary's Jews, 1944 \\
Japan and the Jews in the Far East \\
Nazi gold: national and personal assets looted by Nazis
and placed in Swiss banks, 1943 \\
1945: Some Observations about Western Communications
Intelligence and the Holocaust \\
What was known from Western COMINT \\
When the COMINT agencies knew about the Holocaust",
}
@Article{Hao:2012:SAM,
author = "Feng Hao and Dylan Clarke",
title = "Security Analysis of a Multi-factor Authenticated Key
Exchange Protocol",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7341",
pages = "1--11",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31284-7_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31284-7_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31284-7",
book-URL = "http://www.springerlink.com/content/978-3-642-31284-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{He:2012:ECT,
author = "Debiao He and Sahadeo Padhye and Jianhua Chen",
title = "An efficient certificateless two-party authenticated
key agreement protocol",
journal = j-COMPUT-MATH-APPL,
volume = "64",
number = "6",
pages = "1914--1926",
month = sep,
year = "2012",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:51:13 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122112002490",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@InProceedings{Heninger:2012:MYP,
author = "Nadia Heninger and Zakir Durumeric and Eric Wustrow
and J. Alex Halderman",
editor = "????",
booktitle = "{Proceedings of the 21st USENIX Security Symposium,
August 2012}",
title = "Mining Your {Ps} and {Qs}: Detection of Widespread
Weak Keys in Network Devices",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "205--220",
year = "2012",
DOI = "https://doi.org/10.5555/2362793.2362828",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Sun Nov 30 07:40:33 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://dl.acm.org/doi/10.5555/2362793.2362828;
https://factorable.net/paper.html;
https://factorable.net/weakkeys12.conference.pdf;
https://factorable.net/weakkeys12.extended.pdf",
abstract = "RSA and DSA can fail catastrophically when used with
malfunctioning random number generators, but the extent
to which these problems arise in practice has never
been comprehensively studied at Internet scale. We
perform the largest ever network survey of TLS and SSH
servers and present evidence that vulnerable keys are
surprisingly widespread. We find that 0.75\% of TLS
certificates share keys due to insufficient entropy
during key generation, and we suspect that another
1.70\% come from the same faulty implementations and
may be susceptible to compromise. Even more alarmingly,
we are able to obtain RSA private keys for 0.50\% of
TLS hosts and 0.03\% of SSH hosts, because their public
keys shared nontrivial common factors due to entropy
problems, and DSA private keys for 1.03\% of SSH hosts,
because of insufficient signature randomness. We
cluster and investigate the vulnerable hosts, finding
that the vast majority appear to be headless or
embedded devices. In experiments with three software
components commonly used by these devices, we are able
to reproduce the vulnerabilities and identify specific
software behaviors that induce them, including a
boot-time entropy hole in the Linux random number
generator. Finally, we suggest defenses and draw
lessons for developers, users, and the security
community.",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 42]{Schneier:2015:SWC}.",
xxpages = "1--16",
}
@Article{Herbert:2012:SMP,
author = "Matthias Herbert and Tobias Thieme and Jan Zibuschka
and Heiko Ro{\ss}nagel",
title = "Secure Mashup-Providing Platforms --- Implementing
Encrypted Wiring",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7059",
pages = "99--108",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27997-3_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27997-3_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27997-3",
book-URL = "http://www.springerlink.com/content/978-3-642-27997-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hernandez-Castro:2012:AFH,
author = "Julio Cesar Hernandez-Castro and Pedro Peris-Lopez and
Masoumeh Safkhani and Nasour Bagheri",
title = "Another Fallen Hash-Based {RFID} Authentication
Protocol",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7322",
pages = "29--37",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-30955-7_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:02 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-30955-7_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-30955-7",
book-URL = "http://www.springerlink.com/content/978-3-642-30955-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hernandez-Castro:2012:MTA,
author = "Julio Cesar Hernandez-Castro and Juan Manuel
Estevez-Tapiador and Pedro Peris-Lopez and John A.
Clark and El-Ghazali Talbi",
title = "Metaheuristic Traceability Attack Against {SLMAP}, an
{RFID} Lightweight Authentication Protocol",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "543--553",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400278",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Herzberg:2012:TJA,
author = "Amir Herzberg and Ronen Margulies",
title = "Training {Johnny} to Authenticate (Safely)",
journal = j-IEEE-SEC-PRIV,
volume = "10",
number = "1",
pages = "37--45",
month = jan # "\slash " # feb,
year = "2012",
DOI = "https://doi.org/10.1109/MSP.2011.129",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Feb 15 12:40:29 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Hess:2012:GJC,
author = "Florian Hess",
title = "Generalised {Jacobians} in Cryptography and Coding
Theory",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7369",
pages = "1--15",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31662-3_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:04 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31662-3_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31662-3",
book-URL = "http://www.springerlink.com/content/978-3-642-31662-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Heyse:2012:LEA,
author = "Stefan Heyse and Eike Kiltz and Vadim Lyubashevsky and
Christof Paar and Krzysztof Pietrzak",
title = "{Lapin}: An Efficient Authentication Protocol Based on
Ring-{LPN}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7549",
pages = "346--365",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34047-5_20",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:44 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34047-5_20/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34047-5",
book-URL = "http://www.springerlink.com/content/978-3-642-34047-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Heyse:2012:TOC,
author = "Stefan Heyse and Tim G{\"u}neysu",
title = "Towards One Cycle per Bit Asymmetric Encryption:
Code-Based Cryptography on Reconfigurable Hardware",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7428",
pages = "340--355",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33027-8_20",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33027-8_20/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33027-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33027-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hoang:2012:ESB,
author = "Viet Tung Hoang and Ben Morris and Phillip Rogaway",
title = "An Enciphering Scheme Based on a Card Shuffle",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7417",
pages = "1--13",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32009-5_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:07 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32009-5_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32009-5",
book-URL = "http://www.springerlink.com/content/978-3-642-32009-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hohenberger:2012:DDQ,
author = "Susan Hohenberger and Allison Lewko and Brent Waters",
title = "Detecting Dangerous Queries: a New Approach for Chosen
Ciphertext Security",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "663--681",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_38;
https://doi.org/10.1007/978-3-642-29011-4_39",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-29011-4_38;
http://link.springer.com/chapter/10.1007/978-3-642-29011-4_39/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Holbl:2012:ITP,
author = "Marko H{\"o}lbl and Tatjana Welzer and Bostjan
Brumen",
title = "An improved two-party identity-based authenticated key
agreement protocol using pairings",
journal = j-J-COMP-SYS-SCI,
volume = "78",
number = "1",
pages = "142--150",
month = jan,
year = "2012",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2011.01.002",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:18 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000011000031",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Hollings:2012:CCE,
author = "Christopher Hollings",
title = "{I, Claudius} and the cipher extraordinary",
journal = j-MATH-GAZ,
volume = "96",
number = "537",
pages = "466--470",
month = nov,
year = "2012",
CODEN = "MAGAAS",
DOI = "https://doi.org/10.1017/S002555720000509X",
ISSN = "0025-5572",
ISSN-L = "0025-5572",
bibdate = "Tue May 5 12:04:24 MDT 2015",
bibsource = "http://journals.cambridge.org/action/displayIssue?jid=MAG&volumeId=96&issueId=537;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/mathgaz2010.bib",
acknowledgement = ack-nhfb,
ajournal = "Math. Gaz.",
fjournal = "The Mathematical Gazette",
journal-URL = "http://journals.cambridge.org/action/displayBackIssues?jid=MAG",
}
@Article{Hore:2012:IED,
author = "Bijit Hore and Ee-Chien Chang and Mamadou H. Diallo
and Sharad Mehrotra",
title = "Indexing Encrypted Documents for Supporting Efficient
Keyword Search",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7482",
pages = "93--110",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32873-2_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:32 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32873-2_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32873-2",
book-URL = "http://www.springerlink.com/content/978-3-642-32873-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hore:2012:SMR,
author = "Bijit Hore and Sharad Mehrotra and Mustafa Canim and
Murat Kantarcioglu",
title = "Secure multidimensional range queries over outsourced
data",
journal = j-VLDB-J,
volume = "21",
number = "3",
pages = "333--358",
month = jun,
year = "2012",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-011-0245-7",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Tue Jun 26 17:39:07 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbj.bib",
abstract = "In this paper, we study the problem of supporting
multidimensional range queries on encrypted data. The
problem is motivated by secure data outsourcing
applications where a client may store his/her data on a
remote server in encrypted form and want to execute
queries using server's computational capabilities. The
solution approach is to compute a secure indexing tag
of the data by applying bucketization (a generic form
of data partitioning) which prevents the server from
learning exact values but still allows it to check if a
record satisfies the query predicate. Queries are
evaluated in an approximate manner where the returned
set of records may contain some false positives. These
records then need to be weeded out by the client which
comprises the computational overhead of our scheme. We
develop a bucketization procedure for answering
multidimensional range queries on multidimensional
data. For a given bucketization scheme, we derive cost
and disclosure-risk metrics that estimate client's
computational overhead and disclosure risk
respectively. Given a multidimensional dataset, its
bucketization is posed as an optimization problem where
the goal is to minimize the risk of disclosure while
keeping query cost (client's computational overhead)
below a certain user-specified threshold value. We
provide a tunable data bucketization algorithm that
allows the data owner to control the trade-off between
disclosure risk and cost. We also study the trade-off
characteristics through an extensive set of experiments
on real and synthetic data.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
}
@Article{Hsieh:2012:EHF,
author = "Wen-Bin Hsieh and Jenq-Shiou Leu",
title = "Exploiting hash functions to intensify the remote user
authentication scheme",
journal = j-COMPUT-SECUR,
volume = "31",
number = "6",
pages = "791--798",
month = sep,
year = "2012",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:29 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404812000910",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Hu:2012:VMS,
author = "Chunqiang Hu and Xiaofeng Liao and Xiuzhen Cheng",
title = "Verifiable multi-secret sharing based on {LFSR}
sequences",
journal = j-THEOR-COMP-SCI,
volume = "445",
number = "1",
pages = "52--62",
day = "3",
month = aug,
year = "2012",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2012.05.006",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jun 11 14:41:52 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397512004276",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Hwang:2012:ABA,
author = "Jung Yeon Hwang and Sungwook Eom and Ku-Young Chang
and Pil Joong Lee and DaeHun Nyang",
title = "Anonymity-Based Authenticated Key Agreement with Full
Binding Property",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7690",
pages = "177--191",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35416-8_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:58 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35416-8_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35416-8",
book-URL = "http://www.springerlink.com/content/978-3-642-35416-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hyla:2012:CBE,
author = "Tomasz Hyla and Jerzy Peja{\'s}",
title = "Certificate-Based Encryption Scheme with General
Access Structure",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7564",
pages = "41--55",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33260-9_3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:02 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012j.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33260-9_3/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33260-9",
book-URL = "http://www.springerlink.com/content/978-3-642-33260-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Isobe:2012:SAL,
author = "Takanori Isobe and Kyoji Shibutani",
title = "Security Analysis of the Lightweight Block Ciphers
{XTEA}, {LED} and {Piccolo}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7372",
pages = "71--86",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31448-3_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:08 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31448-3_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31448-3",
book-URL = "http://www.springerlink.com/content/978-3-642-31448-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Isobe:2012:SCL,
author = "Takanori Isobe and Toshihiro Ohigashi and Masakatu
Morii",
title = "Slide Cryptanalysis of Lightweight Stream Cipher
{RAKAPOSHI}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7631",
pages = "138--155",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34117-5_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:12 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34117-5_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34117-5",
book-URL = "http://www.springerlink.com/content/978-3-642-34117-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jain:2012:BAS,
author = "Anil K. Jain and Karthik Nandakumar",
title = "Biometric Authentication: System Security and User
Privacy",
journal = j-COMPUTER,
volume = "45",
number = "11",
pages = "87--92",
month = nov,
year = "2012",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2012.364",
ISSN = "0018-9162",
ISSN-L = "0018-9162",
bibdate = "Wed Nov 14 18:24:24 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Jajodia:2012:RET,
author = "Sushil Jajodia and Witold Litwin and Thomas Schwarz",
title = "Recoverable Encryption through Noised Secret over a
Large Cloud",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7450",
pages = "13--24",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32344-7_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:51 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32344-7_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32344-7",
book-URL = "http://www.springerlink.com/content/978-3-642-32344-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jakobsson:2012:AWD,
author = "Markus Jakobsson and Richard Chow and Jesus Molina",
title = "Authentication --- Are We Doing Well Enough?",
journal = j-IEEE-SEC-PRIV,
volume = "10",
number = "1",
pages = "19--21",
month = jan # "\slash " # feb,
year = "2012",
DOI = "https://doi.org/10.1109/MSP.2012.5",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Feb 15 12:40:29 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Jeong:2012:IKP,
author = "Kyung Chul Jeong and Dong Hoon Lee and Daewan Han",
title = "An Improved Known Plaintext Attack on {PKZIP}
Encryption Algorithm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7259",
pages = "235--247",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31912-9_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:40 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012d.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31912-9_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31912-9",
book-URL = "http://www.springerlink.com/content/978-3-642-31912-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jia:2012:PKD,
author = "Zhongtian Jia and Xiaodong Lin and Seng-Hua Tan and
Lixiang Li and Yixian Yang",
title = "Public key distribution scheme for delay tolerant
networks based on two-channel cryptography",
journal = j-J-NETW-COMPUT-APPL,
volume = "35",
number = "3",
pages = "905--913",
month = may,
year = "2012",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:17 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804511000634",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Jiang:2012:DCA,
author = "Xinghao Jiang and Tanfeng Sun and Yue Zhou and Yun Q.
Shi",
title = "A Drift Compensation Algorithm for {H.264\slash AVC}
Video Robust Watermarking Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "30--41",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jing:2012:MVB,
author = "Huiyun Jing and Xin He and Qi Han and Xiamu Niu",
title = "Motion Vector Based Information Hiding Algorithm for
{H.264\slash AVC} against Motion Vector Steganalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7197",
pages = "91--98",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28490-8_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:04 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28490-8_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28490-8",
book-URL = "http://www.springerlink.com/content/978-3-642-28490-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jovanovic:2012:FAL,
author = "Philipp Jovanovic and Martin Kreuzer and Ilia Polian",
title = "A Fault Attack on the {LED Block} Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7275",
pages = "120--134",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29912-4_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:19:00 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012d.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29912-4_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29912-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29912-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jun:2012:IIR,
author = "Jong Yun Jun and Kunho Kim and Jae-Pil Heo and
Sung-eui Yoon",
title = "{IRIW}: Image Retrieval Based Image Watermarking for
Large-Scale Image Databases",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "126--141",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_12",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_12/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kang:2012:AKM,
author = "Hyun-Sun Kang and Chang-Seop Park",
title = "An Authentication and Key Management Scheme for the
Proxy Mobile {IPv6}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7690",
pages = "144--160",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35416-8_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:58 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35416-8_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35416-8",
book-URL = "http://www.springerlink.com/content/978-3-642-35416-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Karafyllidis:2012:QGC,
author = "Ioannis G. Karafyllidis",
title = "Quantum Gate Circuit Model of Signal Integration in
Bacterial Quorum Sensing",
journal = j-TCBB,
volume = "9",
number = "2",
pages = "571--579",
month = mar,
year = "2012",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2011.104",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Thu Jan 26 16:30:44 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "Bacteria evolved cell to cell communication processes
to gain information about their environment and
regulate gene expression. Quorum sensing is such a
process in which signaling molecules, called
autoinducers, are produced, secreted and detected. In
several cases bacteria use more than one autoinducers
and integrate the information conveyed by them. It has
not yet been explained adequately why bacteria evolved
such signal integration circuits and what can learn
about their environments using more than one
autoinducers since all signaling pathways merge in one.
Here quantum information theory, which includes
classical information theory as a special case, is used
to construct a quantum gate circuit that reproduces
recent experimental results.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@Article{Kasamatsu:2012:TSE,
author = "Kohei Kasamatsu and Takahiro Matsuda and Keita Emura
and Nuttapong Attrapadung and Goichiro Hanaoka",
title = "Time-Specific Encryption from Forward-Secure
Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7485",
pages = "184--204",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32928-9_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:35 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32928-9_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32928-9",
book-URL = "http://www.springerlink.com/content/978-3-642-32928-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kasper:2012:SCA,
author = "Timo Kasper and David Oswald and Christof Paar",
title = "Side-Channel Analysis of Cryptographic {RFIDs} with
Analog Demodulation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7055",
pages = "61--77",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25286-0_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:19 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-25286-0_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-25286-0",
book-URL = "http://www.springerlink.com/content/978-3-642-25286-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Katz:2012:TSP,
author = "Jonathan Katz and Philip MacKenzie and Gelareh Taban
and Virgil Gligor",
title = "Two-server password-only authenticated key exchange",
journal = j-J-COMP-SYS-SCI,
volume = "78",
number = "2",
pages = "651--669",
month = mar,
year = "2012",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2011.09.005",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:18 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000011001048",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Kawachi:2012:SKE,
author = "Akinori Kawachi and Hirotoshi Takebe and Keisuke
Tanaka",
title = "Symmetric-Key Encryption Scheme with Multi-ciphertext
Non-malleability",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7631",
pages = "123--137",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34117-5_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:12 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34117-5_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34117-5",
book-URL = "http://www.springerlink.com/content/978-3-642-34117-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kawai:2012:SHS,
author = "Yutaka Kawai and Noboru Kunihiro",
title = "Secret Handshake Scheme with Request-Based-Revealing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7163",
pages = "1--16",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29804-2_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29804-2_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29804-2",
book-URL = "http://www.springerlink.com/content/978-3-642-29804-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kikuchi:2012:SSN,
author = "Ryo Kikuchi and Atsushi Fujioka and Yoshiaki Okamoto
and Taiichi Saito",
title = "Strong Security Notions for Timed-Release Public-Key
Encryption Revisited",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7259",
pages = "88--108",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31912-9_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:40 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012d.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31912-9_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31912-9",
book-URL = "http://www.springerlink.com/content/978-3-642-31912-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kim:2012:INS,
author = "Hwi-Gang Kim and Eun Jung Lee and Gang-Joon Yoon and
Sung-Dae Yang and Eui Chul Lee and Sang Min Yoon",
title = "Illumination Normalization for {SIFT} Based Finger
Vein Authentication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7432",
pages = "21--30",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33191-6_3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:26 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33191-6_3/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33191-6",
book-URL = "http://www.springerlink.com/content/978-3-642-33191-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kim:2012:SAH,
author = "Hyoungshick Kim and John Tang and Ross Anderson",
title = "Social Authentication: Harder Than It Looks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7397",
pages = "1--15",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32946-3_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32946-3_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32946-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32946-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kim:2012:SLT,
author = "Tiffany Hyun-Jin Kim and Virgil Gligor and Adrian
Perrig",
title = "Street-Level Trust Semantics for Attribute
Authentication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7622",
pages = "96--115",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35694-0_12",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35694-0_12/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35694-0",
book-URL = "http://www.springerlink.com/content/978-3-642-35694-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kim:2012:SSS,
author = "Cheonshik Kim and Dongkyoo Shin and Dongil Shin and
Ching-Nung Yang",
title = "A $ (2, 2) $ Secret Sharing Scheme Based on {Hamming}
Code and {AMBTC}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7197",
pages = "129--139",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28490-8_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:04 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28490-8_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28490-8",
book-URL = "http://www.springerlink.com/content/978-3-642-28490-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Klisowski:2012:CCP,
author = "Michal Klisowski and Vasyl Ustimenko",
title = "On the Comparison of Cryptographical Properties of Two
Different Families of Graphs with Large Cycle
Indicator",
journal = j-MATH-COMPUT-SCI,
volume = "6",
number = "2",
pages = "181--198",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "1661-8270 (print), 1661-8289 (electronic)",
ISSN-L = "1661-8270",
bibdate = "Tue Nov 6 10:16:25 MST 2012",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1661-8270&volume=6&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/math-comput-sci.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1661-8270&volume=6&issue=2&spage=181",
acknowledgement = ack-nhfb,
fjournal = "Mathematics in Computer Science",
journal-URL = "http://www.springerlink.com/content/1661-8270/",
}
@Article{Kocabas:2012:CPB,
author = "{\"U}nal Kocaba{\c{s}} and Andreas Peter and Stefan
Katzenbeisser and Ahmad-Reza Sadeghi",
title = "Converse {PUF}-Based Authentication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7344",
pages = "142--158",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-30921-2_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:31 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-30921-2_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-30921-2",
book-URL = "http://www.springerlink.com/content/978-3-642-30921-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Koeberl:2012:EPD,
author = "Patrick Koeberl and Jiangtao Li and Roel Maes and
Anand Rajan and Claire Vishik and Marcin W{\'o}jcik",
title = "Evaluation of a {PUF} Device Authentication Scheme on
a Discrete 0.13um {SRAM}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7222",
pages = "271--288",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32298-3_18",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:17:56 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32298-3_18/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32298-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32298-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kolesnikov:2012:LPP,
author = "Vladimir Kolesnikov and Abdullatif Shikfa",
title = "On The Limits of Privacy Provided by Order-Preserving
Encryption",
journal = j-BELL-LABS-TECH-J,
volume = "17",
number = "3",
pages = "135--146",
month = dec,
year = "2012",
CODEN = "BLTJFD",
DOI = "https://doi.org/10.1002/bltj.21564",
ISSN = "1089-7089 (print), 1538-7305 (electronic)",
ISSN-L = "1089-7089",
bibdate = "Thu Mar 7 07:32:06 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bstj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Bell Labs Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
onlinedate = "27 Dec 2012",
}
@Article{Kostinger:2012:SBL,
author = "Martin K{\"o}stinger and Peter M. Roth and Horst
Bischof",
title = "Synergy-Based Learning of Facial Identity",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7476",
pages = "195--204",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32717-9_20",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32717-9_20/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32717-9",
book-URL = "http://www.springerlink.com/content/978-3-642-32717-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Koyama:2012:NTD,
author = "Takuma Koyama and Lei Wang and Yu Sasaki and Kazuo
Sakiyama and Kazuo Ohta",
title = "New Truncated Differential Cryptanalysis on {$3$D}
Block Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7232",
pages = "109--125",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29101-2_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:09 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29101-2_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29101-2",
book-URL = "http://www.springerlink.com/content/978-3-642-29101-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Koz:2012:ASE,
author = "Alper Koz and Claude Delpha",
title = "Adaptive Selection of Embedding Locations for Spread
Spectrum Watermarking of Compressed Audio",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "97--110",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kraetzer:2012:PCS,
author = "Christian Kraetzer and Jana Dittmann",
title = "Plausibility Considerations on Steganalysis as a
Security Mechanism --- Discussions on the Example of
Audio Steganalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7228",
pages = "80--101",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31971-6_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:04 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31971-6_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31971-6",
book-URL = "http://www.springerlink.com/content/978-3-642-31971-6",
fjournal = "Lecture Notes in Computer Science",
}
@Book{Krantz:2012:EAM,
author = "Steven G. (Steven George) Krantz",
title = "Elements of advanced mathematics",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
edition = "Third",
pages = "xvi + 351",
year = "2012",
ISBN = "1-4398-9834-0 (hardcover)",
ISBN-13 = "978-1-4398-9834-5 (hardcover)",
LCCN = "QA37.3 .K73 2012",
bibdate = "Tue May 5 16:13:54 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/mathgaz2010.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://marc.crcnetbase.com/isbn/9781439898345",
abstract = "From the Preface to the Third Edition: On the whole,
we have retained the content and character of the first
two editions. But we have added material on point-set
topology (Chapter 8), on theoretical computer science
(Chapter 9), on the P/NP problem (Chapter 10), and on
zero-knowledge proofs and RSA encryption (Chapter 12).
The topology chapter of course builds on the existing
material on real analysis. The computer science
chapters show connections of basic set theory and logic
with current hot topics in the technology sector. The
material on cryptography is exciting, timely, and fun.
These new chapters help to make the book more current
and significant. It should of course be understood that
these four chapters may be considered to be optional.
Skipping them will in no way detract from reading the
rest of the book. Some readers consider Chapter 5 on
axiomatics and rigorous logic to be optional. To be
sure, it is a more demanding chapter than some of the
others. But it contains important material, some of
which is at least alluded to later in the book. Readers
who do not want to spend much time on Chapter 5 might
wish to at least have a look at it. The main message
here is that Chapters 5, 8, 9, 10, and 12 provide an
open-ended venue for students to explore and to learn.
My experience with teaching this course is that the
aggregate material causes many of the students to get
really turned on to mathematics. They need to have a
means for further exploration and reading. These
chapters give them that opportunity, and exercises to
back up the reading. The new Chapter 12 is dessert. It
presents the very new ideas of zero-knowledge proofs
and RSA encryption.",
acknowledgement = ack-nhfb,
author-dates = "1951--",
subject = "Mathematics; MATHEMATICS / General.; MATHEMATICS /
Algebra / General.; MATHEMATICS / Set Theory.",
tableofcontents = "Basic Logic \\
Principles of Logic \\
Truth \\
``And'' and ``Or'' \\
``Not'' \\
``If-Then'' \\
Contrapositive, Converse, and ``Iff'' \\
Quantifiers \\
Truth and Provability \\
\\
Methods of Proof \\
What Is a Proof? \\
Direct Proof \\
Proof by Contradiction \\
Proof by Induction \\
Other Methods of Proof \\
\\
Set Theory \\
Undefinable Terms \\
Elements of Set Theory \\
Venn Diagrams \\
Further Ideas in Elementary Set Theory \\
Indexing and Extended Set Operations \\
\\
Relations and Functions \\
Relations \\
Order Relations \\
Functions \\
Combining Functions \\
Cantor s Notion of Cardinality \\
\\
Axioms of Set Theory, Paradoxes, and Rigor \\
Axioms of Set Theory \\
The Axiom of Choice \\
Independence and Consistency \\
Set Theory and Arithmetic \\
\\
Number Systems \\
The Natural Number System \\
The Integers \\
The Rational Numbers \\
The Real Number System \\
The Nonstandard Real Number System \\
The Complex Numbers \\
The Quaternions, the Cayley Numbers, and Beyond \\
\\
More on the Real Number System \\
Introductory Remark \\
Sequences \\
Open Sets and Closed Sets \\
Compact Sets \\
The Cantor Set \\
\\
A Glimpse of Topology \\
What Is Topology? \\
First Definitions \\
Mappings \\
The Separation Axioms \\
Compactness \\
\\
Theoretical Computer Science \\
Introductory Remarks \\
Primitive Recursive Functions \\
General Recursive Functions \\
Description of Boolean Algebra \\
Axioms of Boolean Algebra \\
Theorems in Boolean Algebra \\
Illustration of the Use of Boolean Logic \\
The Robbins Conjecture \\
\\
The P/NP Problem \\
Introduction \\
The Complexity of a Problem \\
Comparing Polynomial and Exponential Complexity \\
Polynomial Complexity \\
Assertions That Can Be Verified in Polynomial Time \\
Nondeterministic Turing Machines \\
Foundations of NP-Completeness \\
Polynomial Equivalence \\
Definition of NP-Completeness \\
\\
Examples of Axiomatic Theories \\
Group Theory \\
Euclidean and Non-Euclidean Geometry \\
\\
Zero-Knowledge Proofs \\
Basics and Background \\
Preparation for RSA \\
The RSA System Enunciated \\
The RSA Encryption System Explicated \\
Zero-Knowledge Proofs \\
\\
Solutions to Selected Exercises \\
\\
Bibliography \\
\\
Index",
}
@Article{Ksiezopolski:2012:QMQ,
author = "Bogdan Ksiezopolski",
title = "{QoP}-{ML}: Quality of protection modelling language
for cryptographic protocols",
journal = j-COMPUT-SECUR,
volume = "31",
number = "4",
pages = "569--596",
month = jun,
year = "2012",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:28 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404812000107",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Lai:2012:RHB,
author = "Hong Lai and Jinghua Xiao and Lixiang Li and Yixian
Yang",
title = "Recursive hiding of biometrics-based secret sharing
scheme using adversary structure",
journal = j-INFO-PROC-LETT,
volume = "112",
number = "17--18",
pages = "683--687",
day = "30",
month = sep,
year = "2012",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2012.06.006",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri Jul 6 11:52:37 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019012001573",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Lambert-Mogiliansky:2012:EII,
author = "Ariane Lambert-Mogiliansky and Jerome R. Busemeyer",
title = "Emergence and Instability of Individual Identity",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7620",
pages = "102--113",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35659-9_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:59 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35659-9_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35659-9",
book-URL = "http://www.springerlink.com/content/978-3-642-35659-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lampe:2012:ATS,
author = "Rodolphe Lampe and Jacques Patarin and Yannick
Seurin",
title = "An Asymptotically Tight Security Analysis of the
Iterated Even-{Mansour} Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7658",
pages = "278--295",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34961-4_18",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:20 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34961-4_18/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34961-4",
book-URL = "http://www.springerlink.com/content/978-3-642-34961-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lancrenon:2012:IPI,
author = "Jean Lancrenon and Roland Gillard",
title = "Isolating Partial Information of Indistinguishable
Encryptions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7163",
pages = "34--48",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29804-2_3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29804-2_3/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29804-2",
book-URL = "http://www.springerlink.com/content/978-3-642-29804-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Landecker:2012:TBB,
author = "Will Landecker and Thomas Shrimpton and R. Seth
Terashima",
title = "Tweakable Blockciphers with Beyond Birthday-Bound
Security",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7417",
pages = "14--30",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32009-5_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:07 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32009-5_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32009-5",
book-URL = "http://www.springerlink.com/content/978-3-642-32009-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Launchbury:2012:ELT,
author = "John Launchbury and Iavor S. Diatchki and Thomas
DuBuisson and Andy Adams-Moran",
title = "Efficient lookup-table protocol in secure multiparty
computation",
journal = j-SIGPLAN,
volume = "47",
number = "9",
pages = "189--200",
month = sep,
year = "2012",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2398856.2364556",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Thu Nov 15 16:40:19 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "Secure multiparty computation (SMC) permits a
collection of parties to compute a collaborative
result, without any of the parties gaining any
knowledge about the inputs provided by other parties.
Specifications for SMC are commonly presented as
boolean circuits, where optimizations come mostly from
reducing the number of multiply-operations (including
and -gates) --- these are the operations which incur
significant cost, either in computation overhead or in
communication between the parties. Instead, we take a
language-oriented approach, and consequently are able
to explore many other kinds of optimizations. We
present an efficient and general purpose SMC
table-lookup algorithm that can serve as a direct
alternative to circuits. Looking up a private (i.e.
shared, or encrypted) n -bit argument in a public table
requires log(n) parallel-and operations. We use the
advanced encryption standard algorithm (AES) as a
driving motivation, and by introducing different kinds
of parallelization techniques, produce the fastest
current SMC implementation of AES, improving the best
previously reported results by well over an order of
magnitude.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "ICFP '12 conference proceedings.",
}
@Article{Launchbury:2012:TBC,
author = "John Launchbury",
title = "Theorem-based circuit derivation in {Cryptol}",
journal = j-SIGPLAN,
volume = "47",
number = "3",
pages = "185--186",
month = mar,
year = "2012",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2189751.2047894",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Thu Jun 7 08:15:00 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "Even though step-by-step refinement has long been seen
as desirable, it is hard to find compelling industrial
applications of the technique. In theory, transforming
a high-level specification into a high-performance
implementation is an ideal means of producing a correct
design, but in practice it is hard to make it work, and
even harder to make it worthwhile. This talk describes
an exception. We introduce the domain-specific
language, Cryptol, and work up to a design experience
in which theorem-based refinement played a crucial role
in producing an industrial quality FPGA encryptor and
decryptor for AES. Quite simply, we are unlikely to
have succeeded without the technique. The Cryptol
specification language was designed by Galois for the
NSA as a public standard for specifying cryptographic
algorithms. A Cryptol reference specification can serve
as the formal documentation for a cryptographic module,
eliminating the need for separate and voluminous
English descriptions. Cryptol is fully executable,
allowing designers to experiment with their programs
incrementally as their designs evolve. Cryptol
compilers can generate C, C++, and Haskell software
implementations, and VHDL or Verilog HDL hardware
implementations. These generators can significantly
reduce overall life-cycle costs of cryptographic
solutions. For example, Cryptol allows engineers and
mathematicians to program cryptographic algorithms on
FPGAs as if they were writing software. The design
experience we describe runs as follows: we begin with a
specification for AES written in Cryptol, and over a
series of five design stages we produce an industrial
grade encrypt core. In each stage, we state theorems
which relate the component behaviors in one stage with
the corresponding behaviors in the refinement. The
resulting cores, running at 350Mhz-440Mhz depending on
the FPGA part, bear little relationship to the
original, except that the step-by-step theorems ensured
we had not gone astray. We then repeat the pattern in
generating a circuit for AES decrypt. While there are
many similarities between encrypt and decrypt in AES,
there are some crucial differences with regard to high
performance. First concerns the generation of key
material. The AES key is used as a seed for a specific
pseudo-random number generator which produces key
material for use in each of the AES rounds. For
encrypt, the key-generator runs in sync with the action
of encryption, so may be scheduled alongside it. For
decrypt, they run counter to one-another, creating a
major challenge to be overcome. Second, the generated
key material has an additional transformation applied
to it, which occurs deep in the middle of the high
performing core. Using theorems as stepping stones
along the way, we redesign the key expansion algorithm
so that it will run in sync with the decryption. We
then trace parallel steps to the derivation of encrypt,
establishing a series of commuting diagrams along the
way. Whenever we confronted bugs in the development
process, we produced many theorems to isolate the bugs,
using theorems as a principled kind of printf. When the
bugs were found and eradicated, we elided many of the
temporary theorems, leaving behind those that provided
important insights into the behavior of the code. This
talk is a story of the journey with demonstrations of
the tool at work. Its ultimate message is to highlight
the value of including a theorem facility within purely
functional domain-specific languages.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "GCPE '11 conference proceedings.",
}
@Book{Lavington:2012:ATH,
editor = "S. H. (Simon Hugh) Lavington and Martin Campbell-Kelly
and Christopher P. Burton and Roger Johnson",
title = "{Alan Turing} and his contemporaries: building the
world's first computers",
publisher = "British Computer Society",
address = "London, UK",
pages = "xiv + 111",
year = "2012",
ISBN = "1-906124-90-6 (paperback), 1-78017-105-6 (PDF e-book),
1-78017-106-4 (ePub e-book), 1-78017-107-2 (Kindle
e-book)",
ISBN-13 = "978-1-906124-90-8 (paperback), 978-1-78017-105-0 (PDF
e-book), 978-1-78017-106-7 (ePub e-book),
978-1-78017-107-4 (Kindle e-book)",
LCCN = "QA76.17 .A423 2012",
bibdate = "Fri Jun 29 12:40:35 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
library.ox.ac.uk:210/ADVANCE",
price = "UK\pounds 11.69",
abstract = "Secret wartime projects in areas such as
code-breaking, radar and ballistics produced a wealth
of ideas and technologies that kick-started the
development of digital computers. This text tells the
story of the people and projects that flourished in the
post-war period.",
acknowledgement = ack-nhfb,
subject = "Turing, Alan Mathison; Contemporaries; Computer
science; Great Britain; History; Computer scientists;
Computers and IT",
subject-dates = "1912--1954",
}
@Article{Lee:2012:IBS,
author = "Woomyo Lee and Jae Woo Seo and Pil Joong Lee",
title = "Identity-Based Signcryption from Identity-Based
Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7115",
pages = "70--83",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27890-7_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:29 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27890-7_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27890-7",
book-URL = "http://www.springerlink.com/content/978-3-642-27890-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lei:2012:RAW,
author = "Baiying Lei and Ing Yann Soon and Zhen Li",
title = "A Robust Audio Watermarking Scheme Based on Lifting
Wavelet Transform and Singular Value Decomposition",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "86--96",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Lenstra:2012:PK,
author = "Arjen K. Lenstra and James P. Hughes and Maxime Augier
and Joppe W. Bos and Thorsten Kleinjung and Christophe
Wachter",
editor = "Reihaneh Safavi-Naini and Ran Canetti",
booktitle = "{Proceedings of the 32nd Annual Conference on Advances
in Cryptology}",
title = "Public keys",
volume = "7417",
publisher = pub-SV,
address = pub-SV:adr,
pages = "626--642",
year = "2012",
DOI = "https://doi.org/10.1007/978-3-642-32009-5_37",
bibdate = "Fri Jul 29 08:06:57 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = ser-LNCS,
URL = "https://dl.acm.org/doi/10.1007/978-3-642-32009-5_37",
abstract = "We performed a sanity check of public keys collected
on the web and found that the vast majority works as
intended. Our main goal was to test the validity of the
assumption that different random choices are made each
time keys are generated. We found that this is not
always the case, resulting in public keys that offer no
security. Our conclusion is that generating secure
public keys in the real world is challenging. We did
not study usage of public keys.",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32009-5",
}
@TechReport{Lenstra:2012:RWW,
author = "Arjen K. Lenstra and James P. Hughes and Maxime Augier
and Joppe W. Bos and Thorsten Kleinjung and Christophe
Wachter",
title = "{Ron} was wrong, {Whit} is right",
type = "Report",
institution = "EPFL IC LACAL",
address = "Lausanne, Switzerland",
pages = "16",
day = "14",
month = feb,
year = "2012",
bibdate = "Wed Feb 15 10:37:09 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://eprint.iacr.org/2012/064",
abstract = "We performed a sanity check of public keys collected
on the web. Our main goal was to test the validity of
the assumption that different random choices are made
each time keys are generated. We found that the vast
majority of public keys work as intended. A more
disconcerting finding is that two out of every one
thousand RSA moduli that we collected offer no
security. Our conclusion is that the validity of the
assumption is questionable and that generating keys in
the real world for ``multiple-secrets'' cryptosystems
such as RSA is significantly riskier than for
``single-secret'' ones such as ElGamal or (EC)DSA which
are based on Diffie-Hellman.",
acknowledgement = ack-nhfb,
keywords = "(batch) factoring; 99.8\% security; discrete
logarithm; DSA; ECDSA; ElGamal; Euclidean algorithm;
K9; RSA; Sanity check; seeding random number
generators",
remark = "The insecurities described in this article are due to
faulty random-number generator, although the failure of
that process is yet to be analyzed.",
}
@Article{Lertvorratham:2012:ISM,
author = "Supachote Lertvorratham and Pipat Hiranvanichakorn",
title = "Integrating Secure Multipath Mobile Ad Hoc Network
With Self-Authentication Strategy",
journal = j-INT-J-COMPUT-APPL,
volume = "34",
number = "3",
pages = "174--184",
year = "2012",
DOI = "https://doi.org/10.2316/Journal.202.2012.3.202-3245",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:28:10 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2012.3.202-3245",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Lewko:2012:NPM,
author = "Allison Lewko and Brent Waters",
title = "New Proof Methods for Attribute-Based Encryption:
Achieving Full Security through Selective Techniques",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7417",
pages = "180--198",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32009-5_12",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:07 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32009-5_12/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32009-5",
book-URL = "http://www.springerlink.com/content/978-3-642-32009-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Li:2012:BIB,
author = "Fagen Li and Muhammad Khurram Khan",
title = "A biometric identity-based signcryption scheme",
journal = j-FUT-GEN-COMP-SYS,
volume = "28",
number = "1",
pages = "306--310",
month = jan,
year = "2012",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2010.11.004",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Thu Mar 8 07:52:12 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib;
http://www.sciencedirect.com/science/journal/0167739X",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X10002141",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Li:2012:BVS,
author = "Long-Hai Li and Cheng-Qiang Huang and Shao-Feng Fu",
title = "Boardroom Voting Scheme with Unconditionally Secret
Ballots Based on {DC-Net}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7645",
pages = "220--232",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34601-9_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:17:59 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34601-9_17/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34601-9",
book-URL = "http://www.springerlink.com/content/978-3-642-34601-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Li:2012:ESD,
author = "Xiong Li and Yongping Xiong and Jian Ma and Wendong
Wang",
title = "An efficient and security dynamic identity based
authentication protocol for multi-server architecture
using smart cards",
journal = j-J-NETW-COMPUT-APPL,
volume = "35",
number = "2",
pages = "763--769",
month = mar,
year = "2012",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:13 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804511002244",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Li:2012:ESS,
author = "Fagen Li and Mingwu Zhang and Tsuyoshi Takagi",
title = "Efficient signcryption in the standard model",
journal = j-CCPE,
volume = "24",
number = "17",
pages = "1977--1989",
day = "10",
month = dec,
year = "2012",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.1823",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Nov 5 07:44:57 MST 2012",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "22 Sep 2011",
}
@Article{Li:2012:FDM,
author = "Wei Li and Dawu Gu and Zhiqiang Liu and Ya Liu and
Xiaohu Huang",
title = "Fault Detection of the {MacGuffin Cipher} against
Differential Fault Attack",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7222",
pages = "102--112",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32298-3_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:17:56 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32298-3_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32298-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32298-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Li:2012:IBO,
author = "Fagen Li and Muhammad Khurram Khan and Khaled
Alghathbar and Tsuyoshi Takagi",
title = "Identity-based online\slash offline signcryption for
low power devices",
journal = j-J-NETW-COMPUT-APPL,
volume = "35",
number = "1",
pages = "340--347",
month = jan,
year = "2012",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:09 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S108480451100155X",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Li:2012:IIA,
author = "Yanjun Li and Wenling Wu and Lei Zhang",
title = "Improved Integral Attacks on Reduced-Round {CLEFIA}
Block Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7115",
pages = "28--39",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27890-7_3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:29 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27890-7_3/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27890-7",
book-URL = "http://www.springerlink.com/content/978-3-642-27890-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Li:2012:OEA,
author = "Jingwei Li and Chunfu Jia and Jin Li and Xiaofeng
Chen",
title = "Outsourcing Encryption of Attribute-Based Encryption
with {MapReduce}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7618",
pages = "191--201",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34129-8_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:56 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34129-8_17/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34129-8",
book-URL = "http://www.springerlink.com/content/978-3-642-34129-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Li:2012:RIB,
author = "Jian Li and Hongmei Liu and Jiwu Huang and Yun Q.
Shi",
title = "Reference index-based {H.264} video watermarking
scheme",
journal = j-TOMCCAP,
volume = "8",
number = "2S",
pages = "33:1--33:??",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2344436.2344439",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Nov 6 18:13:05 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Video watermarking has received much attention over
the past years as a promising solution to copy
protection. Watermark robustness is still a key issue
of research, especially when a watermark is embedded in
the compressed video domain. In this article, a robust
watermarking scheme for H.264 video is proposed. During
video encoding, the watermark is embedded in the index
of the reference frame, referred to as reference index,
a bitstream syntax element newly proposed in the H.264
standard. Furthermore, the video content (current coded
blocks) is modified based on an optimization model,
aiming at improving watermark robustness without
unacceptably degrading the video's visual quality or
increasing the video's bit rate. Compared with the
existing schemes, our method has the following three
advantages: (1) The bit rate of the watermarked video
is adjustable; (2) the robustness against common video
operations can be achieved; (3) the watermark embedding
and extraction are simple. Extensive experiments have
verified the good performance of the proposed
watermarking scheme.",
acknowledgement = ack-nhfb,
articleno = "33",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Liao:2012:NSM,
author = "Xin Liao and Qiao-yan Wen and Ze-li Zhao and Jie
Zhang",
title = "A Novel Steganographic Method with Four-Pixel
Differencing and Modulus Function",
journal = j-FUND-INFO,
volume = "118",
number = "3",
pages = "281--289",
month = aug,
year = "2012",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2012-714",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:15:27 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Ling:2012:NCC,
author = "Zhen Ling and Junzhou Luo and Wei Yu and Xinwen Fu and
Dong Xuan and Weijia Jia",
title = "A new cell-counting-based attack against {Tor}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "20",
number = "4",
pages = "1245--1261",
month = aug,
year = "2012",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2011.2178036",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Oct 22 08:33:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Various low-latency anonymous communication systems
such as Tor and Anonymizer have been designed to
provide anonymity service for users. In order to hide
the communication of users, most of the anonymity
systems pack the application data into equal-sized
cells (e.g., 512 B for Tor, a known real-world,
circuit-based, low-latency anonymous communication
network). Via extensive experiments on Tor, we found
that the size of IP packets in the Tor network can be
very dynamic because a cell is an application concept
and the IP layer may repack cells. Based on this
finding, we investigate a new cell-counting-based
attack against Tor, which allows the attacker to
confirm anonymous communication relationship among
users very quickly. In this attack, by marginally
varying the number of cells in the target traffic at
the malicious exit onion router, the attacker can embed
a secret signal into the variation of cell counter of
the target traffic. The embedded signal will be carried
along with the target traffic and arrive at the
malicious entry onion router. Then, an accomplice of
the attacker at the malicious entry onion router will
detect the embedded signal based on the received cells
and confirm the communication relationship among users.
We have implemented this attack against Tor, and our
experimental data validate its feasibility and
effectiveness. There are several unique features of
this attack. First, this attack is highly efficient and
can confirm very short communication sessions with only
tens of cells. Second, this attack is effective, and
its detection rate approaches 100\% with a very low
false positive rate. Third, it is possible to implement
the attack in a way that appears to be very difficult
for honest participants to detect (e.g., using our
hopping-based signal embedding).",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ling:2012:SHS,
author = "Huo-Chong Ling and Raphael C.-W. Phan",
title = "On the Security of a Hybrid {SVD--DCT} Watermarking
Method Based on {LPSNR}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7087",
pages = "257--266",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25367-6_23",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Dec 24 07:07:43 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-25367-6_23",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-25367-6",
book-URL = "http://www.springerlink.com/content/978-3-642-25367-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Liu:2012:ESS,
author = "Yan-Xiao Liu and Lein Harn and Ching-Nung Yang and
Yu-Qing Zhang",
title = "Efficient $ (n, t, n) $ secret sharing schemes",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "6",
pages = "1325--1332",
month = jun,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.01.027",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Apr 9 07:26:09 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212000234",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Liu:2012:FVC,
author = "Feng Liu and Teng Guo and ChuanKun Wu and Ching-Nung
Yang",
title = "Flexible Visual Cryptography Scheme without
Distortion",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "211--227",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_18",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_18/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Liu:2012:LFA,
author = "Zhiqiang Liu and Dawu Gu and Ya Liu and Wei Li",
title = "Linear Fault Analysis of Block Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7341",
pages = "241--256",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31284-7_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31284-7_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31284-7",
book-URL = "http://www.springerlink.com/content/978-3-642-31284-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Liu:2012:SOCa,
author = "Shengli Liu and Fangguo Zhang and Kefei Chen",
title = "Selective Opening Chosen Ciphertext Security Directly
from the {DDH} Assumption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7645",
pages = "100--112",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34601-9_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:17:59 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34601-9_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34601-9",
book-URL = "http://www.springerlink.com/content/978-3-642-34601-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lopriore:2012:EPP,
author = "Lanfranco Lopriore",
title = "Encrypted Pointers in Protection System Design",
journal = j-COMP-J,
volume = "55",
number = "4",
pages = "497--507",
month = apr,
year = "2012",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr107",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Mar 27 18:19:58 MDT 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/55/4.toc;
https://www.math.utah.edu/pub/tex/bib/comp2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/55/4/497.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 10, 2011",
}
@Article{Low:2012:BRB,
author = "Robert J. Low",
title = "Book Review: {{\booktitle{Codes: an Introduction to
Information Communication and Cryptography}}, by Norman
L. Biggs}",
journal = j-SIGACT,
volume = "43",
number = "1",
pages = "27--29",
month = mar,
year = "2012",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2160649.2160658",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Mar 20 14:39:02 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Biggs:2008:CII}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Lu:2012:BBE,
author = "Rongxing Lu and Xiaodong Lin and Haojin Zhu and
Xiaohui Liang and Xuemin (Sherman) Shen",
title = "{BECAN}: a {Bandwidth-Efficient Cooperative
Authentication Scheme} for Filtering Injected False
Data in Wireless Sensor Networks",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "23",
number = "1",
pages = "32--43",
month = jan,
year = "2012",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2011.95",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Mar 1 14:46:07 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Lu:2012:HOM,
author = "Jiqiang Lu and Yongzhuang Wei and Jongsung Kim and
Enes Pasalic",
title = "The Higher-Order Meet-in-the-Middle Attack and Its
Application to the {Camellia} Block Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7668",
pages = "244--264",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34931-7_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34931-7_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34931-7",
book-URL = "http://www.springerlink.com/content/978-3-642-34931-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lu:2012:IEC,
author = "Xianhui Lu and Bao Li and Qixiang Mei and Yamin Liu",
title = "Improved Efficiency of Chosen Ciphertext Secure
Encryption from Factoring",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7232",
pages = "34--45",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29101-2_3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:09 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29101-2_3/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29101-2",
book-URL = "http://www.springerlink.com/content/978-3-642-29101-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lu:2012:MMA,
author = "Jiqiang Lu and Yongzhuang Wei and Enes Pasalic and
Pierre-Alain Fouque",
title = "Meet-in-the-Middle Attack on Reduced Versions of the
{Camellia} Block Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7631",
pages = "197--215",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34117-5_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:12 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34117-5_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34117-5",
book-URL = "http://www.springerlink.com/content/978-3-642-34117-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Luo:2012:ESI,
author = "Jianqiang Luo and Kevin D. Bowers and Alina Oprea and
Lihao Xu",
title = "Efficient software implementations of large finite
fields {$ {\rm GF}(2^n) $} for secure storage
applications",
journal = j-TOS,
volume = "8",
number = "1",
pages = "2:1--2:??",
month = feb,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2093139.2093141",
ISSN = "1553-3077 (print), 1553-3093 (electronic)",
ISSN-L = "1553-3077",
bibdate = "Fri Mar 16 15:48:59 MDT 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/tos/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tos.bib",
abstract = "Finite fields are widely used in constructing
error-correcting codes and cryptographic algorithms. In
practice, error-correcting codes use small finite
fields to achieve high-throughput encoding and
decoding. Conversely, cryptographic systems employ
considerably larger finite fields to achieve high
levels of security. We focus on developing efficient
software implementations of arithmetic operations in
reasonably large finite fields as needed by secure
storage applications. In this article, we study several
arithmetic operation implementations for finite fields
ranging from $ {\rm GF}(2^{32}) $ to $ {\rm
GF}(2^{128}) $. We implement multiplication and
division in these finite fields by making use of
precomputed tables in smaller fields, and several
techniques of extending smaller field arithmetic into
larger field operations. We show that by exploiting
known techniques, as well as new optimizations, we are
able to efficiently support operations over finite
fields of interest. We perform a detailed evaluation of
several techniques, and show that we achieve very
practical performance for both multiplication and
division. Finally, we show how these techniques find
applications in the implementation of HAIL, a highly
available distributed cloud storage layer. Using the
newly implemented arithmetic operations in $ {\rm
GF}(2^{64}) $, HAIL improves its performance by a
factor of two, while simultaneously providing a higher
level of security.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Storage",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960",
}
@Article{Luo:2012:FSI,
author = "Xiangyang Luo and Fenlin Liu and Chunfang Yang and
Shiguo Lian and Daoshun Wang",
title = "On {F5} Steganography in Images",
journal = j-COMP-J,
volume = "55",
number = "4",
pages = "447--456",
month = apr,
year = "2012",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr092",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Mar 27 18:19:58 MDT 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/55/4.toc;
https://www.math.utah.edu/pub/tex/bib/comp2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/55/4/447.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 12, 2011",
}
@Article{Luo:2012:FSU,
author = "Song Luo and Qingni Shen and Zhong Chen",
title = "Fully Secure Unidirectional Identity-Based Proxy
Re-encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7259",
pages = "109--126",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31912-9_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:40 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012d.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31912-9_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31912-9",
book-URL = "http://www.springerlink.com/content/978-3-642-31912-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Luo:2012:ICB,
author = "Junzhou Luo and Xiaogang Wang and Ming Yang",
title = "An interval centroid based spread spectrum
watermarking scheme for multi-flow traceback",
journal = j-J-NETW-COMPUT-APPL,
volume = "35",
number = "1",
pages = "60--71",
month = jan,
year = "2012",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:09 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804511000579",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Luo:2012:LVT,
author = "Yong Luo and Yan Zhao and Lei Cheng and Jianxin Wang
and Xuchong Liu",
title = "Lossless Visible Three-Dimensional Watermark of
Digital Elevation Model Data",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7220",
pages = "138--147",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31439-1_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:17:53 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31439-1_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31439-1",
book-URL = "http://www.springerlink.com/content/978-3-642-31439-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lupu:2012:IBK,
author = "Radu Lupu and Eugen Borcoci and Tinku Rasheed",
title = "Identity-Based Key Derivation Method for Low Delay
Inter-domain Handover Re-authentication Service",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7161",
pages = "162--175",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29615-4_12",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29615-4_12/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29615-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29615-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ma:2012:CIS,
author = "Chun-Guang Ma and Ding Wang and Qi-Ming Zhang",
title = "Cryptanalysis and Improvement of {Sood} et al.'s
Dynamic {ID}-Based Authentication Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7154",
pages = "141--152",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28073-3_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:12 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28073-3_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28073-3",
book-URL = "http://www.springerlink.com/content/978-3-642-28073-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Maachaoui:2012:MLA,
author = "M. Maachaoui and A. Abou {El Kalam} and C. Fraboul and
A. Ait Ouahman",
title = "Multi-level Authentication Based Single Sign-On for
{IMS} Services",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7394",
pages = "174--187",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32805-3_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32805-3_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32805-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32805-3",
fjournal = "Lecture Notes in Computer Science",
}
@Book{MacCormick:2012:NAC,
author = "John MacCormick",
title = "Nine algorithms that changed the future: the ingenious
ideas that drive today's computers",
publisher = pub-PRINCETON,
address = pub-PRINCETON:adr,
pages = "x + 2 + 219",
year = "2012",
ISBN = "0-691-14714-0 (hardcover), 0-691-15819-3 (paperback)",
ISBN-13 = "978-0-691-14714-7 (hardcover), 978-0-691-15819-8
(paperback)",
LCCN = "QA76 .M21453 2012",
bibdate = "Tue May 5 17:16:06 MDT 2015",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/mathgaz2010.bib;
https://www.math.utah.edu/pub/tex/bib/pagerank.bib;
z3950.loc.gov:7090/Voyager",
note = "With a foreword by Christopher M. Bishop.",
URL = "http://press.princeton.edu/chapters/s9528.pdf;
http://www.jstor.org/stable/10.2307/j.ctt7t71s",
abstract = "Every day, we use our computers to perform remarkable
feats. A simple web search picks out a handful of
relevant needles from the world's biggest haystack: the
billions of pages on the World Wide Web. Uploading a
photo to Facebook transmits millions of pieces of
information over numerous error-prone network links,
yet somehow a perfect copy of the photo arrives intact.
Without even knowing it, we use public-key cryptography
to transmit secret information like credit card
numbers; and, we use digital signatures to verify the
identity of the websites we visit. How do our computers
perform these tasks with such ease?\par
This is the first book to answer that question in
language anyone can understand, revealing the
extraordinary ideas that power our PCs, laptops, and
smartphones. Using vivid examples, John MacCormick
explains the fundamental ``tricks'' behind nine types
of computer algorithms, including artificial
intelligence (where we learn about the ``nearest
neighbor trick'' and ``twenty questions trick''),
Google's famous PageRank algorithm (which uses the
``random surfer trick''), data compression, error
correction, and much more.\par
These revolutionary algorithms have changed our world:
this book unlocks their secrets, and lays bare the
incredible ideas that our computers use every day.",
acknowledgement = ack-nhfb,
author-dates = "1972--",
subject = "Computer science; Computer algorithms; Artificial
intelligence",
tableofcontents = "Foreword / ix \\
1. Introduction: What Are the Extraordinary Ideas
Computers Use Every Day? / 1 \\
2. Search Engine Indexing: Finding Needles in the
World's Biggest Haystack / 10 \\
3. PageRank: The Technology That Launched Google / 24
\\
4. Public Key Cryptography: Sending Secrets on a
Postcard 38 \\
5. Error-Correcting Codes: Mistakes That Fix Themselves
/ 60 \\
6. Pattern Recognition: Learning from Experience / 80
\\
7. Data Compression: Something for Nothing / 105 \\
8. Databases: The Quest for Consistency / 122 \\
9. Digital Signatures: Who Really Wrote This Software?
/ 149 \\
10. What Is Computable? / 174 \\
11. Conclusion: More Genius at Your Fingertips? / 199
\\
Acknowledgments / 205 \\
Sources and Further Reading / 207 \\
Index / 211",
}
@Article{Madanayake:2012:BPS,
author = "H. L. P. Arjuna Madanayake and R. J. Cintra and V. S.
Dimitrov and L. T. Bruton",
title = "Block-Parallel Systolic-Array Architecture for {$2$-D}
{NTT}-Based Fragile Watermark Embedding",
journal = j-PARALLEL-PROCESS-LETT,
volume = "22",
number = "3",
pages = "1250009",
month = sep,
year = "2012",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626412500090",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Nov 3 13:48:52 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
keywords = "NTT (number theoretic transform)",
}
@Article{Madhusudhan:2012:DIB,
author = "R. Madhusudhan and R. C. Mittal",
title = "Dynamic {ID-based} remote user password authentication
schemes using smart cards: a review",
journal = j-J-NETW-COMPUT-APPL,
volume = "35",
number = "4",
pages = "1235--1248",
month = jul,
year = "2012",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:20 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804512000215",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Maes:2012:PFF,
author = "Roel Maes and Anthony {Van Herrewege} and Ingrid
Verbauwhede",
title = "{PUFKY}: a Fully Functional {PUF}-Based Cryptographic
Key Generator",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7428",
pages = "302--319",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33027-8_18",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33027-8_18/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33027-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33027-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Maimut:2012:LCR,
author = "Diana Maimut and Khaled Ouafi",
title = "Lightweight Cryptography for {RFID} Tags",
journal = j-IEEE-SEC-PRIV,
volume = "10",
number = "2",
pages = "76--79",
month = mar # "\slash " # apr,
year = "2012",
DOI = "https://doi.org/10.1109/MSP.2012.43",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Mon Apr 2 06:03:36 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Maitra:2012:NAC,
author = "Subhashis Maitra and Amitabha Sinha",
title = "A new algorithm for computing triple-base number
system",
journal = j-COMP-ARCH-NEWS,
volume = "40",
number = "4",
pages = "3--9",
month = sep,
year = "2012",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/2411116.2411119",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Tue Dec 11 08:06:57 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "We introduce here a generalized method a new Algorithm
to find Triple-Base number system and Triple-Base chain
and hence in turn Single Digit Triple-Base number
system(SDTBNS). The proposed method is not only simpler
and faster than the Algorithms to find Double-Base
number system or Double-Base chain, experimentally it
also returns a shorter length of Triple-Base chain
which in turn reduces the size of the look-up-table to
find out SDTBNS. The complexity analysis and
experimental results shows the novelty of the proposed
Algorithm. Moreover when the proposed method is applied
to find scalar multiplication in case of Elliptic Curve
Cryptography and coefficient multiplication in case of
designing digital filter, its efficiency also proves
its novelty. Here we have used third base as $5$
because when it is multiplied by $2$ gives $ 10$ which
can be efficiently used for decimal shifting, i.e. if
an integer '$n$' can be represented in SDTBNS form,
then $ n / 10_x$ or $ n \times 10_x$ can also
represented in SDTBNS only by diving or multiplying
'$n$' by $ 10$.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Majzoub:2012:MRH,
author = "Sohaib Majzoub and Hassan Diab",
title = "{MorphoSys} reconfigurable hardware for cryptography:
the {Twofish} case",
journal = j-J-SUPERCOMPUTING,
volume = "59",
number = "1",
pages = "22--41",
month = jan,
year = "2012",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-010-0413-3",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Tue Dec 13 15:25:33 MST 2011",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=59&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-010-0413-3",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Malik:2012:AIC,
author = "Sana Ambreen Malik and Asifullah Khan and Mutawarra
Hussain and Khurram Jawad and Rafiullah Chamlawi and
Abdul Jalil",
title = "Authentication of images for {$3$D} cameras:
{Reversibly} embedding information using intelligent
approaches",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "11",
pages = "2665--2673",
month = nov,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.06.015",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Aug 20 17:08:56 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212001719",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Mansouri:2012:ACA,
author = "Shohreh Sharif Mansouri and Elena Dubrova",
title = "An Architectural Countermeasure against Power Analysis
Attacks for {FSR}-Based Stream Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7275",
pages = "54--68",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29912-4_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:19:00 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012d.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29912-4_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29912-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29912-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Manzanares-Lopez:2012:ICU,
author = "Pilar Manzanares-Lopez and Josemaria Malgosa-Sanahuja
and Juan Pedro Mu{\~n}oz-Gea",
title = "The importance of considering unauthentic transactions
in trust management systems",
journal = j-J-PAR-DIST-COMP,
volume = "72",
number = "6",
pages = "809--818",
month = jun,
year = "2012",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2012.03.006",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Thu Apr 19 16:59:49 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib;
http://www.sciencedirect.com/science/journal/07437315",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731512000718",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Markoff:2012:FFO,
author = "John Markoff",
title = "Flaw found in an online encryption method",
journal = j-NY-TIMES,
day = "14",
month = jan,
year = "2012",
DOI = "https://www.nytimes.com/2012/02/15/technology/researchers-find-flaw-in-an-online-encryption-method.html",
bibdate = "Fri Jul 29 08:09:06 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Article{Martinez-Julia:2012:NIB,
author = "P. Martinez-Julia and A. F. G{\'o}mez-Skarmeta",
title = "A Novel Identity-based Network Architecture for Next
Generation {Internet}",
journal = j-J-UCS,
volume = "18",
number = "12",
pages = "1643--??",
month = "????",
year = "2012",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Nov 8 12:03:11 MST 2012",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_18_12/a_novel_identity_based",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Mathew:2012:EIC,
author = "K. Preetha Mathew and Sachin Vasant and Sridhar
Venkatesan and C. Pandu Rangan",
title = "An Efficient {IND-CCA2} Secure Variant of the
{Niederreiter} Encryption Scheme in the Standard
Model",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7372",
pages = "166--179",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31448-3_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:08 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31448-3_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31448-3",
book-URL = "http://www.springerlink.com/content/978-3-642-31448-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Matsuo:2012:MAK,
author = "Shin'ichiro Matsuo and Daisuke Moriyama and Moti
Yung",
title = "Multifactor Authenticated Key Renewal",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7222",
pages = "204--220",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32298-3_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:17:56 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32298-3_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32298-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32298-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Maurer:2012:CCN,
author = "Ueli Maurer",
title = "Constructive Cryptography --- a New Paradigm for
Security Definitions and Proofs",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6993",
pages = "33--56",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27375-9_3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:58 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27375-9_3/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27375-9",
book-URL = "http://www.springerlink.com/content/978-3-642-27375-9",
fjournal = "Lecture Notes in Computer Science",
}
@Book{McKay:2012:SLC,
author = "Sinclair McKay",
title = "The secret lives of codebreakers: the men and women
who cracked the {Enigma} code at {Bletchley Park}",
publisher = "Plume",
address = "New York, NY, USA",
pages = "vi + 338",
year = "2012",
ISBN = "0-452-29871-7",
ISBN-13 = "978-0-452-29871-2",
LCCN = "D810.C88 M39 2012",
bibdate = "Thu Dec 28 10:01:24 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
remark = "Originally published as: The secret life of Bletchley
Park. London: Aurum, 2010.",
subject = "World War, 1939--1945; Cryptography; Electronic
intelligence; Great Britain; Bletchley Park (Milton
Keynes, England); History",
tableofcontents = "Reporting for duty \\
1938--39: The school of codes \\
1939: Rounding up the brightest and the best \\
The house and the surrounding country \\
1939: How do you break the unbreakable? \\
1939--40: The Enigma initiation \\
Freezing billets and outdoor loos \\
1940: the first glimmers of light \\
1940: inspiration and intensity \\
1940: The coming of the bombes \\
1940: Enigma and the Blitz \\
Bletchley and the class question \\
1941: The Battle of the Atlantic \\
Food, booze and too much tea \\
1941: The wrens and their larks \\
1941: Bletchley and Churchill \\
Military or civilian? \\
1942: Grave setbacks and internal strife \\
The rules of attraction \\
1943: A very special relationship \\
1943: The hazards of careless talk \\
Bletchley and the Russians \\
The cultural life of Bletchley Park \\
1943--44: The rise of the colossus \\
1944--45: D-Day and the end of the war \\
1945 and after: The immediate aftermath \\
Bletchley's intellectual legacy \\
After Bletchley: the silence descends \\
The rescue of the Park",
}
@Article{Meerwald:2012:ERW,
author = "Peter Meerwald and Andreas Uhl",
title = "An Efficient Robust Watermarking Method Integrated in
{H.264\slash SVC}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7110",
pages = "1--14",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28693-3_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28693-3_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28693-3",
book-URL = "http://www.springerlink.com/content/978-3-642-28693-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Mendel:2012:DAL,
author = "Florian Mendel and Vincent Rijmen and Deniz Toz and
Kerem Var{\i}c{\i}",
title = "Differential Analysis of the {LED} Block Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7658",
pages = "190--207",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34961-4_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:20 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34961-4_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34961-4",
book-URL = "http://www.springerlink.com/content/978-3-642-34961-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Meshram:2012:IBC,
author = "Chandrashekhar Meshram and Suchitra A. Meshram and
Mingwu Zhang",
title = "An {ID}-based cryptographic mechanisms based on {GDLP}
and {IFP}",
journal = j-INFO-PROC-LETT,
volume = "112",
number = "19",
pages = "753--758",
day = "15",
month = oct,
year = "2012",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2012.06.018",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri Jul 27 06:23:44 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S002001901200169X",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Meziani:2012:IPS,
author = "Mohammed Meziani and Gerhard Hoffmann and Pierre-Louis
Cayrel",
title = "Improving the Performance of the {SYND} Stream
Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7374",
pages = "99--116",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31410-0_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31410-0_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31410-0",
book-URL = "http://www.springerlink.com/content/978-3-642-31410-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Michail:2012:EHT,
author = "Harris E. Michail and George S. Athanasiou and Vasilis
Kelefouras and George Theodoridis and Costas E.
Goutis",
title = "On the exploitation of a high-throughput {SHA-256
FPGA} design for {HMAC}",
journal = j-TRETS,
volume = "5",
number = "1",
pages = "2:1--2:??",
month = mar,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2133352.2133354",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Tue Mar 20 12:12:48 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
abstract = "High-throughput and area-efficient designs of hash
functions and corresponding mechanisms for Message
Authentication Codes (MACs) are in high demand due to
new security protocols that have arisen and call for
security services in every transmitted data packet. For
instance, IPv6 incorporates the IPSec protocol for
secure data transmission. However, the IPSec's
performance bottleneck is the HMAC mechanism which is
responsible for authenticating the transmitted data.
HMAC's performance bottleneck in its turn is the
underlying hash function. In this article a
high-throughput and small-size SHA-256 hash function
FPGA design and the corresponding HMAC FPGA design is
presented. Advanced optimization techniques have been
deployed leading to a SHA-256 hashing core which
performs more than 30\% better, compared to the next
better design. This improvement is achieved both in
terms of throughput as well as in terms of
throughput/area cost factor. It is the first reported
SHA-256 hashing core that exceeds 11Gbps (after place
and route in Xilinx Virtex 6 board).",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
}
@Article{Minier:2012:EEC,
author = "Marine Minier and Raphael C.-W. Phan",
title = "Energy-Efficient Cryptographic Engineering Paradigm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7039",
pages = "78--88",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27585-2_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:58 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27585-2_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27585-2",
book-URL = "http://www.springerlink.com/content/978-3-642-27585-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Minier:2012:RKI,
author = "Marine Minier and Mar{\'\i}a Naya-Plasencia",
title = "A related key impossible differential attack against $
22 $ rounds of the lightweight block cipher {LBlock}",
journal = j-INFO-PROC-LETT,
volume = "112",
number = "16",
pages = "624--629",
day = "31",
month = aug,
year = "2012",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2012.04.012",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Jun 20 16:46:51 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019012001238",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Mironov:2012:IDP,
author = "Ilya Mironov and Omkant Pandey and Omer Reingold and
Gil Segev",
title = "Incremental Deterministic Public-Key Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "628--644",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_36;
https://doi.org/10.1007/978-3-642-29011-4_37",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-29011-4_36;
http://link.springer.com/chapter/10.1007/978-3-642-29011-4_37/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Moessner:2012:SAS,
author = "M. Moessner and Gul N. Khan",
title = "Secure authentication scheme for passive {C1G2 RFID}
tags",
journal = j-COMP-NET-AMSTERDAM,
volume = "56",
number = "1",
pages = "273--286",
day = "12",
month = jan,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2011.09.008",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Feb 4 10:23:02 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128611003422",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Moldovyan:2012:BBD,
author = "Alexandr Moldovyan and Nikolay Moldovyan and Evgenia
Novikova",
title = "Blind 384-bit Digital Signature Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7531",
pages = "77--83",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33704-8_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:26 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33704-8_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33704-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33704-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Montecchi:2012:QSE,
author = "Leonardo Montecchi and Paolo Lollini and Andrea
Bondavalli and Ernesto {La Mattina}",
title = "Quantitative Security Evaluation of a Multi-biometric
Authentication System",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7613",
pages = "209--221",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33675-1_19",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33675-1_19/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33675-1",
book-URL = "http://www.springerlink.com/content/978-3-642-33675-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Moore:2012:RFF,
author = "Samuel K. Moore",
title = "{RSA} Flaw Found",
journal = j-IEEE-SPECTRUM,
volume = "??",
number = "??",
pages = "??--??",
day = "14",
month = feb,
year = "2012",
CODEN = "IEESAM",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Thu Jul 26 18:41:43 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://spectrum.ieee.org/tech-talk/computing/it/rsa-flaw-found",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
}
@Article{Morad:2012:OEA,
author = "Ameer H. Morad",
title = "Office Employees Authentication Based on {E}-exam
Techniques",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7666",
pages = "60--65",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34478-7_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:30 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34478-7_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34478-7",
book-URL = "http://www.springerlink.com/content/978-3-642-34478-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Morozov:2012:ZKP,
author = "Kirill Morozov and Tsuyoshi Takagi",
title = "Zero-Knowledge Protocols for the {McEliece}
Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7372",
pages = "180--193",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31448-3_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:08 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31448-3_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31448-3",
book-URL = "http://www.springerlink.com/content/978-3-642-31448-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Mroczkowski:2012:CAS,
author = "Piotr Mroczkowski and Janusz Szmidt",
title = "The Cube Attack on Stream Cipher {Trivium} and
Quadraticity Tests",
journal = j-FUND-INFO,
volume = "114",
number = "3--4",
pages = "309--318",
month = aug,
year = "2012",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2012-631",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:14:51 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Muller:2012:HPC,
author = "Sascha M{\"u}ller and Stefan Katzenbeisser",
title = "Hiding the Policy in Cryptographic Access Control",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7170",
pages = "90--105",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29963-6_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29963-6_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29963-6",
book-URL = "http://www.springerlink.com/content/978-3-642-29963-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Myers:2012:BCM,
author = "Steven Myers and Mona Sergi and abhi shelat",
title = "Blackbox Construction of a More Than Non-Malleable
{CCA 1} Encryption Scheme from Plaintext Awareness",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7485",
pages = "149--165",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32928-9_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:35 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32928-9_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32928-9",
book-URL = "http://www.springerlink.com/content/978-3-642-32928-9",
fjournal = "Lecture Notes in Computer Science",
remark = "Yes, `abhi shelat' is spelled in lowercase letters.",
}
@Article{Naranjo:2012:SAK,
author = "J. A. M. Naranjo and N. Antequera and L. G. Casado and
J. A. L{\'o}pez-Ramos",
title = "A suite of algorithms for key distribution and
authentication in centralized secure multicast
environments",
journal = j-J-COMPUT-APPL-MATH,
volume = "236",
number = "12",
pages = "3042--3051",
month = jun,
year = "2012",
CODEN = "JCAMDI",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:24:34 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042711000914",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@Article{Naskar:2012:FIR,
author = "Ruchira Naskar and Rajat Subhra Chakraborty",
title = "Fuzzy Inference Rule Based Reversible Watermarking for
Digital Images",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7671",
pages = "149--163",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35130-3_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:37 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35130-3_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35130-3",
book-URL = "http://www.springerlink.com/content/978-3-642-35130-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nguyen:2012:DQB,
author = "Anh P. Nguyen and Thuc D. Nguyen",
title = "Determining Quality of {S}-Boxes Using Pseudo Random
Sequences Generated from Stream Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7440",
pages = "72--79",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33065-0_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:37 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33065-0_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33065-0",
book-URL = "http://www.springerlink.com/content/978-3-642-33065-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nguyen:2012:LRS,
author = "Manh Ha Nguyen and Keisuke Tanaka and Kenji Yasunaga",
title = "Leakage-Resilience of Stateless\slash Stateful
Public-Key Encryption from Hash Proofs",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7372",
pages = "208--222",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31448-3_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:08 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31448-3_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31448-3",
book-URL = "http://www.springerlink.com/content/978-3-642-31448-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nguyen:2012:SOU,
author = "Long Hoang Nguyen and A. W. Roscoe",
title = "Short-Output Universal Hash Functions and Their Use in
Fast and Secure Data Authentication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7549",
pages = "326--345",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34047-5_19",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:44 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34047-5_19/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34047-5",
book-URL = "http://www.springerlink.com/content/978-3-642-34047-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ning:2012:DCA,
author = "Huansheng Ning and Hong Liu and Laurence T. Yang and
Yan Zhang",
title = "Dual cryptography authentication protocol and its
security analysis for radio frequency identification
systems",
journal = j-CCPE,
volume = "24",
number = "17",
pages = "2040--2054",
day = "10",
month = dec,
year = "2012",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.1827",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Nov 5 07:44:57 MST 2012",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "22 Sep 2011",
}
@Article{Ning:2012:DPB,
author = "H. Ning and H. Liu and Q. Liu and G. Ji",
title = "Directed Path Based Authentication Scheme for the
{Internet of Things}",
journal = j-J-UCS,
volume = "18",
number = "9",
pages = "1112--??",
month = "????",
year = "2012",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Nov 8 12:03:08 MST 2012",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_18_9/directed_path_based_authentication",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@TechReport{NIST:2012:RRN,
author = "{NIST}",
title = "Recommendation for Random Number Generation Using
Deterministic Random Bit Generators",
type = "Special Publication",
number = "800-90",
institution = pub-NIST,
address = pub-NIST:adr,
year = "2012",
bibdate = "Mon Mar 09 15:53:55 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://csrc.nist.gov/publications/PubsSPs.html#800-90A",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 58]{Schneier:2015:SWC}.",
}
@Article{Nojoumian:2012:SRS,
author = "Mehrdad Nojoumian and Douglas R. Stinson",
title = "Socio-Rational Secret Sharing as a New Direction in
Rational Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7638",
pages = "18--37",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34266-0_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:22 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34266-0_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34266-0",
book-URL = "http://www.springerlink.com/content/978-3-642-34266-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Obrenovic:2012:IUC,
author = "{\v{Z}}eljko Obrenovic and Bart den Haak",
title = "Integrating User Customization and Authentication: The
Identity Crisis",
journal = j-IEEE-SEC-PRIV,
volume = "10",
number = "5",
pages = "82--85",
month = sep # "\slash " # oct,
year = "2012",
DOI = "https://doi.org/10.1109/MSP.2012.119",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Mon Oct 22 07:45:36 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Obrien:2012:EPM,
author = "James F. O'brien and Hany Farid",
title = "Exposing photo manipulation with inconsistent
reflections",
journal = j-TOG,
volume = "31",
number = "1",
pages = "4:1--4:??",
month = jan,
year = "2012",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/2077341.2077345",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Fri Feb 17 19:15:29 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/tog/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
abstract = "The advent of sophisticated photo editing software has
made it increasingly easier to manipulate digital
images. Often visual inspection cannot definitively
distinguish the resulting forgeries from authentic
photographs. In response, forensic techniques have
emerged to detect geometric or statistical
inconsistencies that result from specific forms of
photo manipulation. In this article we describe a new
forensic technique that focuses on geometric
inconsistencies that arise when fake reflections are
inserted into a photograph or when a photograph
containing reflections is manipulated. This analysis
employs basic rules of reflective geometry and linear
perspective projection, makes minimal assumptions about
the scene geometry, and only requires the user to
identify corresponding points on an object and its
reflection.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@Article{Ohtake:2012:AAH,
author = "Go Ohtake and Kazuto Ogawa",
title = "Application Authentication for Hybrid Services of
Broadcasting and Communications Networks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7115",
pages = "171--186",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27890-7_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:29 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27890-7_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27890-7",
book-URL = "http://www.springerlink.com/content/978-3-642-27890-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ohzeki:2012:NWM,
author = "Kazuo Ohzeki and YuanYu Wei and Yutaka Hirakawa and
Kiyotsugu Sato",
title = "A New Watermarking Method with Obfuscated Quasi-Chirp
Transform",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "57--71",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Okamoto:2012:AAH,
author = "Tatsuaki Okamoto and Katsuyuki Takashima",
title = "Adaptively Attribute-Hiding (Hierarchical) Inner
Product Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "591--608",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_34;
https://doi.org/10.1007/978-3-642-29011-4_35",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-29011-4_34;
http://link.springer.com/chapter/10.1007/978-3-642-29011-4_35/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Oliveira:2012:STA,
author = "Leonardo B. Oliveira and Aman Kansal and Conrado P. L.
Gouv{\^e}a and Diego F. Aranha and Julio L{\'o}pez and
Bodhi Priyantha and Michel Goraczko and Feng Zhao",
title = "{Secure-TWS}: Authenticating Node to Multi-user
Communication in Shared Sensor Networks",
journal = j-COMP-J,
volume = "55",
number = "4",
pages = "384--396",
month = apr,
year = "2012",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr089",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Mar 27 18:19:58 MDT 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/55/4.toc;
https://www.math.utah.edu/pub/tex/bib/comp2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/55/4/384.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 8, 2011",
}
@Article{Owczarek:2012:LPL,
author = "Agnieszka Owczarek and Krzysztof {\'S}lot",
title = "Lipreading Procedure for Liveness Verification in
Video Authentication Systems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7208",
pages = "115--124",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28942-2_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:19 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28942-2_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28942-2",
book-URL = "http://www.springerlink.com/content/978-3-642-28942-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pandey:2012:PPS,
author = "Omkant Pandey and Yannis Rouselakis",
title = "Property Preserving Symmetric Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "375--391",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_22;
https://doi.org/10.1007/978-3-642-29011-4_23",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-29011-4_22;
http://link.springer.com/chapter/10.1007/978-3-642-29011-4_23/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pandit:2012:EFS,
author = "Tapas Pandit and Rana Barua",
title = "Efficient Fully Secure Attribute-Based Encryption
Schemes for General Access Structures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7496",
pages = "193--214",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33272-2_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33272-2_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33272-2",
book-URL = "http://www.springerlink.com/content/978-3-642-33272-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Papas:2012:MLR,
author = "Marios Papas and Thomas Houit and Derek Nowrouzezahrai
and Markus Gross and Wojciech Jarosz",
title = "The magic lens: refractive steganography",
journal = j-TOG,
volume = "31",
number = "6",
pages = "186:1--186:??",
month = nov,
year = "2012",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/2366145.2366205",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Thu Nov 15 16:10:28 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/tog/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
abstract = "We present an automatic approach to design and
manufacture passive display devices based on optical
hidden image decoding. Motivated by classical
steganography techniques we construct Magic Lenses,
composed of refractive lenslet arrays, to reveal hidden
images when placed over potentially unstructured
printed or displayed source images. We determine the
refractive geometry of these surfaces by formulating
and efficiently solving an inverse light transport
problem, taking into account additional constraints
imposed by the physical manufacturing processes. We
fabricate several variants on the basic magic lens idea
including using a single source image to encode several
hidden images which are only revealed when the lens is
placed at prescribed orientations on the source image
or viewed from different angles. We also present an
important special case, the universal lens, that forms
an injection mapping from the lens surface to the
source image grid, allowing it to be used with
arbitrary source images. We use this type of lens to
generate hidden animation sequences. We validate our
simulation results with many real-world manufactured
magic lenses, and experiment with two separate
manufacturing processes.",
acknowledgement = ack-nhfb,
articleno = "186",
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@Article{Parent:2012:WAI,
author = "Xavier Parent",
title = "Why Be Afraid of Identity?",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7360",
pages = "295--307",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29414-3_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:52 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29414-3_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29414-3",
book-URL = "http://www.springerlink.com/content/978-3-642-29414-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Park:2012:APO,
author = "Jong Hyuk Park",
title = "An authentication protocol offering service anonymity
of mobile device in ubiquitous environment",
journal = j-J-SUPERCOMPUTING,
volume = "62",
number = "1",
pages = "105--117",
month = oct,
year = "2012",
CODEN = "JOSUED",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Fri Oct 26 07:42:33 MDT 2012",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=62&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=62&issue=1&spage=105",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Park:2012:IDF,
author = "JeaHoon Park and JaeCheol Ha",
title = "Improved Differential Fault Analysis on Block Cipher
{ARIA}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7690",
pages = "82--95",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35416-8_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:58 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35416-8_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35416-8",
book-URL = "http://www.springerlink.com/content/978-3-642-35416-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pathak:2012:PPS,
author = "Manas Pathak and Jose Portelo and Bhiksha Raj and
Isabel Trancoso",
title = "Privacy-Preserving Speaker Authentication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7483",
pages = "1--22",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33383-5_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33383-5_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33383-5",
book-URL = "http://www.springerlink.com/content/978-3-642-33383-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Paul:2012:KSS,
author = "Goutam Paul and Ian Davidson and Imon Mukherjee and S.
S. Ravi",
title = "Keyless Steganography in Spatial Domain Using
Energetic Pixels",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7671",
pages = "134--148",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35130-3_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:37 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35130-3_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35130-3",
book-URL = "http://www.springerlink.com/content/978-3-642-35130-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Peck:2012:CAC,
author = "Morgan E. Peck",
title = "The cryptoanarchists' answer to cash",
journal = j-IEEE-SPECTRUM,
volume = "49",
number = "6",
pages = "50--56",
month = jun,
year = "2012",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2012.6203968",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 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/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Bitcoin; Cryptography; Currency; Digital printing;
dollar bill; electronic money; Exchange rates; Internet
smut; Public key cryptography; stripper",
}
@Article{Peinado:2012:CAT,
author = "Alberto Peinado and Amparo F{\'u}ster-Sabater",
title = "Cryptographic Analysis of a Type of Sequence
Generators",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7671",
pages = "265--276",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35130-3_19",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:37 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35130-3_19/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35130-3",
book-URL = "http://www.springerlink.com/content/978-3-642-35130-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pendl:2012:ECC,
author = "Christian Pendl and Markus Pelnar and Michael Hutter",
title = "Elliptic Curve Cryptography on the {WISP} {UHF} {RFID}
Tag",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7055",
pages = "32--47",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25286-0_3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:19 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-25286-0_3/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-25286-0",
book-URL = "http://www.springerlink.com/content/978-3-642-25286-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Peter:2012:AHE,
author = "Andreas Peter and Max Kronberg and Wilke Trei and
Stefan Katzenbeisser",
title = "Additively Homomorphic Encryption with a Double
Decryption Mechanism, Revisited",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7483",
pages = "242--257",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33383-5_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33383-5_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33383-5",
book-URL = "http://www.springerlink.com/content/978-3-642-33383-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Petrlic:2012:PRE,
author = "Ronald Petrlic",
title = "Proxy Re-encryption in a Privacy-Preserving Cloud
Computing {DRM} Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7672",
pages = "194--211",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35362-8_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35362-8_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35362-8",
book-URL = "http://www.springerlink.com/content/978-3-642-35362-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Phan:2012:DDB,
author = "Duong Hieu Phan and David Pointcheval and Mario
Strefler",
title = "Decentralized Dynamic Broadcast Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7485",
pages = "166--183",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32928-9_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:35 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32928-9_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32928-9",
book-URL = "http://www.springerlink.com/content/978-3-642-32928-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Phan:2012:MBT,
author = "Duong Hieu Phan and David Pointcheval and Mario
Strefler",
title = "Message-Based Traitor Tracing with Optimal Ciphertext
Rate",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7533",
pages = "56--77",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33481-8_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33481-8_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33481-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33481-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pippal:2012:SVU,
author = "Ravi Singh Pippal and Jaidhar C. D. and Shashikala
Tapaswi",
title = "Security Vulnerabilities of User Authentication Scheme
Using Smart Card",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7371",
pages = "106--113",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31540-4_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:06 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31540-4_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31540-4",
book-URL = "http://www.springerlink.com/content/978-3-642-31540-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Piret:2012:PBC,
author = "Gilles Piret and Thomas Roche and Claude Carlet",
title = "{PICARO} --- a Block Cipher Allowing Efficient
Higher-Order Side-Channel Resistance",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7341",
pages = "311--328",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31284-7_19",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31284-7_19/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31284-7",
book-URL = "http://www.springerlink.com/content/978-3-642-31284-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Poh:2012:SEC,
author = "Geong Sen Poh and Moesfa Soeheila Mohamad and Muhammad
Reza Z'aba",
title = "Structured Encryption for Conceptual Graphs",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7631",
pages = "105--122",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34117-5_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:12 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34117-5_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34117-5",
book-URL = "http://www.springerlink.com/content/978-3-642-34117-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pohls:2012:RDI,
author = "Henrich C. P{\"o}hls and Focke H{\"o}hne",
title = "The Role of Data Integrity in {EU} Digital Signature
Legislation --- Achieving Statutory Trust for
Sanitizable Signature Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7170",
pages = "175--192",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29963-6_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29963-6_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29963-6",
book-URL = "http://www.springerlink.com/content/978-3-642-29963-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Poller:2012:EIC,
author = "Andreas Poller and Ulrich Waldmann and Sven Vowe and
Sven Turpe",
title = "Electronic Identity Cards for User Authentication ---
Promise and Practice",
journal = j-IEEE-SEC-PRIV,
volume = "10",
number = "1",
pages = "46--54",
month = jan # "\slash " # feb,
year = "2012",
DOI = "https://doi.org/10.1109/MSP.2011.148",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Feb 15 12:40:29 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Popa:2012:CPQ,
author = "Raluca Ada Popa and Catherine M. S. Redfield and
Nickolai Zeldovich and Hari Balakrishnan",
title = "{CryptDB}: processing queries on an encrypted
database",
journal = j-CACM,
volume = "55",
number = "9",
pages = "103--111",
month = sep,
year = "2012",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2330667.2330691",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Oct 23 06:56:18 MDT 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Poppelmann:2012:TEA,
author = "Thomas P{\"o}ppelmann and Tim G{\"u}neysu",
title = "Towards Efficient Arithmetic for Lattice-Based
Cryptography on Reconfigurable Hardware",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7533",
pages = "139--158",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33481-8_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33481-8_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33481-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33481-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Priemuth-Schmid:2012:ASV,
author = "Deike Priemuth-Schmid",
title = "Attacks on Simplified Versions of {K2}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7053",
pages = "117--127",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25261-7_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:16 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-25261-7_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-25261-7",
book-URL = "http://www.springerlink.com/content/978-3-642-25261-7",
fjournal = "Lecture Notes in Computer Science",
keywords = "K2 stream cipher",
}
@Article{Pudovkina:2012:RKA,
author = "Marina Pudovkina",
title = "A Related-Key Attack on Block Ciphers with Weak
Recurrent Key Schedules",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6888",
pages = "90--101",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27901-0_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:19:37 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27901-0_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27901-0",
book-URL = "http://www.springerlink.com/content/978-3-642-27901-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pyun:2012:IBF,
author = "Young June Pyun and Younghee Park and Douglas S.
Reeves and Xinyuan Wang and Peng Ning",
title = "Interval-based flow watermarking for tracing
interactive traffic",
journal = j-COMP-NET-AMSTERDAM,
volume = "56",
number = "5",
pages = "1646--1665",
day = "30",
month = mar,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2012.01.017",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Thu Apr 12 08:06:25 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128612000412",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Rangasamy:2012:ERP,
author = "Jothi Rangasamy and Douglas Stebila and Colin Boyd and
Juan Manuel Gonz{\'a}lez-Nieto",
title = "Effort-Release Public-Key Encryption from
Cryptographic Puzzles",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7372",
pages = "194--207",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31448-3_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:08 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31448-3_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31448-3",
book-URL = "http://www.springerlink.com/content/978-3-642-31448-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Rao:2012:SSA,
author = "Burepalli V. S. Rao and Munaga V. N. K. Prasad",
title = "Subset Selection Approach for Watermarking Relational
Databases",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6411",
pages = "181--188",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27872-3_27",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Dec 24 07:14:53 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-27872-3_27",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27872-3",
book-URL = "http://www.springerlink.com/content/978-3-642-27872-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Rifa-Pous:2012:AHD,
author = "Helena Rif{\`a}-Pous and Carles Garrigues",
title = "Authenticating hard decision sensing reports in
cognitive radio networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "56",
number = "2",
pages = "566--576",
day = "2",
month = feb,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2011.10.006",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Feb 4 10:23:06 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128611003720",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Rjasko:2012:BBP,
author = "Michal Rja{\v{s}}ko",
title = "Black-Box Property of Cryptographic Hash Functions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6888",
pages = "181--193",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27901-0_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:19:37 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27901-0_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27901-0",
book-URL = "http://www.springerlink.com/content/978-3-642-27901-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Rodriguez-Vazquez:2012:SCB,
author = "Juan Jos{\'e} Rodr{\'\i}guez-V{\'a}zquez and Sixto
Romero-S{\'a}nchez and Miguel C{\'a}rdenas-Montes",
title = "Speeding Up a Chaos-Based Image Encryption Algorithm
Using {GPGPU}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6927",
pages = "592--599",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27549-4_76",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Dec 24 07:13:59 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-27549-4_76",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27549-4",
book-URL = "http://www.springerlink.com/content/978-3-642-27549-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Roettger:2012:PKC,
author = "Eric Roettger and Hugh C. Williams",
title = "Public-Key Cryptography Based on a Cubic Extension of
the {Lucas} Functions",
journal = j-FUND-INFO,
volume = "114",
number = "3--4",
pages = "325--344",
month = aug,
year = "2012",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2012-633",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:14:51 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Rogaway:2012:SCS,
author = "Phillip Rogaway and Mark Wooding and Haibin Zhang",
title = "The Security of Ciphertext Stealing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7549",
pages = "180--195",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34047-5_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:44 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34047-5_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34047-5",
book-URL = "http://www.springerlink.com/content/978-3-642-34047-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Romero:2012:IBB,
author = "J. J. Romero",
title = "{India}'s big bet on identity",
journal = j-IEEE-SPECTRUM,
volume = "49",
number = "3",
pages = "48--56",
month = mar,
year = "2012",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2012.6156865",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "biometric authentication system; biometrics;
biometrics (access control); Biometrics (access
control); Government policies; identity; India;
Information technology; message authentication;
Privacy",
}
@Article{Saarinen:2012:PPK,
author = "Markku-Juhani O. Saarinen",
title = "The {PASSERINE} Public Key Encryption and
Authentication Mechanism",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7127",
pages = "283--288",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27937-9_20",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:40 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27937-9_20/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27937-9",
book-URL = "http://www.springerlink.com/content/978-3-642-27937-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sachnev:2012:IME,
author = "Vasily Sachnev and Hyoung Joong Kim",
title = "An Improved Matrix Encoding Scheme for {JPEG}
Steganography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "3--15",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_3/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Safkhani:2012:SMA,
author = "Masoumeh Safkhani and Nasour Bagheri and Somitra Kumar
Sanadhya and Majid Naderi and Hamid Behnam",
title = "On the Security of Mutual Authentication Protocols for
{RFID} Systems: The Case of {Wei} et al. 's Protocol",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7122",
pages = "90--103",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28879-1_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28879-1_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28879-1",
book-URL = "http://www.springerlink.com/content/978-3-642-28879-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sahai:2012:DCC,
author = "Amit Sahai and Hakan Seyalioglu and Brent Waters",
title = "Dynamic Credentials and Ciphertext Delegation for
Attribute-Based Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7417",
pages = "199--217",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32009-5_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:07 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32009-5_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32009-5",
book-URL = "http://www.springerlink.com/content/978-3-642-32009-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sallam:2012:EBM,
author = "Ahmed I. Sallam and El-Sayed El-Rabaie and Osama S.
Faragallah",
title = "Encryption-based multilevel model for {DBMS}",
journal = j-COMPUT-SECUR,
volume = "31",
number = "4",
pages = "437--446",
month = jun,
year = "2012",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:28 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404812000417",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Sang:2012:SSF,
author = "Lifeng Sang and Anish Arora",
title = "A shared-secret free security infrastructure for
wireless networks",
journal = j-TAAS,
volume = "7",
number = "2",
pages = "23:1--23:??",
month = jul,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2240166.2240173",
ISSN = "1556-4665 (print), 1556-4703 (electronic)",
ISSN-L = "1556-4665",
bibdate = "Tue Nov 6 19:20:32 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/taas.bib",
abstract = "This article develops a shared-secret free wireless
security infrastructure that provides confidentiality,
identity authentication, message authentication,
integrity, sender nonrepudiation, receiver
nonrepudiation, and anonymity. Our infrastructure is
based on two physical primitives, namely collaborative
jamming and spatial signature enforcement, and a zero
knowledge alternative for bootstrapping trust. Notably,
it eschews the use of shared secrets, while providing a
cryptosystem that is no less secure than conventional
cryptosystems.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Autonomous and Adaptive Systems
(TAAS)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1010",
}
@Article{Sarier:2012:SNB,
author = "Neyire Deniz Sarier",
title = "Security Notions of Biometric Remote Authentication
Revisited",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7170",
pages = "72--89",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29963-6_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29963-6_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29963-6",
book-URL = "http://www.springerlink.com/content/978-3-642-29963-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sarma:2012:STP,
author = "Amardeo Sarma and Joao Girao",
title = "Supporting Trust and Privacy with an Identity-Enabled
Architecture",
journal = j-FUTURE-INTERNET,
volume = "4",
number = "4",
pages = "1016--1025",
day = "19",
month = nov,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi4041016",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:49 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/4/4/1016",
abstract = "Cost reduction and a vastly increased potential to
create new services, such as via the proliferation of
the Cloud, have led to many more players and ``end
points''. With many of them being new entrants,
possibly short-lived, the question of how to handle
trust and privacy in this new context arises. In this
paper, we specifically look at the underlying
infrastructure that connects end-points served by these
players, which is an essential part of the overall
architecture to enable trust and privacy. We present an
enhanced architecture that allows real people, objects
and services to reliably interact via an infrastructure
providing assured levels of trust.",
acknowledgement = ack-nhfb,
remark = "Special Issue Privacy in the Future Internet.",
}
@Article{Sasaki:2012:DSW,
author = "Yu Sasaki",
title = "Double-{SP} Is Weaker Than Single-{SP}: Rebound
Attacks on {Feistel} Ciphers with Several Rounds",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7668",
pages = "265--282",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34931-7_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34931-7_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34931-7",
book-URL = "http://www.springerlink.com/content/978-3-642-34931-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sasaki:2012:IKK,
author = "Yu Sasaki and Sareh Emami and Deukjo Hong and Ashish
Kumar",
title = "Improved Known-Key Distinguishers on {Feistel--SP}
Ciphers and Application to {Camellia}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7372",
pages = "87--100",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31448-3_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:08 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31448-3_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31448-3",
book-URL = "http://www.springerlink.com/content/978-3-642-31448-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Satir:2012:CBT,
author = "Esra Satir and Hakan Isik",
title = "A compression-based text steganography method",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "10",
pages = "2385--2394",
month = oct,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.05.027",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Jul 9 14:35:24 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212001379",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Saxena:2012:BIT,
author = "Nitin Saxena and C. Seshadhri",
title = "Blackbox Identity Testing for Bounded Top-Fanin
Depth-$3$ Circuits: The Field Doesn't Matter",
journal = j-SIAM-J-COMPUT,
volume = "41",
number = "5",
pages = "1285--1298",
month = "????",
year = "2012",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/10848232",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Wed Oct 31 08:33:29 MDT 2012",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/41/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 2012",
}
@Book{Schaathun:2012:MLI,
author = "Hans Georg Schaathun",
title = "Machine learning in image steganalysis",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xi + 284",
year = "2012",
DOI = "https://doi.org/10.1002/9781118437957",
ISBN = "0-470-66305-7, 1-118-43795-0, 1-283-60392-6,
1-118-43796-9, 1-118-43798-5, 1-118-43800-0",
ISBN-13 = "978-0-470-66305-9, 978-1-118-43795-7,
978-1-283-60392-8, 978-1-118-43796-4,
978-1-118-43798-8, 978-1-118-43800-8",
LCCN = "Q325.5 .S285 2012",
bibdate = "Wed Aug 27 07:30:35 MDT 2014",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://onlinelibrary.wiley.com/book/10.1002/9781118437957",
abstract = "The only book to look at steganalysis from the
perspective of machine learning theory, and to apply
the common technique of machine learning to the
particular field of steganalysis; ideal for people
working in both disciplines.",
acknowledgement = ack-nhfb,
subject = "Computergraphik; Kryptoanalyse; Maschinelles Lernen;
Steganographie; Machine learning; Wavelets
(Mathematics); Data encryption (Computer science);
SCIENCE; Waves and Wave Mechanics; COMPUTERS;
Enterprise Applications; Business Intelligence Tools;
Intelligence (AI) and Semantics; Machine learning;
Wavelets (Mathematics); Data encryption (Computer
science); Data encryption (Computer science); Machine
learning; Wavelets (Mathematics)",
tableofcontents = "Front Matter \\
Overview \\
Introduction \\
Steganography and Steganalysis \\
Getting Started with a Classifier \\
Features \\
Histogram Analysis \\
Bit-Plane Analysis \\
More Spatial Domain Features \\
The Wavelets Domain \\
Steganalysis in the JPEG Domain \\
Calibration Techniques \\
Classifiers \\
Simulation and Evaluation \\
Support Vector Machines \\
Other Classification Algorithms \\
Feature Selection and Evaluation \\
The Steganalysis Problem \\
Future of the Field \\
Bibliography \\
Index",
}
@Article{Schaffer:2012:EII,
author = "J. S. Schaffer and M. L. Stokes and N. Yan",
title = "Enabling an integrated identity from disparate
sources",
journal = j-IBM-JRD,
volume = "56",
number = "6",
pages = "6:1--6:10",
month = "????",
year = "2012",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/JRD.2012.2214091",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Fri Jan 25 11:44:56 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6355654",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
keywords = "digital identities for Web users; social computing;
user privacy",
}
@Article{Scheidat:2012:STT,
author = "Tobias Scheidat and Karl K{\"u}mmel and Claus
Vielhauer",
title = "Short Term Template Aging Effects on Biometric Dynamic
Handwriting Authentication Performance",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7394",
pages = "107--116",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32805-3_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32805-3_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32805-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32805-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Schilling:2012:ATU,
author = "Thorsten Ernst Schilling and H{\aa}vard Raddum",
title = "Analysis of {Trivium} Using Compressed Right Hand Side
Equations",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7259",
pages = "18--32",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31912-9_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:40 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012d.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31912-9_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31912-9",
book-URL = "http://www.springerlink.com/content/978-3-642-31912-9",
fjournal = "Lecture Notes in Computer Science",
keywords = "Trivium cipher",
}
@Article{Schmitz:2012:NAC,
author = "Roland Schmitz and Shujun Li and Christos Grecos and
Xinpeng Zhang",
title = "A New Approach to Commutative
Watermarking-Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7394",
pages = "117--130",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32805-3_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32805-3_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32805-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32805-3",
fjournal = "Lecture Notes in Computer Science",
}
@Book{Schneier:2012:LOE,
author = "Bruce Schneier",
title = "Liars and outliers: enabling the trust that society
needs to thrive",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "384 (est.)",
year = "2012",
ISBN = "1-118-14330-2 (paperback)",
ISBN-13 = "978-1-118-14330-8 (paperback)",
LCCN = "????",
bibdate = "Thu Feb 2 11:55:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://spectrum.ieee.org/at-work/innovation/review-liars-outliers",
acknowledgement = ack-nhfb,
}
@Article{Schnoor:2012:DES,
author = "Henning Schnoor",
title = "Deciding Epistemic and Strategic Properties of
Cryptographic Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7459",
pages = "91--108",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33167-1_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:02 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33167-1_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33167-1",
book-URL = "http://www.springerlink.com/content/978-3-642-33167-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sengupta:2012:SAI,
author = "Madhumita Sengupta and J. K. Mandal",
title = "Self Authentication of image through {Daubechies}
Transform technique {(SADT)}",
journal = "arXiv.org",
volume = "??",
number = "??",
pages = "1--4",
day = "9",
month = dec,
year = "2012",
CODEN = "????",
ISSN = "2331-8422",
ISSN-L = "2331-8422",
bibdate = "Fri Mar 9 06:55:56 MST 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://arxiv.org/abs/1212.1863",
abstract = "In this paper a $ 4 \times 4 $ Daubechies transform
based authentication technique termed as SADT has been
proposed to authenticate gray scale images. The cover
image is transformed into the frequency domain using $
4 \times 4 $ mask in a row major order using Daubechies
transform technique, resulting four frequency subbands
AF, HF, VF and DF. One byte of every band in a mask is
embedding with two or four bits of secret information.
Experimental results are computed and compared with the
existing authentication techniques like Li's method
[5], SCDFT [6], Region-Based method [7] and other
similar techniques based on Mean Square Error (MSE),
Peak Signal to Noise Ratio (PSNR) and Image Fidelity
(IF), which shows better performance in SADT.",
acknowledgement = ack-nhfb,
remark = "4 page paper in 47th Annual National Convention of
COMPUTER SOCIETY OF INDIA, The First International
Conference on Intelligent Infrastructure, CSI-2012,
held during 1st and 2nd December, 2012 at science city,
Kolkata.",
subject = "Cryptography and Security (cs.CR); Computer Vision and
Pattern Recognition (cs.CV)",
}
@Article{Seo:2012:MPM,
author = "Hwajeong Seo and Howon Kim",
title = "Multi-precision Multiplication for Public-Key
Cryptography on Embedded Microprocessors",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7690",
pages = "55--67",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35416-8_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:58 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35416-8_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35416-8",
book-URL = "http://www.springerlink.com/content/978-3-642-35416-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Serrato:2012:IAN,
author = "Christy Serrato",
title = "Identity assurance and network security",
journal = j-NETWORK-SECURITY,
volume = "2012",
number = "4",
pages = "19--20",
month = apr,
year = "2012",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(12)70028-4",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485812700284",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Sethumadhavan:2012:CHD,
author = "Simha Sethumadhavan and Ryan Roberts and Yannis
Tsividis",
title = "A Case for Hybrid Discrete-Continuous Architectures",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "11",
number = "1",
pages = "1--4",
month = jan # "\slash " # jun,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1109/L-CA.2011.22",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Current technology trends indicate that power- and
energy-efficiency will limit chip throughput in the
future. Current solutions to these problems, either in
the way of programmable or fixed-function digital
accelerators will soon reach their limits as
microarchitectural overheads are successively trimmed.
A significant departure from current computing methods
is required to carry forward computing advances beyond
digital accelerators. In this paper we describe how the
energy-efficiency of a large class of problems can be
improved by employing a hybrid of the discrete and
continuous models of computation instead of the
ubiquitous, traditional discrete model of computation.
We present preliminary analysis of domains and
benchmarks that can be accelerated with the new model.
Analysis shows that machine learning, physics and up to
one-third of SPEC, RMS and Berkeley suite of
applications can be accelerated with the new hybrid
model.",
acknowledgement = ack-nhfb,
affiliation = "Sethumadhavan, S (Reprint Author), Columbia Univ, New
York, NY 10027 USA. Sethumadhavan, Simha; Roberts,
Ryan; Tsividis, Yannis, Columbia Univ, New York, NY
10027 USA.",
author-email = "simha@cs.columbia.edu",
da = "2019-06-20",
doc-delivery-number = "953VM",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "DARPA; AFRL [FA8750-10-2-0253,
FA9950-09-1-0389]; NSF",
funding-text = "Sethumadhavan's research is funded by grants from
DARPA, AFRL (FA8750-10-2-0253, FA9950-09-1-0389), the
NSF CAREER program, gifts from Microsoft Research and
Columbia University, and software donations from
Synopsys and Wind River. Roberts conducted this
research as a GRA in Sethumadhavan's Lab.",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "Approximation algorithms; Benchmark testing; Berkeley
suite; Computational modeling; Computer architecture;
computer architecture; computing methods; continuous
models; cryptography; Design studies; Differential
equations; discrete model; discrete models; domains
analysis; energy conservation; energy-efficiency;
fixed-function digital accelerators; forward computing
advances; hybrid discrete-continuous architectures;
Hybrid systems; machine learning; Mathematical model;
microarchitectural overheads; microprocessor chips;
power-efficiency; Processor architectures; RMS; SPEC;
Very large scale integration",
number-of-cited-references = "16",
research-areas = "Computer Science",
times-cited = "4",
unique-id = "Sethumadhavan:2012:CHD",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Shakeri:2012:RZW,
author = "Mahsa Shakeri and Mansour Jamzad",
title = "A Robust Zero-Watermark Copyright Protection Scheme
Based on {DWT} and Image Normalization",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7088",
pages = "359--370",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25346-1_32",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Dec 24 07:07:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-25346-1_32",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-25346-1",
book-URL = "http://www.springerlink.com/content/978-3-642-25346-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Shankar:2012:BDF,
author = "Deepa D. Shankar and T. Gireeshkumar and K. Praveen
and R. Jithin and Ashji S. Raj",
title = "Block Dependency Feature Based Classification Scheme
for Uncalibrated Image Steganalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6411",
pages = "189--195",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27872-3_28",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Dec 24 07:14:53 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-27872-3_28",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27872-3",
book-URL = "http://www.springerlink.com/content/978-3-642-27872-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Shao:2012:AKP,
author = "Jun Shao and Peng Liu and Yuan Zhou",
title = "Achieving key privacy without losing {CCA} security in
proxy re-encryption",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "3",
pages = "655--665",
month = mar,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.09.034",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri Feb 17 07:42:10 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211002421",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Sheldon:2012:IWN,
author = "Frederick T. Sheldon and John Mark Weber and Seong-Moo
Yoo and W. David Pan",
title = "The Insecurity of Wireless Networks",
journal = j-IEEE-SEC-PRIV,
volume = "10",
number = "4",
pages = "54--61",
month = jul # "\slash " # aug,
year = "2012",
DOI = "https://doi.org/10.1109/MSP.2012.60",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Aug 29 17:25:32 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
keywords = "AES (Advanced Encryption Standard); Beck--Tews attack;
Chopchop attack; Counter Mode Cipher Block Chaining
Message Authentication Code (CCMP); Halvorsen--Haugen
attack; Hole 196 attack; message integrity check (MIC);
Temporal Key Integrity Protocol (TKIP); Wi-Fi Protected
Access (WPA); Wi-Fi Protected Access version 2 (WPA-2);
Wired Equivalency Protocol (WEP)",
}
@Article{Shen:2012:PAS,
author = "Jing Shen and Yusong Du",
title = "A Password Authentication Scheme against {Smart Card}
Security Breach",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7473",
pages = "37--44",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34062-8_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:20 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34062-8_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34062-8",
book-URL = "http://www.springerlink.com/content/978-3-642-34062-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Shparlinski:2012:CSD,
author = "Igor E. Shparlinski and Katherine E. Stange",
title = "Character Sums with Division Polynomials",
journal = j-CAN-MATH-BULL,
volume = "55",
number = "4",
pages = "850--??",
month = dec,
year = "2012",
CODEN = "CMBUA3",
DOI = "https://doi.org/10.4153/CMB-2011-126-x",
ISSN = "0008-4395 (print), 1496-4287 (electronic)",
ISSN-L = "0008-4395",
bibdate = "Mon Nov 5 08:57:39 MST 2012",
bibsource = "http://cms.math.ca/cmb/v55/;
https://www.math.utah.edu/pub/tex/bib/canmathbull.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "We obtain nontrivial estimates of quadratic character
sums of division polynomials $ \Psi_n(P) $, $ n = 1, 2,
\dots $, evaluated at a given point $P$ on an elliptic
curve over a finite field of $q$ elements. Our bounds
are nontrivial if the order of $P$ is at least $ q^{1 /
2 + \varepsilon }$ for some fixed $ \varepsilon > 0$.
This work is motivated by an open question about
statistical indistinguishability of some
cryptographically relevant sequences that was recently
brought up by K. Lauter and the second author.",
acknowledgement = ack-nhfb,
fjournal = "Canadian mathematical bulletin = Bulletin canadien de
math{\'e}matiques",
journal-URL = "http://cms.math.ca/cmb/",
}
@Article{Shrivastava:2012:UIE,
author = "Swapnil Shrivastava and Zia Saquib and Gopinath P. and
Peeyush Chomal",
title = "Unique Identity Enabled Service Delivery through
{NSDG}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7452",
pages = "103--111",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32701-8_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32701-8_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32701-8",
book-URL = "http://www.springerlink.com/content/978-3-642-32701-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Siad:2012:NAP,
author = "Amar Siad",
title = "A New Approach for Private Searches on Public-Key
Encrypted Data",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7394",
pages = "160--173",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32805-3_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32805-3_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32805-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32805-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Souissi:2012:OCP,
author = "Youssef Souissi and Nicolas Debande and Sami Mekki and
Sylvain Guilley and Ali Maalaoui",
title = "On the Optimality of Correlation Power Attack on
Embedded Cryptographic Systems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7322",
pages = "169--178",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-30955-7_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:02 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-30955-7_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-30955-7",
book-URL = "http://www.springerlink.com/content/978-3-642-30955-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Spiez:2012:RCT,
author = "Stanis{\l}aw Spie{\.z} and Marian Srebrny and Jerzy
Urbanowicz",
title = "Remarks on the Classical Threshold Secret Sharing
Schemes",
journal = j-FUND-INFO,
volume = "114",
number = "3--4",
pages = "345--357",
month = aug,
year = "2012",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2012-634",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:14:51 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Srinivasan:2012:RAP,
author = "Avinash Srinivasan and Lashidhar Chennupati",
title = "Robust Authentication of Public Access Points Using
Digital Certificates --- a Novel Approach",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7672",
pages = "153--164",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35362-8_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35362-8_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35362-8",
book-URL = "http://www.springerlink.com/content/978-3-642-35362-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Stanek:2012:TEM,
author = "Martin Stanek",
title = "Threshold Encryption into Multiple Ciphertexts",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6888",
pages = "62--72",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27901-0_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:19:37 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27901-0_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27901-0",
book-URL = "http://www.springerlink.com/content/978-3-642-27901-0",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Stefan:2012:ACT,
author = "Deian Stefan and Alejandro Russo and Pablo Buiras and
Amit Levy and John C. Mitchell and David Mazi{\'e}res",
title = "Addressing covert termination and timing channels in
concurrent information flow systems",
journal = j-SIGPLAN,
volume = "47",
number = "9",
pages = "201--214",
month = sep,
year = "2012",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2398856.2364557",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Thu Nov 15 16:40:19 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "When termination of a program is observable by an
adversary, confidential information may be leaked by
terminating accordingly. While this termination covert
channel has limited bandwidth for sequential programs,
it is a more dangerous source of information leakage in
concurrent settings. We address concurrent termination
and timing channels by presenting a dynamic
information-flow control system that mitigates and
eliminates these channels while allowing termination
and timing to depend on secret values. Intuitively, we
leverage concurrency by placing such potentially
sensitive actions in separate threads. While
termination and timing of these threads may expose
secret values, our system requires any thread observing
these properties to raise its information-flow label
accordingly, preventing leaks to lower-labeled
contexts. We implement this approach in a Haskell
library and demonstrate its applicability by building a
web server that uses information-flow control to
restrict untrusted web applications.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "ICFP '12 conference proceedings.",
}
@Article{Stolte:2012:EDA,
author = "Daniel Stolte",
title = "Experts determine age of book 'nobody can read'",
journal = "{UANews}",
day = "11",
month = feb,
year = "2012",
bibdate = "Thu Jun 28 13:19:31 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://uanews.org/node/37825;
http://www.rdmag.com/News/2011/02/Materials-Testing-Experts-determine-age-of-book-nobody-can-read/",
acknowledgement = ack-nhfb,
keywords = "Voynich manuscript",
}
@Article{Su:2012:IIN,
author = "Chen Su and Haining Fan",
title = "Impact of {Intel}'s new instruction sets on software
implementation of {$ {\rm GF}(2)[x] $} multiplication",
journal = j-INFO-PROC-LETT,
volume = "112",
number = "12",
pages = "497--502",
day = "30",
month = jun,
year = "2012",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2012.03.012",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon May 21 07:13:00 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019012000804",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
keywords = "AVX; Cryptography; GF(2)[x] multiplication; Karatsuba
algorithm; PCLMULQDQ; SSE",
}
@Article{Suciu:2012:SED,
author = "Dan Suciu",
title = "{SQL} on an encrypted database: technical
perspective",
journal = j-CACM,
volume = "55",
number = "9",
pages = "102--102",
month = sep,
year = "2012",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2330667.2330690",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Oct 23 06:56:18 MDT 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Suoranta:2012:ASM,
author = "Sanna Suoranta and Jani Heikkinen and Pekka
Silvekoski",
title = "Authentication Session Migration",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7127",
pages = "17--32",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27937-9_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:40 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27937-9_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27937-9",
book-URL = "http://www.springerlink.com/content/978-3-642-27937-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Suoranta:2012:SAM,
author = "Sanna Suoranta and Andr{\'e} Andrade and Tuomas Aura",
title = "Strong Authentication with Mobile Phone",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7483",
pages = "70--85",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33383-5_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33383-5_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33383-5",
book-URL = "http://www.springerlink.com/content/978-3-642-33383-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sur:2012:SSU,
author = "Arijit Sur and Vignesh Ramanathan",
title = "Secure Steganography Using Randomized Cropping",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7110",
pages = "82--95",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28693-3_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28693-3_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28693-3",
book-URL = "http://www.springerlink.com/content/978-3-642-28693-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Suriadi:2012:PCV,
author = "Suriadi Suriadi and Chun Ouyang and Ernest Foo",
title = "Privacy Compliance Verification in Cryptographic
Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7400",
pages = "251--276",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35179-2_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:45 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35179-2_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35179-2",
book-URL = "http://www.springerlink.com/content/978-3-642-35179-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Tan:2012:LCP,
author = "Zuowen Tan",
title = "A lightweight conditional privacy-preserving
authentication and access control scheme for pervasive
computing environments",
journal = j-J-NETW-COMPUT-APPL,
volume = "35",
number = "6",
pages = "1839--1846",
month = nov,
year = "2012",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:25 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804512001609",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Tan:2012:SLM,
author = "Shunquan Tan",
title = "Steganalysis of {LSB} Matching Revisited for
Consecutive Pixels Using {B}-Spline Functions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "16--29",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Tang:2012:RSS,
author = "Zhaohui Tang and Hoon Wei Lim and Huaxiong Wang",
title = "Revisiting a Secret Sharing Approach to Network
Codes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7496",
pages = "300--317",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33272-2_20",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33272-2_20/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33272-2",
book-URL = "http://www.springerlink.com/content/978-3-642-33272-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Tani:2012:EQA,
author = "Seiichiro Tani and Hirotada Kobayashi and Keiji
Matsumoto",
title = "Exact Quantum Algorithms for the Leader Election
Problem",
journal = j-TOCT,
volume = "4",
number = "1",
pages = "1:1--1:??",
month = mar,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2141938.2141939",
ISSN = "1942-3454 (print), 1942-3462 (electronic)",
ISSN-L = "1942-3454",
bibdate = "Tue Nov 6 18:23:48 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/toct/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toct.bib",
abstract = "This article gives a separation between quantum and
classical models in pure (i.e., noncryptographic)
computing abilities with no restriction on the amount
of available computing resources, by considering the
exact solvability of the leader election problem in
anonymous networks, a celebrated unsolvable problem in
classical distributed computing. The goal of the leader
election problem is to elect a unique leader from among
distributed parties. In an anonymous network, all
parties with the same number of communication links are
identical. It is well-known that no classical algorithm
can exactly solve (i.e., in bounded time without error)
the leader election problem in anonymous networks, even
if the number of parties is given. This article devises
a quantum algorithm that, if the number of parties is
given, exactly solves the problem for any network
topology in polynomial rounds with polynomial
communication/time complexity with respect to the
number of parties, when the parties are connected with
quantum communication links and they have the ability
of quantum computing. Our algorithm works even when
only an upper bound of the number of parties is given.
In such a case, no classical algorithm can solve the
problem even under the zero-error setting, the setting
in which error is not allowed but running time may be
unbounded.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Computation Theory (TOCT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1190",
}
@Article{Tassa:2012:SDC,
author = "Tamir Tassa and Ehud Gudes",
title = "Secure distributed computation of anonymized views of
shared databases",
journal = j-TODS,
volume = "37",
number = "2",
pages = "11:1--11:??",
month = may,
year = "2012",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/2188349.2188353",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri Jun 1 17:45:19 MDT 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "We consider the problem of computing efficient
anonymizations of partitioned databases. Given a
database that is partitioned between several sites,
either horizontally or vertically, we devise secure
distributed algorithms that allow the different sites
to obtain a k -anonymized and l-diverse view of the
union of their databases, without disclosing sensitive
information. Our algorithms are based on the sequential
algorithm [Goldberger and Tassa 2010] that offers
anonymizations with utility that is significantly
better than other anonymization algorithms, and in
particular those that were implemented so far in the
distributed setting. Our algorithms can apply to
different generalization techniques and utility
measures and to any number of sites. While previous
distributed algorithms depend on costly cryptographic
primitives, the cryptographic assumptions of our
solution are surprisingly minimal.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Database Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
}
@Article{Terrovitis:2012:PPD,
author = "Manolis Terrovitis and Nikos Mamoulis and John
Liagouris and Spiros Skiadopoulos",
title = "Privacy preservation by disassociation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "944--955",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "In this work, we focus on protection against identity
disclosure in the publication of sparse
multidimensional data. Existing multidimensional
anonymization techniques (a) protect the privacy of
users either by altering the set of quasi-identifiers
of the original data (e.g., by generalization or
suppression) or by adding noise (e.g., using
differential privacy) and/or (b) assume a clear
distinction between sensitive and non-sensitive
information and sever the possible linkage. In many
real world applications the above techniques are not
applicable. For instance, consider web search query
logs. Suppressing or generalizing anonymization methods
would remove the most valuable information in the
dataset: the original query terms. Additionally, web
search query logs contain millions of query terms which
cannot be categorized as sensitive or non-sensitive
since a term may be sensitive for a user and
non-sensitive for another. Motivated by this
observation, we propose an anonymization technique
termed disassociation that preserves the original terms
but hides the fact that two or more different terms
appear in the same record. We protect the users'
privacy by disassociating record terms that participate
in identifying combinations. This way the adversary
cannot associate with high probability a record with a
rare combination of terms. To the best of our
knowledge, our proposal is the first to employ such a
technique to provide protection against identity
disclosure. We propose an anonymization algorithm based
on our approach and evaluate its performance on real
and synthetic datasets, comparing it against other
state-of-the-art methods based on generalization and
differential privacy.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
}
@Article{Thorpe:2012:CRB,
author = "Christopher Thorpe and Steven R. Willis",
title = "Cryptographic Rule-Based Trading",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7397",
pages = "65--72",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32946-3_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32946-3_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32946-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32946-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Tian:2012:SSB,
author = "Huawei Tian and Zheng Wang and Yao Zhao and Rongrong
Ni and Lunming Qin",
title = "Spread Spectrum-Based Multi-bit Watermarking for
Free-View Video",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "156--166",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Tian:2012:TOE,
author = "Hui Tian and Hong Jiang and Ke Zhou and Dan Feng",
title = "Transparency-Orientated Encoding Strategies for
{Voice-over-IP} Steganography",
journal = j-COMP-J,
volume = "55",
number = "6",
pages = "702--716",
month = jun,
year = "2012",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr111",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed May 30 11:20:33 MDT 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/55/6.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/55/6/702.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 3, 2011",
}
@Article{Tong:2012:NBD,
author = "Xiao-jun Tong",
title = "The novel bilateral --- {Diffusion} image encryption
algorithm with dynamical compound chaos",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "4",
pages = "850--858",
month = apr,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.10.051",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri Feb 17 07:42:13 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211002834",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Trammel:2012:DTP,
author = "John Trammel and {\"U}mit Yal{\c{c}}inalp and Andrei
Kalfas and James Boag and Dan Brotsky",
title = "Device Token Protocol for Persistent Authentication
Shared across Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7592",
pages = "230--243",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33427-6_20",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:26 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012j.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33427-6_20/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33427-6",
book-URL = "http://www.springerlink.com/content/978-3-642-33427-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Tsaur:2012:ESM,
author = "Woei-Jiunn Tsaur and Jia-Hong Li and Wei-Bin Lee",
title = "An efficient and secure multi-server authentication
scheme with key agreement",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "4",
pages = "876--882",
month = apr,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.10.049",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri Feb 17 07:42:13 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211002810",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Tsay:2012:VUL,
author = "Joe-Kai Tsay and Stig F. Mj{\o}lsnes",
title = "A Vulnerability in the {UMTS} and {LTE} Authentication
and Key Agreement Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7531",
pages = "65--76",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33704-8_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:26 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33704-8_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33704-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33704-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Tseng:2012:ERI,
author = "Yuh-Min Tseng and Tung-Tso Tsai",
title = "Efficient Revocable {ID}-Based Encryption with a
Public Channel",
journal = j-COMP-J,
volume = "55",
number = "4",
pages = "475--486",
month = apr,
year = "2012",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr098",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Mar 27 18:19:58 MDT 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/55/4.toc;
https://www.math.utah.edu/pub/tex/bib/comp2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/55/4/475.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 29, 2011",
}
@Article{Tsougenis:2012:PEM,
author = "E. D. Tsougenis and G. A. Papakostas and D. E.
Koulouriotis and V. D. Tourassis",
title = "Performance evaluation of moment-based watermarking
methods: a review",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "8",
pages = "1864--1884",
month = aug,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.02.045",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri May 18 08:44:03 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212000684",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Vaikuntanathan:2012:HCE,
author = "Vinod Vaikuntanathan",
title = "How to Compute on Encrypted Data",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7668",
pages = "1--15",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34931-7_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34931-7_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34931-7",
book-URL = "http://www.springerlink.com/content/978-3-642-34931-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Valamehr:2012:IRM,
author = "Jonathan Valamehr and Melissa Chase and Seny Kamara
and Andrew Putnam and Dan Shumow and Vinod
Vaikuntanathan and Timothy Sherwood",
title = "Inspection resistant memory: architectural support for
security from physical examination",
journal = j-COMP-ARCH-NEWS,
volume = "40",
number = "3",
pages = "130--141",
month = jun,
year = "2012",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/2366231.2337174",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Thu Sep 6 10:21:07 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "ISCA '12 conference proceedings.",
abstract = "The ability to safely keep a secret in memory is
central to the vast majority of security schemes, but
storing and erasing these secrets is a difficult
problem in the face of an attacker who can obtain
unrestricted physical access to the underlying
hardware. Depending on the memory technology, the very
act of storing a 1 instead of a 0 can have physical
side effects measurable even after the power has been
cut. These effects cannot be hidden easily, and if the
secret stored on chip is of sufficient value, an
attacker may go to extraordinary means to learn even a
few bits of that information. Solving this problem
requires a new class of architectures that measurably
increase the difficulty of physical analysis. In this
paper we take a first step towards this goal by
focusing on one of the backbones of any hardware
system: on-chip memory. We examine the relationship
between security, area, and efficiency in these
architectures, and quantitatively examine the resulting
systems through cryptographic analysis and
microarchitectural impact. In the end, we are able to
find an efficient scheme in which, even if an adversary
is able to inspect the value of a stored bit with a
probabilistic error of only 5\%, our system will be
able to prevent that adversary from learning any
information about the original un-coded bits with
99.9999999999\% probability.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Vivek:2012:CSE,
author = "S. Sree Vivek and S. Sharmila Deva Selvi and C. Pandu
Rangan",
title = "Compact Stateful Encryption Schemes with Ciphertext
Verifiability",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7631",
pages = "87--104",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34117-5_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:12 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34117-5_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34117-5",
book-URL = "http://www.springerlink.com/content/978-3-642-34117-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Vleju:2012:CCA,
author = "Mircea Boris Vleju",
title = "A Client-Centric {ASM}-Based Approach to Identity
Management in Cloud Computing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7518",
pages = "34--43",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33999-8_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33999-8_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33999-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33999-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wang:2012:BRR,
author = "Ding Wang and Chun-guang Ma and Sen-dong Zhao and
Chang-li Zhou",
title = "Breaking a Robust Remote User Authentication Scheme
Using Smart Cards",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7513",
pages = "110--118",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35606-3_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:06 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35606-3_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35606-3",
book-URL = "http://www.springerlink.com/content/978-3-642-35606-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wang:2012:FOP,
author = "Xu An Wang and Xinyi Huang and Xiaoyuan Yang and
Longfei Liu and Xuguang Wu",
title = "Further observation on proxy re-encryption with
keyword search",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "3",
pages = "643--654",
month = mar,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.09.035",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri Feb 17 07:42:10 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211002433",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Wang:2012:MCE,
author = "Jinwei Wang and Shiguo Lian",
title = "On multiwatermarking in cloud environment",
journal = j-CCPE,
volume = "24",
number = "17",
pages = "2151--2164",
day = "10",
month = dec,
year = "2012",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.1820",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Nov 5 07:44:57 MST 2012",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "16 Sep 2011",
}
@Article{Wang:2012:NFS,
author = "Hui Wang and Anthony T. S. Ho and Xi Zhao",
title = "A Novel Fast Self-restoration Semi-fragile
Watermarking Algorithm for Image Content Authentication
Resistant to {JPEG} Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "72--85",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wang:2012:NIS,
author = "Xiaofeng Wang and Nanning Zheng and Jianru Xue and
Zhenli Liu",
title = "A Novel Image Signature Method for Content
Authentication",
journal = j-COMP-J,
volume = "55",
number = "6",
pages = "686--701",
month = jun,
year = "2012",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr108",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed May 30 11:20:33 MDT 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/55/6.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/55/6/686.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "October 15, 2011",
}
@Article{Wang:2012:PAC,
author = "Lei Wang and Yu Sasaki and Kazuo Sakiyama and Kazuo
Ohta",
title = "Polynomial-Advantage Cryptanalysis of {$3$D} Cipher
and {$3$D}-Based Hash Function",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7631",
pages = "170--181",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34117-5_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:12 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34117-5_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34117-5",
book-URL = "http://www.springerlink.com/content/978-3-642-34117-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wang:2012:PCE,
author = "Qingju Wang and Andrey Bogdanov",
title = "The provable constructive effect of diffusion
switching mechanism in {CLEFIA}-type block ciphers",
journal = j-INFO-PROC-LETT,
volume = "112",
number = "11",
pages = "427--432",
day = "15",
month = jun,
year = "2012",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2012.02.006",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon May 21 07:12:59 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019012000555",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Wang:2012:RTC,
author = "Liyun Wang and Hefei Ling and Fuhao Zou and Zhengding
Lu",
title = "Real-Time Compressed-Domain Video Watermarking
Resistance to Geometric Distortions",
journal = j-IEEE-MULTIMEDIA,
volume = "19",
number = "1",
pages = "70--79",
month = jan # "\slash " # mar,
year = "2012",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2011.76",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Thu Mar 1 14:21:05 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
}
@Article{Wang:2012:SPB,
author = "Ding Wang and Chun-guang Ma and Peng Wu",
title = "Secure Password-Based Remote User Authentication
Scheme with Non-tamper Resistant Smart Cards",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7371",
pages = "114--121",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31540-4_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:06 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31540-4_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31540-4",
book-URL = "http://www.springerlink.com/content/978-3-642-31540-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Watanabe:2012:ITT,
author = "Yohei Watanabe and Takenobu Seito and Junji Shikata",
title = "Information-Theoretic Timed-Release Security:
Key-Agreement, Encryption, and Authentication Codes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7412",
pages = "167--186",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32284-6_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:00 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32284-6_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32284-6",
book-URL = "http://www.springerlink.com/content/978-3-642-32284-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Waters:2012:FER,
author = "Brent Waters",
title = "Functional Encryption for Regular Languages",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7417",
pages = "218--235",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32009-5_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:07 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32009-5_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32009-5",
book-URL = "http://www.springerlink.com/content/978-3-642-32009-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wei:2012:CSO,
author = "Fushan Wei and Zhenfeng Zhang and Chuangui Ma",
title = "Corrigendum to {``Gateway-oriented
password-authenticated key exchange protocol in the
standard model' [J. Syst. Softw. {\bf 85} (March (3))
(2012) 760--768]}",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "9",
pages = "2192--2192",
month = sep,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.05.070",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Thu Jun 28 16:13:33 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
note = "See \cite{Wei:2012:GOP}.",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212001550",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Wei:2012:GOP,
author = "Fushan Wei and Zhenfeng Zhang and Chuangui Ma",
title = "Gateway-oriented password-authenticated key exchange
protocol in the standard model",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "3",
pages = "760--768",
month = mar,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.09.061",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri Feb 17 07:42:10 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211002597",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Wei:2012:IRK,
author = "Yuechuan Wei and Chao Li and Dan Cao",
title = "Improved Related-Key Rectangle Attack on the Full
{HAS-160} Encryption Mode",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "3",
pages = "733--??",
month = apr,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500074",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:16:05 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wei:2012:NCI,
author = "Xiaopeng Wei and Ling Guo and Qiang Zhang and Jianxin
Zhang and Shiguo Lian",
title = "A novel color image encryption algorithm based on
{DNA} sequence operation and hyper-chaotic system",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "2",
pages = "290--299",
month = feb,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.08.017",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:32 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211002147",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Wei:2012:NTB,
author = "Zhuo Wei and Xuhua Ding and Robert Huijie Deng and
Yongdong Wu",
title = "No Tradeoff between Confidentiality and Performance:
An Analysis on {H.264\slash SVC} Partial Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7394",
pages = "72--86",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32805-3_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32805-3_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32805-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32805-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Weir:2012:AVC,
author = "Jonathan Weir and WeiQi Yan",
title = "Authenticating Visual Cryptography Shares Using {$2$D}
Barcodes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "196--210",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_17/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Weir:2012:IHV,
author = "Jonathan Weir and Weiqi Yan and Mohan S. Kankanhalli",
title = "Image hatching for visual cryptography",
journal = j-TOMCCAP,
volume = "8",
number = "2S",
pages = "32:1--32:??",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2344436.2344438",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Nov 6 18:13:05 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Image hatching (or nonphotorealistic line-art) is a
technique widely used in the printing or engraving of
currency. Diverse styles of brush strokes have
previously been adopted for different areas of an image
to create aesthetically pleasing textures and shading.
Because there is no continuous tone within these types
of images, a multilevel scheme is proposed, which uses
different textures based on a threshold level. These
textures are then applied to the different levels and
are then combined to build up the final hatched image.
The proposed technique allows a secret to be hidden
using Visual Cryptography (VC) within the hatched
images. Visual cryptography provides a very powerful
means by which one secret can be distributed into two
or more pieces known as shares. When the shares are
superimposed exactly together, the original secret can
be recovered without computation. Also provided is a
comparison between the original grayscale images and
the resulting hatched images that are generated by the
proposed algorithm. This reinforces that the overall
quality of the hatched scheme is sufficient. The
Structural SIMilarity index (SSIM) is used to perform
this comparison.",
acknowledgement = ack-nhfb,
articleno = "32",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Weng:2012:NCC,
author = "Zhiwei Weng and Jian Weng and Kai He and Yingkai Li",
title = "New Chosen Ciphertext Secure Public Key Encryption in
the Standard Model with Public Verifiability",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6839",
pages = "170--176",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25944-9_22",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Dec 24 07:11:45 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-25944-9_22",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-25944-9",
book-URL = "http://www.springerlink.com/content/978-3-642-25944-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wu:2012:AST,
author = "Shengbao Wu and Mingsheng Wang",
title = "Automatic Search of Truncated Impossible Differentials
for Word-Oriented Block Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7668",
pages = "283--302",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34931-7_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:33 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34931-7_17/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34931-7",
book-URL = "http://www.springerlink.com/content/978-3-642-34931-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wu:2012:DAA,
author = "Hongjun Wu and Tao Huang and Phuong Ha Nguyen and
Huaxiong Wang and San Ling",
title = "Differential Attacks against Stream Cipher {ZUC}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7658",
pages = "262--277",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34961-4_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:20 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34961-4_17/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34961-4",
book-URL = "http://www.springerlink.com/content/978-3-642-34961-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wu:2012:PSC,
author = "Wei Wu and Yi Mu and Willy Susilo and Xinyi Huang and
Li Xu",
title = "A Provably Secure Construction of Certificate-Based
Encryption from Certificateless Encryption",
journal = j-COMP-J,
volume = "55",
number = "10",
pages = "1157--1168",
month = oct,
year = "2012",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr130",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Oct 26 08:44:19 MDT 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/55/10.toc;
https://www.math.utah.edu/pub/tex/bib/comp2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/55/10/1157.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "January 5, 2012",
}
@Article{Wu:2012:RGB,
author = "Xiaotian Wu and Wei Sun",
title = "Random grid-based visual secret sharing for general
access structures with cheat-preventing ability",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "5",
pages = "1119--1134",
month = may,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.12.041",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 27 06:33:47 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211003220",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Wu:2012:RIB,
author = "Tsu-Yang Wu and Yuh-Min Tseng and Tung-Tso Tsai",
title = "A revocable {ID}-based authenticated group key
exchange protocol with resistant to malicious
participants",
journal = j-COMP-NET-AMSTERDAM,
volume = "56",
number = "12",
pages = "2994--3006",
day = "16",
month = aug,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2012.05.011",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Jul 9 14:38:47 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128612001995",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Wu:2012:SWG,
author = "Hao-tian Wu and Yiu-ming Cheung",
title = "Secure Watermarking on {$3$D} Geometry via {ICA} and
Orthogonal Transformation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7110",
pages = "52--62",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28693-3_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28693-3_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28693-3",
book-URL = "http://www.springerlink.com/content/978-3-642-28693-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wu:2012:UFS,
author = "Xiaotian Wu and Duanhao Ou and Qiming Liang and Wei
Sun",
title = "A user-friendly secret image sharing scheme with
reversible steganography based on cellular automata",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "8",
pages = "1852--1863",
month = aug,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.02.046",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri May 18 08:44:03 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212000696",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Xi:2012:MDA,
author = "Kai Xi and Jiankun Hu and Fengling Han",
title = "Mobile device access control: an improved correlation
based face authentication scheme and its {Java ME}
application",
journal = j-CCPE,
volume = "24",
number = "10",
pages = "1066--1085",
month = jul,
year = "2012",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.1797",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Nov 5 07:44:49 MST 2012",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/java2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "28 Jul 2011",
}
@Article{Xie:2012:DPK,
author = "Xiang Xie and Rui Xue and Rui Zhang",
title = "Deterministic Public Key Encryption and Identity-Based
Encryption from Lattices in the Auxiliary-Input
Setting",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7485",
pages = "1--18",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32928-9_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:35 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32928-9_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32928-9",
book-URL = "http://www.springerlink.com/content/978-3-642-32928-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Xie:2012:ORI,
author = "Min Xie and Libin Wang",
title = "One-round identity-based key exchange with {Perfect
Forward Security}",
journal = j-INFO-PROC-LETT,
volume = "112",
number = "14--15",
pages = "587--591",
day = "15",
month = aug,
year = "2012",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2012.05.001",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed May 30 11:09:52 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019012001196",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Xie:2012:RAA,
author = "Yulai Xie",
title = "Review of {{\booktitle{Applied Algebra: Codes, Ciphers
and Discrete Algorithms}}, by Darel W. Hardy, Fred
Richman, and Carol L. Walker}",
journal = j-SIGACT,
volume = "43",
number = "3",
pages = "25--27",
month = sep,
year = "2012",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2421096.2421101",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Sun May 5 10:25:39 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Xie:2012:RBA,
author = "Yulai Xie",
title = "Review of {{\booktitle{Applied Algebra: Codes, Ciphers
and Discrete Algorithms}}, by Darel W. Hardy, Fred
Richman, and Carol L. Walker}",
journal = j-SIGACT,
volume = "43",
number = "3",
pages = "25--27",
month = sep,
year = "2012",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2421096.2421101",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Sun May 5 10:25:39 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Xiong:2012:CBP,
author = "Kaiqi Xiong and Ronghua Wang and Wenliang Du and Peng
Ning",
title = "Containing bogus packet insertion attacks for
broadcast authentication in sensor networks",
journal = j-TOSN,
volume = "8",
number = "3",
pages = "20:1--20:??",
month = jul,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2240092.2240094",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Tue Nov 6 18:02:35 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Broadcast is a critical communication primitive in
wireless sensor networks. The multihop nature of sensor
networks makes it necessary for sensor nodes to forward
broadcast messages so that the messages can reach an
entire network. Authentication of broadcast messages is
an important but challenging problem in sensor
networks. Public key cryptography (PKC) has been used
recently to address this problem. However, PKC-based
authentication techniques are susceptible to bogus
packet insertion attacks in which attackers keep
broadcasting bogus messages and force
resource-constrained sensor nodes to forward such
messages. Moreover, because it takes time to do
signature verifications, it is impractical for each
node to authenticate every received message before
forwarding it. In this article, we propose a dynamic
window scheme to thwart the aforementioned bogus packet
insertion attacks which permits sensor nodes to
efficiently broadcast messages. Within this scheme, a
sensor node has the ability to determine whether or not
to verify an incoming message before forwarding the
message. We further study the property of this dynamic
window scheme and investigate the best strategy for
thwarting bogus packet insertion attacks. We propose
three strategies for finding the optimal parameters by
an improved additive increase multiplicative decrease
(AIMD) window updating function so that the proposed
dynamic window scheme can achieve the best overall
performance with respect to the authentication and
forwarding times of messages. Numerical validations
show that our proposed scheme performs very well in
terms of energy saving and broadcast delays based on
three different metrics, including average
authentication delays, the percentage of nodes
receiving fake messages, and the percentage of nodes
forwarding fake messages.",
acknowledgement = ack-nhfb,
articleno = "20",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Xiong:2012:CLR,
author = "Hao Xiong and Cong Zhang and Tsz Hon Yuen and Echo P.
Zhang and Siu Ming Yiu and Sihan Qing",
title = "Continual Leakage-Resilient Dynamic Secret Sharing in
the Split-State Model",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7618",
pages = "119--130",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34129-8_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:56 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34129-8_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34129-8",
book-URL = "http://www.springerlink.com/content/978-3-642-34129-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Xiong:2012:PPK,
author = "Kaiqi Xiong",
title = "The Performance of Public Key-Based Authentication
Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7645",
pages = "206--219",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34601-9_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:17:59 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34601-9_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34601-9",
book-URL = "http://www.springerlink.com/content/978-3-642-34601-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Xu:2012:AHA,
author = "Chang Xu and Zhoujun Li and Yi Mu and Hua Guo and Tao
Guo",
title = "Affiliation-Hiding Authenticated Asymmetric Group Key
Agreement",
journal = j-COMP-J,
volume = "55",
number = "10",
pages = "1180--1191",
month = oct,
year = "2012",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxs022",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Oct 26 08:44:19 MDT 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/55/10.toc;
https://www.math.utah.edu/pub/tex/bib/comp2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/55/10/1180.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "March 16, 2012",
}
@Article{Xu:2012:APA,
author = "Zhi Xu and Hungyuan Hsu and Xin Chen and Sencun Zhu
and Ali R. Hurson",
title = "{AK-PPM}: An Authenticated Packet Attribution Scheme
for Mobile Ad Hoc Networks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7462",
pages = "147--168",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33338-5_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:06 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33338-5_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33338-5",
book-URL = "http://www.springerlink.com/content/978-3-642-33338-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yamada:2012:PBR,
author = "Takaaki Yamada and Isao Echizen",
title = "{PC}-Based Real-Time Video Watermark Embedding System
Independent of Platform for Parallel Computing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7110",
pages = "15--33",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28693-3_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28693-3_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28693-3",
book-URL = "http://www.springerlink.com/content/978-3-642-28693-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yamada:2012:UEW,
author = "Takaaki Yamada and Yoshiyasu Takahashi",
title = "Use of ``Emergable Watermarks'' as Copy Indicators for
Securing Video Content",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "181--195",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yamaguchi:2012:EVC,
author = "Yasushi Yamaguchi",
title = "An Extended Visual Cryptography Scheme for
Continuous-Tone Images",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "228--242",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_19",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_19/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yan:2012:SMA,
author = "Diqun Yan and Rangding Wang and Xianmin Yu and Jie
Zhu",
title = "Steganography for {MP3} audio by exploiting the rule
of window switching",
journal = j-COMPUT-SECUR,
volume = "31",
number = "5",
pages = "704--716",
month = jul,
year = "2012",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:29 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404812000673",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Yang:2012:BPN,
author = "Shuguo Yang and Yongbin Zhou and Jiye Liu and Danyang
Chen",
title = "Back Propagation Neural Network Based Leakage
Characterization for Practical Security Analysis of
Cryptographic Implementations",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7259",
pages = "169--185",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31912-9_12",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:40 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012d.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31912-9_12/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31912-9",
book-URL = "http://www.springerlink.com/content/978-3-642-31912-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yang:2012:EMA,
author = "Rui Yang and Zhenhua Qu and Jiwu Huang",
title = "Exposing {MP3} audio forgeries using frame offsets",
journal = j-TOMCCAP,
volume = "8",
number = "2S",
pages = "35:1--35:??",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2344436.2344441",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Nov 6 18:13:05 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Audio recordings should be authenticated before they
are used as evidence. Although audio watermarking and
signature are widely applied for authentication, these
two techniques require accessing the original audio
before it is published. Passive authentication is
necessary for digital audio, especially for the most
popular audio format: MP3. In this article, we propose
a passive approach to detect forgeries of MP3 audio.
During the process of MP3 encoding the audio samples
are divided into frames, and thus each frame has its
own frame offset after encoding. Forgeries lead to the
breaking of framing grids. So the frame offset is a
good indication for locating forgeries, and it can be
retrieved by the identification of the quantization
characteristic. In this way, the doctored positions can
be automatically located. Experimental results
demonstrate that the proposed approach is effective in
detecting some common forgeries, such as deletion,
insertion, substitution, and splicing. Even when the
bit rate is as low as 32 kbps, the detection rate is
above 99\%.",
acknowledgement = ack-nhfb,
articleno = "35",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Yang:2012:LUC,
author = "Bo Yang and Mingwu Zhang",
title = "{LR-UESDE}: a Continual-Leakage Resilient Encryption
with Unbounded Extensible Set Delegation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7496",
pages = "125--142",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33272-2_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33272-2_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33272-2",
book-URL = "http://www.springerlink.com/content/978-3-642-33272-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yang:2012:NIB,
author = "Geng Yang and Qiang Zhou and Xiaolong Xu and Jian Xu
and Chunming Rong",
title = "A Novel Identity-Based Key Management and Encryption
Scheme for Distributed System",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7672",
pages = "123--138",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35362-8_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012l.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35362-8_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35362-8",
book-URL = "http://www.springerlink.com/content/978-3-642-35362-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yang:2012:PST,
author = "Jun-Han Yang and Tian-Jie Cao",
title = "Provably secure three-party password authenticated key
exchange protocol in the standard model",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "2",
pages = "340--350",
month = feb,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.08.024",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:32 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211002172",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Yang:2012:SAK,
author = "Zheng Yang and J{\"o}rg Schwenk",
title = "Strongly Authenticated Key Exchange Protocol from
Bilinear Groups without Random Oracles",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7496",
pages = "264--275",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33272-2_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33272-2_17/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33272-2",
book-URL = "http://www.springerlink.com/content/978-3-642-33272-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yang:2012:WSI,
author = "Chunfang Yang and Fenlin Liu and Shiguo Lian and
Xiangyang Luo and Daoshun Wang",
title = "Weighted Stego-Image Steganalysis of Messages Hidden
into Each Bit Plane",
journal = j-COMP-J,
volume = "55",
number = "6",
pages = "717--727",
month = jun,
year = "2012",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr112",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed May 30 11:20:33 MDT 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/55/6.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/55/6/717.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "October 28, 2011",
}
@Article{Yasuda:2012:ASM,
author = "Takanori Yasuda and Tsuyoshi Takagi and Kouichi
Sakurai",
title = "Application of Scalar Multiplication of {Edwards}
Curves to Pairing-Based Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7631",
pages = "19--36",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34117-5_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:12 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34117-5_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34117-5",
book-URL = "http://www.springerlink.com/content/978-3-642-34117-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yavuz:2012:BFB,
author = "Attila A. Yavuz and Peng Ning and Michael K. Reiter",
title = "{BAF} and {FI-BAF}: Efficient and Publicly Verifiable
Cryptographic Schemes for Secure Logging in
Resource-Constrained Systems",
journal = j-TISSEC,
volume = "15",
number = "2",
pages = "9:1--9:??",
month = jul,
year = "2012",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2240276.2240280",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Tue Jul 31 17:02:31 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "Audit logs are an integral part of modern computer
systems due to their forensic value. Protecting audit
logs on a physically unprotected machine in hostile
environments is a challenging task, especially in the
presence of active adversaries. It is critical for such
a system to have forward security and append-only
properties such that when an adversary compromises a
logging machine, she cannot forge or selectively delete
the log entries accumulated before the compromise.
Existing public-key-based secure logging schemes are
computationally costly. Existing symmetric secure
logging schemes are not publicly verifiable and open to
certain attacks. In this article, we develop a new
forward-secure and aggregate signature scheme called
Blind-Aggregate-Forward (BAF), which is suitable for
secure logging in resource-constrained systems. BAF is
the only cryptographic secure logging scheme that can
produce publicly verifiable, forward-secure and
aggregate signatures with low computation,
key/signature storage, and signature communication
overheads for the loggers, without requiring any online
trusted third party support. A simple variant of BAF
also allows a fine-grained verification of log entries
without compromising the security or computational
efficiency of BAF. We prove that our schemes are secure
in Random Oracle Model (ROM). We also show that they
are significantly more efficient than all the previous
publicly verifiable cryptographic secure logging
schemes.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Yavuz:2012:ECR,
author = "Attila A. Yavuz and Peng Ning and Michael K. Reiter",
title = "Efficient, Compromise Resilient and Append-Only
Cryptographic Schemes for Secure Audit Logging",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7397",
pages = "148--163",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32946-3_12",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32946-3_12/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32946-3",
book-URL = "http://www.springerlink.com/content/978-3-642-32946-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yoneyama:2012:ORA,
author = "Kazuki Yoneyama",
title = "One-Round Authenticated Key Exchange with Strong
Forward Secrecy in the Standard Model against
Constrained Adversary",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7631",
pages = "69--86",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34117-5_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:12 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34117-5_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34117-5",
book-URL = "http://www.springerlink.com/content/978-3-642-34117-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yoshida:2012:OGT,
author = "Maki Yoshida and Toru Fujiwara and Marc Fossorier",
title = "Optimum General Threshold Secret Sharing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7412",
pages = "187--204",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32284-6_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:00 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32284-6_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32284-6",
book-URL = "http://www.springerlink.com/content/978-3-642-32284-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yoshino:2012:SIP,
author = "Masayuki Yoshino and Noboru Kunihiro and Ken Naganuma
and Hisayoshi Sato",
title = "Symmetric Inner-Product Predicate Encryption Based on
Three Groups",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7496",
pages = "215--234",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33272-2_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33272-2_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33272-2",
book-URL = "http://www.springerlink.com/content/978-3-642-33272-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{You:2012:DDS,
author = "Ilsun You and Jong-Hyouk Lee and Kouichi Sakurai",
title = "{DSSH}: Digital signature based secure handover for
network-based mobility management",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "27",
number = "3",
pages = "??--??",
month = "????",
year = "2012",
CODEN = "CSSEEI",
ISSN = "0267-6192",
ISSN-L = "0267-6192",
bibdate = "Tue Dec 3 12:04:33 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
}
@Article{Yu:2012:EPF,
author = "Jia Yu and Fanyu and Kong and Xiangguo Cheng and Rong
Hao and Jianxi Fan",
title = "Erratum to the paper: {Forward-Secure Identity-Based
Public-Key Encryption without Random Oracles}",
journal = j-FUND-INFO,
volume = "114",
number = "1",
pages = "103--103",
month = jan,
year = "2012",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2011-619",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:14:40 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
note = "See \cite{Yu:2011:FSI}.",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Yu:2012:IRI,
author = "Jia Yu and Fanyu Kong and Xiangguo Cheng and Rong Hao
and Jianxi Fan",
title = "Intrusion-resilient identity-based signature:
{Security} definition and construction",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "2",
pages = "382--391",
month = feb,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.08.034",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:32 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211002342",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Yu:2012:NWM,
author = "Zhiwei Yu and Chaokun Wang and Clark Thomborson and
Jianmin Wang and Shiguo Lian and Athanasios V.
Vasilakos",
title = "A novel watermarking method for software protection in
the cloud",
journal = j-SPE,
volume = "42",
number = "4",
pages = "409--430",
month = "????",
year = "2012",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.1088",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Wed Apr 4 09:38:34 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
http://www3.interscience.wiley.com/journalfinder.html",
acknowledgement = ack-nhfb,
fjournal = "Software---Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "23 May 2011",
}
@Article{Yu:2012:SME,
author = "Jia Yu and Shuguang Wang and Huawei Zhao and Minglei
Shu and Jialiang Lv and Qiang Guo",
title = "A Simultaneous Members Enrollment and Revocation
Protocol for Secret Sharing Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7299",
pages = "190--197",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-30428-6_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:19:32 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012d.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-30428-6_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-30428-6",
book-URL = "http://www.springerlink.com/content/978-3-642-30428-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yuen:2012:IBE,
author = "Tsz Hon Yuen and Sherman S. M. Chow and Ye Zhang and
Siu Ming Yiu",
title = "Identity-Based Encryption Resilient to Continual
Auxiliary Leakage",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7237",
pages = "117--134",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29011-4_8;
https://doi.org/10.1007/978-3-642-29011-4_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 15 20:55:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-29011-4_8;
http://link.springer.com/chapter/10.1007/978-3-642-29011-4_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29011-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29011-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yum:2012:OPE,
author = "Dae Hyun Yum and Duk Soo Kim and Jin Seok Kim and Pil
Joong Lee",
title = "Order-Preserving Encryption for Non-uniformly
Distributed Plaintexts",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7115",
pages = "84--97",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27890-7_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:29 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-27890-7_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27890-7",
book-URL = "http://www.springerlink.com/content/978-3-642-27890-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhang:2012:AOP,
author = "Jiuling Zhang and Beixing Deng and Xing Li",
title = "Additive Order Preserving Encryption Based Encrypted
Documents Ranking in Secure Cloud Storage",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7332",
pages = "58--65",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31020-1_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:15 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31020-1_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31020-1",
book-URL = "http://www.springerlink.com/content/978-3-642-31020-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhang:2012:CCB,
author = "Leo Yu Zhang and Chengqing Li and Kwok-Wo Wong and Shi
Shu and Guanrong Chen",
title = "Cryptanalyzing a chaos-based image encryption
algorithm using alternate structure",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "9",
pages = "2077--2085",
month = sep,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.04.002",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Thu Jun 28 16:13:33 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S016412121200101X",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Zhang:2012:EEF,
author = "Yunmei Zhang and Joseph K. Liu and Xinyi Huang and Man
Ho Au and Willy Susilo",
title = "Efficient Escrow-Free Identity-Based Signature",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7496",
pages = "161--174",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33272-2_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33272-2_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33272-2",
book-URL = "http://www.springerlink.com/content/978-3-642-33272-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhang:2012:EHO,
author = "Wentao Zhang and Bozhan Su and Wenling Wu and Dengguo
Feng and Chuankun Wu",
title = "Extending Higher-Order Integral: An Efficient Unified
Algorithm of Constructing Integral Distinguishers for
Block Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7341",
pages = "117--134",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31284-7_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31284-7_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31284-7",
book-URL = "http://www.springerlink.com/content/978-3-642-31284-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhang:2012:LDC,
author = "Haibin Zhang",
title = "Length-Doubling Ciphers and Tweakable Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7341",
pages = "100--116",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31284-7_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31284-7_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31284-7",
book-URL = "http://www.springerlink.com/content/978-3-642-31284-7",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhang:2012:TCS,
author = "Zhifang Zhang and Yeow Meng Chee and San Ling and
Mulan Liu and Huaxiong Wang",
title = "Threshold changeable secret sharing schemes
revisited",
journal = j-THEOR-COMP-SCI,
volume = "418",
number = "1",
pages = "106--115",
day = "10",
month = feb,
year = "2012",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2011.09.027",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Jan 19 15:34:40 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397511008206",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Zhao:2012:FCS,
author = "Xingwen Zhao and Fangguo Zhang",
title = "Fully {CCA2} secure identity-based broadcast
encryption with black-box accountable authority",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "3",
pages = "708--716",
month = mar,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.09.045",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri Feb 17 07:42:10 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S016412121100255X",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Zhao:2012:IAS,
author = "Yifan Zhao and Swee-Won Lo and Robert H. Deng and
Xuhua Ding",
title = "An Improved Authentication Scheme for {H.264\slash
SVC} and Its Performance Evaluation over Non-stationary
Wireless Mobile Networks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7645",
pages = "192--205",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34601-9_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:17:59 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34601-9_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34601-9",
book-URL = "http://www.springerlink.com/content/978-3-642-34601-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhao:2012:SSM,
author = "Hong Zhao and Yun Q. Shi and Nirwan Ansari",
title = "Steganography in Streaming Multimedia over Networks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7110",
pages = "96--114",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28693-3_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:24 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28693-3_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28693-3",
book-URL = "http://www.springerlink.com/content/978-3-642-28693-3",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhao:2012:SSS,
author = "Dawei Zhao and Haipeng Peng and Cong Wang and Yixian
Yang",
title = "A secret sharing scheme with a short share realizing
the {$ (t, n) $} threshold and the adversary
structure",
journal = j-COMPUT-MATH-APPL,
volume = "64",
number = "4",
pages = "611--615",
month = aug,
year = "2012",
CODEN = "CMAPDK",
DOI = "https://doi.org/10.1016/j.camwa.2011.12.067",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
MRclass = "94A60 (91A80)",
MRnumber = "2948607",
MRreviewer = "Maura Beth Paterson",
bibdate = "Wed Mar 1 21:51:12 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122111011382",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Zhou:2012:CBF,
author = "Qing Zhou and Xiaofeng Liao",
title = "Collision-based flexible image encryption algorithm",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "2",
pages = "400--407",
month = feb,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.08.032",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:32 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211002329",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Zhu:2012:JLS,
author = "Xinglei Zhu and Chang W. Chen",
title = "A joint layered scheme for reliable and secure mobile
{JPEG-2000} streaming",
journal = j-TOMCCAP,
volume = "8",
number = "3",
pages = "30:1--30:??",
month = jul,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2240136.2240143",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Nov 6 18:13:06 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "This article presents a novel joint layered approach
to simultaneously achieve both reliable and secure
mobile JPEG-2000 image streaming. With a priori
knowledge of JPEG-2000 source coding and channel
coding, the proposed joint system integrates
authentication into the media error protection
components to ensure that every source-decodable media
unit is authenticated. By such a dedicated design, the
proposed scheme protects both compressed JPEG-2000
codestream and the authentication data from wireless
channel impairments. It is fundamentally different from
many existing systems that consider the problem of
media authentication separately from the other
operations in the media transmission system. By
utilizing the contextual relationship, such as coding
dependency and content importance between media slices
for authentication hash appending, the proposed scheme
generates an extremely low authentication overhead.
Under this joint layered coding framework, an optimal
rate allocation algorithm for source coding, channel
coding, and media authentication is developed to
guarantee end-to-end media quality. Experiment results
on JPEG-2000 images validate the proposed scheme and
demonstrate that the performance of the proposed scheme
is approaching its upper bound, in which case no
authentication is applied to the media stream.",
acknowledgement = ack-nhfb,
articleno = "30",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Zmudzinski:2012:WEU,
author = "Sascha Zmudzinski and Martin Steinebach",
title = "Watermark Embedding Using Audio Fingerprinting",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7228",
pages = "63--79",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31971-6_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:04 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31971-6_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31971-6",
book-URL = "http://www.springerlink.com/content/978-3-642-31971-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zorpette:2012:BEC,
author = "Glenn Zorpette",
title = "The beginning of the end of cash [Special Report]",
journal = j-IEEE-SPECTRUM,
volume = "49",
number = "6",
pages = "27--29",
month = jun,
year = "2012",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2012.6203962",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "cash; credit card; Credit cards; cryptography; debit
card; digital economy; electronic money; encryption;
Government; Mobile communication; Online banking;
prepaid debit card; smart cards; Social network
services; Special issues and sections",
}
@Article{Zwattendorfer:2012:CBL,
author = "Bernd Zwattendorfer and Arne Tauber and Klaus
Stranacher and Peter Reichst{\"a}dter",
title = "Cross-Border Legal Identity Management",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7443",
pages = "149--161",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33489-4_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:42 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33489-4_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33489-4",
book-URL = "http://www.springerlink.com/content/978-3-642-33489-4",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Acar:2013:SPA,
author = "Tolga Acar and Mira Belenkiy and Alptekin
K{\"u}p{\c{c}}{\"u}",
title = "Single password authentication",
journal = j-COMP-NET-AMSTERDAM,
volume = "57",
number = "13",
pages = "2597--2614",
day = "9",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2013.05.007",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Tue Aug 6 11:25:50 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128613001667",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@TechReport{Adj:2013:WDC,
author = "Gora Adj and Alfred Menezes and Thomaz Oliveira and
Francisco Rodriguez-Henriquez",
title = "Weakness of {$ \mathbb {F}_{3^{6509}} $} for discrete
logarithm cryptography",
type = "Report",
institution = "University of Waterloo",
address = "Waterloo, ON, Canada",
pages = "25",
day = "15",
month = jul,
year = "2013",
bibdate = "Thu Feb 27 06:04:08 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://crypto.2013.rump.cr.yp.to/;
http://eprint.iacr.org/2013/446",
abstract = "In 2013, Joux, and then Barbulescu, Gaudry, Joux and
Thom{\'e}, presented new algorithms for computing
discrete logarithms in finite fields of small and
medium characteristic. We show that these new
algorithms render the finite field $ \mathbb {F}_{3^{6
\cdot 509}} = \mathbb {F}_{3^{3054}} $ weak for
discrete logarithm cryptography in the sense that
discrete logarithms in this field can be computed
significantly faster than with the previous fastest
algorithms. Our concrete analysis shows that the
supersingular elliptic curve over $ \mathbb
{F}_{3^{509}} $ with embedding degree $6$ that had been
considered for implementing pairing-based cryptosystems
at the 128-bit security level in fact provides only a
significantly lower level of security. Our work
provides a convenient framework and tools for
performing a concrete analysis of the new discrete
logarithm algorithms and their variants.",
acknowledgement = ack-nhfb,
remark = "Presented at Crypto 2013 rump session, Santa Barbara,
CA, USA, 20 August 2013.",
}
@Article{Agudo:2013:PAC,
author = "Isaac Agudo and Ruben Rios and Javier Lopez",
title = "A privacy-aware continuous authentication scheme for
proximity-based access control",
journal = j-COMPUT-SECUR,
volume = "39 (part B)",
number = "??",
pages = "117--126",
month = nov,
year = "2013",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:35 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404813000874",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Book{Aid:2013:DIO,
editor = "Matthew M. Aid and William Burr and Thomas R.
Johnson",
title = "``{Disreputable} if Not Outright Illegal'': the
{National Security Agency} versus {Martin Luther King,
Muhammad Ali, Art Buchwald, Frank Church, et al.}:
Newly Declassified History Divulges Names of Prominent
{Americans} Targeted by {NSA} during {Vietnam Era}",
volume = "441",
publisher = "National Security Archive",
address = "Washington, DC, USA",
year = "2013",
LCCN = "JZ5630",
bibdate = "Mon Mar 9 12:12:19 MDT 2015",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "National Security Archive Electronic Briefing Book",
URL = "http://www2.gwu.edu/~nsarchiv/NSAEBB/NSAEBB441/",
acknowledgement = ack-nhfb,
remark = "Posted September 25, 2013.",
subject = "Military intelligence; History; 20th century;
Cryptography; United States; Electronic surveillance;
Official secrets; Cold War; Cryptography.; Electronic
surveillance.; Military intelligence.; Official
secrets.",
}
@Article{Alcaide:2013:AAP,
author = "Almudena Alcaide and Esther Palomar and Jos{\'e}
Montero-Castillo and Arturo Ribagorda",
title = "Anonymous authentication for privacy-preserving {IoT}
target-driven applications",
journal = j-COMPUT-SECUR,
volume = "37",
number = "??",
pages = "111--123",
month = sep,
year = "2013",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:33 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404813000904",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@TechReport{AlFardan:2013:LTB,
author = "Nadhem AlFardan and Kenny Paterson",
title = "Lucky Thirteen: Breaking the {TLS} and {DTLS} Record
Protocols",
type = "Report",
number = "??",
institution = "Information Security Group, Royal Holloway, University
of London",
address = "Egham, Surrey TW20 0EX, UK",
pages = "18",
day = "4",
month = feb,
year = "2013",
bibdate = "Wed Feb 06 11:48:25 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.isg.rhul.ac.uk/tls/;
http://www.isg.rhul.ac.uk/tls/TLStiming.pdf",
abstract = "The Transport Layer Security (TLS) protocol aims to
provide confidentiality and integrity of data in
transit across untrusted networks. TLS has become the
de facto secure protocol of choice for Internet and
mobile applications. DTLS is a variant of TLS that is
growing in importance. In this paper, we present
distinguishing and plaintext recovery attacks against
TLS and DTLS. The attacks are based on a delicate
timing analysis of decryption processing in the two
protocols. We include experimental results
demonstrating the feasibility of the attacks in
realistic network environments for several different
implementations of TLS and DTLS, including the leading
OpenSSL implementations. We provide countermeasures for
the attacks. Finally, we discuss the wider implications
of our attacks for the cryptographic design used by TLS
and DTLS.",
acknowledgement = ack-nhfb,
keywords = "Bouncy-Castle; GnuTLS; HMAC-MD5; HMAC-SHA-1;
HMAC-SHA-256; Java; man-in-the-middle attack;
MEE-TLS-CBC; OpenJDK; OpenSSL; PolarSSL; RC4; TLS;
yaSSL",
remark = "The authors describe, and implement in unreleased
code, a practical attack against a flaw in the
Transport Layer Security (TLS) protocol specification
that affects many existing implementations. The attack
needs close network proximity to measure small timing
differences that eventually lead to complete packet
decryption.",
}
@InProceedings{Almeida:2013:CCA,
author = "Jos{\'e} Bacelar Almeida and Manuel Barbosa and Gilles
Barthe and Fran{\c{c}}ois Dupressoir",
editor = "????",
booktitle = "{ACM Conference on Computer and Communications
Security}",
title = "Certified computer-aided cryptography: Efficient
provably secure machine code from high-level
implementations",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "1217--1230",
year = "2013",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:18:17 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 3]{Schneier:2015:SWC}.",
}
@Article{Almulla:2013:CKE,
author = "M. Almulla and A. Kanso and M. Ghebleh",
title = "A concurrent key exchange protocol based on commuting
matrices",
journal = j-CCPE,
volume = "25",
number = "5",
pages = "743--751",
day = "10",
month = apr,
year = "2013",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.1802",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Apr 29 18:46:29 MDT 2013",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Prac\-tice and
Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "28 Jul 2011",
}
@Article{Alsulaiman:2013:IVB,
author = "Fawaz A. Alsulaiman and Nizar Sakr and Julio J.
Vald{\'e}s and Abdulmotaleb {El Saddik}",
title = "Identity verification based on handwritten signatures
with haptic information using genetic programming",
journal = j-TOMCCAP,
volume = "9",
number = "2",
pages = "11:1--11:??",
month = may,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2457450.2457453",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Mar 13 07:37:48 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "In this article, haptic-based handwritten signature
verification using Genetic Programming (GP)
classification is presented. A comparison of GP-based
classification with classical classifiers including
support vector machine, $k$-nearest neighbors,
na{\"\i}ve Bayes, and random forest is conducted. In
addition, the use of GP in discovering small
knowledge-preserving subsets of features in
high-dimensional datasets of haptic-based signatures is
investigated and several approaches are explored.
Subsets of features extracted from GP-generated models
(analytic functions) are also exploited to determine
the importance and relevance of different haptic data
types (e.g., force, position, torque, and orientation)
in user identity verification. The results revealed
that GP classifiers compare favorably with the
classical methods and use a much fewer number of
attributes (with simple function sets).",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{AlTawy:2013:SOC,
author = "Riham AlTawy and Aleksandar Kircanski and Amr
Youssef",
title = "Second order collision for the 42-step reduced
{DHA-256} hash function",
journal = j-INFO-PROC-LETT,
volume = "113",
number = "19--21",
pages = "764--770",
month = sep # "\slash " # oct,
year = "2013",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2013.07.015",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Sep 9 07:26:45 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013002044",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
onlinedate = "23 July 2013",
}
@Article{Ananth:2013:SFP,
author = "Prabhanjan Ananth and Raghav Bhaskar and Vipul Goyal
and Vanishree Rao",
title = "On the (In)security of {Fischlin}'s Paradigm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "202--221",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_12",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_12/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Anderson:2013:MNF,
author = "David Anderson",
title = "{Max Newman}: forgotten man of early {British}
computing",
journal = j-CACM,
volume = "56",
number = "5",
pages = "29--31",
month = may,
year = "2013",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2447976.2447986",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Apr 30 18:42:49 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Reflections on a significant, yet often overlooked,
computing pioneer.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "`Fish' encrypted traffic; Bletchley Park; Colossus;
Heath Robinson; Manchester Small Scale Electronic
Machine (1948); Newmanry; Tunny code",
}
@Article{Andriotis:2013:JSD,
author = "Panagiotis Andriotis and George Oikonomou and Theo
Tryfonas",
title = "{JPEG} steganography detection with {Benford's Law}",
journal = "Digital Investigation",
volume = "9",
number = "3--4",
pages = "246--257",
year = "2013",
DOI = "https://doi.org/10.1016/j.diin.2013.01.005",
ISSN = "1742-2876",
bibdate = "Wed Jan 28 10:08:12 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1742287613000066",
abstract = "In this paper we present a novel approach to the
problem of steganography detection in {JPEG} images by
applying a statistical attack. The method is based on
the empirical Benford's Law and, more specifically, on
its generalized form. We prove and extend the validity
of the logarithmic rule in colour images and introduce
a blind steganographic method which can flag a file as
a suspicious stego-carrier. The proposed method
achieves very high accuracy and speed and is based on
the distributions of the first digits of the quantized
Discrete Cosine Transform coefficients present in
JPEGs. In order to validate and evaluate our algorithm,
we developed steganographic tools which are able to
analyse image files and we subsequently applied them on
the popular Uncompressed Colour Image Database.
Furthermore, we demonstrate that not only can our
method detect steganography but, if certain criteria
are met, it can also reveal which steganographic
algorithm was used to embed data in a {JPEG} file.",
acknowledgement = ack-nhfb,
keywords = "Benford's Law; Data hiding; Generalized Benford's Law;
Quantized {DCT} coefficients; Steganalysis;
Steganography detection",
}
@Article{Anonymous:2013:CFF,
author = "Anonymous",
title = "Crypto flaw found in {Android}",
journal = j-NETWORK-SECURITY,
volume = "2013",
number = "7",
pages = "2--2",
month = jul,
year = "2013",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(13)70077-1",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:56 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485813700771",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2013:CRR,
author = "Anonymous",
title = "{CryptoLocker} runs rampant, but drops ransom price",
journal = j-NETWORK-SECURITY,
volume = "2013",
number = "12",
pages = "2--2",
month = dec,
year = "2013",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(13)70130-2",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:01 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485813701302",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@TechReport{Anonymous:2013:DSS,
author = "Anonymous",
key = "FIPS-186-4",
title = "{Digital Signature Standard (DSS)}",
type = "{Federal Information Processing Standards}
Publication",
number = "FIPS Pub 186-4",
institution = pub-NIST,
address = pub-NIST:adr,
pages = "vii + 121",
month = jul,
year = "2013",
DOI = "https://doi.org/10.6028/NIST.FIPS.186-4",
bibdate = "Thu Aug 21 06:15:29 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-4.pdf",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography; Digital Signature
Standard (DSS); Federal Information Processing
Standards",
}
@Article{Anonymous:2013:NCI,
author = "Anonymous",
title = "{NSA} has cracked {Internet} encryption protocols",
journal = j-NETWORK-SECURITY,
volume = "2013",
number = "9",
pages = "1--2",
month = sep,
year = "2013",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(13)70097-7",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:58 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485813700977",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
remark = "From the article: ``The US National Security Agency
(NSA) is able to read communications secured with the
most common Internet encryption algorithms and it may
be able to hack smartphones, according to the
continuing revelations arising from the leak of secret
documents by ex-NSA contractor Edward Snowden.''",
}
@Article{Anonymous:2013:SIS,
author = "Anonymous",
title = "Special Issue on {``Security and identity architecture
for the future Internet''}",
journal = j-COMP-NET-AMSTERDAM,
volume = "57",
number = "10",
pages = "2215--2217",
day = "5",
month = jul,
year = "2013",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Jul 1 19:17:17 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128613001795",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Anonymous:2013:SSD,
author = "Anonymous",
title = "Simple Steps to Data Encryption",
journal = j-NETWORK-SECURITY,
volume = "2013",
number = "9",
pages = "4--4",
month = sep,
year = "2013",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(13)70100-4",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:58 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485813701004",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Appelbaum:2013:SSG,
author = "J. Appelbaum and J. Horchert and C. St{\"o}cker",
title = "Shopping for Spy Gear: Catalog Advertises {NSA}
Toolbox",
journal = "{Der Spiegel}",
volume = "??",
number = "??",
pages = "??--??",
day = "29",
month = dec,
year = "2013",
bibdate = "Thu Sep 22 18:39:28 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.spiegel.de/international/world/catalog-reveals-nsa-has-back-doors-for-numerous-devices-a-940994.html",
acknowledgement = ack-nhfb,
}
@Article{Applebaum:2013:GXG,
author = "Benny Applebaum",
title = "Garbling {XOR} Gates ``For Free'' in the Standard
Model",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "162--181",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Arai:2013:MDH,
author = "Kohei Arai",
title = "Method for data hiding based on {LeGall} 5/3
({Cohen--Daubechies--Feauveau}: {CDF} 5/3) wavelet with
data compression and random scanning of secret imagery
data",
journal = j-INT-J-WAVELETS-MULTIRESOLUT-INF-PROCESS,
volume = "11",
number = "4",
pages = "1360006, 18",
year = "2013",
CODEN = "IJWMIP",
DOI = "https://doi.org/10.1142/S0219691313600060",
ISSN = "0219-6913 (print), 1793-690X (electronic)",
ISSN-L = "0219-6913",
MRclass = "94A60 (42C40 65T60 94A08 94A62)",
MRnumber = "3081432",
bibdate = "Wed Mar 7 18:04:36 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
ajournal = "Int. J. Wavelets Multiresolut. Inf. Process.",
fjournal = "International Journal of Wavelets, Multiresolution and
Information Processing",
journal-URL = "https://www.worldscientific.com/worldscinet/ijwmip",
}
@Article{Arapinis:2013:PSC,
author = "Myrto Arapinis and Sergiu Bursuc and Mark Ryan",
title = "Privacy-supporting cloud computing by in-browser key
translation",
journal = j-J-COMP-SECUR,
volume = "21",
number = "6",
pages = "847--880",
month = "????",
year = "2013",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-130489",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:26:04 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Armando:2013:AFB,
author = "Alessandro Armando and Roberto Carbone and Luca
Compagna and Jorge Cu{\'e}llar and Giancarlo Pellegrino
and Alessandro Sorniotti",
title = "An authentication flaw in browser-based Single Sign-On
protocols: Impact and remediations",
journal = j-COMPUT-SECUR,
volume = "33",
number = "??",
pages = "41--58",
month = mar,
year = "2013",
CODEN = "CPSEDU",
DOI = "https://doi.org/10.1016/j.cose.2012.08.007",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:31 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404812001356",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Asharov:2013:FCF,
author = "Gilad Asharov and Yehuda Lindell and Tal Rabin",
title = "A Full Characterization of Functions that Imply Fair
Coin Tossing and Ramifications to Fairness",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "243--262",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Baek:2013:SPK,
author = "Joonsang Baek and Quang Hieu Vu and Abdulhadi Shoufan
and Andrew Jones and Duncan S. Wong",
title = "Stateful Public-Key Encryption Schemes Forward-Secure
Against State Exposure",
journal = j-COMP-J,
volume = "56",
number = "4",
pages = "497--507",
month = apr,
year = "2013",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxs151",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Apr 1 08:36:50 MDT 2013",
bibsource = "http://comjnl.oxfordjournals.org/content/56/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/56/4/497.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 21, 2012",
}
@Article{Bajaj:2013:CSE,
author = "Sumeet Bajaj and Radu Sion",
title = "{CorrectDB}: {SQL} engine with practical query
authentication",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "6",
number = "7",
pages = "529--540",
month = may,
year = "2013",
CODEN = "????",
ISSN = "2150-8097",
bibdate = "Fri Dec 13 05:56:37 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Clients of outsourced databases need Query
Authentication (QA) guaranteeing the integrity
(correctness and completeness), and authenticity of the
query results returned by potentially compromised
providers. Existing results provide QA assurances for a
limited class of queries by deploying several software
cryptographic constructs. Here, we show that, to
achieve QA, however, it is significantly cheaper and
more practical to deploy server-hosted, tamper-proof
co-processors, despite their higher acquisition costs.
Further, this provides the ability to handle arbitrary
queries. To reach this insight, we extensively survey
existing QA work and identify interdependencies and
efficiency relationships. We then introduce CorrectDB,
a new DBMS with full QA assurances, leveraging
server-hosted, tamper-proof, trusted hardware in close
proximity to the outsourced data.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
}
@Article{Baldi:2013:ULC,
author = "Marco Baldi and Marco Bianchi and Franco Chiaraluce
and Joachim Rosenthal and Davide Schipani",
title = "Using {LDGM} Codes and Sparse Syndromes to Achieve
Digital Signatures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7932",
pages = "1--15",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-38616-9_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Mar 21 08:01:29 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-38616-9_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-38616-9",
book-URL = "http://www.springerlink.com/content/978-3-642-38616-9",
fjournal = "Lecture Notes in Computer Science",
}
@TechReport{Barbulescu:2013:QPA,
author = "Razvan Barbulescu and Pierrick Gaudry and Antoine Joux
and Emmanuel Thom{\'e}",
title = "A quasi-polynomial algorithm for discrete logarithm in
finite fields of small characteristic",
type = "Report",
institution = "Inria, CNRS, University of Lorraine; Foundation UPMC
--- LIP 6, CNRS UMR 7606; CryptoExperts",
address = "Lorraine, France; Paris, France; Paris, France",
pages = "16",
day = "25",
month = nov,
year = "2013",
bibdate = "Thu Feb 27 06:15:04 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://eprint.iacr.org/2013/400.pdf",
acknowledgement = ack-nhfb,
}
@Article{Barenghi:2013:FIT,
author = "Alessandro Barenghi and Guido M. Bertoni and Luca
Breveglieri and Gerardo Pelosi",
title = "A fault induction technique based on voltage
underfeeding with application to attacks against {AES}
and {RSA}",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "7",
pages = "1864--1878",
month = jul,
year = "2013",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue May 14 16:09:17 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121213000320",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Basin:2013:PRI,
author = "David Basin and Cas Cremers and Simon Meier",
title = "Provably repairing the {ISO\slash IEC 9798} standard
for entity authentication",
journal = j-J-COMP-SECUR,
volume = "21",
number = "6",
pages = "817--846",
month = "????",
year = "2013",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-130472",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:26:04 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@TechReport{Beaulieu:2013:SSF,
author = "Ray Beaulieu and Douglas Shors and Jason Smith and
Stefan Treatman-Clark and Bryan Weeks and Louis
Wingers",
title = "The {{\sc Simon}} and {{\sc Speck}} Families of
Lightweight Block Ciphers",
type = "Report",
institution = "National Security Agency",
address = "9800 Savage Road, Fort Meade, MD 20755, USA",
pages = "45",
day = "19",
month = jun,
year = "2013",
bibdate = "Tue May 15 07:49:12 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://eprint.iacr.org/2013/404.pdf;
https://www.schneier.com/crypto-gram/archives/2018/0515.html;
https://www.wikitribune.com/story/2018/04/20/business/exclusive-nsa-encryption-plan-for-internet-of-things-rejected-by-international-body/67004/",
abstract = "In this paper we propose two families of block
ciphers, Simon and Speck, each of which comes in a
variety of widths and key sizes. While many lightweight
block ciphers exist, most were designed to perform well
on a single platform and were not meant to provide high
performance across a range of devices. The aim of Simon
and Speck is to fill the need for secure, flexible, and
analyzable lightweight block ciphers. Each offers
excellent performance on hardware and software
platforms, is flexible enough to admit a variety of
implementations on a given platform, and is amenable to
analysis using existing techniques. Both perform
exceptionally well across the full spectrum of
lightweight applications, but Simon is tuned for
optimal performance in hardware, and Speck for optimal
performance in software.",
acknowledgement = ack-nhfb,
remark = "The ciphers in this report have been rejected by the
ISO on the grounds that NSA-provided ciphers may have
known, but undisclosed, weaknesses that would allow
back-door decryption.",
}
@TechReport{Becker:2013:SDL,
author = "Georg T. Becker and Francesco Regazzoni and Christof
Paar and Wayne P. Burleson",
title = "Stealthy Dopant-Level Hardware Trojans?",
type = "Report",
institution = "University of Massachusetts (Amherst, USA); TU Delft
(The Netherlands); ALaRI (University of Lugano,
Switzerland); Horst G{\"o}rtz Institut for IT-Security,
Ruhr-Universit{\"a}t Bochum (Bochum, Germany)",
pages = "18",
day = "7",
month = jun,
year = "2013",
bibdate = "Tue Feb 04 17:23:00 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://people.umass.edu/gbecker/BeckerChes13.pdf",
abstract = "In recent years, hardware Trojans have drawn the
attention of governments and industry as well as the
scientific community. One of the main concerns is that
integrated circuits, e.g., for military or
critical-infrastructure applications, could be
maliciously manipulated during the manufacturing
process, which often takes place abroad. However, since
there have been no reported hardware Trojans in
practice yet, little is known about how such a Trojan
would look like, and how difficult it would be in
practice to implement one. In this paper we propose an
extremely stealthy approach for implementing hardware
Trojans below the gate level, and we evaluate their
impact on the security of the target device. Instead of
adding additional circuitry to the target design, we
insert our hardware Trojans by changing the dopant
polarity of existing transistors. Since the modified
circuit appears legitimate on all wiring layers
(including all metal and polysilicon), our family of
Trojans is resistant to most detection techniques,
including fine-grain optical inspection and checking
against `golden chips'. We demonstrate the
effectiveness of our approach by inserting Trojans into
two designs --- a digital post-processing derived from
Intel's cryptographically secure RNG design used in the
Ivy Bridge processors and a side-channel resistant SBox
implementation --- and by exploring their detectability
and their effects on security.",
acknowledgement = ack-nhfb,
}
@Article{Behnia:2013:IEB,
author = "S. Behnia and A. Akhavan and A. Akhshani and A.
Samsudin",
title = "Image encryption based on the {Jacobian} elliptic
maps",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "9",
pages = "2429--2438",
month = sep,
year = "2013",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 3 06:29:11 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121213001283",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Ben-Othman:2013:IHN,
author = "Jalel Ben-Othman and Yesica I. Saavedra Benitez",
title = "{IBC-HWMP}: a novel secure identity-based
cryptography-based scheme for {Hybrid Wireless Mesh
Protocol} for {IEEE 802.11s}",
journal = j-CCPE,
volume = "25",
number = "5",
pages = "686--700",
day = "10",
month = apr,
year = "2013",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.1813",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Apr 29 18:46:29 MDT 2013",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Prac\-tice and
Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "19 Aug 2011",
}
@Article{Berman:2013:HPR,
author = "Itay Berman and Iftach Haitner and Ilan Komargodski
and Moni Naor",
title = "Hardness Preserving Reductions via Cuckoo Hashing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "40--59",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_3/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bessani:2013:DDS,
author = "Alysson Bessani and Miguel Correia and Bruno Quaresma
and Fernando Andr{\'e} and Paulo Sousa",
title = "{DepSky}: Dependable and Secure Storage in a
Cloud-of-Clouds",
journal = j-TOS,
volume = "9",
number = "4",
pages = "12:1--12:??",
month = nov,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2535929",
ISSN = "1553-3077 (print), 1553-3093 (electronic)",
ISSN-L = "1553-3077",
bibdate = "Thu Dec 12 18:12:51 MST 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/tos/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tos.bib",
abstract = "The increasing popularity of cloud storage services
has lead companies that handle critical data to think
about using these services for their storage needs.
Medical record databases, large biomedical datasets,
historical information about power systems and
financial data are some examples of critical data that
could be moved to the cloud. However, the reliability
and security of data stored in the cloud still remain
major concerns. In this work we present DepSky, a
system that improves the availability, integrity, and
confidentiality of information stored in the cloud
through the encryption, encoding, and replication of
the data on diverse clouds that form a cloud-of-clouds.
We deployed our system using four commercial clouds and
used PlanetLab to run clients accessing the service
from different countries. We observed that our
protocols improved the perceived availability, and in
most cases, the access latency, when compared with
cloud providers individually. Moreover, the monetary
costs of using DepSky in this scenario is at most twice
the cost of using a single cloud, which is optimal and
seems to be a reasonable cost, given the benefits.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Storage",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960",
}
@Article{Bhatnagar:2013:BIW,
author = "Gaurav Bhatnagar and Q. M. Jonathan Wu",
title = "Biometrics inspired watermarking based on a fractional
dual tree complex wavelet transform",
journal = j-FUT-GEN-COMP-SYS,
volume = "29",
number = "1",
pages = "182--195",
month = jan,
year = "2013",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2012.05.021",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Oct 26 06:10:54 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib;
http://www.sciencedirect.com/science/journal/0167739X",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1200129X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Bhatnagar:2013:SRI,
author = "Gaurav Bhatnagar and Q. M. Jonathan Wu and Pradeep K.
Atrey",
title = "Secure randomized image watermarking based on singular
value decomposition",
journal = j-TOMCCAP,
volume = "10",
number = "1",
pages = "4:1--4:??",
month = dec,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2542205.2542207",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Mar 13 07:37:53 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "In this article, a novel logo watermarking scheme is
proposed based on wavelet frame transform, singular
value decomposition and automatic thresholding. The
proposed scheme essentially rectifies the ambiguity
problem in the SVD-based watermarking. The core idea is
to randomly upscale the size of host image using
reversible random extension transform followed by the
embedding of logo watermark in the wavelet frame
domain. After embedding, a verification phase is casted
with the help of a binary watermark and toral
automorphism. At the extraction end, the binary
watermark is first extracted followed by the
verification of watermarked image. The logo watermark
is extracted if and only if the watermarked image is
verified. The security, attack and comparative analysis
confirm high security, efficiency and robustness of the
proposed watermarking system.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Bicakci:2013:LSS,
author = "Kemal Bicakci and Bruno Crispo and Gabriele Oligeri",
title = "{LAKE}: a Server-Side Authenticated Key-Establishment
with Low Computational Workload",
journal = j-TOIT,
volume = "13",
number = "2",
pages = "5:1--5:??",
month = dec,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2542214.2542216",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Dec 23 18:38:12 MST 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Server-side authenticated key-establishment protocols
are characterized by placing a heavy workload on the
server. We propose LAKE: a new protocol that enables
amortizing servers' workload peaks by moving most of
the computational burden to the clients. We provide a
formal analysis of the LAKE protocol under the
Canetti-Krawczyk model and prove it to be secure. To
the best of our knowledge, this is the most
computationally efficient authenticated
key-establishment ever proposed in the literature.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Birajdar:2013:DIF,
author = "Gajanan K. Birajdar and Vijay H. Mankar",
title = "Digital image forgery detection using passive
techniques: A survey",
journal = "Digital Investigation",
volume = "10",
number = "3",
pages = "226--245",
year = "2013",
DOI = "https://doi.org/10.1016/j.diin.2013.04.007",
ISSN = "1742-2876",
bibdate = "Wed Jan 28 10:08:12 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1742287613000364",
abstract = "Today manipulation of digital images has become easy
due to powerful computers, advanced photo-editing
software packages and high resolution capturing
devices. Verifying the integrity of images and
detecting traces of tampering without requiring extra
prior knowledge of the image content or any embedded
watermarks is an important research field. An attempt
is made to survey the recent developments in the field
of digital image forgery detection and complete
bibliography is presented on blind methods for forgery
detection. Blind or passive methods do not need any
explicit priori information about the image. First,
various image forgery detection techniques are
classified and then its generalized structure is
developed. An overview of passive image authentication
is presented and the existing blind forgery detection
techniques are reviewed. The present status of image
forgery detection technique is discussed along with a
recommendation for future research.",
acknowledgement = ack-nhfb,
keywords = "Benford's Law; Image authentication; Image forensic;
Image manipulation detection; Image tampering
detection; Passive/blind image forgery detection",
}
@Article{Birrell:2013:FIM,
author = "Eleanor Birrell and Fred B. Schneider",
title = "Federated Identity Management Systems: A Privacy-Based
Characterization",
journal = j-IEEE-SEC-PRIV,
volume = "11",
number = "5",
pages = "36--48",
month = sep # "\slash " # oct,
year = "2013",
DOI = "https://doi.org/10.1109/MSP.2013.114",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Nov 15 07:50:42 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
fjournal = "IEEE Security \& Privacy",
}
@Article{Bitansky:2013:SNI,
author = "Nir Bitansky and Alessandro Chiesa and Yuval Ishai and
Omer Paneth and Rafail Ostrovsky",
title = "Succinct Non-interactive Arguments via Linear
Interactive Proofs",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "315--333",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_18",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_18/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bitansky:2013:WFS,
author = "Nir Bitansky and Dana Dachman-Soled and Sanjam Garg
and Abhishek Jain and Yael Tauman Kalai and Adriana
L{\'o}pez-Alt and Daniel Wichs",
title = "Why ``{Fiat--Shamir} for Proofs'' Lacks a Proof",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "182--201",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Blaner:2013:IPP,
author = "B. Blaner and B. Abali and B. M. Bass and S. Chari and
R. Kalla and S. Kunkel and K. Lauricella and R. Leavens
and J. J. Reilly and P. A. Sandon",
title = "{IBM POWER7+} processor on-chip accelerators for
cryptography and active memory expansion",
journal = j-IBM-JRD,
volume = "57",
number = "6",
pages = "3:1--3:16",
month = nov # "--" # dec,
year = "2013",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/JRD.2013.2280090",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Sat Feb 15 16:52:47 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Bogdanov:2013:SDS,
author = "Andrey Bogdanov and Miroslav Knezevic and Gregor
Leander and Deniz Toz and Kerem Varici and Ingrid
Verbauwhede",
title = "{SPONGENT}: The Design Space of Lightweight
Cryptographic Hashing",
journal = j-IEEE-TRANS-COMPUT,
volume = "62",
number = "10",
pages = "2041--2053",
month = oct,
year = "2013",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2012.196",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Nov 15 08:54:34 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Bossuet:2013:AFS,
author = "Lilian Bossuet and Michael Grand and Lubos Gaspar and
Viktor Fischer and Guy Gogniat",
title = "Architectures of flexible symmetric key crypto engines
--- a survey: From hardware coprocessor to
multi-crypto-processor system on chip",
journal = j-COMP-SURV,
volume = "45",
number = "4",
pages = "41:1--41:??",
month = aug,
year = "2013",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2501654.2501655",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Mon Aug 26 17:21:41 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Throughput, flexibility, and security form the design
trilogy of reconfigurable crypto engines; they must be
carefully considered without reducing the major role of
classical design constraints, such as surface, power
consumption, dependability, and cost. Applications such
as network security, Virtual Private Networks (VPN),
Digital Rights Management (DRM), and pay per view have
drawn attention to these three constraints. For more
than ten years, many studies in the field of
cryptographic engineering have focused on the design of
optimized high-throughput hardware cryptographic cores
(e.g., symmetric and asymmetric key block ciphers,
stream ciphers, and hash functions). The flexibility of
cryptographic systems plays a very important role in
their practical application. Reconfigurable hardware
systems can evolve with algorithms, face up to new
types of attacks, and guarantee interoperability
between countries and institutions. The flexibility of
reconfigurable crypto processors and crypto
coprocessors has reached new levels with the emergence
of dynamically reconfigurable hardware architectures
and tools. Last but not least, the security of systems
that handle confidential information needs to be
thoroughly evaluated at the design stage in order to
meet security objectives that depend on the importance
of the information to be protected and on the cost of
protection. Usually, designers tackle security problems
at the same time as other design constraints and in
many cases target only one security objective, for
example, a side-channel attack countermeasures, fault
tolerance capability, or the monitoring of the device
environment. Only a few authors have addressed all
three design constraints at the same time. In
particular, key management security (e.g., secure key
generation and transmission, the use of a hierarchical
key structure composed of session keys and master keys)
has frequently been neglected to the benefit of
performance and/or flexibility. Nevertheless, a few
authors propose original processor architectures based
on multi-crypto-processor structures and reconfigurable
cryptographic arrays. In this article, we review
published works on symmetric key crypto engines and
present current trends and design challenges.",
acknowledgement = ack-nhfb,
articleno = "41",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Bothe:2013:EPS,
author = "Suvarna Bothe and Panagiotis Karras and Akrivi
Vlachou",
title = "{eSkyline}: processing skyline queries over encrypted
data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "6",
number = "12",
pages = "1338--1341",
month = aug,
year = "2013",
CODEN = "????",
ISSN = "2150-8097",
bibdate = "Fri Dec 13 05:57:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "The advent of cloud computing redefines the
traditional query processing paradigm. Whereas
computational overhead and memory constraints become
less prohibitive, data privacy, security, and
confidentiality concerns become top priorities. In
particular, as data owners outsource the management of
their data to service providers, query processing over
such data has more resources to tap into, yet the data
oftentimes has to be encrypted so as to prevent
unauthorized access. The challenge that arises in such
a setting is to devise an encryption scheme that still
allows for query results to be efficiently computed
using the encrypted data values. An important type of
query that raises unconventional requirements in terms
of the operator that has to be evaluated is the skyline
query, which returns a set of objects in a dataset
whose values are not dominated by any other object
therein. In this demonstration, we present eSkyline, a
prototype system and query interface that enables the
processing of skyline queries over encrypted data, even
without preserving the order on each attribute as
order-preserving encryption would do. Our system
comprises of an encryption scheme that facilitates the
evaluation of domination relationships, hence allows
for state-of-the-art skyline processing algorithms to
be used. The actual data values are reconstructed only
at the client side, where the encryption key is known.
Our demo visualizes the details of the encryption
scheme, allows a user to interact with a server, and
showcases the efficiency of computing skyline queries
and decrypting the results.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
}
@Article{Boyen:2013:ABF,
author = "Xavier Boyen",
title = "Attribute-Based Functional Encryption on Lattices",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "122--142",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Brakerski:2013:WHB,
author = "Zvika Brakerski",
title = "When Homomorphism Becomes a Liability",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "143--161",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Caldwell:2013:INP,
author = "Tracey Caldwell",
title = "Identity --- the new perimeter",
journal = j-NETWORK-SECURITY,
volume = "2013",
number = "4",
pages = "14--18",
month = apr,
year = "2013",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(13)70051-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:53 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485813700515",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Canetti:2013:PCC,
author = "Ran Canetti and Huijia Lin and Omer Paneth",
title = "Public-Coin Concurrent Zero-Knowledge in the Global
Hash Model",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "80--99",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Cao:2013:SIPa,
author = "Jian Cao and Jie Wang and Haiyan Zhao and Minglu Li",
title = "Special Issue Papers: An event view specification
approach for {Supporting Service} process
collaboration",
journal = j-CCPE,
volume = "25",
number = "13",
pages = "1943--1966",
day = "10",
month = sep,
year = "2013",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.2990",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue Dec 3 10:37:32 MST 2013",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "12 Feb 2013",
}
@Article{Carter:2013:SSA,
author = "Kyle Carter and Adam Foltzer and Joe Hendrix and Brian
Huffman and Aaron Tomb",
title = "{SAW}: the software analysis workbench",
journal = j-SIGADA-LETTERS,
volume = "33",
number = "3",
pages = "15--18",
month = dec,
year = "2013",
CODEN = "AALEE5",
DOI = "https://doi.org/10.1145/2658982.2527277",
ISSN = "1094-3641 (print), 1557-9476 (electronic)",
ISSN-L = "1094-3641",
bibdate = "Wed Sep 3 16:38:30 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/java2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigada.bib",
abstract = "Galois has developed a suite of symbolic simulation
and formal analysis tools, collectively called the
Software Analysis Workbench (SAW). SAW provides
security analysts and engineers with the ability to
generate formal models from C and Java programs and
prove properties of those programs using several
automated verification tools. SAW is primarily used to
verify the correctness of cryptographic
implementations, and is able to import specifications
written in Cryptol, a language developed by Galois for
specifying cryptographic primitives. In this short
paper, we describe the main components of SAW. We then
given an overview of the cryptographic implementations
that have been verified.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGADA Ada Letters",
journal-URL = "http://portal.acm.org/citation.cfm?id=J32",
remark = "HILT '13 conference proceedings.",
}
@Article{Castro:2013:RAM,
author = "P. C. Castro and J. W. Ligman and M. Pistoia and J.
Ponzo and G. S. Thomas and U. Topkara",
title = "Runtime adaptive multi-factor authentication for
mobile devices",
journal = j-IBM-JRD,
volume = "57",
number = "6",
pages = "8:1--8:17",
month = nov # "--" # dec,
year = "2013",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/JRD.2013.2281123",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Sat Feb 15 16:52:47 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Centenaro:2013:TBA,
author = "Matteo Centenaro and Riccardo Focardi and Flaminia L.
Luccio",
title = "Type-based analysis of key management in {PKCS\#11}
cryptographic devices",
journal = j-J-COMP-SECUR,
volume = "21",
number = "6",
pages = "971--1007",
month = "????",
year = "2013",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-130479",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:26:04 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Chakraborty:2013:EHI,
author = "Debrup Chakraborty and Cuauhtemoc Mancillas-Lopez and
Francisco Rodriguez-Henriquez and Palash Sarkar",
title = "Efficient Hardware Implementations of {BRW}
Polynomials and Tweakable Enciphering Schemes",
journal = j-IEEE-TRANS-COMPUT,
volume = "62",
number = "2",
pages = "279--294",
month = feb,
year = "2013",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2011.227",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Apr 30 12:26:22 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Chan:2013:OCK,
author = "Aldar C.-F. Chan",
title = "On optimal cryptographic key derivation",
journal = j-THEOR-COMP-SCI,
volume = "489--490",
number = "??",
pages = "21--36",
day = "10",
month = jun,
year = "2013",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 8 16:38:39 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397513002843",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Chang:2013:MPQ,
author = "Mei-Chu Chang",
title = "On a matrix product question in cryptography",
journal = j-LINEAR-ALGEBRA-APPL,
volume = "439",
number = "7",
pages = "1742--1748",
day = "1",
month = oct,
year = "2013",
CODEN = "LAAPAW",
ISSN = "0024-3795 (print), 1873-1856 (electronic)",
ISSN-L = "0024-3795",
bibdate = "Mon Aug 26 14:35:46 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linala2010.bib;
http://www.sciencedirect.com/science/journal/00243795",
URL = "http://www.sciencedirect.com/science/article/pii/S002437951300339X",
acknowledgement = ack-nhfb,
fjournal = "Linear Algebra and its Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/00243795",
}
@Article{Chappell:2013:PMI,
author = "Brian Chappell",
title = "Privilege management --- the industry's best kept
secret",
journal = j-NETWORK-SECURITY,
volume = "2013",
number = "10",
pages = "12--14",
month = oct,
year = "2013",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(13)70114-4",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:59 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485813701144",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Chase:2013:SMN,
author = "Melissa Chase and Markulf Kohlweiss and Anna
Lysyanskaya and Sarah Meiklejohn",
title = "Succinct Malleable {NIZKs} and an Application to
Compact Shuffles",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "100--119",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chen:2013:ATK,
author = "Qian Chen and Haibo Hu and Jianliang Xu",
title = "Authenticating top-$k$ queries in location-based
services with confidentiality",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "7",
number = "1",
pages = "49--60",
month = sep,
year = "2013",
CODEN = "????",
ISSN = "2150-8097",
bibdate = "Wed Feb 4 09:21:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "State-of-the-art location-based services (LBSs)
involve data owners, requesting clients, and service
providers. As LBSs become new business opportunities,
there is an increasing necessity to verify the
genuineness of service results. Unfortunately, while
traditional query authentication techniques can address
this issue, they fail to protect the confidentiality of
data, which is sensitive location information when LBSs
are concerned. Recent work has studied how to preserve
such location privacy in query authentication. However,
the prior work is limited to range queries, where
private values only appear on one side of the range
comparison. In this paper, we address the more
challenging authentication problem on top-$k$ queries,
where private values appear on both sides of a
comparison. To start with, we propose two novel
cryptographic building blocks, followed by a
comprehensive design of authentication schemes for
top-$k$ queries based on R-tree and Power Diagram
indexes. Optimizations, security analysis, and
experimental results consistently show the
effectiveness and robustness of the proposed schemes
under various system settings and query workloads.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chen:2013:RWM,
author = "Xianyi Chen and Xingming Sun and Huiyu Sun and Zhili
Zhou and Jianjun Zhang",
title = "Reversible watermarking method based on
asymmetric-histogram shifting of prediction errors",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "10",
pages = "2620--2626",
month = oct,
year = "2013",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Sep 9 07:54:52 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S016412121300126X",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chen:2013:TSE,
author = "Te-Yu Chen and Cheng-Chi Lee and Min-Shiang Hwang and
Jinn-Ke Jan",
title = "Towards secure and efficient user authentication
scheme using smart card for multi-server environments",
journal = j-J-SUPERCOMPUTING,
volume = "66",
number = "2",
pages = "1008--1032",
month = nov,
year = "2013",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-013-0966-z",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Feb 8 11:11:03 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=66&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-013-0966-z",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Chen:2013:WSB,
author = "Guoming Chen and Qiang Chen and Dong Zhang and Yiqun
Chen",
title = "A Watermarking Scheme Based on Compressive Sensing and
{Bregman} Iteration",
journal = j-INT-J-COMPUT-APPL,
volume = "35",
number = "4",
pages = "173--180",
year = "2013",
DOI = "https://doi.org/10.2316/Journal.202.2013.4.202-3844",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:29:01 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2013.4.202-3844",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Cheng:2013:DVB,
author = "Yueqiang Cheng and Xuhua Ding and Robert H. Deng",
title = "{DriverGuard}: Virtualization-Based Fine-Grained
Protection on {I/O} Flows",
journal = j-TISSEC,
volume = "16",
number = "2",
pages = "6:1--6:??",
month = sep,
year = "2013",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2505123",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Sep 23 17:04:07 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Most commodity peripheral devices and their drivers
are geared to achieve high performance with security
functions being opted out. The absence of strong
security measures invites attacks on the I/O data and
consequently posts threats to those services feeding on
them, such as fingerprint-based biometric
authentication. In this article, we present a generic
solution called DriverGuard, which dynamically protects
the secrecy of I/O flows such that the I/O data are not
exposed to the malicious kernel. Our design leverages a
composite of cryptographic and virtualization
techniques to achieve fine-grained protection without
using any extra devices and modifications on user
applications. We implement the DriverGuard prototype on
Xen by adding around 1.7K SLOC. DriverGuard is
lightweight as it only needs to protect around 2\% of
the driver code's execution. We measure the performance
and evaluate the security of DriverGuard with three
input devices (keyboard, fingerprint reader and camera)
and three output devices (printer, graphic card, and
sound card). The experiment results show that
DriverGuard induces negligible overhead to the
applications.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Cheng:2013:EHM,
author = "Chi Cheng and Tao Jiang",
title = "An Efficient Homomorphic {MAC} with Small Key Size for
Authentication in Network Coding",
journal = j-IEEE-TRANS-COMPUT,
volume = "62",
number = "10",
pages = "2096--2100",
month = oct,
year = "2013",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2012.135",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Nov 15 08:54:34 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
note = "See comments \cite{Li:2015:CEH,Kim:2015:CEH}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Cheng:2013:NIB,
author = "Xiangguo Cheng and Lifeng Guo and Jia Yu and Huiran Ma
and Yuexiu Wu",
title = "A New Identity-Based Group Signature Scheme",
journal = j-INT-J-COMPUT-APPL,
volume = "35",
number = "1",
pages = "1--5",
year = "2013",
CODEN = "IJCAFW",
DOI = "https://doi.org/10.2316/Journal.202.2013.1.202-3136",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:28:32 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2013.1.202-3136",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Cheswick:2013:RP,
author = "William Cheswick",
title = "Rethinking passwords",
journal = j-CACM,
volume = "56",
number = "2",
pages = "40--44",
month = feb,
year = "2013",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2408776.2408790",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed Jan 30 15:28:27 MST 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Our authentication system is lacking. Is improvement
possible?",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Chien:2013:CRC,
author = "Hung-Yu Chien",
title = "Combining {Rabin} cryptosystem and error correction
codes to facilitate anonymous authentication with
un-traceability for low-end devices",
journal = j-COMP-NET-AMSTERDAM,
volume = "57",
number = "14",
pages = "2705--2717",
day = "4",
month = oct,
year = "2013",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Tue Sep 3 06:24:18 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128613001898",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Chin:2013:SMB,
author = "Ji-Jian Chin and Syh-Yuan Tan and Swee-Huay Heng and
Raphael C.-W. Phan",
title = "On the security of a modified {Beth} identity-based
identification scheme",
journal = j-INFO-PROC-LETT,
volume = "113",
number = "14--16",
pages = "580--583",
month = jul # "\slash " # aug,
year = "2013",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jul 1 18:58:11 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013001324",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Chirgwin:2013:ABB,
author = "R. Chirgwin",
title = "{Android} Bug Batters {Bitcoin} Wallets",
journal = "The Register",
volume = "??",
number = "??",
pages = "??--??",
month = "????",
year = "2013",
bibdate = "Sat Nov 29 13:52:49 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "????",
acknowledgement = ack-nhfb,
}
@Article{Chong:2013:ASG,
author = "Song-Kong Chong and Cheng-Chi Lee and Min-Shiang
Hwang",
title = "An Authentication Scheme for the Global Mobility
Network",
journal = j-PARALLEL-PROCESS-LETT,
volume = "23",
number = "3",
pages = "1350009",
month = sep,
year = "2013",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626413500096",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Sat Mar 15 08:49:31 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Chou:2013:TIB,
author = "Chih-Ho Chou and Kuo-Yu Tsai and Chung-Fu Lu",
title = "Two {ID}-based authenticated schemes with key
agreement for mobile environments",
journal = j-J-SUPERCOMPUTING,
volume = "66",
number = "2",
pages = "973--988",
month = nov,
year = "2013",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-013-0962-3",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Feb 8 11:11:03 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=66&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-013-0962-3",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Chou:2013:UGS,
author = "Yao-Hsin Chou and Shuo-Mao Chen and Yu-Ting Lin and
Chi-Yuan Chen and Han-Chieh Chao",
title = "Using {GHZ}-State for Multiparty Quantum Secret
Sharing Without Code Table",
journal = j-COMP-J,
volume = "56",
number = "10",
pages = "1167--1175",
month = oct,
year = "2013",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxs005",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Oct 1 12:09:04 MDT 2013",
bibsource = "http://comjnl.oxfordjournals.org/content/56/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/56/10/1167.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "February 1, 2012",
}
@Article{Claessen:2013:SPN,
author = "Koen Claessen and Micha{\l} H. Pa{\l}ka",
title = "Splittable pseudorandom number generators using
cryptographic hashing",
journal = j-SIGPLAN,
volume = "48",
number = "12",
pages = "47--58",
month = dec,
year = "2013",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2578854.2503784",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Tue Mar 4 17:04:55 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
note = "Haskell '14 conference proceedings.",
abstract = "We propose a new splittable pseudorandom number
generator (PRNG) based on a cryptographic hash
function. Splittable PRNGs, in contrast to linear
PRNGs, allow the creation of two (seemingly)
independent generators from a given random number
generator. Splittable PRNGs are very useful for
structuring purely functional programs, as they avoid
the need for threading around state. We show that the
currently known and used splittable PRNGs are either
not efficient enough, have inherent flaws, or lack
formal arguments about their randomness. In contrast,
our proposed generator can be implemented efficiently,
and comes with a formal statements and proofs that
quantify how 'random' the results are that are
generated. The provided proofs give strong randomness
guarantees under assumptions commonly made in
cryptography.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
}
@Article{Cobb:2013:LMS,
author = "William E. Cobb and Rusty O. Baldwin and Eric D.
Laspe",
title = "Leakage Mapping: a Systematic Methodology for
Assessing the Side-Channel Information Leakage of
Cryptographic Implementations",
journal = j-TISSEC,
volume = "16",
number = "1",
pages = "2:1--2:??",
month = jun,
year = "2013",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2487222.2487224",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Fri Jun 14 19:25:26 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "We propose a generalized framework to evaluate the
side-channel information leakage of symmetric block
ciphers. The leakage mapping methodology enables the
systematic and efficient identification and mitigation
of problematic information leakages by exhaustively
considering relevant leakage models. The evaluation
procedure bounds the anticipated resistance of an
implementation to the general class of univariate
differential side-channel analysis techniques. Typical
applications are demonstrated using the well-known
Hamming weight and Hamming distance leakage models,
with recommendations for the incorporation of more
accurate models. The evaluation results are empirically
validated against correlation-based differential
side-channel analysis attacks on two typical
unprotected implementations of the Advanced Encryption
Standard.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@InProceedings{Courtois:2013:BRC,
author = "N. T. Courtois and D. Hulme and K. Hussain and J. A.
Gawinecki and M. Grajek",
booktitle = "Proceedings of the IEEE Security and Privacy
Workshops",
title = "On bad randomness and cloning of contactless payment
and building smart cards",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "105--110",
year = "2013",
DOI = "https://doi.org/10.1109/SPW.2013.29",
bibdate = "Fri Jul 29 07:44:51 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Book{Cozzens:2013:MEE,
author = "Margaret B. Cozzens and Steven J. Miller",
title = "The mathematics of encryption: an elementary
introduction",
volume = "29",
publisher = pub-AMS,
address = pub-AMS:adr,
pages = "xvii + 332",
year = "2013",
ISBN = "0-8218-8321-6 (paperback)",
ISBN-13 = "978-0-8218-8321-1 (paperback)",
LCCN = "QA268 .C697 2013",
bibdate = "Thu Mar 19 08:52:10 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/amermathmonthly2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Mathematical world",
acknowledgement = ack-nhfb,
subject = "Coding theory; Textbooks; Cryptography; Mathematics;
History; Data encryption (Computer science); Codage;
Cryptographie; Chiffrement (informatique); Coding
theory; Cryptography; Mathematics; Data encryption
(Computer science); Codage; Manuels d'enseignement
sup{\'e}rieur; Cryptographie; Math{\'e}matiques;
Histoire; Chiffrement (Informatique)",
tableofcontents = "Historical introduction \\
Classical cryptology : methods \\
Enigma and Ultra \\
Classical cryptography : attacks I \\
Classical cryptography : attacks II \\
Modern symmetric encryption \\
Introduction to public-channel cryptography \\
Public-channel cryptography \\
Error detecting and correcting codes \\
Modern cryptography \\
Primality testing and factorization \\
Solutions to selected problems",
}
@Article{Crawford:2013:FCT,
author = "Heather Crawford and Karen Renaud and Tim Storer",
title = "A framework for continuous, transparent mobile device
authentication",
journal = j-COMPUT-SECUR,
volume = "39 (part B)",
number = "??",
pages = "127--136",
month = nov,
year = "2013",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:35 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404813000886",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Crenne:2013:CMS,
author = "J{\'e}r{\'e}mie Crenne and Romain Vaslin and Guy
Gogniat and Jean-Philippe Diguet and Russell Tessier
and Deepak Unnikrishnan",
title = "Configurable memory security in embedded systems",
journal = j-TECS,
volume = "12",
number = "3",
pages = "71:1--71:??",
month = mar,
year = "2013",
CODEN = "????",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue May 28 17:38:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "System security is an increasingly important design
criterion for many embedded systems. These systems are
often portable and more easily attacked than
traditional desktop and server computing systems. Key
requirements for system security include defenses
against physical attacks and lightweight support in
terms of area and power consumption. Our new approach
to embedded system security focuses on the protection
of application loading and secure application
execution. During secure application loading, an
encrypted application is transferred from on-board
flash memory to external double data rate synchronous
dynamic random access memory (DDR-SDRAM) via a
microprocessor. Following application loading, the
core-based security technique provides both
confidentiality and authentication for data stored in a
microprocessor's system memory. The benefits of our low
overhead memory protection approaches are demonstrated
using four applications implemented in a
field-programmable gate array (FPGA) in an embedded
system prototyping platform. Each application requires
a collection of tasks with varying memory security
requirements. The configurable security core
implemented on-chip inside the FPGA with the
microprocessor allows for different memory security
policies for different application tasks. An average
memory saving of 63\% is achieved for the four
applications versus a uniform security approach. The
lightweight circuitry included to support application
loading from flash memory adds about 10\% FPGA area
overhead to the processor-based system and main memory
security hardware.",
acknowledgement = ack-nhfb,
articleno = "71",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
}
@Article{Cui:2013:OSL,
author = "T. Cui and C. Jin and G. Zhang",
title = "Observations of Skipjack-like Structure with {SP/SPS}
Round Function",
journal = j-J-UCS,
volume = "19",
number = "16",
pages = "2453--??",
month = "????",
year = "2013",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Thu Mar 13 14:26:22 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_19_16/observations_of_skipjack_like",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{DaRolt:2013:NDS,
author = "Jean {Da Rolt} and Giorgio {Di Natale} and Marie-Lise
Flottes and Bruno Rouzeyre",
title = "A novel differential scan attack on advanced {DFT}
structures",
journal = j-TODAES,
volume = "18",
number = "4",
pages = "58:1--58:??",
month = oct,
year = "2013",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/2505014",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Nov 8 11:45:54 MST 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "Scan chains insertion is the most common technique to
ensure the testability of digital cores, providing high
fault coverage. However, for ICs dealing with secret
information, scan chains can be used as back doors for
accessing secret data thus becoming a threat to system
security. So far, advanced test structures used to
reduce test costs (e.g., response compaction) and
achieve high fault coverage (e.g., X's masking decoder)
have been considered as intrinsic countermeasures
against these threats. This work proposes a new generic
scan-based attack demonstrating that these test
structures are not sufficiently effective to prevent
leakage through the test infrastructure. This generic
attack can be easily adapted to several cryptographic
implementations for both symmetric and public key
algorithms. The proposed attack is demonstrated on
several ciphers.",
acknowledgement = ack-nhfb,
articleno = "58",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems (TODAES)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{DePrisco:2013:CVC,
author = "Roberto {De Prisco} and Alfredo {De Santis}",
title = "Color visual cryptography schemes for black and white
secret images",
journal = j-THEOR-COMP-SCI,
volume = "510",
number = "??",
pages = "62--86",
day = "28",
month = oct,
year = "2013",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Nov 4 10:04:17 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397513006750",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Dini:2013:HHS,
author = "Gianluca Dini and Marco Tiloca",
title = "{HISS}: a {HIghly Scalable Scheme} for Group
Rekeying",
journal = j-COMP-J,
volume = "56",
number = "4",
pages = "508--525",
month = apr,
year = "2013",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxs152",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Apr 1 08:36:50 MDT 2013",
bibsource = "http://comjnl.oxfordjournals.org/content/56/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/56/4/508.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 23, 2012",
}
@Article{Dodis:2013:OWE,
author = "Yevgeniy Dodis and Yu Yu",
title = "Overcoming Weak Expectations",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "1--22",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_1/;
http://link.springer.com/content/pdf/bfm:978-3-642-36594-2/1.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Dong:2013:PRS,
author = "Qi Dong and Donggang Liu and Peng Ning",
title = "Providing {DoS} resistance for signature-based
broadcast authentication in sensor networks",
journal = j-TECS,
volume = "12",
number = "3",
pages = "73:1--73:??",
month = mar,
year = "2013",
CODEN = "????",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue May 28 17:38:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Recent studies have demonstrated that it is feasible
to perform public key cryptographic operations on
resource-constrained sensor platforms. However, the
significant energy consumption introduced by public key
operations makes any public key-based protocol an easy
target of Denial-of-Service (DoS) attacks. For example,
if digital signature schemes such as ECDSA are used
directly for broadcast authentication without further
protection, an attacker can simply broadcast fake
messages and force the receiving nodes to perform a
huge number of unnecessary signature verifications,
eventually exhausting their battery power. This paper
shows how to mitigate such DoS attacks when digital
signatures are used for broadcast authentication in
sensor networks. Specifically, this paper first
presents two filtering techniques, the group-based
filter and the key chain-based filter, to handle the
DoS attacks against signature verification. Both
methods can significantly reduce the number of
unnecessary signature verifications when a sensor node
is under DoS attacks. This paper then combines these
two filters and proposes a hybrid solution to further
improve the performance.",
acknowledgement = ack-nhfb,
articleno = "73",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
}
@Article{Driessen:2013:ESA,
author = "Benedikt Driessen and Ralf Hund and Carsten Willems
and Christof Paar and Thorsten Holz",
title = "An experimental security analysis of two satphone
standards",
journal = j-TISSEC,
volume = "16",
number = "3",
pages = "10:1--10:??",
month = nov,
year = "2013",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2535522",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Dec 9 11:22:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "General-purpose communication systems such as GSM and
UMTS have been in the focus of security researchers for
over a decade now. Recently also technologies that are
only used under more specific circumstances have come
into the spotlight of academic research and the hacker
scene alike. A striking example of this is recent work
[Driessen et al. 2012] that analyzed the security of
the over-the-air encryption in the two existing ETSI
satphone standards GMR-1 and GMR-2. The firmware of
handheld devices was reverse-engineered and the
previously unknown stream ciphers A5-GMR-1 and A5-GMR-2
were recovered. In a second step, both ciphers were
cryptanalized, resulting in a ciphertext-only attack on
A5-GMR-1 and a known-plaintext attack on A5-GMR-2. In
this work, we extend the aforementioned results in the
following ways: First, we improve the proposed attack
on A5-GMR-1 and reduce its average-case complexity from
$ 2^{32} $ to $ 2^{21} $ steps. Second, we implement a
practical attack to successfully record communications
in the Thuraya network and show that it can be done
with moderate effort for approximately \$5,000. We
describe the implementation of our modified attack and
the crucial aspects to make it practical. Using our
eavesdropping setup, we recorded 30 seconds of our own
satellite-to-satphone communication and show that we
are able to recover Thuraya session keys in half an
hour (on average). We supplement these results with
experiments designed to highlight the feasibility of
also eavesdropping on the satphone's emanations. The
purpose of this article is threefold: Develop and
demonstrate more practical attacks on A5-GMR-1,
summarize current research results in the field of
GMR-1 and GMR-2 security, and shed light on the amount
of work and expertise it takes from setting out to
analyze a complex system to actually break it in the
real world.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@InProceedings{Egele:2013:ESC,
author = "Manuel Egele and David Brumley and Yanick Fratantonio
and Christopher Kruegel",
editor = "????",
booktitle = "{ACM Conference on Computer and Communications
Security}",
title = "An empirical study of cryptographic misuse in
{Android} applications",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "73--84",
year = "2013",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:57:10 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 31]{Schneier:2015:SWC}.",
}
@Article{El-Emam:2013:NSA,
author = "Nameer N. El-Emam and Rasheed Abdul Shaheed
Al-Zubidy",
title = "New steganography algorithm to conceal a large amount
of secret message using hybrid adaptive neural networks
with modified adaptive genetic algorithm",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "6",
pages = "1465--1481",
month = jun,
year = "2013",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue May 14 16:09:14 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212003317",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Engels:2013:NLL,
author = "Susanne Engels and Elif Bilge Kavun and Christof Paar
and Tolga Yalcin and Hristina Mihajloska",
title = "A Non-Linear\slash Linear Instruction Set Extension
for Lightweight Ciphers",
crossref = "IEEE:2013:PIS",
pages = "67--75",
year = "2013",
DOI = "https://doi.org/10.1109/ARITH.2013.36",
ISSN = "1063-6889",
bibdate = "Sat Aug 1 09:38:32 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = ack-nhfb,
keywords = "algebraic normal form; ANF; binary matrix
multiply-and-add form; bit permutation; Ciphers;
cryptographic operation; cryptography; embedded CPU;
embedded microcontroller; Hardware; instruction set
extension; lightweight cipher; lightweight ciphers;
lightweight cryptographic algorithm; linear instruction
set extension; linear operation; matrix algebra;
microcontrollers; modular architecture; nonlinear
instruction set extension; nonlinear operation;
Registers; s-box; Silicon; Software; Standards",
remark = "ARITH'21 conference paper.",
}
@Article{Fan:2013:CEM,
author = "Chun-I Fan and Yi-Hui Lin and Ruei-Hau Hsu",
title = "Complete {EAP} Method: User Efficient and Forward
Secure Authentication Protocol for {IEEE 802.11}
Wireless {LANs}",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "24",
number = "4",
pages = "672--680",
month = apr,
year = "2013",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2012.164",
ISSN = "1045-9219",
ISSN-L = "1045-9219",
bibdate = "Wed May 1 08:02:21 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Fan:2013:CPP,
author = "Chun-I Fan and Shi-Yuan Huang",
title = "Controllable privacy preserving search based on
symmetric predicate encryption in cloud storage",
journal = j-FUT-GEN-COMP-SYS,
volume = "29",
number = "7",
pages = "1716--1724",
month = sep,
year = "2013",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Aug 26 16:08:23 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib;
http://www.sciencedirect.com/science/journal/0167739X",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1200101X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Fan:2013:KIS,
author = "J. Fan and Y. Zheng and X. Tang",
title = "Key-Insulated Signcryption",
journal = j-J-UCS,
volume = "19",
number = "10",
pages = "1351--??",
month = "????",
year = "2013",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Fri Sep 13 11:19:11 MDT 2013",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_19_10/key_insulated_signcryption",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Fawzi:2013:LDN,
author = "Omar Fawzi and Patrick Hayden and Pranab Sen",
title = "From Low-Distortion Norm Embeddings to Explicit
Uncertainty Relations and Efficient Information
Locking",
journal = j-J-ACM,
volume = "60",
number = "6",
pages = "44:1--44:??",
month = nov,
year = "2013",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/2518131",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Tue Dec 3 18:36:06 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "The existence of quantum uncertainty relations is the
essential reason that some classically unrealizable
cryptographic primitives become realizable when quantum
communication is allowed. One operational manifestation
of these uncertainty relations is a purely quantum
effect referred to as information locking [DiVincenzo
et al. 2004]. A locking scheme can be viewed as a
cryptographic protocol in which a uniformly random n
-bit message is encoded in a quantum system using a
classical key of size much smaller than n. Without the
key, no measurement of this quantum state can extract
more than a negligible amount of information about the
message, in which case the message is said to be
``locked''. Furthermore, knowing the key, it is
possible to recover, that is ``unlock'', the message.
In this article, we make the following contributions by
exploiting a connection between uncertainty relations
and low-distortion embeddings of Euclidean spaces into
slightly larger spaces endowed with the l$_1$ norm. We
introduce the notion of a metric uncertainty relation
and connect it to low-distortion embeddings of l$_2$
into l$_1$. A metric uncertainty relation also implies
an entropic uncertainty relation. We prove that random
bases satisfy uncertainty relations with a stronger
definition and better parameters than previously known.
Our proof is also considerably simpler than earlier
proofs. We then apply this result to show the existence
of locking schemes with key size independent of the
message length. Moreover, we give efficient
constructions of bases satisfying metric uncertainty
relations. The bases defining these metric uncertainty
relations are computable by quantum circuits of almost
linear size. This leads to the first explicit
construction of a strong information locking scheme.
These constructions are obtained by adapting an
explicit norm embedding due to Indyk [2007] and an
extractor construction of Guruswami et al. [2009]. We
apply our metric uncertainty relations to exhibit
communication protocols that perform equality testing
of n -qubit states. We prove that this task can be
performed by a single message protocol using O (log$^2$
n ) qubits and n bits of communication, where the
computation of the sender is efficient.",
acknowledgement = ack-nhfb,
articleno = "44",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Fehr:2013:FCC,
author = "Serge Fehr and Jonathan Katz and Fang Song and
Hong-Sheng Zhou and Vassilis Zikas",
title = "Feasibility and Completeness of Cryptographic Tasks in
the Quantum World",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "281--296",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Misc{Felten:2013:LBA,
author = "Edward Felten",
title = "The {Linux} backdoor attempt of 2003",
howpublished = "Web site.",
year = "2013",
bibdate = "Mon Mar 09 12:00:45 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linux.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
URL = "https://freedom-to-tinker.com/blog/felten/the-linux-backdoor-attempt-of-2003/",
acknowledgement = ack-nhfb,
}
@Article{Feng:2013:ECE,
author = "Jun Feng and Xueming Wang and Hong Sun",
title = "Efficiently computable endomorphism for genus $3$
hyperelliptic curve cryptosystems",
journal = j-INFO-PROC-LETT,
volume = "113",
number = "12",
pages = "405--408",
day = "30",
month = jun,
year = "2013",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Apr 16 06:15:28 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013000914",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Book{Fox:2013:RLQ,
author = "Margalit Fox",
title = "The Riddle of the Labyrinth: the Quest to Crack an
Ancient Code",
publisher = pub-HARPERCOLLINS,
address = pub-HARPERCOLLINS:adr,
pages = "xx + 363",
year = "2013",
ISBN = "0-06-222883-8",
ISBN-13 = "978-0-06-222883-3",
LCCN = "P1038 .F69 2013",
bibdate = "Fri May 31 20:54:44 MDT 2013",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://en.wikipedia.org/wiki/Linear_B_script",
abstract = "An intellectual detective story follows the quest to
unlock one of the great secrets of human history ---
the decipherment of Linear B, an unknown script from
the Aegean Bronze Age.",
acknowledgement = ack-nhfb,
subject = "Kober, Alice; Evans, Sir Arthur; Ventris, Michael;
Inscriptions, Linear B; Civilization, Mycenaean; Women
linguists; Biography; Archaeologists; Great Britain;
Greece",
subject-dates = "1906--1950 \\
1851--1941",
tableofcontents = "Buried treasure \\
The digger \\
The record-keepers \\
The vanished key \\
Love among the ruins \\
The detective \\
American champollion \\
A delightful problem \\
Splitting the baby \\
The matrix \\
``Hurry up and deciper the thing!'' \\
The architect \\
The hollow boy \\
A leap of faith \\
``I know it, I know it'' \\
Solution, dissolution \\
Mr. X and Mr. Y",
}
@Article{Frauchiger:2013:TRR,
author = "Daniela Frauchiger and Renato Renner and Matthias
Troyer",
title = "True randomness from realistic quantum devices",
journal = "arXiv.org",
volume = "??",
number = "??",
pages = "??--??",
day = "13",
month = nov,
year = "2013",
bibdate = "Sat Nov 29 14:26:20 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://arxiv.org/abs/1311.4547",
abstract = "Even if the output of a Random Number Generator (RNG)
is perfectly uniformly distributed, it may be
correlated to pre-existing information and therefore be
predictable. Statistical tests are thus not sufficient
to guarantee that an RNG is usable for applications,
e.g., in cryptography or gambling, where
unpredictability is important. To enable such
applications a stronger notion of randomness, termed
``true randomness'', is required, which includes
independence from prior information. Quantum systems
are particularly suitable for true randomness
generation, as their unpredictability can be proved
based on physical principles. Practical implementations
of Quantum RNGs (QRNGs) are however always subject to
noise, i.e., influences which are not fully controlled.
This reduces the quality of the raw randomness
generated by the device, making it necessary to
post-process it. Here we provide a framework to analyse
realistic QRNGs and to determine the post-processing
that is necessary to turn their raw output into true
randomness.",
acknowledgement = ack-nhfb,
pagecount = "12",
}
@Article{Fritsch:2013:CPE,
author = "Lothar Fritsch",
title = "The Clean Privacy Ecosystem of the Future {Internet}",
journal = j-FUTURE-INTERNET,
volume = "5",
number = "1",
pages = "34--45",
day = "14",
month = jan,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi5010034",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:49 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/5/1/34",
abstract = "This article speculates on the future of privacy and
electronic identities on the Internet. Based on a short
review of security models and the development of
privacy-enhancing technology, privacy and electronic
identities will be discussed as parts of a larger
context-an ecosystem of personal information and
electronic identities. The article argues for an
ecosystem view of personal information and electronic
identities, as both personal information and identity
information are basic required input for many
applications. Therefore, for both application owners
and users, a functioning ecosystem of personal
information and electronic identification is important.
For the future of the Internet, high-quality
information and controlled circulation of such
information is therefore argued as decisive for the
value of future Internet applications.",
acknowledgement = ack-nhfb,
remark = "Special Issue Privacy in the Future Internet.",
}
@Article{Galindo:2013:NIC,
author = "David Galindo",
title = "A note on an {IND-CCA2} secure {Paillier}-based
cryptosystem",
journal = j-INFO-PROC-LETT,
volume = "113",
number = "22--24",
pages = "913--914",
month = nov # "\slash " # dec,
year = "2013",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Dec 2 11:48:02 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013002457",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Gao:2013:LCA,
author = "Guangyong Gao and Guoping Jiang",
title = "A lossless copyright authentication scheme based on
{Bessel--Fourier} moment and extreme learning machine
in curvature-feature domain",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "1",
pages = "222--232",
month = jan,
year = "2013",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.07.070",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri Nov 9 12:50:20 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212002270",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Garmany:2013:PPR,
author = "Behrad Garmany and Tilo M{\"u}ller",
booktitle = "Proceedings of the 29th Annual Computer Security
Applications Conference",
title = "{PRIME}: Private {RSA} Infrastructure for Memory-less
Encryption",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "149--158",
year = "2013",
DOI = "https://doi.org/10.1145/2523649.2523656",
ISBN = "1-4503-2015-5",
ISBN-13 = "978-1-4503-2015-3",
bibdate = "Sat Feb 15 17:21:55 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "ACSAC '13",
abstract = "Cold boot attacks exploit the fact that data in RAM
gradually fades away over time, rather than being lost
immediately when power is cycled off. An attacker can
gain access to all memory contents by a restart or
short power-down of the system, a so called cold boot.
Consequently, sensitive data in RAM like cryptographic
keys are exposed to attackers with physical access.
Research in recent years found software-based solutions
to the cold boot problem in terms of CPU-bound or
memory-less encryption. To date, however, the focus has
been set on symmetric ciphers, particularly concerning
disk encryption systems. Contrary to that, the work in
hand aims to close the gap to asymmetric ciphers. With
PRIME, we present a cold boot resistant infrastructure
for private RSA operations. All private RSA parameters
reside symmetrically encrypted in RAM and are decrypted
only within CPU registers. The modular exponentiation
algorithm for RSA is implemented entirely on the CPU,
such that no sensitive state of RSA ever goes to RAM.",
acmid = "2523656",
keywords = "CPU-bound encryption, RSA, cold boot attack",
location = "New Orleans, Louisiana",
numpages = "10",
}
@Article{Gasarch:2013:RBC,
author = "William Gasarch",
title = "Review of {{\booktitle{Theoretical Computer Science:
Introduction to Automata, Computability, Complexity,
Algorithmics, Randomization, Communication, and
Cryptography}} by Juraj Hromkovic}",
journal = j-SIGACT,
volume = "44",
number = "3",
pages = "7--8",
month = sep,
year = "2013",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2527748.2527750",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Mon Dec 2 17:43:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Ge:2013:SAP,
author = "Aijun Ge and Jiang Zhang and Rui Zhang and Chuangui Ma
and Zhenfeng Zhang",
title = "Security Analysis of a Privacy-Preserving
Decentralized Key-Policy Attribute-Based Encryption
Scheme",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "24",
number = "11",
pages = "2319--2321",
month = nov,
year = "2013",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2012.328",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Fri Nov 15 10:31:20 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Geller:2013:MIS,
author = "Tom Geller",
title = "Making the {Internet} safe for gadgets",
journal = j-CACM,
volume = "56",
number = "10",
pages = "18--20",
month = oct,
year = "2013",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2507771.2507777",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Sep 30 16:28:43 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Initiatives favor direct connections, named resources,
and cryptography.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@TechReport{Genkin:2013:RKE,
author = "Daniel Genkin and Adi Shamir and Eran Tromer",
title = "{RSA} Key Extraction via Low-Bandwidth Acoustic
Cryptanalysis",
type = "Technical and Web report",
institution = "Technion and Tel Aviv University and Weizmann
Institute of Science",
address = "Haifa and Tel Aviv, Israel",
day = "18",
month = dec,
year = "2013",
bibdate = "Wed Dec 18 09:40:20 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.cs.tau.ac.il/~tromer/acoustic/;
http://www.tau.ac.il/~tromer/papers/acoustic-20131218.pdf",
abstract = "Many computers emit a high-pitched noise during
operation, due to vibration in some of their electronic
components. These acoustic emanations are more than a
nuisance: they can convey information about the
software running on the computer, and in particular
leak sensitive information about security-related
computations. In a preliminary presentation, we have
shown that different RSA keys induce different sound
patterns, but it was not clear how to extract
individual key bits. The main problem was that the
acoustic side channel has a very low bandwidth (under
20 kHz using common microphones, and a few hundred kHz
using ultrasound microphones), many orders of magnitude
below the GHz-scale clock rates of the attacked
computers.\par
Here, we describe a new acoustic cryptanalysis key
extraction attack, applicable to GnuPG's current
implementation of RSA. The attack can extract full
4096-bit RSA decryption keys from laptop computers (of
various models), within an hour, using the sound
generated by the computer during the decryption of some
chosen ciphertexts. We experimentally demonstrate that
such attacks can be carried out, using either a plain
mobile phone placed next to the computer, or a more
sensitive microphone placed 4 meters away.\par
Beyond acoustics, we demonstrate that a similar
low-bandwidth attack can be performed by measuring the
electric potential of a computer chassis. A
suitably-equipped attacker need merely touch the target
computer with his bare hand, or get the required
leakage information from the ground wires at the remote
end of VGA, USB or Ethernet cables.",
acknowledgement = ack-nhfb,
}
@Misc{Gentry:2013:EIF,
author = "Craig B. Gentry and Shai Halevi",
title = "Efficient implementation of fully homomorphic
encryption",
howpublished = "US Patent 8,565,435.",
day = "22",
month = oct,
year = "2013",
bibdate = "Sat Dec 28 14:09:31 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "Filed 9 August 2011.",
acknowledgement = ack-nhfb,
}
@Article{Gentry:2013:EMH,
author = "Craig Gentry",
title = "Encrypted Messages from the Heights of Cryptomania",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "120--121",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-36594-2_7?coverImageUrl=/static/0.8699/sites/link/images/abstract_cover_placeholder.png",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gentry:2013:FSB,
author = "Craig Gentry and Shai Halevi and Chris Peikert and
Nigel P. Smart",
title = "Field switching in {BGV}-style homomorphic
encryption",
journal = j-J-COMP-SECUR,
volume = "21",
number = "5",
pages = "663--684",
month = "????",
year = "2013",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-130480",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:25:59 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Goglin:2013:KGS,
author = "Brice Goglin and St{\'e}phanie Moreaud",
title = "{KNEM}: a generic and scalable kernel-assisted
intra-node {MPI} communication framework",
journal = j-J-PAR-DIST-COMP,
volume = "73",
number = "2",
pages = "176--188",
month = feb,
year = "2013",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2012.09.016",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Thu Dec 13 20:22:17 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib;
https://www.math.utah.edu/pub/tex/bib/pvm.bib;
http://www.sciencedirect.com/science/journal/07437315",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731512002316",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Goh:2013:TOT,
author = "Weihan Goh and Chai Kiat Yeo",
title = "Teaching an Old {TPM} New Tricks: Repurposing for
Identity-Based Signatures",
journal = j-IEEE-SEC-PRIV,
volume = "11",
number = "5",
pages = "28--35",
month = sep # "\slash " # oct,
year = "2013",
DOI = "",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Nov 15 07:50:42 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
fjournal = "IEEE Security \& Privacy",
}
@Book{GomezPardo:2013:ICM,
author = "Jos{\'e} Luis {G{\'o}mez Pardo}",
title = "Introduction to Cryptography with {Maple}",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xxx + 705",
year = "2013",
DOI = "https://doi.org/10.1007/978-3-642-32166-5",
ISBN = "3-642-32165-8, 3-642-32166-6",
ISBN-13 = "978-3-642-32165-8, 978-3-642-32166-5",
LCCN = "QA76.9.A25 G66 2013",
bibdate = "Sat Aug 9 14:06:33 MDT 2014",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib",
URL = "http://www.springerlink.com/content/978-3-642-32166-5",
abstract = "This introduction to cryptography employs a
programming-oriented approach to study the most
important cryptographic schemes in current use and the
main cryptanalytic attacks against them. Discussion of
the theoretical aspects, emphasizing precise security
definitions based on methodological tools such as
complexity and randomness, and of the mathematical
aspects, with emphasis on number-theoretic algorithms
and their applications to cryptography and
cryptanalysis, is integrated with the programming
approach, thus providing implementations of the
algorithms and schemes as well as examples of realistic
size.\par
A distinctive feature of the author's approach is the
use of Maple as a programming environment in which not
just the cryptographic primitives but also the most
important cryptographic schemes are implemented
following the recommendations of standards bodies such
as NIST, with many of the known cryptanalytic attacks
implemented as well. The purpose of the Maple
implementations is to let the reader experiment and
learn, and for this reason the author includes numerous
examples. The book discusses important recent subjects
such as homomorphic encryption, identity-based
cryptography and elliptic curve cryptography. The
algorithms and schemes which are treated in detail and
implemented in Maple include AES and modes of
operation, CMAC, GCM/GMAC, SHA-256, HMAC, RSA, Rabin,
Elgamal, Paillier, Cocks IBE, DSA and ECDSA. In
addition, some recently introduced schemes enjoying
strong security properties, such as RSA-OAEP,
Rabin-SAEP, Cramer--Shoup, and PSS, are also discussed
and implemented. On the cryptanalysis side, Maple
implementations and examples are used to discuss many
important algorithms, including birthday and
man-in-the-middle attacks, integer factorization
algorithms such as Pollard's rho and the quadratic
sieve, and discrete log algorithms such as baby-step
giant-step, Pollard's rho, Pohlig--Hellman and the
index calculus method.\par
This textbook is suitable for advanced undergraduate
and graduate students of computer science, engineering
and mathematics, satisfying the requirements of various
types of courses: a basic introductory course; a
theoretically oriented course whose focus is on the
precise definition of security concepts and on
cryptographic schemes with reductionist security
proofs; a practice-oriented course requiring little
mathematical background and with an emphasis on
applications; or a mathematically advanced course
addressed to students with a stronger mathematical
background. The main prerequisite is a basic knowledge
of linear algebra and elementary calculus, and while
some knowledge of probability and abstract algebra
would be helpful, it is not essential because the book
includes the necessary background from these subjects
and, furthermore, explores the number-theoretic
material in detail. The book is also a comprehensive
reference and is suitable for self-study by
practitioners and programmers.",
acknowledgement = ack-nhfb,
subject = "Maple (Computer file); Maple (Computer file); Data
encryption (Computer science); Cryptography; Maple.;
Kryptoanalyse.; Kryptologie.; Cryptography.; Data
encryption (Computer science)",
tableofcontents = "Classical Ciphers and Their Cryptanalysis \\
Basic Concepts from Probability, Complexity, Algebra
and Number Theory \\
Private-Key Encryption \\
Block Ciphers and Modes of Operation \\
Message Authentication \\
Algorithmic Number Theory for Cryptography and
Cryptanalysis: Primality, Factoring and Discrete
Logarithms \\
Introduction to Public-Key Cryptography: The
Diffie--Hellman Protocol \\
Public-Key Encryption \\
Digital Signatures \\
Identity-Based Cryptography \\
An Introduction to Elliptic Curve Cryptography",
}
@Article{Gong:2013:NOT,
author = "Longyan Gong and Jingxin Pan and Beibei Liu and
Shengmei Zhao",
title = "A novel one-time password mutual authentication scheme
on sharing renewed finite random sub-passwords",
journal = j-J-COMP-SYS-SCI,
volume = "79",
number = "1",
pages = "122--130",
month = feb,
year = "2013",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2012.06.002",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:21 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000012001249",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Goyal:2013:CZK,
author = "Vipul Goyal and Abhishek Jain and Rafail Ostrovsky and
Silas Richelson and Ivan Visconti",
title = "Concurrent Zero Knowledge in the Bounded Player
Model",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "60--79",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gradwohl:2013:SRC,
author = "Ronen Gradwohl and Noam Livne and Alon Rosen",
title = "Sequential rationality in cryptographic protocols",
journal = j-TEAC,
volume = "1",
number = "1",
pages = "2:1--2:??",
month = jan,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2399187.2399189",
ISSN = "2167-8375 (print), 2167-8383 (electronic)",
ISSN-L = "2167-8375",
bibdate = "Fri Mar 14 06:10:51 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/teac.bib",
abstract = "Much of the literature on rational cryptography
focuses on analyzing the strategic properties of
cryptographic protocols. However, due to the presence
of computationally-bounded players and the asymptotic
nature of cryptographic security, a definition of
sequential rationality for this setting has thus far
eluded researchers. We propose a new framework for
overcoming these obstacles, and provide the first
definitions of computational solution concepts that
guarantee sequential rationality. We argue that natural
computational variants of subgame perfection are too
strong for cryptographic protocols. As an alternative,
we introduce a weakening called threat-free Nash
equilibrium that is more permissive but still
eliminates the undesirable ``empty threats'' of
nonsequential solution concepts. To demonstrate the
applicability of our framework, we revisit the problem
of implementing a mediator for correlated equilibria
[Dodis et al 2000], and propose a variant of their
protocol that is sequentially rational for a nontrivial
class of correlated equilibria. Our treatment provides
a better understanding of the conditions under which
mediators in a correlated equilibrium can be replaced
by a stable protocol.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Economics and Computation",
journal-URL = "http://dl.acm.org/citation.cfm?id=2542174",
}
@Article{Grosse:2013:AS,
author = "Eric Grosse and Mayank Upadhyay",
title = "Authentication at Scale",
journal = j-IEEE-SEC-PRIV,
volume = "11",
number = "1",
pages = "15--22",
month = jan # "\slash " # feb,
year = "2013",
DOI = "https://doi.org/10.1109/MSP.2012.162",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Mon Mar 18 08:56:47 2013",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/grosse-eric.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "http://www.computer.org/cms/Computer.org/ComputingNow/pdfs/AuthenticationAtScale.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
keywords = "authentication; delegation; Google 2sv; OAutho;
passwords; phishing attacks; second factor",
xxURL = "http://origin-www.computer.org/csdl/mags/sp/preprint/msp2012990123.pdf",
}
@Article{Guo:2013:TVS,
author = "Teng Guo and Feng Liu and ChuanKun Wu",
title = "Threshold visual secret sharing by random grids with
improved contrast",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "8",
pages = "2094--2109",
month = aug,
year = "2013",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Jul 15 15:59:36 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121213000745",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Gupta:2013:HPH,
author = "Sourav Sen Gupta and A. Chattopadhyay and K. Sinha and
S. Maitra and B. P. Sinha",
title = "High-Performance Hardware Implementation for {RC4}
Stream Cipher",
journal = j-IEEE-TRANS-COMPUT,
volume = "62",
number = "4",
pages = "730--743",
month = apr,
year = "2013",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2012.19",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Apr 30 12:26:22 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Han:2013:IBD,
author = "Jinguang Han and Willy Susilo and Yi Mu",
title = "Identity-based data storage in cloud computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "29",
number = "3",
pages = "673--681",
month = mar,
year = "2013",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2012.07.010",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Nov 30 11:11:37 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib;
http://www.sciencedirect.com/science/journal/0167739X",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X12001719",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Han:2013:RMA,
author = "Song Han and Tharam Dillon and Vidy Potdar and
Elizabeth Chang",
title = "{RFID} mutual authentication protocols for tags and
readers with and without a server",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "28",
number = "2",
pages = "??--??",
month = "????",
year = "2013",
CODEN = "CSSEEI",
ISSN = "0267-6192",
ISSN-L = "0267-6192",
bibdate = "Tue Dec 3 12:04:33 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
}
@Article{Harn:2013:GA,
author = "Lein Harn",
title = "Group Authentication",
journal = j-IEEE-TRANS-COMPUT,
volume = "62",
number = "9",
pages = "1893--1898",
month = sep,
year = "2013",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2012.251",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Nov 15 08:54:34 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Hayashi:2013:AEI,
author = "Y.-I. Hayashi and Y. Hayashi and N. Homma and T.
Mizuki and T. Aoki",
title = "Analysis of Electromagnetic Information Leakage From
Cryptographic Devices With Different Physical
Structures",
journal = j-IEEE-TRANS-ELECTROMAGN-COMPAT,
volume = "??",
number = "??",
pages = "1--10",
year = "2013",
CODEN = "IEMCAE",
DOI = "https://doi.org/10.1109/TEMC.2012.2227486",
ISSN = "0018-9375 (print), 1558-187X (electronic)",
ISSN-L = "0018-9375",
bibdate = "Thu May 16 18:25:19 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Electromagnetic Compatibility",
onlinedate = "19 December 2012",
remark = "In press on 16 May 2013, but not yet assigned a volume
and issue.",
}
@Article{Hayes:2013:NSA,
author = "Adrian Hayes",
title = "Network Service Authentication Timing Attacks",
journal = j-IEEE-SEC-PRIV,
volume = "11",
number = "2",
pages = "80--82",
month = mar # "\slash " # apr,
year = "2013",
DOI = "https://doi.org/10.1109/MSP.2013.39",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed May 1 09:11:38 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{He:2013:GME,
author = "Q. Y. He and M. D. Reid",
title = "Genuine Multipartite {Einstein--Podolsky--Rosen}
Steering",
journal = j-PHYS-REV-LET,
volume = "111",
number = "25",
pages = "250403",
month = dec,
year = "2013",
CODEN = "PRLTAO",
DOI = "https://doi.org/10.1103/PhysRevLett.111.250403",
ISSN = "0031-9007 (print), 1079-7114 (electronic), 1092-0145",
ISSN-L = "0031-9007",
bibdate = "Wed Mar 26 14:58:12 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/einstein.bib",
URL = "http://link.aps.org/doi/10.1103/PhysRevLett.111.250403;
http://www.scientificcomputing.com/news/2014/03/einsteins-entanglement-produces-quantum-encryption;
http://www.swinburne.edu.au/engineering/caous/news_and_events/mulitipartite%20EPR%20steering%20paper.htm",
acknowledgement = ack-nhfb,
fjournal = "Physical Review Letters",
journal-URL = "http://prl.aps.org/browse",
keywords = "$N$-partite Einstein-Podolsky-Rosen (EPR) steering;
quantum cryptography; quantum secret sharing",
numpages = "5",
}
@Article{He:2013:HEH,
author = "Daojing He and Jiajun Bu and Sammy Chan and Chun
Chen",
title = "{Handauth}: Efficient Handover Authentication with
Conditional Privacy for Wireless Networks",
journal = j-IEEE-TRANS-COMPUT,
volume = "62",
number = "3",
pages = "616--622",
month = mar,
year = "2013",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2011.258",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Apr 30 12:26:22 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Henson:2013:MES,
author = "Michael Henson and Stephen Taylor",
title = "Memory encryption: a survey of existing techniques",
journal = j-COMP-SURV,
volume = "46",
number = "4",
pages = "53:1--53:??",
month = mar,
year = "2013",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2566673",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Fri Mar 21 18:13:35 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Memory encryption has yet to be used at the core of
operating system designs to provide confidentiality of
code and data. As a result, numerous vulnerabilities
exist at every level of the software stack. Three
general approaches have evolved to rectify this
problem. The most popular approach is based on complex
hardware enhancements; this allows all encryption and
decryption to be conducted within a well-defined
trusted boundary. Unfortunately, these designs have not
been integrated within commodity processors and have
primarily been explored through simulation with very
few prototypes. An alternative approach has been to
augment existing hardware with operating system
enhancements for manipulating keys, providing improved
trust. This approach has provided insights into the use
of encryption but has involved unacceptable overheads
and has not been adopted in commercial operating
systems. Finally, specialized industrial devices have
evolved, potentially adding coprocessors, to increase
security of particular operations in specific operating
environments. However, this approach lacks generality
and has introduced unexpected vulnerabilities of its
own. Recently, memory encryption primitives have been
integrated within commodity processors such as the
Intel i7, AMD bulldozer, and multiple ARM variants.
This opens the door for new operating system designs
that provide confidentiality across the entire software
stack outside the CPU. To date, little practical
experimentation has been conducted, and the
improvements in security and associated performance
degradation has yet to be quantified. This article
surveys the current memory encryption literature from
the viewpoint of these central issues.",
acknowledgement = ack-nhfb,
articleno = "53",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Hernandez-Ardieta:2013:TSA,
author = "Jorge L. Hernandez-Ardieta and Ana I. Gonzalez-Tablas
and Jose M. de Fuentes and Benjamin Ramos",
title = "A taxonomy and survey of attacks on digital
signatures",
journal = j-COMPUT-SECUR,
volume = "34",
number = "??",
pages = "67--112",
month = may,
year = "2013",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:32 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404812001794",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Herranz:2013:SMS,
author = "Javier Herranz and Alexandre Ruiz and Germ{\'a}n
S{\'a}ez",
title = "Sharing many secrets with computational provable
security",
journal = j-INFO-PROC-LETT,
volume = "113",
number = "14--16",
pages = "572--579",
month = jul # "\slash " # aug,
year = "2013",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jul 1 18:58:11 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013001373",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Hocking:2013:COU,
author = "C. G. Hocking and S. M. Furnell and N. L. Clarke and
P. L. Reynolds",
title = "{Co}-operative user identity verification using an
Authentication Aura",
journal = j-COMPUT-SECUR,
volume = "39 (part B)",
number = "??",
pages = "486--502",
month = nov,
year = "2013",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:35 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404813001417",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Houmansadr:2013:BCN,
author = "Amir Houmansadr and Nikita Borisov",
title = "{BotMosaic}: {Collaborative} network watermark for the
detection of {IRC}-based botnets",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "3",
pages = "707--715",
month = mar,
year = "2013",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.11.005",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed Jan 23 08:33:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212003068",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Hulsing:2013:OPX,
author = "Andreas H{\"u}lsing and Lea Rausch and Johannes
Buchman",
title = "Optimal Parameters for {XMSS$^{MT}$}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8128",
pages = "194--208",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-40588-4_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 31 16:16:46 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "https://link.springer.com/chapter/10.1007/978-3-642-40588-4_14",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
journal-URL = "http://link.springer.com/bookseries/558",
keywords = "hash-based signature scheme",
remark = "Proceedings of the International Conference on
Availability, Reliability, and Security (CD-ARES 13).",
}
@Article{Hulsing:2013:WOS,
author = "Andreas H{\"u}lsing",
title = "{W-OTS+} --- Shorter Signatures for Hash-Based
Signature Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7918",
pages = "173--188",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-38553-7_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 31 16:10:39 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://link.springer.com/chapter/10.1007/978-3-642-38553-7_10",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
journal-URL = "http://link.springer.com/bookseries/558",
keywords = "Winternitz type one-time signature scheme (W-OTS)",
remark = "Proceedings of the 6th International Conference on
Cryptology in Africa (AFRICACRYPT 13).",
}
@Article{Hur:2013:REC,
author = "Junbeom Hur and Dongyoung Koo and Seong Oun Hwang and
Kyungtae Kang",
title = "Removing escrow from ciphertext policy attribute-based
encryption",
journal = j-COMPUT-MATH-APPL,
volume = "65",
number = "9",
pages = "1310--1317",
month = may,
year = "2013",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:51:21 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122112001198",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{IBM:2013:DMP,
author = "{IBM}",
title = "Daunting Mathematical Puzzle Solved, Enables Unlimited
Analysis of Encrypted Data",
journal = "Scientific Computing",
day = "24",
month = dec,
year = "2013",
bibdate = "Sat Dec 28 14:07:39 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "See patent \cite{Gentry:2013:EIF}.",
URL = "http://www.scientificcomputing.com/news/2013/12/daunting-mathematical-puzzle-solved-enables-unlimited-analysis-encrypted-data",
acknowledgement = ack-nhfb,
keywords = "fully homomorphic encryption",
}
@Misc{IBM:2013:IPC,
author = "{IBM}",
title = "{IBM PCIe Cryptographic Coprocessor}",
howpublished = "Web document",
year = "2013",
bibdate = "Thu Feb 27 08:46:07 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www-03.ibm.com/security/cryptocards/pciecc/overview.shtml",
abstract = "The 4765 Cryptographic Coprocessor is a tamper
responding, programmable, cryptographic PCIe card,
containing CPU, encryption hardware, RAM, persistent
memory, hardware random number generator, time of day
clock, infrastructure firmware, and software.
Specialized hardware performs AES, DES, TDES, RSA,
SHA-1, SHA-224 to SHA-512, and other cryptographic
processes, relieving the main processor from these
tasks.",
acknowledgement = ack-nhfb,
}
@Article{Jain:2013:MSD,
author = "Ajay Jain and Kusha Chopra",
title = "Malware signing detection system",
journal = j-SIGSOFT,
volume = "38",
number = "5",
pages = "1--8",
month = sep,
year = "2013",
CODEN = "SFENDP",
DOI = "https://doi.org/10.1145/2507288.2507307",
ISSN = "0163-5948 (print), 1943-5843 (electronic)",
ISSN-L = "0163-5948",
bibdate = "Wed Aug 1 17:16:29 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsoft2010.bib",
abstract = "Software malware not only creates financial damages to
corporate and individual computer users, but also
invades privacy, exploits their devices and induces
other significant losses. While efficient tools and
technologies that control and limit malware spread
across devices in the public domain are being
developed, the problem is far from being resolved. We
worked on a methodology that uses techniques to detect
malware during in-house development and prevents
malware from being released in the field. This work
helps determine and handle situations where a person,
authorized to access an authentic signing certificate
[1] signs malware (or set of file(s)) intended to
perform harmful operations, such as spreading a virus
on a computer using the said certificate, and releases
the malicious code publicly or to a community.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGSOFT Software Engineering Notes",
journal-URL = "https://dl.acm.org/citation.cfm?id=J728",
}
@Article{Jawad:2013:GAD,
author = "Khurram Jawad and Asifullah Khan",
title = "Genetic algorithm and difference expansion based
reversible watermarking for relational databases",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "11",
pages = "2742--2753",
month = nov,
year = "2013",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Sep 9 07:54:59 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121213001428",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Jeffs:2013:CCP,
author = "R. Amzi Jeffs and Mike Rosulek",
title = "Characterizing the Cryptographic Properties of
Reactive $2$-Party Functionalities",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "263--280",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jeong:2013:CBC,
author = "Kitae Jeong",
title = "Cryptanalysis of block cipher {Piccolo} suitable for
cloud computing",
journal = j-J-SUPERCOMPUTING,
volume = "66",
number = "2",
pages = "829--840",
month = nov,
year = "2013",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-013-0902-2",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Feb 8 10:21:59 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=66&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-013-0902-2",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@TechReport{Joux:2013:NIC,
author = "Antoine Joux",
title = "A new index calculus algorithm with complexity {$ L(1
/ 4 + o(1)) $} in very small characteristic",
type = "Report",
number = "2013/095",
institution = "CryptoExperts and Universit{\'e} de Versailles
Saint-Quentin-en-Yvelines, Laboratoire PRISM",
address = "45 avenue des Etats-Unis, F-78035 Versailles Cedex,
France",
pages = "23",
day = "20",
month = feb,
year = "2013",
bibdate = "Thu Feb 27 06:27:57 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://eprint.iacr.org/2013/095",
abstract = "In this paper, we describe a new algorithm for
discrete logarithms in small characteristic. This
algorithm is based on index calculus and includes two
new contributions. The first is a new method for
generating multiplicative relations among elements of a
small smoothness basis. The second is a new descent
strategy that allows us to express the logarithm of an
arbitrary finite field element in terms of the
logarithm of elements from the smoothness basis. For a
small characteristic finite field of size $ Q = p^n $,
this algorithm achieves heuristic complexity $ L_Q(1 /
4 + o(1)). $ For technical reasons, unless $n$ is
already a composite with factors of the right size,
this is done by embedding $ \GF {Q} $ in a small
extension $ \GF {Q^e} $ with $ e \leq 2 \lceil \log_p n
\rceil $.",
acknowledgement = ack-nhfb,
keywords = "discrete logarithm",
remark = "Presented at Selected Areas in Cryptography 2013 (SAC
2013), Burnaby, British Columbia, Canada, August
2013.",
}
@Article{Kamp:2013:MES,
author = "Poul-Henning Kamp",
title = "More Encryption Is Not the Solution",
journal = j-QUEUE,
volume = "11",
number = "7",
pages = "10",
month = jul,
year = "2013",
CODEN = "AQCUAE",
DOI = "https://doi.org/10.1145/2508834.2508864",
ISSN = "1542-7730 (print), 1542-7749 (electronic)",
ISSN-L = "1542-7730",
bibdate = "Wed Jul 31 12:23:21 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/queue.bib",
abstract = "Cryptography as privacy works only if both ends work
at it in good faith.",
acknowledgement = ack-nhfb,
fjournal = "ACM Queue: Tomorrow's Computing Today",
}
@Article{Kannan:2013:NQF,
author = "S. R. Kannan and S. Ramthilagam and R. Devi and
Yueh-Min Huang",
title = "Novel Quadratic Fuzzy $c$-Means Algorithms for
Effective Data Clustering Problems",
journal = j-COMP-J,
volume = "56",
number = "3",
pages = "393--406",
month = mar,
year = "2013",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxs085",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Mar 1 06:18:28 MST 2013",
bibsource = "http://comjnl.oxfordjournals.org/content/56/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/56/3/393.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "June 27, 2012",
}
@Book{Kapera:2013:MRM,
author = "Zdzis{\l}aw Jan Kapera",
title = "{Marian Rejewski}: the man who defeated ``{Enigma}''",
volume = "8",
publisher = "The Enigma Press",
address = "Krak{\'o}w, Poland",
pages = "111",
year = "2013",
ISBN = "83-86110-72-4",
ISBN-13 = "978-83-86110-72-8",
LCCN = "????",
bibdate = "Sat Jun 6 12:20:23 MDT 2015",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptologia.bib",
series = "The Enigma bulletin",
acknowledgement = ack-nhfb,
author-dates = "1942--",
subject = "Rejewski, Marian,; Enigma (Chiffriermaschine); Polen",
subject-dates = "1905--1980",
}
@Article{Karakoc:2013:BCL,
author = "F. Karako{\c{c}} and H. Demirci and A. E. Harmanci",
title = "Biclique cryptanalysis of {LBlock} and {TWINE}",
journal = j-INFO-PROC-LETT,
volume = "113",
number = "12",
pages = "423--429",
day = "30",
month = jun,
year = "2013",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Apr 16 06:15:28 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013000884",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Katz:2013:RIB,
author = "Jon Katz",
title = "Review of {{\booktitle{Identity-based encryption}} by
Sanjit Chattarjee and Palash Sarkar}",
journal = j-SIGACT,
volume = "44",
number = "4",
pages = "29--31",
month = dec,
year = "2013",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2556663.2556668",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
bibdate = "Sat Mar 15 09:22:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Kawai:2013:SHS,
author = "Yutaka Kawai and Noboru Kunihiro",
title = "Secret handshake scheme with request-based-revealing",
journal = j-COMPUT-MATH-APPL,
volume = "65",
number = "5",
pages = "786--798",
month = mar,
year = "2013",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:51:19 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122112004919",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Khakpour:2013:ITA,
author = "Amir R. Khakpour and Alex X. Liu",
title = "An information-theoretical approach to high-speed flow
nature identification",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "4",
pages = "1076--1089",
month = aug,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2219591",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Sep 9 17:27:57 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper concerns the fundamental problem of
identifying the content nature of a flow--namely text,
binary, or encrypted--for the first time. We propose
Iustitia, a framework for identifying flow nature on
the fly. The key observation behind Iustitia is that
text flows have the lowest entropy and encrypted flows
have the highest entropy, while the entropy of binary
flows stands in between. We further extend Iustitia for
the finer-grained classification of binary flows so
that we can differentiate different types of binary
flows (such as image, video, and executables) and even
the file formats (such as JPEG and GIF for images, MPEG
and AVI for videos) carried by binary flows. The basic
idea of Iustitia is to classify flows using machine
learning techniques where a feature is the entropy of
every certain number of consecutive bytes. Our
experimental results show that the classification can
be done with high speed and high accuracy. On average,
Iustitia can classify flows with 88.27\% of accuracy
using a buffer size of 1 K with a classification time
of less than 10\% of packet interarrival time for
91.2\% of flows.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Khalil-Hani:2013:BEB,
author = "Mohamed Khalil-Hani and Muhammad N. Marsono and Rabia
Bakhteri",
title = "Biometric encryption based on a fuzzy vault scheme
with a fast chaff generation algorithm",
journal = j-FUT-GEN-COMP-SYS,
volume = "29",
number = "3",
pages = "800--810",
month = mar,
year = "2013",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2012.02.002",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Nov 30 11:11:37 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib;
http://www.sciencedirect.com/science/journal/0167739X",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X12000350",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Khan:2013:EDC,
author = "Abdul Nasir Khan and M. L. Mat Kiah and Sajjad A.
Madani and Atta ur Rehman Khan and Mazhar Ali",
title = "Enhanced dynamic credential generation scheme for
protection of user identity in mobile-cloud computing",
journal = j-J-SUPERCOMPUTING,
volume = "66",
number = "3",
pages = "1687--1706",
month = dec,
year = "2013",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-013-0967-y",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Feb 8 11:30:58 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=66&issue=3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-013-0967-y",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Klingler:2013:UPT,
author = "Lee Klingler and Rainer Steinwandt and Dominique
Unruh",
title = "On using probabilistic {Turing} machines to model
participants in cryptographic protocols",
journal = j-THEOR-COMP-SCI,
volume = "501",
number = "??",
pages = "49--51",
day = "27",
month = aug,
year = "2013",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Aug 26 16:17:46 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397513003666",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Kobsa:2013:CJV,
author = "Alfred Kobsa and Rishab Nithyanand and Gene Tsudik and
Ersin Uzun",
title = "Can {Jannie} verify? {Usability} of display-equipped
{RFID} tags for security purposes",
journal = j-J-COMP-SECUR,
volume = "21",
number = "3",
pages = "347--370",
month = "????",
year = "2013",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-130470",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:25:52 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Krenn:2013:AWI,
author = "Daniel Krenn",
title = "Analysis of the width-$w$ non-adjacent form in
conjunction with hyperelliptic curve cryptography and
with lattices",
journal = j-THEOR-COMP-SCI,
volume = "491",
number = "??",
pages = "47--70",
day = "17",
month = jun,
year = "2013",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2013.04.006",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 8 16:38:46 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397513002685",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Krenn:2013:CCR,
author = "Stephan Krenn and Krzysztof Pietrzak and Akshay
Wadia",
title = "A Counterexample to the Chain Rule for Conditional
{HILL} Entropy",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "23--39",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kupcu:2013:DTT,
author = "Alptekin K{\"u}p{\c{c}}{\"u}",
title = "Distributing trusted third parties",
journal = j-SIGACT,
volume = "44",
number = "2",
pages = "92--112",
month = jun,
year = "2013",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2491533.2491553",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
bibdate = "Mon Dec 2 17:43:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
abstract = "Trusted Third Parties (TTPs) are widely employed in
various scenarios for providing fairness guarantees
(e.g., in fair exchange or e-commerce protocols,
including secure two-party computation), for
distributing secrets (e.g., in authentication or
secret-sharing protocols, as well as group signatures),
and for creating trust (e.g., as certificate
authorities). Such wide use of TTPs, as well as the
trust requirement that is put on them make them a prime
target for distributed systems and cryptography
research. There are some well-known and proven
solutions to the problem of distributing the trust put
on TTPs: Byzantine agreement or secure multi-party
computation techniques can be employed to distribute
the job of any TTP to multiple parties, tolerating up
to half or one-third of those parties being malicious.
Such techniques are not widely-employed in practice
possibly due to their quadratic complexity or
inter-operation requirements. This brings up the
question of distributing TTPs in a much more efficient
way, possibly via using autonomous agents, who do not
directly communicate with each other. In this paper, we
present various known techniques for distributing the
trust put on TTPs. Then, we concentrate on using
multiple autonomous parties, who do not communicate
with each other at all, to realize a single TTP. We
discuss the role of synchrony in such attempts, and
conclude with some open questions.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Kushner:2013:RSS,
author = "David Kushner",
title = "The real story of {Stuxnet}",
journal = j-IEEE-SPECTRUM,
volume = "50",
number = "3",
pages = "48--53",
month = mar,
year = "2013",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2013.6471059",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Companies; Computer hacking; Computer security;
Computer viruses; Cryptography; invasive software;
Iran; Kaspersky Laboratory; Malware; malware;
nuclear-fuel enrichment program; stuxnet",
}
@Article{Lai:2013:SAS,
author = "Chengzhe Lai and Hui Li and Rongxing Lu and Xuemin
(Sherman) Shen",
title = "{SE-AKA}: a secure and efficient group authentication
and key agreement protocol for {LTE} networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "57",
number = "17",
pages = "3492--3510",
day = "9",
month = dec,
year = "2013",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Nov 4 10:15:54 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128613002570",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Lamonica:2013:LDQ,
author = "M. Lamonica",
title = "Long-distance quantum cryptography [News]",
journal = j-IEEE-SPECTRUM,
volume = "50",
number = "8",
pages = "12--13",
month = aug,
year = "2013",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2013.6565546",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Cryptography; encrypt data; long-distance quantum
cryptography; point-to-point connection security;
quantum cryptography; Quantum physics",
}
@Misc{Langley:2013:EDC,
author = "Adam Langley",
title = "Enhancing digital certificate security",
howpublished = "Web site.",
year = "2013",
bibdate = "Mon Mar 09 15:48:08 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://googleonlinesecurity.blogspot.com/2013/01/enhancing-digital-certificate-security.html",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 52]{Schneier:2015:SWC}.",
}
@Article{Lasc:2013:DDA,
author = "Ioana Lasc and Reiner Dojen and Tom Coffey",
title = "On the detection of desynchronisation attacks against
security protocols that use dynamic shared secrets",
journal = j-COMPUT-SECUR,
volume = "32",
number = "??",
pages = "115--129",
month = feb,
year = "2013",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:31 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404812001678",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Lee:2013:CCM,
author = "Che-Wei Lee and Wen-Hsiang Tsai",
title = "A covert communication method via spreadsheets by
secret sharing with a self-authentication capability",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "2",
pages = "324--334",
month = feb,
year = "2013",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.08.048",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Sat Jan 5 09:05:59 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212002464",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Lei:2013:RSW,
author = "Baiying Lei and Insu Song and Shah Atiqur Rahman",
title = "Robust and secure watermarking scheme for breath
sound",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "6",
pages = "1638--1649",
month = jun,
year = "2013",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue May 14 16:09:14 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121213000332",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Lerch-Hostalot:2013:LMS,
author = "Daniel Lerch-Hostalot and David Meg{\'\i}as",
title = "{LSB} matching steganalysis based on patterns of pixel
differences and random embedding",
journal = j-COMPUT-SECUR,
volume = "32",
number = "??",
pages = "192--206",
month = feb,
year = "2013",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:31 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404812001745",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Leva:2013:ABN,
author = "Tapio Lev{\"a} and Miika Komu and Ari Ker{\"a}nen and
Sakari Luukkainen",
title = "Adoption barriers of network layer protocols: the case
of host identity protocol",
journal = j-COMP-NET-AMSTERDAM,
volume = "57",
number = "10",
pages = "2218--2232",
day = "5",
month = jul,
year = "2013",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Jul 1 19:17:17 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128613000480",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Li:2013:EAF,
author = "Celia Li and Uyen Trang Nguyen and Hoang Lan Nguyen
and Nurul Huda",
title = "Efficient authentication for fast handover in wireless
mesh networks",
journal = j-COMPUT-SECUR,
volume = "37",
number = "??",
pages = "124--142",
month = sep,
year = "2013",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:33 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404813000916",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Li:2013:ESC,
author = "Xiong Li and Jianwei Niu and Muhammad Khurram Khan and
Junguo Liao",
title = "An enhanced smart card based remote user password
authentication scheme",
journal = j-J-NETW-COMPUT-APPL,
volume = "36",
number = "5",
pages = "1365--1371",
month = sep,
year = "2013",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:42 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804513000726",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Li:2013:SSS,
author = "Ming Li and Shucheng Yu and Yao Zheng and Kui Ren and
Wenjing Lou",
title = "Scalable and Secure Sharing of Personal Health Records
in Cloud Computing Using Attribute-Based Encryption",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "24",
number = "1",
pages = "131--143",
month = jan,
year = "2013",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2012.97",
ISSN = "1045-9219",
ISSN-L = "1045-9219",
bibdate = "Wed May 1 08:02:21 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Liao:2013:NMS,
author = "Yi-Pin Liao and Chih-Ming Hsiao",
title = "A novel multi-server remote user authentication scheme
using self-certified public keys for mobile clients",
journal = j-FUT-GEN-COMP-SYS,
volume = "29",
number = "3",
pages = "886--900",
month = mar,
year = "2013",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2012.03.017",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Nov 30 11:11:37 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib;
http://www.sciencedirect.com/science/journal/0167739X",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X12000829",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Liskiewicz:2013:GBS,
author = "Maciej Li{\'s}kiewicz and R{\"u}diger Reischuk and
Ulrich W{\"o}lfel",
title = "Grey-box steganography",
journal = j-THEOR-COMP-SCI,
volume = "505",
number = "??",
pages = "27--41",
day = "23",
month = sep,
year = "2013",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Oct 7 09:23:18 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
URL = "http://www.sciencedirect.com/science/article/pii/S030439751200309X",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Liu:2013:GPB,
author = "Hong Liu and Huansheng Ning and Yan Zhang and Daojing
He and Qingxu Xiong and Laurence T. Yang",
title = "Grouping-Proofs-Based Authentication Protocol for
Distributed {RFID} Systems",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "24",
number = "7",
pages = "1321--1330",
month = jul,
year = "2013",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2012.218",
ISSN = "1045-9219",
ISSN-L = "1045-9219",
bibdate = "Fri Jun 21 08:51:27 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Liu:2013:IAG,
author = "Yining Liu and Chi Cheng and Jianyu Cao and Tao
Jiang",
title = "An Improved Authenticated Group Key Transfer Protocol
Based on Secret Sharing",
journal = j-IEEE-TRANS-COMPUT,
volume = "62",
number = "11",
pages = "2335--2336",
month = nov,
year = "2013",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2012.216",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Nov 15 08:54:34 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Liu:2013:PAE,
author = "Bin Liu and Bevan M. Baas",
title = "Parallel {AES} Encryption Engines for Many-Core
Processor Arrays",
journal = j-IEEE-TRANS-COMPUT,
volume = "62",
number = "3",
pages = "536--547",
month = mar,
year = "2013",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2011.251",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Apr 30 12:26:22 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Liu:2013:SIP,
author = "Dongxi Liu and Shenlu Wang",
title = "Special Issue Papers: Nonlinear order preserving index
for encrypted database query in service cloud
environments",
journal = j-CCPE,
volume = "25",
number = "13",
pages = "1967--1984",
day = "10",
month = sep,
year = "2013",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.2992",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue Dec 3 10:37:32 MST 2013",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "25 Jan 2013",
}
@Article{Liu:2013:TIE,
author = "Hongjun Liu and Xingyuan Wang",
title = "Triple-image encryption scheme based on one-time key
stream generated by chaos and plain images",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "3",
pages = "826--834",
month = mar,
year = "2013",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.11.026",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed Jan 23 08:33:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212003196",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Louchene:2013:WMR,
author = "Ahmed Louchene and Ammar Dahmani",
title = "Watermarking Method Resilient to {RST} and Compression
Based on {DWT}, {LPM} and Phase Correlation",
journal = j-INT-J-COMPUT-APPL,
volume = "35",
number = "1",
pages = "36--43",
year = "2013",
DOI = "https://doi.org/10.2316/Journal.202.2013.1.202-3503",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:28:32 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2013.1.202-3503",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Lu:2013:CSA,
author = "Linzhen Lu and Shaozhen Chen",
title = "A compress slide attack on the full {GOST} block
cipher",
journal = j-INFO-PROC-LETT,
volume = "113",
number = "17",
pages = "634--639",
day = "30",
month = aug,
year = "2013",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jul 1 18:58:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013001543",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Lui:2013:CBS,
author = "Oi-Yan Lui and Kwok-Wo Wong",
title = "Chaos-based selective encryption for {H.264\slash
AVC}",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "12",
pages = "3183--3192",
month = dec,
year = "2013",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Nov 4 10:35:56 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121213001994",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Lv:2013:NTP,
author = "Chao Lv and Maode Ma and Hui Li and Jianfeng Ma and
Yaoyu Zhang",
title = "An novel three-party authenticated key exchange
protocol using one-time key",
journal = j-J-NETW-COMPUT-APPL,
volume = "36",
number = "1",
pages = "498--503",
month = jan,
year = "2013",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:29 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804512000999",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Ma:2013:PVP,
author = "Chris Y. T. Ma and David K. Y. Yau and Nung Kwan Yip
and Nageswara S. V. Rao",
title = "Privacy vulnerability of published anonymous mobility
traces",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "3",
pages = "720--733",
month = jun,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2208983",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Feb 7 19:18:15 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobility traces of people and vehicles have been
collected and published to assist the design and
evaluation of mobile networks, such as large-scale
urban sensing networks. Although the published traces
are often made anonymous in that the true identities of
nodes are replaced by random identifiers, the privacy
concern remains. This is because in real life, nodes
are open to observations in public spaces, or they may
voluntarily or inadvertently disclose partial knowledge
of their whereabouts. Thus, snapshots of nodes'
location information can be learned by interested third
parties, e.g., directly through chance/engineered
meetings between the nodes and their observers, or
indirectly through casual conversations or other
information sources about people. In this paper, we
investigate how an adversary, when equipped with a
small amount of the snapshot information termed as side
information, can infer an extended view of the
whereabouts of a victim node appearing in an anonymous
trace. Our results quantify the loss of victim nodes'
privacy as a function of the nodal mobility, the
inference strategies of adversaries, and any noise that
may appear in the trace or the side information.
Generally, our results indicate that the privacy
concern is significant in that a relatively small
amount of side information is sufficient for the
adversary to infer the true identity (either uniquely
or with high probability) of a victim in a set of
anonymous traces. For instance, an adversary is able to
identify the trace of 30\%-50\% of the victims when she
has collected 10 pieces of side information about a
victim.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Mahmoody:2013:LEZ,
author = "Mohammad Mahmoody and David Xiao",
title = "Languages with Efficient Zero-Knowledge {PCPs} are in
{SZK}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "297--314",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_17/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Maitra:2013:DSM,
author = "Subhashis Maitra and Amitabha Sinha",
title = "Design and simulation of {MAC} unit using
combinational circuit and adder",
journal = j-COMP-ARCH-NEWS,
volume = "41",
number = "5",
pages = "25--33",
month = dec,
year = "2013",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/2641361.2641365",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Mon Aug 18 17:12:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "Hardware and timing complexities of MAC unit to
perform arithmetic operation like addition or
multiplication especially in the field of Digital
Signal Processing (DSP) or Elliptic Curve Cryptography
(ECC) are the major issues to the designer. The
multiplication operation is essential and abundant in
DSP Applications. In order to achieve maximum
implementation efficiency and timing performance,
designing a DSP systems is critical and frequently
presents a significant challenge to hardware engineers.
There are certain multipliers that simplify this
challenge by abstracting away FPGA device specifics,
while maintaining the required maximum performance and
resource efficiency. These multipliers are able to
perform parallel multiplication and hence constant
coefficient multiplication, both with differing
implementation styles. Again with the aid of
instantaneous resource estimation, hardware engineers
can rapidly select the optimal solution for their
system. The latest additions to the IP provide fine
control over the latency using the concept of
pipelining of the multipliers that are purely
combinatorial to be fully pipelined. Here a new
compensation method that reduces both the hardware and
timing complexities of the multiplier used for DSP
application or ECC application has been proposed. The
design of the MAC unit based on the proposed
compensation method has been dealt here properly using
Xilinx 13.2 and compared with array multiplier, Booth
multiplier and Vedic multiplier to show its novelty
over them. The hardware complexity is reduced to about
60\% of the original multiplier. Design results show
that the proposed architecture has lower hardware
overhead, lower error and fast operating speed as
compared with array, Booth and Vedic multiplier.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Maitra:2013:HEM,
author = "Subhashis Maitra and Amitabha Sinha",
title = "High efficiency {MAC} unit used in digital signal
processing and elliptic curve cryptography",
journal = j-COMP-ARCH-NEWS,
volume = "41",
number = "4",
pages = "1--7",
month = sep,
year = "2013",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/2560488.2560490",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Thu Jan 2 17:25:55 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "Computational complexities of different Algorithms to
enhance the speed of response of digital signal
processor and different cryptographic analysis are the
important issues for the current researcher.
Computational complexities means hardware complexities
and timing complexities. Both the complexities depend
on the design of the software and hardware. Arithmetic
computation like addition and multiplication are the
major parts in designing processor that helps to
improve the efficiency and to reduce complexities.
Hence the design of a multiplier unit is the major
issue to the current researchers. There are different
multiplication algorithms discussed in different
research materials. In this paper, a new algorithm for
multiplication has been proposed to enhance the speed
of operation and to reduce hardware complexities. Also
a comparative study of the proposed algorithm over
different existing algorithms has been explained here
along with VHDL model of the proposed architecture.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Maitra:2013:HPM,
author = "Subhashis Maitra and Amitabha Sinha",
title = "High performance {MAC} unit for {DSP} and
cryptographic applications",
journal = j-COMP-ARCH-NEWS,
volume = "41",
number = "2",
pages = "47--55",
month = may,
year = "2013",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/2490302.2490311",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Sat Jun 1 11:00:26 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "Multiplication and addition are the basic arithmetic
operation used in Digital Signal Processing (DSP) for
coefficient multiplication, scalar point multiplication
in Elliptic Curve Cryptography (ECC) and in other
fields. Multiplications are basically a shift and add
operation. However, there are many different variations
on how to do it. Some are more suitable to implement on
FPGA than others. However time complexities and
hardware complexities are the major issues in designing
a multiplier unit. There are different multiplication
algorithms in current technology. Hardware complexities
in some design are more than time complexities whereas
in some other design time complexities are more.
However there must be a tradeoff between these two
types of methodology. This paper will discuss a brief
idea how a tradeoff can be achieved. Experimental
results that have discussed here and the architecture
based on the proposed algorithm shows it's novelty.
Applications of the proposed algorithm on DSP and ECC
have been dealt here clearly.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Maity:2013:CRS,
author = "Santi P. Maity and Seba Maity and Jaya Sil and Claude
Delpha",
title = "Collusion resilient spread spectrum watermarking in
{$M$}-band wavelets using {GA}-fuzzy hybridization",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "1",
pages = "47--59",
month = jan,
year = "2013",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.06.057",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri Nov 9 12:50:20 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212001938",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Malkin:2013:SCB,
author = "Tal Malkin",
title = "Secure Computation for Big Data",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "355--355",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_20",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-36594-2_20?coverImageUrl=/static/0.8699/sites/link/images/abstract_cover_placeholder.png",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Malone:2013:MOD,
author = "C. V. Malone and E. J. Barkie and B. L. Fletcher and
N. Wei and A. Keren and A. Wyskida",
title = "{Mobile Optimized Digital Identity (MODI)}: A
framework for easier digital certificate use",
journal = j-IBM-JRD,
volume = "57",
number = "6",
pages = "9:1--9:11",
month = nov # "--" # dec,
year = "2013",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/JRD.2013.2283755",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Sat Feb 15 16:52:47 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Mangard:2013:KSL,
author = "Stefan Mangard",
title = "Keeping Secrets on Low-Cost Chips",
journal = j-IEEE-SEC-PRIV,
volume = "11",
number = "4",
pages = "75--77",
year = "2013",
DOI = "https://doi.org/10.1109/MSP.2013.88",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Mon Aug 12 11:34:33 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Manshaei:2013:GTM,
author = "Mohammad Hossein Manshaei and Quanyan Zhu and Tansu
Alpcan and Tamer Bacsar and Jean-Pierre Hubaux",
title = "Game theory meets network security and privacy",
journal = j-COMP-SURV,
volume = "45",
number = "3",
pages = "25:1--25:??",
month = jun,
year = "2013",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2480741.2480742",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Mon Jul 1 18:21:14 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "This survey provides a structured and comprehensive
overview of research on security and privacy in
computer and communication networks that use
game-theoretic approaches. We present a selected set of
works to highlight the application of game theory in
addressing different forms of security and privacy
problems in computer networks and mobile applications.
We organize the presented works in six main categories:
security of the physical and MAC layers, security of
self-organizing networks, intrusion detection systems,
anonymity and privacy, economics of network security,
and cryptography. In each category, we identify
security problems, players, and game models. We
summarize the main results of selected works, such as
equilibrium analysis and security mechanism designs. In
addition, we provide a discussion on the advantages,
drawbacks, and future direction of using game theory in
this field. In this survey, our goal is to instill in
the reader an enhanced understanding of different
research approaches in applying game-theoretic methods
to network security. This survey can also help
researchers from various fields develop game-theoretic
solutions to current and emerging security problems in
computer networking.",
acknowledgement = ack-nhfb,
articleno = "25",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Marconato:2013:VLC,
author = "G. Vache Marconato and M. Ka{\^a}niche and V.
Nicomette",
title = "A Vulnerability Life Cycle-Based Security Modeling and
Evaluation Approach",
journal = j-COMP-J,
volume = "56",
number = "4",
pages = "422--439",
month = apr,
year = "2013",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxs112",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Apr 1 08:36:50 MDT 2013",
bibsource = "http://comjnl.oxfordjournals.org/content/56/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/56/4/422.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 3, 2012",
}
@Article{Martinez-Julia:2013:BSI,
author = "Pedro Martinez-Julia and Antonio F. Skarmeta",
title = "Beyond the separation of identifier and locator:
Building an identity-based overlay network architecture
for the {Future Internet}",
journal = j-COMP-NET-AMSTERDAM,
volume = "57",
number = "10",
pages = "2280--2300",
day = "5",
month = jul,
year = "2013",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Jul 1 19:17:17 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128613000066",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Mazurczyk:2013:FWS,
author = "W. Mazurczyk and K. Szczypiorski and J. Lubacz",
title = "Four ways to smuggle messages through {Internet}
services",
journal = j-IEEE-SPECTRUM,
volume = "50",
number = "11",
pages = "42--45",
month = nov,
year = "2013",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2013.6655839",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Cryptography; custom-made software; Digital audio
players; dispatch decoding; dispatch encoding;
government policies; IEEE 802.11 Standards; Information
analysis; Internet; Internet services; message
authentication; message smuggling; national security;
Protocols; public Websites; Russian Foreign
Intelligence Service; secret agents; spies; US
Department of Justice; US policies; US programs; US
residents; Web sites",
}
@Article{Mazurczyk:2013:VSD,
author = "Wojciech Mazurczyk",
title = "{VoIP} steganography and its detection --- a survey",
journal = j-COMP-SURV,
volume = "46",
number = "2",
pages = "20:1--20:??",
month = nov,
year = "2013",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2543581.2543587",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Feb 6 07:35:29 MST 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Steganography is an ancient art that encompasses
various techniques of information hiding, the aim of
which is to embed secret information into a carrier
message. Steganographic methods are usually aimed at
hiding the very existence of the communication. Due to
the rise in popularity of IP telephony, together with
the large volume of data and variety of protocols
involved, it is currently attracting the attention of
the research community as a perfect carrier for
steganographic purposes. This article is a first survey
of the existing Voice over IP (VoIP) steganography
methods and their countermeasures.",
acknowledgement = ack-nhfb,
articleno = "20",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@TechReport{Menezes:2013:IPB,
author = "Alfred Menezes",
title = "An Introduction to Pairing-Based Cryptography",
type = "Report",
institution = "Department of Mathematics, University of Waterloo",
address = "Waterloo, ON, Canada",
pages = "19",
day = "27",
month = oct,
year = "2013",
bibdate = "Fri Feb 15 10:45:20 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.math.uwaterloo.ca/~ajmeneze/publications/pairings.pdf",
abstract = "Bilinear pairings have been used to design ingenious
protocols for such tasks as one-round three-party key
agreement, identity-based encryption, and aggregate
signatures. Suitable bilinear pairings can be
constructed from the Tate pairing for specially chosen
elliptic curves. This article gives an introduction to
the protocols, Tate pairing computation, and curve
selection.",
acknowledgement = ack-nhfb,
}
@Misc{Menn:2013:ESC,
author = "Joseph Menn",
title = "Exclusive: Secret contract tied {NSA} and security
industry pioneer",
howpublished = "Reuters",
day = "13",
month = dec,
year = "2013",
bibdate = "Mon Mar 09 15:52:09 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 56]{Schneier:2015:SWC}.",
}
@Article{Meshram:2013:IBC,
author = "Chandrashekhar Meshram and Suchitra A. Meshram",
title = "An identity-based cryptographic model for discrete
logarithm and integer factoring based cryptosystem",
journal = j-INFO-PROC-LETT,
volume = "113",
number = "10--11",
pages = "375--380",
month = may # "\slash " # jun,
year = "2013",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Apr 16 06:15:25 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013000550",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Mone:2013:FPE,
author = "Gregory Mone",
title = "Future-proof encryption",
journal = j-CACM,
volume = "56",
number = "11",
pages = "12--14",
month = nov,
year = "2013",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2524713.2524718",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Dec 2 16:21:27 MST 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Researchers are relying on quantum mechanics to
generate unhackable methods of communication.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Moreno:2013:NIP,
author = "Carlos Moreno and Sebastian Fischmeister and M. Anwar
Hasan",
title = "Non-intrusive program tracing and debugging of
deployed embedded systems through side-channel
analysis",
journal = j-SIGPLAN,
volume = "48",
number = "5",
pages = "77--88",
month = may,
year = "2013",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2499369.2465570",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Mon Jul 1 17:15:32 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "One of the hardest aspects of embedded software
development is that of debugging, especially when
faulty behavior is observed at the production or
deployment stage. Non-intrusive observation of the
system's behavior is often insufficient to infer the
cause of the problem and identify and fix the bug. In
this work, we present a novel approach for
non-intrusive program tracing aimed at assisting
developers in the task of debugging embedded systems at
deployment or production stage, where standard
debugging tools are usually no longer available. The
technique is rooted in cryptography, in particular the
area of side-channel attacks. Our proposed technique
expands the scope of these cryptographic techniques so
that we recover the sequence of operations from power
consumption observations (power traces). To this end,
we use digital signal processing techniques (in
particular, spectral analysis) combined with pattern
recognition techniques to determine blocks of source
code being executed given the observed power trace. One
of the important highlights of our contribution is the
fact that the system works on a standard PC, capturing
the power traces through the recording input of the
sound card. Experimental results are presented and
confirm that the approach is viable.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "GPCE '12 conference proceedings.",
}
@Article{Mosca:2013:QKD,
author = "Michele Mosca and Douglas Stebila and Berkant
Ustao{\u{g}}lu",
title = "Quantum Key Distribution in the Classical
Authenticated Key Exchange Framework",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7932",
pages = "136--154",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-38616-9_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Mar 21 08:01:29 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-38616-9_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-38616-9",
book-URL = "http://www.springerlink.com/content/978-3-642-38616-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Mou:2013:CBC,
author = "Luntian Mou and Tiejun Huang and Yonghong Tian and
Menglin Jiang and Wen Gao",
title = "Content-based copy detection through multimodal
feature representation and temporal pyramid matching",
journal = j-TOMCCAP,
volume = "10",
number = "1",
pages = "5:1--5:??",
month = dec,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2542205.2542208",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Mar 13 07:37:53 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Content-based copy detection (CBCD) is drawing
increasing attention as an alternative technology to
watermarking for video identification and copyright
protection. In this article, we present a comprehensive
method to detect copies that are subjected to
complicated transformations. A multimodal feature
representation scheme is designed to exploit the
complementarity of audio features, global and local
visual features so that optimal overall robustness to a
wide range of complicated modifications can be
achieved. Meanwhile, a temporal pyramid matching
algorithm is proposed to assemble frame-level
similarity search results into sequence-level matching
results through similarity evaluation over multiple
temporal granularities. Additionally, inverted indexing
and locality sensitive hashing (LSH) are also adopted
to speed up similarity search. Experimental results
over benchmarking datasets of TRECVID 2010 and 2009
demonstrate that the proposed method outperforms other
methods for most transformations in terms of copy
detection accuracy. The evaluation results also suggest
that our method can achieve competitive copy
localization preciseness.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Myers:2013:BBC,
author = "Steven Myers and Mona Sergi and abhi shelat",
title = "Black-box construction of a more than non-malleable
{CCA1} encryption scheme from plaintext awareness",
journal = j-J-COMP-SECUR,
volume = "21",
number = "5",
pages = "721--748",
month = "????",
year = "2013",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-130485",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:25:59 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Naranjo:2013:FDA,
author = "J. A. M. Naranjo and F. Cores and L. G. Casado and F.
Guirado",
title = "Fully distributed authentication with locality
exploitation for the {CoDiP2P} peer-to-peer computing
platform",
journal = j-J-SUPERCOMPUTING,
volume = "65",
number = "3",
pages = "1037--1049",
month = sep,
year = "2013",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-012-0842-2",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Feb 8 10:21:44 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=65&issue=3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-012-0842-2",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Narasimhan:2013:HTD,
author = "Seetharam Narasimhan and Dongdong Du and Rajat Subhra
Chakraborty and Somnath Paul and Francis G. Wolff and
Christos A. Papachristou and Kaushik Roy and Swarup
Bhunia",
title = "Hardware {Trojan} Detection by Multiple-Parameter
Side-Channel Analysis",
journal = j-IEEE-TRANS-COMPUT,
volume = "62",
number = "11",
pages = "2183--2195",
month = nov,
year = "2013",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2012.200",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Nov 15 08:54:34 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Naskar:2013:GTL,
author = "Ruchira Naskar and Rajat Subhra Chakraborty",
title = "A generalized tamper localization approach for
reversible watermarking algorithms",
journal = j-TOMCCAP,
volume = "9",
number = "3",
pages = "19:1--19:??",
month = jun,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2487268.2487272",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Mar 13 07:37:50 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "In general reversible watermarking algorithms, the
convention is to reject the entire cover image at the
receiver end if it fails authentication, since there is
no way to detect the exact locations of tampering. This
feature may be exploited by an adversary to bring about
a form of DoS attack. Here we provide a solution to
this problem in form of a tamper localization mechanism
for reversible watermarking algorithms, which allows
selective rejection of distorted cover image regions in
case of authentication failure, thus avoiding rejection
of the complete image. Additionally it minimizes the
bandwidth requirement of the communication channel.",
acknowledgement = ack-nhfb,
articleno = "19",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Newell:2013:PCD,
author = "Andrew Newell and Jing Dong and Cristina Nita-Rotaru",
title = "On the practicality of cryptographic defences against
pollution attacks in wireless network coding",
journal = j-COMP-SURV,
volume = "45",
number = "3",
pages = "39:1--39:??",
month = jun,
year = "2013",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2480741.2480756",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Mon Jul 1 18:21:14 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Numerous practical systems based on network coding
have been proposed in recent years demonstrating the
wide range of benefits of network coding, such as
increased throughput, reliability, and energy
efficiency. However, network coding systems are
inherently vulnerable to a severe attack, known as
packet pollution, which presents a key obstacle to the
deployment of such systems. Several cryptographic
schemes have been proposed to defend against pollution
attacks. We conduct a detailed analysis and an
experimental evaluation in a realistic wireless network
coding setting of a set of representative cryptographic
defenses against pollution attacks. Our analysis
identifies severe limitations of asymmetric-based
schemes, which impose high communication overhead by
placing constraints on the basic network coding
parameters and high computation overhead by relying on
numerous operations over large fields. Our analysis
also shows that symmetric cryptographic schemes, while
having better performance than asymmetric
cryptographic-based schemes, impose prohibitive
overhead in the presence of multiple byzantine
adversaries. We further evaluate these schemes by using
a set of typical network coding system parameters on a
realistic topology. Our experimental evaluation shows
that all the schemes we compare induce a throughput
degradation that negates the performance benefits of
network coding in the presence of multiple colluding
adversaries.",
acknowledgement = ack-nhfb,
articleno = "39",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Ni:2013:EIB,
author = "Liang Ni and Gongliang Chen and Jianhua Li",
title = "Escrowable identity-based authenticated key agreement
protocol with strong security",
journal = j-COMPUT-MATH-APPL,
volume = "65",
number = "9",
pages = "1339--1349",
month = may,
year = "2013",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:51:21 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S089812211200051X",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Nie:2013:CHB,
author = "Xuyun Nie and Zhaohu Xu and Johannes Buchmann",
title = "Cryptanalysis of Hash-Based Tamed Transformation and
Minus Signature Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7932",
pages = "155--164",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-38616-9_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Mar 21 08:01:29 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-38616-9_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-38616-9",
book-URL = "http://www.springerlink.com/content/978-3-642-38616-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nieto:2013:PVC,
author = "Juan Gonz{\'a}lez Nieto and Mark Manulis and Bertram
Poettering and Jothi Rangasamy and Douglas Stebila",
title = "Publicly verifiable ciphertexts",
journal = j-J-COMP-SECUR,
volume = "21",
number = "5",
pages = "749--778",
month = "????",
year = "2013",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-130473",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:25:59 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Misc{NIST:2013:CSS,
author = "{NIST}",
title = "Cryptographic standards statement",
howpublished = "National Institute of Standards and Technology",
month = sep,
year = "2013",
bibdate = "Mon Mar 09 15:56:53 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 61]{Schneier:2015:SWC}.",
}
@Article{Noureddine:2013:AMT,
author = "M. Noureddine and R. Bashroush",
title = "An authentication model towards cloud federation in
the enterprise",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "9",
pages = "2269--2275",
month = sep,
year = "2013",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 3 06:29:11 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212003408",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Pande:2013:SMC,
author = "Amit Pande and Prasant Mohapatra and Joseph Zambreno",
title = "Securing Multimedia Content Using Joint Compression
and Encryption",
journal = j-IEEE-MULTIMEDIA,
volume = "20",
number = "4",
pages = "50--61",
month = oct # "\slash " # dec,
year = "2013",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2012.29",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Mon Aug 25 06:43:49 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
}
@Article{Pang:2013:IMA,
author = "Liaojun Pang and Huixian Li and Qingqi Pei and Yumin
Wang",
title = "Improvement on {Meshram} et al.'s {ID}-based
cryptographic mechanism",
journal = j-INFO-PROC-LETT,
volume = "113",
number = "19--21",
pages = "789--792",
month = sep # "\slash " # oct,
year = "2013",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Sep 9 07:26:45 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013002081",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Papamanthou:2013:SCC,
author = "Charalampos Papamanthou and Elaine Shi and Roberto
Tamassia",
title = "Signatures of Correct Computation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "222--242",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Park:2013:PPM,
author = "Y. Park and C. Sur and S. Shin and K.-H. Rhee and C.
Seo",
title = "A Privacy Preserving Message Delivery Protocol Using
Identity-Hidden Index in {VDTNs}",
journal = j-J-UCS,
volume = "19",
number = "16",
pages = "2385--??",
month = "????",
year = "2013",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Thu Mar 13 14:26:22 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_19_16/a_privacy_preserving_message",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Pass:2013:USP,
author = "Rafael Pass",
title = "Unprovable Security of Perfect {NIZK} and
Non-interactive Non-malleable Commitments",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7785",
pages = "334--354",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-36594-2_19",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:32:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-36594-2_19/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-36594-2",
book-URL = "http://www.springerlink.com/content/978-3-642-36594-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pei:2013:ARW,
author = "Qingqi Pei and Xiang Wang and Yuan Li and Hui Li",
title = "Adaptive reversible watermarking with improved
embedding capacity",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "11",
pages = "2841--2848",
month = nov,
year = "2013",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Sep 9 07:54:59 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121213001623",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Pereira:2013:SLC,
author = "Geovandro C. C. F. Pereira and Mateus A. S. Santos and
Bruno T. de Oliveira and Marcos A. {Simplicio, Jr.} and
Paulo S. L. M. Barreto and C{\'\i}ntia B. Margi and
Wilson V. Ruggiero",
title = "{SMSCrypto}: a lightweight cryptographic framework for
secure {SMS} transmission",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "3",
pages = "698--706",
month = mar,
year = "2013",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.11.004",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed Jan 23 08:33:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212003056",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Persichetti:2013:SAH,
author = "Edoardo Persichetti",
title = "Secure and Anonymous Hybrid Encryption from Coding
Theory",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7932",
pages = "174--187",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-38616-9_12",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Mar 21 08:01:29 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-38616-9_12/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-38616-9",
book-URL = "http://www.springerlink.com/content/978-3-642-38616-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Phatak:2013:SIN,
author = "Dhananjay Phatak and Alan T. Sherman and Nikhil Joshi
and Bhushan Sonawane and Vivek G. Relan and Amol
Dawalbhakta",
title = "Spread Identity: A new dynamic address remapping
mechanism for anonymity and {DDoS} defense",
journal = j-J-COMP-SECUR,
volume = "21",
number = "2",
pages = "233--281",
month = "????",
year = "2013",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2012-0463",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:25:48 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Philippaerts:2013:CMC,
author = "Pieter Philippaerts and Yves Younan and Stijn Muylle
and Frank Piessens and Sven Lachmund and Thomas
Walter",
title = "{CPM}: Masking Code Pointers to Prevent Code Injection
Attacks",
journal = j-TISSEC,
volume = "16",
number = "1",
pages = "1:1--1:??",
month = jun,
year = "2013",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2487222.2487223",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Fri Jun 14 19:25:26 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "Code Pointer Masking (CPM) is a novel countermeasure
against code injection attacks on native code. By
enforcing the correct semantics of code pointers, CPM
thwarts attacks that modify code pointers to divert the
application's control flow. It does not rely on secret
values such as stack canaries and protects against
attacks that are not addressed by state-of-the-art
countermeasures of similar performance. This article
reports on two prototype implementations on very
distinct processor architectures, showing that the idea
behind CPM is portable. The evaluation also shows that
the overhead of using our countermeasure is very small
and the security benefits are substantial.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Picazo-Sanchez:2013:CRS,
author = "Pablo Picazo-Sanchez and Lara Ortiz-Martin and Pedro
Peris-Lopez",
title = "Cryptanalysis of the {RNTS} system",
journal = j-J-SUPERCOMPUTING,
volume = "65",
number = "2",
pages = "949--960",
month = aug,
year = "2013",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-013-0873-3",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Feb 8 11:02:54 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=65&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-013-0873-3",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Pongaliur:2013:SNS,
author = "Kanthakumar Pongaliur and Li Xiao",
title = "Sensor node source privacy and packet recovery under
eavesdropping and node compromise attacks",
journal = j-TOSN,
volume = "9",
number = "4",
pages = "50:1--50:??",
month = jul,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2489253.2489267",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Thu Mar 13 07:56:26 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Securing a sensor network poses a variety of problems.
Of those, an important one is of providing privacy to
the event-detecting sensor node and integrity to the
data gathered by the node. Compromised source privacy
can inadvertently leak event location. Safeguarding the
privacy of the source node is important, as sensor
networks hold critical roles in military application,
tracking endangered species, etc. Existing techniques
in sensor networks use either random walk path or
generate fake event packets to make it hard for an
adversary to trace back to the source, since encryption
alone may not help prevent a traffic analysis attack.
In this work, without using traditional
overhead-intensive methods, we present a scheme for
hiding source information using cryptographic
techniques incurring lower overhead. The packet is
modified en route by dynamically selected nodes to make
it difficult for a malicious entity to trace back the
packet to a source node and also to prevent packet
spoofing. This is important because the adversary model
considers a super-local eavesdropper having the ability
to compromise sensor nodes. Additionally, we provide a
method for the base station to recover corrupted
packets and identify the location of the compromised
node. We analyze the ability of our proposed scheme to
withstand different attacks and demonstrate its
efficiency in terms of overhead and functionality when
compared to existing work.",
acknowledgement = ack-nhfb,
articleno = "50",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Pranata:2013:MDR,
author = "Ilung Pranata and Rukshan Athauda and Geoff Skinner",
title = "Modeling Decentralized Reputation-Based Trust for
Initial Transactions in Digital Environments",
journal = j-TOIT,
volume = "12",
number = "3",
pages = "8:1--8:??",
month = may,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2461321.2461323",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat May 25 16:26:39 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The advent of digital environments has generated
significant benefits for businesses, organizations,
governments, academia and societies in general. Today,
over millions of transactions take place on the
Internet. Although the widespread use of digital
environments has generally provided opportunities for
societies, a number of threats have limited their
adoption. The de-facto standard today is for
certification authorities to authenticate the identity
of service providers while trust on the provided
services is implied. This approach has certain
shortcomings, for example, single point of failure,
implied trust rather than explicit trust and others.
One approach for minimizing such threats is to
introduce an effective and resilient trust mechanism
that is capable of determining the trustworthiness of
service providers in providing their services.
Determining the trustworthiness of services reduces
invalid transactions in digital environments and
further encourages collaborations. Evaluating
trustworthiness of a service provider without any prior
historical transactions (i.e. the initial transaction)
pose a number of challenging issues. This article
presents TIDE --- a decentralized reputation trust
mechanism that determines the initial trustworthiness
of entities in digital environments. TIDE improves the
precision of trust computation by considering raters'
feedback, number of transactions, credibility,
incentive to encourage raters' participation, strategy
for updating raters' category, and safeguards against
dynamic personalities. Furthermore, TIDE classifies
raters into three categories and promotes the
flexibility and customization through its parameters.
Evaluation of TIDE against several attack vectors
demonstrates its accuracy, robustness and resilience.",
acknowledgement = ack-nhfb,
articleno = "8",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Qu:2013:DPA,
author = "Bo Qu and Dawu Gu and Zheng Guo and Junrong Liu",
title = "Differential power analysis of stream ciphers with
{LFSRs}",
journal = j-COMPUT-MATH-APPL,
volume = "65",
number = "9",
pages = "1291--1299",
month = may,
year = "2013",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:51:21 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122112001381",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Ren:2013:DSE,
author = "Ling Ren and Xiangyao Yu and Christopher W. Fletcher
and Marten van Dijk and Srinivas Devadas",
title = "Design space exploration and optimization of path
oblivious {RAM} in secure processors",
journal = j-COMP-ARCH-NEWS,
volume = "41",
number = "3",
pages = "571--582",
month = jun,
year = "2013",
DOI = "https://doi.org/10.1145/2508148.2485971",
bibdate = "Sat Jul 27 06:58:55 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
note = "ICSA '13 conference proceedings.",
abstract = "Keeping user data private is a huge problem both in
cloud computing and computation outsourcing. One
paradigm to achieve data privacy is to use
tamper-resistant processors, inside which users'
private data is decrypted and computed upon. These
processors need to interact with untrusted external
memory. Even if we encrypt all data that leaves the
trusted processor, however, the address sequence that
goes off-chip may still leak information. To prevent
this address leakage, the security community has
proposed ORAM (Oblivious RAM). ORAM has mainly been
explored in server/file settings which assume a vastly
different computation model than secure processors. Not
surprisingly, na{\"\i}vely applying ORAM to a secure
processor setting incurs large performance overheads.
In this paper, a recent proposal called Path ORAM is
studied. We demonstrate techniques to make Path ORAM
practical in a secure processor setting. We introduce
background eviction schemes to prevent Path ORAM
failure and allow for a performance-driven design space
exploration. We propose a concept called super blocks
to further improve Path ORAM's performance, and also
show an efficient integrity verification scheme for
Path ORAM. With our optimizations, Path ORAM overhead
drops by 41.8\%, and SPEC benchmark execution time
improves by 52.4\% in relation to a baseline
configuration. Our work can be used to improve the
security level of previous secure processors.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Ren:2013:PPK,
author = "Yanli Ren and Shuozhong Wang and Xinpeng Zhang",
title = "Practical parallel key-insulated encryption with
multiple helper keys",
journal = j-COMPUT-MATH-APPL,
volume = "65",
number = "9",
pages = "1403--1412",
month = may,
year = "2013",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:51:21 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122112000429",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Savage:2013:NSL,
author = "Neil Savage",
title = "News: Stopping the leaks",
journal = j-CACM,
volume = "56",
number = "1",
pages = "19--21",
month = jan,
year = "2013",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2398356.2398363",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Dec 27 19:03:03 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Side channels give out information that can be used to
crack secrets, but researchers are identifying the
holes and trying to close them.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Savage:2013:PP,
author = "Neil Savage",
title = "Proofs probable",
journal = j-CACM,
volume = "56",
number = "6",
pages = "22--24",
month = jun,
year = "2013",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2461256.2461265",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Jun 18 16:08:03 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/acm-turing-awards.bib;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Shafi Goldwasser and Silvio Micali laid the
foundations for modern cryptography, with contributions
including interactive and zero-knowledge proofs.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "A. M. Turing Award recipients; Shafi Goldwasser;
Silvio Micali",
}
@Misc{Schneier:2013:HDD,
author = "Bruce Schneier",
title = "How to Design --- And Defend Against --- The Perfect
Security Backdoor",
howpublished = "Web site.",
year = "2013",
bibdate = "Mon Mar 09 16:03:22 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.schneier.com/essays/archives/2013/10/how_to_design_and_de.html",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 68]{Schneier:2015:SWC}.",
}
@Article{Sendrier:2013:HCE,
author = "Nicolas Sendrier and Dimitris E. Simos",
title = "The Hardness of Code Equivalence over {$ \mathbb {F}_q
$} and Its Application to Code-Based Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7932",
pages = "203--216",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-38616-9_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Mar 21 08:01:29 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-38616-9_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-38616-9",
book-URL = "http://www.springerlink.com/content/978-3-642-38616-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Seo:2013:PIC,
author = "Jae Woo Seo and Dae Hyun Yum and Pil Joong Lee",
title = "Proxy-invisible {CCA}-secure type-based proxy
re-encryption without random oracles",
journal = j-THEOR-COMP-SCI,
volume = "491",
number = "??",
pages = "83--93",
day = "17",
month = jun,
year = "2013",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 8 16:38:46 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397512010560",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Serwadda:2013:ELK,
author = "Abdul Serwadda and Vir V. Phoha",
title = "Examining a Large Keystroke Biometrics Dataset for
Statistical-Attack Openings",
journal = j-TISSEC,
volume = "16",
number = "2",
pages = "8:1--8:??",
month = sep,
year = "2013",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2516960",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Sep 23 17:04:07 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "Research on keystroke-based authentication has
traditionally assumed human impostors who generate
forgeries by physically typing on the keyboard. With
bots now well understood to have the capacity to
originate precisely timed keystroke sequences, this
model of attack is likely to underestimate the threat
facing a keystroke-based system in practice. In this
work, we investigate how a keystroke-based
authentication system would perform if it were
subjected to synthetic attacks designed to mimic the
typical user. To implement the attacks, we perform a
rigorous statistical analysis on keystroke biometrics
data collected over a 2-year period from more than 3000
users, and then use the observed statistical traits to
design and launch algorithmic attacks against three
state-of-the-art password-based keystroke verification
systems. Relative to the zero-effort attacks typically
used to test the performance of keystroke biometric
systems, we show that our algorithmic attack increases
the mean Equal Error Rates (EERs) of three high
performance keystroke verifiers by between 28.6\% and
84.4\%. We also find that the impact of the attack is
more pronounced when the keystroke profiles subjected
to the attack are based on shorter strings, and that
some users see considerably greater performance
degradation under the attack than others. This article
calls for a shift from the traditional zero-effort
approach of testing the performance of password-based
keystroke verifiers, to a more rigorous algorithmic
approach that captures the threat posed by today's
bots.",
acknowledgement = ack-nhfb,
articleno = "8",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Shaw:2013:DE,
author = "John Shaw",
title = "Dealing with encryption",
journal = j-NETWORK-SECURITY,
volume = "2013",
number = "11",
pages = "8--11",
month = nov,
year = "2013",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(13)70120-X",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:00 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S135348581370120X",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Shi:2013:REA,
author = "Qi Shi and Ning Zhang and Madjid Merabti and Kashif
Kifayat",
title = "Resource-efficient authentic key establishment in
heterogeneous wireless sensor networks",
journal = j-J-PAR-DIST-COMP,
volume = "73",
number = "2",
pages = "235--249",
month = feb,
year = "2013",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2012.10.004",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Thu Dec 13 20:22:17 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib;
http://www.sciencedirect.com/science/journal/07437315",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731512002547",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Singh:2013:QBF,
author = "Durgesh Singh and Shivendra Shivani and Suneeta
Agarwal",
title = "Quantization-Based Fragile Watermarking Using
Block-Wise Authentication and Pixel-Wise Recovery
Scheme for Tampered Image",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "13",
number = "2",
pages = "",
month = apr,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467813400020",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Tue Aug 6 10:37:51 MDT 2013",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Soderstrom:2013:DDY,
author = "Sylvia S{\"o}derstr{\"o}m",
title = "Digital Differentiation in Young People's {Internet}
Use --- Eliminating or Reproducing Disability
Stereotypes",
journal = j-FUTURE-INTERNET,
volume = "5",
number = "2",
pages = "190--204",
day = "07",
month = may,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi5020190",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:50 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/5/2/190",
abstract = "Norwegian authorities' policy aims at securing an
information society for all, emphasizing the importance
of accessible and usable Information and Communication
Technology (ICT) for everyone. While the body of
research on young people's use of ICT is quite
comprehensive, research addressing digital
differentiation in young people with disabilities' use
of ICT is still in its early days. This article
investigates how young people with disabilities' use,
or non-use, of assistive ICT creates digital
differentiations. The investigation elaborates on how
the anticipations and stereotypes of disability
establish an authoritative definition of assistive ICT,
and the consequence this creates for the use of the Web
by young people with disabilities. The object of the
article is to provide enhanced insight into the field
of technology and disability by illuminating how
assistive ICT sometimes eliminates and sometimes
reproduces stereotypes and digital differentiations.
The investigation draws on a qualitative interview
study with 23 young Norwegians with disabilities, aged
15-20 years. I draw on a theoretical perspective to
analyze the findings of the study, which employs the
concept of identity multiplicity. The article's closing
discussion expands on technology's significance in
young people's negotiations of impairment and of
perceptions of disability.",
acknowledgement = ack-nhfb,
remark = "Special Issue Inequality in the Digital Environment.",
}
@Article{Staff:2013:ITD,
author = "S. Staff",
title = "Inside {TAO}: Documents Reveal Top {NSA} Hacking
Unit",
journal = "{Der Spiegel}",
volume = "??",
number = "??",
pages = "??--??",
day = "29",
month = dec,
year = "2013",
bibdate = "Thu Sep 22 19:02:15 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.spiegel.de/international/world/the-nsa-uses-powerful-toolbox-in-effort-to-spy-on-global-networks-a-940969-3.html",
acknowledgement = ack-nhfb,
}
@Article{Strydis:2013:SAP,
author = "Christos Strydis and Robert M. Seepers and Pedro
Peris-Lopez and Dimitrios Siskos and Ioannis Sourdis",
title = "A system architecture, processor, and communication
protocol for secure implants",
journal = j-TACO,
volume = "10",
number = "4",
pages = "57:1--57:??",
month = dec,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2541228.2555313",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Thu Jan 9 10:42:35 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
abstract = "Secure and energy-efficient communication between
Implantable Medical Devices (IMDs) and authorized
external users is attracting increasing attention these
days. However, there currently exists no systematic
approach to the problem, while solutions from
neighboring fields, such as wireless sensor networks,
are not directly transferable due to the peculiarities
of the IMD domain. This work describes an original,
efficient solution for secure IMD communication. A new
implant system architecture is proposed, where security
and main-implant functionality are made completely
decoupled by running the tasks onto two separate cores.
Wireless communication goes through a custom security
ASIP, called SISC (Smart-Implant Security Core), which
runs an energy-efficient security protocol. The
security core is powered by RF-harvested energy until
it performs external-reader authentication, providing
an elegant defense mechanism against battery
Denial-of-Service (DoS) and other, more common attacks.
The system has been evaluated based on a realistic case
study involving an artificial pancreas implant. When
synthesized for a UMC 90nm CMOS ASIC technology, our
system architecture achieves defense against
unauthorized accesses having zero energy cost, running
entity authentication through harvesting only 7.45 $
\mu $J of RF energy from the requesting entity. In all
other successfully authenticated accesses, our
architecture achieves secure data exchange without
affecting the performance of the main IMD
functionality, adding less than 1o/oo (1.3 mJ ) to the
daily energy consumption of a typical implant. Compared
to a singe-core, secure reference IMD, which would
still be more vulnerable to some types of attacks, our
secure system on chip (SoC) achieves high security
levels at 56\% energy savings and at an area overhead
of less than 15\%.",
acknowledgement = ack-nhfb,
articleno = "57",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Sun:2013:IUP,
author = "San-Tsai Sun and Eric Pospisil and Ildar Muslukhov and
Nuray Dindar and Kirstie Hawkey and Konstantin
Beznosov",
title = "Investigating Users' Perspectives of {Web} Single
Sign-On: Conceptual Gaps and Acceptance Model",
journal = j-TOIT,
volume = "13",
number = "1",
pages = "2:1--2:??",
month = nov,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2532639",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Dec 3 18:44:00 MST 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "OpenID and OAuth are open and simple Web SSO protocols
that have been adopted by major service providers, and
millions of supporting Web sites. However, the average
user's perception of Web SSO is still poorly
understood. Through several user studies, this work
investigates users' perceptions and concerns when using
Web SSO for authentication. We found that our
participants had several misconceptions and concerns
that impeded their adoption. This ranged from their
inadequate mental models of Web SSO, to their concerns
about personal data exposure, and a reduction in
perceived Web SSO value due to the employment of
password management practices. Informed by our
findings, we offer a Web SSO technology acceptance
model, and suggest design improvements.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Tao:2013:SMS,
author = "Chengdong Tao and Adama Diene and Shaohua Tang and
Jintai Ding",
title = "Simple Matrix Scheme for Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7932",
pages = "231--242",
year = "2013",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-38616-9_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Mar 21 08:01:29 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-38616-9_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-38616-9",
book-URL = "http://www.springerlink.com/content/978-3-642-38616-9",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Tetali:2013:MSA,
author = "Sai Deep Tetali and Mohsen Lesani and Rupak Majumdar
and Todd Millstein",
title = "{MrCrypt}: static analysis for secure cloud
computations",
journal = j-SIGPLAN,
volume = "48",
number = "10",
pages = "271--286",
month = oct,
year = "2013",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2544173.2509554",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Mon Dec 9 09:19:33 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
note = "OOPSLA '13 conference proceedings.",
abstract = "In a common use case for cloud computing, clients
upload data and computation to servers that are managed
by a third-party infrastructure provider. We describe
MrCrypt, a system that provides data confidentiality in
this setting by executing client computations on
encrypted data. MrCrypt statically analyzes a program
to identify the set of operations on each input data
column, in order to select an appropriate homomorphic
encryption scheme for that column, and then transforms
the program to operate over encrypted data. The
encrypted data and transformed program are uploaded to
the server and executed as usual, and the result of the
computation is decrypted on the client side. We have
implemented MrCrypt for Java and illustrate its
practicality on three standard benchmark suites for the
Hadoop MapReduce framework. We have also formalized the
approach and proven several soundness and security
guarantees.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
}
@Article{Toledo:2013:DFS,
author = "Nerea Toledo and Marivi Higuero and Jasone Astorga and
Marina Aguado and Jean Marie Bonnin",
title = "Design and formal security evaluation of {NeMHIP}: a
new secure and efficient network mobility management
protocol based on the Host Identity Protocol",
journal = j-COMPUT-SECUR,
volume = "32",
number = "??",
pages = "1--18",
month = feb,
year = "2013",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:31 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404812001599",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Tormo:2013:IMP,
author = "Gines Dolera Tormo and Felix Gomez Marmol and Joao
Girao and Gregorio Martinez Perez",
title = "Identity Management --- In Privacy We Trust: Bridging
the Trust Gap in {eHealth} Environments",
journal = j-IEEE-SEC-PRIV,
volume = "11",
number = "6",
pages = "34--41",
month = nov # "\slash " # dec,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2013.80",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Dec 18 18:41:55 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Tsai:2013:ZWS,
author = "Hung-Hsu Tsai and Yen-Shou Lai and Shih-Che Lo",
title = "A zero-watermark scheme with geometrical invariants
using {SVM} and {PSO} against geometrical attacks for
image protection",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "2",
pages = "335--348",
month = feb,
year = "2013",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.08.040",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Sat Jan 5 09:05:59 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212002440",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Tso:2013:SAI,
author = "Raylin Tso",
title = "Security analysis and improvements of a
communication-efficient three-party password
authenticated key exchange protocol",
journal = j-J-SUPERCOMPUTING,
volume = "66",
number = "2",
pages = "863--874",
month = nov,
year = "2013",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-013-0917-8",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Feb 8 10:21:59 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=66&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-013-0917-8",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Tu:2013:PAQ,
author = "Stephen Tu and M. Frans Kaashoek and Samuel Madden and
Nickolai Zeldovich",
title = "Processing analytical queries over encrypted data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "6",
number = "5",
pages = "289--300",
month = mar,
year = "2013",
CODEN = "????",
ISSN = "2150-8097",
bibdate = "Fri Dec 13 05:56:27 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "MONOMI is a system for securely executing analytical
workloads over sensitive data on an untrusted database
server. MONOMI works by encrypting the entire database
and running queries over the encrypted data. MONOMI
introduces split client/server query execution, which
can execute arbitrarily complex queries over encrypted
data, as well as several techniques that improve
performance for such workloads, including per-row
precomputation, space-efficient encryption, grouped
homomorphic addition, and pre-filtering. Since these
optimizations are good for some queries but not others,
MONOMI introduces a designer for choosing an efficient
physical design at the server for a given workload, and
a planner to choose an efficient execution plan for a
given query at runtime. A prototype of MONOMI running
on top of Postgres can execute most of the queries from
the TPC-H benchmark with a median overhead of only $
1.24 \times $ (ranging from $ 1.03 \times $ to $ 2.33
\times $ ) compared to an un-encrypted Postgres
database where a compromised server would reveal all
data.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
}
@Article{Ulutas:2013:ISI,
author = "Mustafa Ulutas and G{\"u}zin Ulutas and Vasif V.
Nabiyev",
title = "Invertible secret image sharing for gray level and
dithered cover images",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "2",
pages = "485--500",
month = feb,
year = "2013",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.09.027",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Sat Jan 5 09:05:59 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212002701",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Uto:2013:MRI,
author = "Nelson Uto",
title = "A Methodology for Retrieving Information from Malware
Encrypted Output Files: {Brazilian} Case Studies",
journal = j-FUTURE-INTERNET,
volume = "5",
number = "2",
pages = "140--167",
day = "25",
month = apr,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi5020140",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:50 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/5/2/140",
abstract = "This article presents and explains a methodology based
on cryptanalytic and reverse engineering techniques
that can be employed to quickly recover information
from encrypted files generated by malware. The
objective of the methodology is to minimize the effort
with static and dynamic analysis, by using
cryptanalysis and related knowledge as much as
possible. In order to illustrate how it works, we
present three case studies, taken from a big Brazilian
company that was victimized by directed attacks focused
on stealing information from a special purpose hardware
they use in their environment.",
acknowledgement = ack-nhfb,
remark = "Special Issue Security of Systems and Software
Resiliency.",
}
@Article{Wang:2013:BSB,
author = "Xiangyang Wang and Hongying Yang and Jing Wang and
Lili Chen and Panpan Niu",
title = "{Bayesian} Segmentation Based Local Geometrically
Invariant Image Watermarking",
journal = j-FUND-INFO,
volume = "128",
number = "4",
pages = "475--501",
month = oct,
year = "2013",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2013-954",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:17:55 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Wang:2013:CRA,
author = "Honggang Wang",
title = "Communication-resource-aware adaptive watermarking for
multimedia authentication in wireless multimedia sensor
networks",
journal = j-J-SUPERCOMPUTING,
volume = "64",
number = "3",
pages = "883--897",
month = jun,
year = "2013",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-010-0500-5",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Feb 8 10:21:22 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=64&issue=3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-010-0500-5",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Wang:2013:HCL,
author = "Kan Wang and Zhe-Ming Lu and Yong-Jian Hu",
title = "A high capacity lossless data hiding scheme for {JPEG}
images",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "7",
pages = "1965--1975",
month = jul,
year = "2013",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue May 14 16:09:17 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121213000812",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Wang:2013:NMC,
author = "Qichun Wang and Chik How Tan",
title = "A new method to construct {Boolean} functions with
good cryptographic properties",
journal = j-INFO-PROC-LETT,
volume = "113",
number = "14--16",
pages = "567--571",
month = jul # "\slash " # aug,
year = "2013",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jul 1 18:58:11 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013001348",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Wang:2013:NSW,
author = "Xiaogang Wang and Ming Yang and Junzhou Luo",
title = "A novel sequential watermark detection model for
efficient traceback of secret network attack flows",
journal = j-J-NETW-COMPUT-APPL,
volume = "36",
number = "6",
pages = "1660--1670",
month = nov,
year = "2013",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:44 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804513000246",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Wang:2013:RBC,
author = "Xiang-yang Wang and Chun-peng Wang and Hong-ying Yang
and Pan-pan Niu",
title = "A robust blind color image watermarking in quaternion
{Fourier} transform domain",
journal = j-J-SYST-SOFTW,
volume = "86",
number = "2",
pages = "255--277",
month = feb,
year = "2013",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2012.08.015",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Sat Jan 5 09:05:59 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121212002312",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Wang:2013:SES,
author = "Guojun Wang and Qiushuang Du and Wei Zhou and Qin
Liu",
title = "A scalable encryption scheme for multi-privileged
group communications",
journal = j-J-SUPERCOMPUTING,
volume = "64",
number = "3",
pages = "1075--1091",
month = jun,
year = "2013",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-011-0683-4",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Feb 8 11:30:45 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=64&issue=3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-011-0683-4",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Weng:2013:VWI,
author = "Chi-Yao Weng and Yu Hong Zhang and Li Chun Lin and
Shiuh-Jeng Wang",
title = "Visible watermarking images in high quality of data
hiding",
journal = j-J-SUPERCOMPUTING,
volume = "66",
number = "2",
pages = "1033--1048",
month = nov,
year = "2013",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-013-0969-9",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Feb 8 11:11:03 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=66&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-013-0969-9",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Williams:2013:APC,
author = "Peter Williams and Radu Sion",
title = "Access privacy and correctness on untrusted storage",
journal = j-TISSEC,
volume = "16",
number = "3",
pages = "12:1--12:??",
month = nov,
year = "2013",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2535524",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Dec 9 11:22:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "We introduce a new practical mechanism for remote data
storage with access pattern privacy and correctness. A
storage client can deploy this mechanism to issue
encrypted reads, writes, and inserts to a potentially
curious and malicious storage service provider, without
revealing information or access patterns. The provider
is unable to establish any correlation between
successive accesses, or even to distinguish between a
read and a write. Moreover, the client is provided with
strong correctness assurances for its operations ---
illicit provider behavior does not go undetected. We
describe a practical system that can execute an
unprecedented several queries per second on
terabyte-plus databases while maintaining full
computational privacy and correctness.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Willis:2013:IFI,
author = "Karl D. D. Willis and Andrew D. Wilson",
title = "{InfraStructs}: fabricating information inside
physical objects for imaging in the terahertz region",
journal = j-TOG,
volume = "32",
number = "4",
pages = "138:1--138:??",
month = jul,
year = "2013",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/2461912.2461936",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Sat Jul 13 11:43:20 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/tog/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
abstract = "We introduce InfraStructs, material-based tags that
embed information inside digitally fabricated objects
for imaging in the Terahertz region. Terahertz imaging
can safely penetrate many common materials, opening up
new possibilities for encoding hidden information as
part of the fabrication process. We outline the design,
fabrication, imaging, and data processing steps to
fabricate information inside physical objects.
Prototype tag designs are presented for location
encoding, pose estimation, object identification, data
storage, and authentication. We provide detailed
analysis of the constraints and performance
considerations for designing InfraStruct tags. Future
application scenarios range from production line
inventory, to customized game accessories, to mobile
robotics.",
acknowledgement = ack-nhfb,
articleno = "138",
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@Article{Wu:2013:FTR,
author = "Qianhong Wu and Bo Qin and Lei Zhang and Josep
Domingo-Ferrer and Jes{\'u}s A. Manj{\'o}n",
title = "Fast transmission to remote cooperative groups: a new
key management paradigm",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "2",
pages = "621--633",
month = apr,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2208201",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:23 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The problem of efficiently and securely broadcasting
to a remote cooperative group occurs in many newly
emerging networks. A major challenge in devising such
systems is to overcome the obstacles of the potentially
limited communication from the group to the sender, the
unavailability of a fully trusted key generation
center, and the dynamics of the sender. The existing
key management paradigms cannot deal with these
challenges effectively. In this paper, we circumvent
these obstacles and close this gap by proposing a novel
key management paradigm. The new paradigm is a hybrid
of traditional broadcast encryption and group key
agreement. In such a system, each member maintains a
single public/secret key pair. Upon seeing the public
keys of the members, a remote sender can securely
broadcast to any intended subgroup chosen in an ad hoc
way. Following this model, we instantiate a scheme that
is proven secure in the standard model. Even if all the
nonintended members collude, they cannot extract any
useful information from the transmitted messages. After
the public group encryption key is extracted, both the
computation overhead and the communication cost are
independent of the group size. Furthermore, our scheme
facilitates simple yet efficient member deletion/
addition and flexible rekeying strategies. Its strong
security against collusion, its constant overhead, and
its implementation friendliness without relying on a
fully trusted authority render our protocol a very
promising solution to many applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Xie:2013:ECP,
author = "X. Xie and H. Ma and J. Li and X. Chen",
title = "An Efficient Ciphertext-Policy Attribute-Based Access
Control towards Revocation in Cloud Computing",
journal = j-J-UCS,
volume = "19",
number = "16",
pages = "2349--??",
month = "????",
year = "2013",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Thu Mar 13 14:26:22 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_19_16/an_efficient_ciphertext_policy",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Xie:2013:SIP,
author = "Yongming Xie and Guojun Wang",
title = "Special Issue Papers: Practical distributed secret key
generation for delay tolerant networks",
journal = j-CCPE,
volume = "25",
number = "14",
pages = "2067--2079",
day = "25",
month = sep,
year = "2013",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.2885",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue Dec 3 10:37:36 MST 2013",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "8 Jul 2012",
}
@Article{Xiong:2013:NIB,
author = "Hu Xiong and Zhong Chen and Fagen Li",
title = "New identity-based three-party authenticated key
agreement protocol with provable security",
journal = j-J-NETW-COMPUT-APPL,
volume = "36",
number = "2",
pages = "927--932",
month = mar,
year = "2013",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:34 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804512002184",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Xu:2013:PKE,
author = "Peng Xu and Hai Jin and Qianhong Wu and Wei Wang",
title = "Public-Key Encryption with Fuzzy Keyword Search: A
Provably Secure Scheme under Keyword Guessing Attack",
journal = j-IEEE-TRANS-COMPUT,
volume = "62",
number = "11",
pages = "2266--2277",
month = nov,
year = "2013",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2012.215",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Nov 15 08:54:34 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Xue:2013:TCB,
author = "Kaiping Xue and Changsha Ma and Peilin Hong and Rong
Ding",
title = "A temporal-credential-based mutual authentication and
key agreement scheme for wireless sensor networks",
journal = j-J-NETW-COMPUT-APPL,
volume = "36",
number = "1",
pages = "316--323",
month = jan,
year = "2013",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:29 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804512001403",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Yang:2013:ECS,
author = "Xiao-yuan Yang and Li-qiang Wu and Min-qing Zhang and
Xiao-Feng Chen",
title = "An efficient {CCA}-secure cryptosystem over ideal
lattices from identity-based encryption",
journal = j-COMPUT-MATH-APPL,
volume = "65",
number = "9",
pages = "1254--1263",
month = may,
year = "2013",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:51:21 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122112001447",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Yi:2013:ETS,
author = "Xun Yi and San Ling and Huaxiong Wang",
title = "Efficient Two-Server Password-Only Authenticated Key
Exchange",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "24",
number = "9",
pages = "1773--1782",
year = "2013",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2012.282",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Aug 12 11:23:25 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Ying:2013:PPB,
author = "Bidi Ying and Dimitrios Makrakis and Hussein T.
Mouftah",
title = "Privacy preserving broadcast message authentication
protocol for {VANETs}",
journal = j-J-NETW-COMPUT-APPL,
volume = "36",
number = "5",
pages = "1352--1364",
month = sep,
year = "2013",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:42 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804512001439",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Yoon:2013:RBB,
author = "Eun-Jun Yoon and Kee-Young Yoo",
title = "Robust biometrics-based multi-server authentication
with key agreement scheme for smart cards on elliptic
curve cryptosystem",
journal = j-J-SUPERCOMPUTING,
volume = "63",
number = "1",
pages = "235--255",
month = jan,
year = "2013",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-010-0512-1",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Mon Apr 1 14:50:43 MDT 2013",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=63&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-010-0512-1",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Young:2013:TPC,
author = "Maxwell Young and Aniket Kate and Ian Goldberg and
Martin Karsten",
title = "Towards practical communication in
{Byzantine}-resistant {DHTs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "21",
number = "1",
pages = "190--203",
month = feb,
year = "2013",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2195729",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jul 13 11:32:17 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "There are several analytical results on distributed
hash tables (DHTs) that can tolerate Byzantine faults.
Unfortunately, in such systems, operations such as data
retrieval and message sending incur significant
communication costs. For example, a simple scheme used
in many Byzantine fault-tolerant DHT constructions of n
nodes requires O (log$^3$ n ) messages; this is likely
impractical for real-world applications. The previous
best known message complexity is O (log$^2$ n ) in
expectation. However, the corresponding protocol
suffers from prohibitive costs owing to hidden
constants in the asymptotic notation and setup costs.
In this paper, we focus on reducing the communication
costs against a computationally bounded adversary. We
employ threshold cryptography and distributed key
generation to define two protocols, both of which are
more efficient than existing solutions. In comparison,
our first protocol is deterministic with O (log$^2$ n )
message complexity, and our second protocol is
randomized with expected O (log n ) message complexity.
Furthermore, both the hidden constants and setup costs
for our protocols are small, and no trusted third party
is required. Finally, we present results from
microbenchmarks conducted over PlanetLab showing that
our protocols are practical for deployment under
significant levels of churn and adversarial behavior.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yuan:2013:PVQ,
author = "Lihua Yuan and Chao-Chih Chen and Prasant Mohapatra
and Chen-Nee Chuah and Krishna Kant",
title = "A Proxy View of Quality of {Domain Name Service},
Poisoning Attacks and Survival Strategies",
journal = j-TOIT,
volume = "12",
number = "3",
pages = "9:1--9:??",
month = may,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2461321.2461324",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat May 25 16:26:39 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The Domain Name System (DNS) provides a critical
service for the Internet --- mapping of user-friendly
domain names to their respective IP addresses. Yet,
there is no standard set of metrics quantifying the
Quality of Domain Name Service (QoDNS), let alone a
thorough evaluation of it. This article attempts to
fill this gap from the perspective of a DNS
proxy/cache, which is the bridge between clients and
authoritative servers. We present an analytical model
of DNS proxy operations that offers insights into the
design trade-offs of DNS infrastructure and the
selection of critical DNS parameters. Due to the
critical role DNS proxies play in QoDNS, they are the
focus of attacks including cache poisoning attack. We
extend the analytical model to study DNS cache
poisoning attacks and their impact on QoDNS metrics.
This analytical study prompts us to present Domain Name
Cross-Referencing (DoX), a peer-to-peer systems for DNS
proxies to cooperatively defend cache poisoning
attacks. Based on QoDNS, we compare DoX with the
cryptography-based DNS Security Extension (DNSSEC) to
understand their relative merits.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Yuen:2013:ELT,
author = "Tsz Hon Yuen and Joseph K. Liu and Man Ho Au and Willy
Susilo and Jianying Zhou",
title = "Efficient Linkable and\slash or Threshold Ring
Signature Without Random Oracles",
journal = j-COMP-J,
volume = "56",
number = "4",
pages = "407--421",
month = apr,
year = "2013",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxs115",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Apr 1 08:36:50 MDT 2013",
bibsource = "http://comjnl.oxfordjournals.org/content/56/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/56/4/407.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 24, 2012",
}
@Article{Zhang:2013:BLR,
author = "Mingwu Zhang and Bo Yang and Tsuyoshi Takagi",
title = "Bounded Leakage-Resilient Functional Encryption with
Hidden Vector Predicate",
journal = j-COMP-J,
volume = "56",
number = "4",
pages = "464--477",
month = apr,
year = "2013",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxs133",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Apr 1 08:36:50 MDT 2013",
bibsource = "http://comjnl.oxfordjournals.org/content/56/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/56/4/464.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 22, 2012",
}
@Article{Zhang:2013:LPP,
author = "Ye Zhang and Wai-Kit Wong and S. M. Yiu and Nikos
Mamoulis and David W. Cheung",
title = "Lightweight privacy-preserving peer-to-peer data
integration",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "6",
number = "3",
pages = "157--168",
month = jan,
year = "2013",
CODEN = "????",
ISSN = "2150-8097",
bibdate = "Fri Dec 13 05:56:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Peer Data Management Systems (PDMS) are an attractive
solution for managing distributed heterogeneous
information. When a peer (client) requests data from
another peer (server) with a different schema,
translations of the query and its answer are done by a
sequence of intermediate peers (translators). There are
two privacy issues in this P2P data integration
process: (i) answer privacy: no unauthorized parties
(including the translators) should learn the query
result; (ii) mapping privacy: the schema and the value
mappings used by the translators to perform the
translation should not be revealed to other peers.
Elmeleegy and Ouzzani proposed the PPP protocol that is
the first to support privacy-preserving querying in
PDMS. However, PPP suffers from several shortcomings.
First, PPP does not satisfy the requirement of answer
privacy, because it is based on commutative encryption;
we show that this issue can be fixed by adopting
another cryptographic technique called oblivious
transfer. Second, PPP adopts a weaker notion for
mapping privacy, which allows the client peer to
observe certain mappings done by translators. In this
paper, we develop a lightweight protocol, which
satisfies mapping privacy and extend it to a more
complex one that facilitates parallel translation by
peers. Furthermore, we consider a stronger adversary
model where there may be collusions among peers and
propose an efficient protocol that guards against
collusions. We conduct an experimental study on the
performance of the proposed protocols using both real
and synthetic data. The results show that the proposed
protocols not only achieve a better privacy guarantee
than PPP, but they are also more efficient.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
}
@Article{Zhang:2013:RMS,
author = "En Zhang and Yongquan Cai",
title = "Rational Multi-Secret Sharing Scheme in Standard
Point-To-Point Communication Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "879--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411350024X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhu:2013:TSC,
author = "Wen Tao Zhu",
title = "Towards secure and communication-efficient broadcast
encryption systems",
journal = j-J-NETW-COMPUT-APPL,
volume = "36",
number = "1",
pages = "178--186",
month = jan,
year = "2013",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:29 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804512002159",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Zilberberg:2013:PCM,
author = "Omer Zilberberg and Shlomo Weiss and Sivan Toledo",
title = "Phase-change memory: an architectural perspective",
journal = j-COMP-SURV,
volume = "45",
number = "3",
pages = "29:1--29:33",
month = jun,
year = "2013",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2480741.2480746",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Mon Jul 1 18:21:14 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "This article surveys the current state of phase-change
memory (PCM) as a nonvolatile memory technology set to
replace flash and DRAM in modern computerized systems.
It has been researched and developed in the last
decade, with researchers providing better architectural
designs which address the technology's main
challenges-its limited write endurance, potential long
latency, high energy writes, power dissipation, and
some concerns for memory privacy. Some physical
properties of the technology are also discussed,
providing a basis for architectural discussions. Also
briefly shown are other architectural alternatives,
such as FeRAM and MRAM. The designs surveyed in this
article include read before write, wear leveling, write
cancellation, write pausing, some encryption schemes,
and buffer organizations. These allow PCM to stand on
its own as a replacement for DRAM as main memory.
Designs for hybrid memory systems with both PCM and
DRAM are also shown and some designs for SSDs
incorporating PCM.",
acknowledgement = ack-nhfb,
articleno = "29",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Adj:2014:SRC,
author = "G. Adj and F. Rodriguez-Henriquez",
title = "Square Root Computation over Even Extension Fields",
journal = j-IEEE-TRANS-COMPUT,
volume = "63",
number = "11",
pages = "2829--2841",
month = nov,
year = "2014",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2013.145",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Nov 06 07:39:04 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Algorithm design and analysis; Complexity theory;
Computational efficiency; Computer science; Elliptic
curve cryptography; Elliptic curves; even extension
fields; finite extension fields; finite field
arithmetic; Modular square root; number theoretical
problem; number theory; square root computation;
Taxonomy",
}
@Article{Ahmad:2014:RTN,
author = "Tahir Ahmad and Usman Younis",
title = "Randomness testing of non-cryptographic hash functions
for real-time hash table based storage and look-up of
{URLs}",
journal = j-J-NETW-COMPUT-APPL,
volume = "41",
number = "??",
pages = "197--205",
month = may,
year = "2014",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:45:00 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804513002853",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Ak:2014:ICS,
author = "Murat Ak and Turgut Hanoymak and Ali Aydin
Sel{\c{c}}uk",
title = "{IND-CCA} secure encryption based on a
{Zheng--Seberry} scheme",
journal = j-J-COMPUT-APPL-MATH,
volume = "259 (part B)",
number = "??",
pages = "529--535",
day = "15",
month = mar,
year = "2014",
CODEN = "JCAMDI",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:34:02 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042713003403",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@Article{Akinyele:2014:MGA,
author = "Joseph A. Akinyele and Matthew Green and Susan
Hohenberger and Matthew Pagano",
title = "Machine-generated algorithms, proofs and software for
the batch verification of digital signature schemes",
journal = j-J-COMP-SECUR,
volume = "22",
number = "6",
pages = "867--912",
month = "????",
year = "2014",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-140507",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:26:28 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Akyildiz:2014:OTB,
author = "Ersan Akyildiz and Muhammad Ashraf",
title = "An overview of trace based public key cryptography
over finite fields",
journal = j-J-COMPUT-APPL-MATH,
volume = "259 (part B)",
number = "??",
pages = "599--621",
day = "15",
month = mar,
year = "2014",
CODEN = "JCAMDI",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:34:02 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042713005669",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@Article{Alavi:2014:RQE,
author = "Zohreh Alavi and Lu Zhou and James Powers and Keke
Chen",
title = "{RASP-QS}: efficient and confidential query services
in the cloud",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "7",
number = "13",
pages = "1685--1688",
month = aug,
year = "2014",
CODEN = "????",
ISSN = "2150-8097",
bibdate = "Wed Feb 4 17:20:31 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Hosting data query services in public clouds is an
attractive solution for its great scalability and
significant cost savings. However, data owners also
have concerns on data privacy due to the lost control
of the infrastructure. This demonstration shows a
prototype for efficient and confidential range/kNN
query services built on top of the random space
perturbation (RASP) method. The RASP approach provides
a privacy guarantee practical to the setting of
cloud-based computing, while enabling much faster query
processing compared to the encryption-based approach.
This demonstration will allow users to more intuitively
understand the technical merits of the RASP approach
via interactive exploration of the visual interface.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@InProceedings{Albertini:2014:MHE,
author = "Ange Albertini and Jean-Philippe Aumasson and Maria
Eichlseder and Florian Mendel and Martin
Schl{\"a}ffer",
title = "Malicious Hashing: {Eve}'s Variant of {SHA-1}",
crossref = "Joux:2014:SAC",
pages = "1--19",
day = "29",
month = nov,
year = "2014",
DOI = "https://doi.org/10.1007/978-3-319-13051-4_1",
bibdate = "Mon Mar 09 11:15:46 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
series = ser-LNCS,
URL = "http://eprint.iacr.org/2014/694;
http://link.springer.com/chapter/10.1007/978-3-319-13051-4_1;
https://malicioussha1.github.io/",
abstract = "We present collisions for a version of SHA-1 with
modified constants, where the colliding payloads are
valid binary files. Examples are given of colliding
executables, archives, and images. Our malicious SHA-1
instances have round constants that differ from the
original ones in only 40 bits (on average). Modified
versions of cryptographic standards are typically used
on closed systems (e.g., in pay-TV, media and gaming
platforms) and aim to differentiate cryptographic
components across customers or services. Our
proof-of-concept thus demonstrates the exploitability
of custom SHA-1 versions for malicious purposes, such
as the injection of user surveillance features. To
encourage further research on such malicious hash
functions, we propose definitions of malicious hash
functions and of associated security notions.",
acknowledgement = ack-nhfb,
book-URL = "http://link.springer.com/chapter/10.1007/978-3-319-13051-4",
keywords = "cryptanalysis; hash functions; malicious cryptography,
backdoors; secret-key cryptography; SHA-1",
remark = "Cite in \cite[reference 2]{Schneier:2015:SWC}.",
}
@Article{Ali:2014:ALD,
author = "Syed Taha Ali and Vijay Sivaraman and Diethelm Ostry",
title = "Authentication of lossy data in body-sensor networks
for cloud-based healthcare monitoring",
journal = j-FUT-GEN-COMP-SYS,
volume = "35",
number = "??",
pages = "80--90",
month = jun,
year = "2014",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Feb 28 07:31:07 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X13001866",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Alleaume:2014:UQK,
author = "R. All{\'e}aume and C. Branciard and J. Bouda and T.
Debuisschert and M. Dianati and N. Gisin and M. Godfrey
and P. Grangier and T. L{\"a}nger and N. L{\"u}tkenhaus
and C. Monyk and P. Painchault and M. Peev and A. Poppe
and T. Pornin and J. Rarity and R. Renner and G.
Ribordy and M. Riguidel and L. Salvail and A. Shields
and H. Weinfurter and A. Zeilinger",
title = "Using quantum key distribution for cryptographic
purposes: a survey",
journal = j-THEOR-COMP-SCI,
volume = "560 (part 1)",
number = "??",
pages = "62--81",
day = "4",
month = dec,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Dec 2 19:05:23 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514006963",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Almeida:2014:COS,
author = "Jos{\'e} Bacelar Almeida and Manuel Barbosa and
Jean-Christophe Filli{\^a}tre and Jorge Sousa Pinto and
B{\'a}rbara Vieira",
title = "{CAOVerif}: an open-source deductive verification
platform for cryptographic software implementations",
journal = j-SCI-COMPUT-PROGRAM,
volume = "91 (part B)",
number = "??",
pages = "216--233",
day = "1",
month = oct,
year = "2014",
CODEN = "SCPGD4",
ISSN = "0167-6423 (print), 1872-7964 (electronic)",
ISSN-L = "0167-6423",
bibdate = "Sat Aug 16 11:32:54 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S016764231200189X",
acknowledgement = ack-nhfb,
fjournal = "Science of Computer Programming",
journal-URL = "http://www.sciencedirect.com/science/journal/01676423/",
}
@Article{AlTawy:2014:IDR,
author = "Riham AlTawy and Amr M. Youssef",
title = "Integral distinguishers for reduced-round {Stribog}",
journal = j-INFO-PROC-LETT,
volume = "114",
number = "8",
pages = "426--431",
month = aug,
year = "2014",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri May 9 17:24:54 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019014000428",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
keywords = "Cryptography; GOST R 34.11-2012; Hash functions;
Integral distinguisher; Stribog",
remark = "From the abstract: ``In January 2013, the Stribog hash
function officially replaced GOST R 34.11-94 as the new
Russian cryptographic hash standard GOST R
34.11-2012.''",
}
@Article{Anawis:2014:ARR,
author = "Mark Anawis",
title = "Applications for Randomness: Random numbers have been
shown to be valuable in sampling, simulations,
modeling, data encryption, gambling and even musical
composition",
journal = j-SCI-COMPUT,
volume = "31",
number = "11",
pages = "28--30",
month = nov,
year = "2014",
CODEN = "SCHRCU",
ISSN = "1930-5753 (print), 1930-6156 (electronic)",
ISSN-L = "1930-5753",
bibdate = "Thu Nov 20 14:33:47 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
note = "Special issue for Supercomputing 2014 (SC14), defining
the market: 30 years of high-performance computing
(1984--2014).",
URL = "http://digital.scientificcomputing.com/scientificcomputing/hpc_source_sc14_special_edition",
acknowledgement = ack-nhfb,
ajournal = "Sci. Comput. (Rockaway, NJ, USA)",
fjournal = "Scientific Computing (Rockaway, NJ, USA)",
journal-URL = "http://digital.scientificcomputing.com/scientificcomputing/",
}
@Article{Anonymous:2014:CSL,
author = "Anonymous",
title = "{CryptoLocker} success leads to more malware",
journal = j-NETWORK-SECURITY,
volume = "2014",
number = "1",
pages = "20--20",
month = jan,
year = "2014",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(14)70012-1",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:03 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485814700121",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2014:ERE,
author = "Anonymous",
title = "Encryption on the rise, but not enough",
journal = j-NETWORK-SECURITY,
volume = "2014",
number = "2",
pages = "1--2",
month = feb,
year = "2014",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(14)70014-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:04 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485814700145",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2014:TPC,
author = "Anonymous",
title = "{TrueCrypt} project cancelled by its developers",
journal = j-NETWORK-SECURITY,
volume = "2014",
number = "6",
pages = "1--2",
month = jun,
year = "2014",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(14)70054-6",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:08 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485814700546",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anthes:2014:FTI,
author = "Gary Anthes",
title = "{French} team invents faster code-breaking algorithm",
journal = j-CACM,
volume = "57",
number = "1",
pages = "21--23",
month = jan,
year = "2014",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2555807",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Feb 15 18:20:01 MST 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "New method can crack certain cryptosystems far faster
than earlier alternatives. \ldots{} In a certain class
of problem, the new algorithm is able to efficiently
solve the discrete logarithm problem that underlies
several important types of modern cryptosystems.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "discrete logarithm; L(0) complexity; L(1/4)
complexity",
}
@Book{Applebaum:2014:CCP,
author = "Benny Applebaum",
title = "Cryptography in Constant Parallel Time",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvi + 193 + 3",
year = "2014",
DOI = "https://doi.org/10.1007/978-3-642-17367-7",
ISBN = "3-642-17366-7, 3-642-17367-5 (e-book)",
ISBN-13 = "978-3-642-17366-0, 978-3-642-17367-7 (e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.M35; TK5102.94 QA76.9.A25",
bibdate = "Sat Jun 10 08:35:15 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Information Security and Cryptography",
abstract = "Locally computable (NC0) functions are ``simple''
functions for which every bit of the output can be
computed by reading a small number of bits of their
input. The study of locally computable cryptography
attempts to construct cryptographic functions that
achieve this strong notion of simplicity and
simultaneously provide a high level of security. Such
constructions are highly parallelizable and they can be
realized by Boolean circuits of constant depth. This
book establishes, for the first time, the possibility
of local implementations for many basic cryptographic
primitives such as one-way functions, pseudorandom
generators, encryption schemes and digital signatures.
It also extends these results to other stronger notions
of locality, and addresses a wide variety of
fundamental questions about local cryptography. The
author's related thesis was honorably mentioned
(runner-up) for the ACM Dissertation Award in 2007, and
this book includes some expanded sections and proofs,
and notes on recent developments. The book assumes only
a minimal background in computational complexity and
cryptography and is therefore suitable for graduate
students or researchers in related areas who are
interested in parallel cryptography. It also introduces
general techniques and tools which are likely to
interest experts in the area.",
acknowledgement = ack-nhfb,
subject = "Berechnungskomplexit{\"a}t; Kryptologie.",
tableofcontents = "1. Introduction \\
2. Preliminaries and definitions \\
3. Randomized encoding of functions \\
4. Cryptography in NC0 \\
5. Computationally private randomizing polynomials and
their applications \\
6. One-way functions with optimal output locality \\
7. On pseudorandom generators with linear stretch in
NC0 \\
8. Cryptography with constant input locality \\
App. A, On Collections of Cryptographic Primitives",
}
@Article{Applebaum:2014:HGA,
author = "Benny Applebaum and Yuval Ishai and Eyal Kushilevitz",
title = "How to Garble Arithmetic Circuits",
journal = j-SIAM-J-COMPUT,
volume = "43",
number = "2",
pages = "905--929",
month = "????",
year = "2014",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/120875193",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Sat Sep 13 11:18:32 MDT 2014",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/43/2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 2014",
}
@Article{Asharov:2014:TCC,
author = "Gilad Asharov",
title = "Towards Characterizing Complete Fairness in Secure
Two-Party Computation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "291--316",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ashraf:2014:MTG,
author = "Muhammad Ashraf and Baris B{\"u}lent Kirlar",
title = "Message transmission for {GH}-public key
cryptosystem",
journal = j-J-COMPUT-APPL-MATH,
volume = "259 (part B)",
number = "??",
pages = "578--585",
day = "15",
month = mar,
year = "2014",
CODEN = "JCAMDI",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:34:02 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042713005499",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@Article{Au:2014:SMV,
author = "Man Ho Au and Guomin Yang and Willy Susilo and Yunmei
Zhang",
title = "({Strong}) multidesignated verifiers signatures secure
against rogue key attack",
journal = j-CCPE,
volume = "26",
number = "8",
pages = "1574--1592",
day = "10",
month = jun,
year = "2014",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3094",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Fri May 30 08:55:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "5 Jul 2013",
}
@Book{Aumasson:2014:HFB,
author = "Jean-Philippe Aumasson and Willi Meier and Raphael
C.-W. Phan and Luca Henzen",
title = "The Hash Function {BLAKE}",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xviii + 228 + 18",
year = "2014",
DOI = "https://doi.org/10.1007/978-3-662-44757-4",
ISBN = "3-662-44756-8 (print), 3-662-44757-6 (e-book)",
ISBN-13 = "978-3-662-44756-7 (print), 978-3-662-44757-4
(e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.H36 A96 2014",
bibdate = "Sat Jun 10 08:35:22 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Information Security and Cryptography",
abstract = "This is a comprehensive description of the
cryptographic hash function BLAKE, one of the five
final contenders in the NIST SHA3 competition, and of
BLAKE2, an improved version popular among developers.
It describes how BLAKE was designed and why BLAKE2 was
developed, and it offers guidelines on implementing and
using BLAKE, with a focus on software implementation.
In the first two chapters, the authors offer a short
introduction to cryptographic hashing, the SHA3
competition, and BLAKE. They review applications of
cryptographic hashing, they describe some basic notions
such as security definitions and state-of-the-art
collision search methods, and they present SHA1, SHA2,
and the SHA3 finalists. In the chapters that follow,
the authors give a complete description of the four
instances BLAKE-256, BLAKE-512, BLAKE-224, and
BLAKE-384; they describe applications of BLAKE,
including simple hashing with or without a salt, and
HMAC and PBKDF2 constructions; they review
implementation techniques, from portable C and Python
to AVR assembly and vectorized code using SIMD CPU
instructions; they describe BLAKE's properties with
respect to hardware design for implementation in ASICs
or FPGAs; they explain BLAKE's design rationale in
detail, from NIST's requirements to the choice of
internal parameters; they summarize the known security
properties of BLAKE and describe the best attacks on
reduced or modified variants; and they present BLAKE2,
the successor of BLAKE, starting with motivations and
also covering its performance and security aspects. The
book concludes with detailed test vectors, a reference
portable C implementation of BLAKE, and a list of
third-party software implementations of BLAKE and
BLAKE2. The book is oriented towards practice -
engineering and craftsmanship - rather than theory. It
is suitable for developers, engineers, and security
professionals engaged with BLAKE and cryptographic
hashing in general, and for applied cryptography
researchers and students who need a consolidated
reference and a detailed description of the design
process, or guidelines on how to design a cryptographic
algorithm.",
acknowledgement = ack-nhfb,
shorttableofcontents = "Introduction \\
Preliminaries \\
Specification of BLAKE \\
Using BLAKE \\
BLAKE in Software \\
BLAKE in Hardware \\
Design Rationale \\
Security of BLAKE \\
BLAKE2 \\
Conclusion \\
References \\
App. A, Test Vectors \\
App. B, Reference C Code \\
App. C, Third-Party Software \\
Index",
subject = "BLAKE",
tableofcontents = "Introduction / 1 \\
1.1 Cryptographic Hashing / 1 \\
1.2 The SHA3 Competition / 2 \\
1.3 BLAKE, in a Nutshell / 5 \\
1.4 Conventions / 6 \\
2 Preliminaries / 9 \\
2.1 Applications / 9 \\
2.1.1 Modification Detection / 9 \\
2.1.2 Message Authentication / 10 \\
2.1.3 Digital Signatures / 11 \\
2.1.4 Pseudorandom Functions / 12 \\
2.1.5 Entropy Extraction and Key Derivation / 13 \\
2.1.6 Password Hashing / 13 \\
2.1.7 Data Identification / 14 \\
2.1.8 Key Update / 14 \\
2.1.9 Proof-of-Work Systems / 14 \\
2.1.10 Timestamping / 15 \\
2.2 Security Notions / 15 \\
2.2.1 Security Models / 15 \\
2.2.2 Classical Security Definitions / 17 \\
2.2.3 General Security Definition / 19 \\
2.3 Black-Box Collision Search / 20 \\
2.3.1 Cycles and Tails / 20 \\
2.3.2 Cycle Detection / 21 \\
2.3.3 Parallel Collision Search / 22 \\
2.3.4 Application to Meet-in-the-Middle / 22 \\
2.3.5 Quantum Collision Search / 23 \\
2.4 Constructing Hash Functions / 24 \\
2.4.1 Merkle-Damgard / 24 \\
2.4.2 HAIFA / 27 \\
2.4.3 Wide-Pipe / 27 \\
2.4.4 Sponge Functions / 27 \\
2.4.5 Compression Functions / 28 \\
2.5 The SHA Family / 31 \\
2.5.1 SHA1 / 31 \\
2.5.2 SHA2 / 32 \\
2.5.3 SHA3 Finalists / 34 \\
3 Specification of BLAKE / 37 \\
3.1 BLAKE-256 / 37 \\
3.1.1 Constant Parameters / 37 \\
3.1.2 Compression Function / 38 \\
3.1.3 Iteration Mode / 40 \\
3.2 BLAKE-512 / 41 \\
3.2.1 Constant Parameters / 41 \\
3.2.2 Compression Function / 42 \\
3.2.3 Iteration Mode / 42 \\
3.3 BLAKE-224 / 43 \\
3.4 BLAKE-384 / 43 \\
3.5 Toy Versions / 44 \\
4 Using BLAKE / 45 \\
4.1 Simple Hashing / 45 \\
4.1.1 Description / 45 \\
4.1.2 Hashing a Large File with BLAKE-256 / 46 \\
4.1.3 Hashing a Bit with BLAKE-512 / 48 \\
4.1.4 Hashing the Empty String with BLAKE-512 / 49 \\
4.2 Hashing with a Salt / 49 \\
4.2.1 Description / 49 \\
4.2.2 Hashing a Bit with BLAKE-512 and a Salt / 49 \\
4.3 Message Authentication with HMAC / 50 \\
4.3.1 Description / 50 \\
4.3.2 Authenticating a File with HMAC-BLAKE-512 / 50
\\
4.4 Password-Based Key Derivation with PBKDF2 / 53 \\
4.4.1 Basic Description / 53 \\
4.4.2 Generating a Key with PBKDF2-HMAC-BLAKE-224 / 53
\\
5 BLAKE in Software / 55 \\
5.1 Straightforward Implementation / 55 \\
5.1.1 Portable C / 55 \\
5.1.2 Other Languages / 58 \\
5.2 Embedded Systems / 60 \\
5.2.1 8-Bit AVR / 60 \\
5.2.2 32-Bit ARM / 62 \\
5.3 Vectorized Implementation Principle / 64 \\
5.4 Vectorized Implementation with SSE Extensions / 64
\\
5.4.1 Streaming SIMD Extensions 2 (SSE2) / 64 \\
5.4.2 Implementing BLAKE-256 with SSE2 / 65 \\
5.4.3 Implementing BLAKE-512 with SSE2 / 66 \\
5.4.4 Implementations with SSSE3 and SSE4.1 / 70 \\
5.5 Vectorized Implementation with AVX2 Extensions / 70
\\
5.5.1 Relevant AVX2 Instructions / 71 \\
5.5.2 Implementing BLAKE-512 with AVX2 / 73 \\
5.5.3 Implementing BLAKE-256 with AVX2 / 77 \\
5.6 Vectorized Implementation with XOP Extensions / 79
\\
5.6.1 Relevant XOP Instructions / 80 \\
5.6.2 Implementing BLAKE with XOP / 80 \\
5.7 Vectorized Implementation with NEON Extensions / 83
\\
5.7.1 Relevant NEON Instructions / 83 \\
5.7.2 Implementing BLAKE-256 with NEON / 84 \\
5.7.3 Implementing BLAKE-512 with NEON / 86 \\
5.8 Performance / 88 \\
5.8.1 Speed Summary / 89 \\
5.8.2 8-Bit AVR / 90 \\
5.8.3 ARM Platforms / 91 \\
5.8.4 x86 Platforms (32-bit) / 91 \\
5.8.5 amd64 Platforms (64-bit) / 92 \\
5.8.6 Other Platforms / 93 \\
6 BLAKE in Hardware / 97 \\
6.1 RTL Design / 97 \\
6.2 ASIC Implementation / 98 \\
6.2.1 High-Speed Design / 98 \\
6.2.2 Compact Design / 100 \\
6.3 FPGA Design / 100 \\
6.4 Performance / 101 \\
6.4.1 ASIC / 102 \\
6.4.2 FPGA / 102 \\
6.4.3 Discussion / 105 \\
7 Design Rationale / 107 \\
7.1 NIST Call for Submissions / 107 \\
7.1.1 General Requirements / 107 \\
7.1.2 Technical and Security Requirements / 109 \\
7.1.3 Could SHA2 Be SHA3? / 110 \\
7.2 Needs Analysis Ill 7.2.1 Ease of Implementation /
112 \\
7.2.2 Performance / 113 \\
7.2.3 Security / 113 \\
7.2.4 Extra Features / 114 \\
7.3 Design Philosophy / 114 \\
7.3.1 Minimalism / 115 \\
7.3.2 Robustness / 119 \\
7.3.3 Versatility / 120 \\
7.4 Design Choices / 120 \\
7.4.1 General Choices / 121 \\
7.4.2 Iteration Mode / 122 \\
7.4.3 Core Algorithm / 122 \\
7.4.4 Rotation Counts / 125 \\
7.4.5 Permutations / 126 \\
7.4.6 Number of Rounds / 128 \\
7.4.7 Constants / 128 \\
8 Security of BLAKE / 131 \\
8.1 Differential Cryptanalysis / 131 \\
8.1.1 Differences and Differentials / 132 \\
8.1.2 Finding Good Differentials / 133 \\
8.2 Properties of BLAKE's G Function / 133 \\
8.2.1 Basic Properties / 134 \\
8.2.2 Differential Properties of G / 136 \\
8.3 Properties of the Round Function / 141 \\
8.3.1 Bijectivity / 141 \\
8.3.2 Diffusion and Low-Weight Differences / 142 \\
8.3.3 Invertibility / 145 \\
8.3.4 Impossible Differentials / 147 \\
8.4 Properties of the Compression Function / 151 \\
8.4.1 Finalization / 151 \\
8.4.2 Local Collisions / 152 \\
8.4.3 Fixed Points / 152 \\
8.4.4 Fixed Point Collisions / 153 \\
8.4.5 Pseudorandomness / 153 \\
8.5 Security Against Generic Attacks / 154 \\
8.5.1 Indifferentiability / 154 \\
8.5.2 Length Extension / 155 \\
8.5.3 Collision Multiplication / 155 \\
8.5.4 Multicollisions / 156 \\
8.5.5 Second Preimages / 157 \\
8.6 Attacks on Reduced BLAKE / 158 \\
8.6.1 Preimage Attacks / 158 \\
8.6.2 Near-Collision Attack / 159 \\
8.6.3 Boomerang Distinguisher / 160 \\
8.6.4 Iterative Characteristics / 161 \\
8.6.5 Breaking BLOKE / 163 \\
8.6.6 Attack on a Variant with Identical Constants /
163 \\
9 BLAKE2 / 165 \\
9.1 Motivations / 165 \\
9.2 Differences with BLAKE / 166 \\
9.2.1 Fewer Rounds / 167 \\
9.2.2 Rotations Optimized for Speed / 167 \\
9.2.3 Minimal Padding / 168 \\
9.2.4 Finalization Flags / 168 \\
9.2.5 Fewer Constants '68 9.2.6 Little-Endianness / 169
\\
9.2.7 Counter in Bytes / 170 \\
9.2.8 Salt Processing / 170 \\
9.2.9 Parameter Block / 170 \\
9.3 Keyed Hashing (MAC and PRF) / 172 \\
9.4 Tree Hashing / 172 \\
9.4.1 Basic Mechanism / 173 \\
9.4.2 Message Parsing / 174 \\
9.4.3 Special Cases / 174 \\
9.4.4 Generic Tree Parameters / 175 \\
9.4.5 Updatable Hashing Example / 175 \\
9.5 Parallel Hashing: BLAKE2sp and BLAKE2bp / 176 \\
9.6 Performance / 177 \\
9.6.1 Why BLAKE2 Is Fast in Software / 177 \\
9.6.2 64-bit Platforms / 178 \\
9.6.3 Low-End Platforms / 179 \\
9.6.4 Hardware / 180 \\
9.7 Security / 180 \\
9.7.1 BLAKE Legacy / 180 \\
9.7.2 Implications of BLAKE2 Tweaks / 181 \\
9.7.3 Third-Party Cryptanalysis / 181 \\
10 Conclusion / 185 \\
References / 187 \\
A Test Vectors / 195 \\
A.1 BLAKE-256 / 195 \\
A.1.1 One-Block Message / 195 \\
A.1.2 Two-Block Message / 196 \\
A.2 BLAKE-224 / 198 \\
A.2.1 One-Block Message / 198 \\
A.2.2 Two-Block Message / 199 \\
A.3 BLAKE-512 / 201 \\
A.3.1 One-Block Message / 201 \\
A.3.2 Two-Block Message / 202 \\
A.4 BLAKE-384 / 205 \\
A.4.1 One-Block Message / 205 \\
A.4.2 Two-Block Message / 206 \\
B Reference C Code / 209 \\
B.1 blake.h / 209 \\
B.2 blake224.c / 211 \\
B.3 blake256.c / 214 \\
B.4 blake384.c / 217 \\
B.5 blake512.c / 220 \\
C Third-Party Software / 225 \\
C.1 BLAKE / 225 \\
C.2 BLAKE2 / 226 \\
Index / 227",
}
@Article{Azarderakhsh:2014:NDP,
author = "R. Azarderakhsh and K. Karabina",
title = "A New Double Point Multiplication Algorithm and Its
Application to Binary Elliptic Curves with
Endomorphisms",
journal = j-IEEE-TRANS-COMPUT,
volume = "63",
number = "10",
pages = "2614--2619",
month = oct,
year = "2014",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2013.112",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Nov 06 07:29:34 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "binary elliptic curves; computable endomorphisms;
differential addition chains; double point
multiplication; double point multiplication algorithm;
Elliptic curve cryptosystems; endomorphism; hardware
implementation; parallel multipliers; public key
cryptography; side channel analysis attacks; single
point multiplication",
}
@Article{Babamir:2014:AKP,
author = "Faezeh Sadat Babamir and Ali Norouzi",
title = "Achieving Key Privacy and Invisibility for Unattended
Wireless Sensor Networks in Healthcare",
journal = j-COMP-J,
volume = "57",
number = "4",
pages = "624--635",
month = apr,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt046",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Mar 26 15:06:42 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/57/4/624.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "May 8, 2013",
}
@Article{Bailey:2014:UIA,
author = "Kyle O. Bailey and James S. Okolica and Gilbert L.
Peterson",
title = "User identification and authentication using
multi-modal behavioral biometrics",
journal = j-COMPUT-SECUR,
volume = "43",
number = "??",
pages = "77--89",
month = jun,
year = "2014",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:37 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404814000340",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Barak:2014:OEF,
author = "Boaz Barak and Nir Bitansky and Ran Canetti and Yael
Tauman Kalai and Omer Paneth and Amit Sahai",
title = "Obfuscation for Evasive Functions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "26--51",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Barbulescu:2014:HQP,
author = "Razvan Barbulescu and Pierrick Gaudry and Antoine Joux
and Emmanuel Thom{\'e}",
title = "A Heuristic Quasi-Polynomial Algorithm for Discrete
Logarithm in Finite Fields of Small Characteristic",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8441",
pages = "1--16",
year = "2014",
DOI = "https://doi.org/10.1007/978-3-642-55220-5_1",
bibdate = "Wed May 21 10:08:33 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
remark = "See also press release about the significance of this
work \cite{CNRS:2014:NAS}.",
}
@Article{Barthe:2014:PRV,
author = "Gilles Barthe and C{\'e}dric Fournet and Benjamin
Gr{\'e}goire and Pierre-Yves Strub and Nikhil Swamy and
Santiago Zanella-B{\'e}guelin",
title = "Probabilistic relational verification for
cryptographic implementations",
journal = j-SIGPLAN,
volume = "49",
number = "1",
pages = "193--205",
month = jan,
year = "2014",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2578855.2535847",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Tue Mar 4 17:04:57 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
note = "POPL '14 conference proceedings.",
abstract = "Relational program logics have been used for
mechanizing formal proofs of various cryptographic
constructions. With an eye towards scaling these
successes towards end-to-end security proofs for
implementations of distributed systems, we present RF*,
a relational extension of F*, a general-purpose
higher-order stateful programming language with a
verification system based on refinement types. The
distinguishing feature of F* is a relational Hoare
logic for a higher-order, stateful, probabilistic
language. Through careful language design, we adapt the
F* typechecker to generate both classic and relational
verification conditions, and to automatically discharge
their proofs using an SMT solver. Thus, we are able to
benefit from the existing features of F*, including its
abstraction facilities for modular reasoning about
program fragments. We evaluate RF* experimentally by
programming a series of cryptographic constructions and
protocols, and by verifying their security properties,
ranging from information flow to unlinkability,
integrity, and privacy. Moreover, we validate the
design of RF* by formalizing in Coq a core
probabilistic \lambda calculus and a relational
refinement type system and proving the soundness of the
latter against a denotational semantics of the
probabilistic lambda \lambda calculus.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
}
@Article{Basin:2014:KYE,
author = "David Basin and Cas Cremers",
title = "Know Your Enemy: Compromising Adversaries in Protocol
Analysis",
journal = j-TISSEC,
volume = "17",
number = "2",
pages = "7:1--7:??",
month = nov,
year = "2014",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2658996",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Nov 19 12:26:42 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "We present a symbolic framework, based on a modular
operational semantics, for formalizing different
notions of compromise relevant for the design and
analysis of cryptographic protocols. The framework's
rules can be combined to specify different adversary
capabilities, capturing different practically-relevant
notions of key and state compromise. The resulting
adversary models generalize the models currently used
in different domains, such as security models for
authenticated key exchange. We extend an existing
security-protocol analysis tool, Scyther, with our
adversary models. This extension systematically
supports notions such as weak perfect forward secrecy,
key compromise impersonation, and adversaries capable
of state-reveal queries. Furthermore, we introduce the
concept of a protocol-security hierarchy, which
classifies the relative strength of protocols against
different adversaries. In case studies, we use Scyther
to analyse protocols and automatically construct
protocol-security hierarchies in the context of our
adversary models. Our analysis confirms known results
and uncovers new attacks. Additionally, our hierarchies
refine and correct relationships between protocols
previously reported in the cryptographic literature.",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@TechReport{Bax:2014:PPD,
author = "Stephen Bax",
title = "A proposed partial decoding of the {Voynich} script",
type = "Web report",
institution = "Centre for Research in English Language Learning and
Assessment (CRELLA), University of Bedfordshire",
address = "Luton, Bedfordshire, UK, LU1 3JU",
pages = "62",
month = jan,
year = "2014",
bibdate = "Sat Mar 15 11:30:03 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://stephenbax.net/wp-content/uploads/2014/01/Voynich-a-provisional-partial-decoding-BAX.pdf",
acknowledgement = ack-nhfb,
}
@Article{Beimel:2014:CCW,
author = "Amos Beimel and Yuval Ishai and Ranjit Kumaresan and
Eyal Kushilevitz",
title = "On the Cryptographic Complexity of the Worst
Functions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "317--342",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_14/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Beimel:2014:MLS,
author = "Amos Beimel and Aner Ben-Efraim and Carles Padr{\'o}
and Ilya Tyomkin",
title = "Multi-linear Secret-Sharing Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "394--418",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_17/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Belkacem:2014:DCM,
author = "Samia Belkacem and Zohir Dibi and Ahmed Bouridane",
title = "{DCT} Coefficients Modelling for Image Watermarking",
journal = j-INT-J-COMPUT-APPL,
volume = "36",
number = "4",
pages = "155--163",
year = "2014",
DOI = "https://doi.org/10.2316/Journal.202.2014.4.202-4017",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:29:40 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2014.4.202-4017",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "10 Jul 2015",
}
@TechReport{Bellare:2014:SSEa,
author = "Mihir Bellare and Kenneth Paterson and Phillip
Rogaway",
title = "Security of Symmetric Encryption against Mass
Surveillance",
type = "Cryptology {ePrint} Archive report",
number = "2014/438",
institution = "Department of Computer Science and Engineering,
University of California San Diego",
address = "San Diego, CA, USA",
year = "2014",
bibdate = "Wed Jul 16 11:27:21 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://eprint.iacr.org",
abstract = "Motivated by revelations concerning population-wide
surveillance of encrypted communications, we formalize
and investigate the resistance of symmetric encryption
schemes to mass surveillance. The focus is on
algorithm-substitution attacks (ASAs), where a
subverted encryption algorithm replaces the real one.
We assume that the goal of `big brother' is
undetectable subversion, meaning that ciphertexts
produced by the subverted encryption algorithm should
reveal plaintexts to big brother yet be
indistinguishable to users from those produced by the
real encryption scheme. We formalize security notions
to capture this goal and then offer both attacks and
defenses. In the first category we show that successful
(from the point of view of big brother) ASAs may be
mounted on a large class of common symmetric encryption
schemes. In the second category we show how to design
symmetric encryption schemes that avoid such attacks
and meet our notion of security. The lesson that
emerges is the danger of choice: randomized, stateless
schemes are subject to attack while deterministic,
stateful ones are not.",
acknowledgement = ack-nhfb,
keywords = "algorithm-substitution attack (ASA); kleptography",
}
@InProceedings{Bellare:2014:SSEb,
author = "Mihir Bellare and Kenneth Paterson and Phillip
Rogaway",
editor = "????",
booktitle = "Advances in Cryptology -- {CRYPTO 2014}",
title = "Security of Symmetric Encryption against Mass
Surveillance",
publisher = pub-SV,
address = pub-SV:adr,
pages = "1--19",
year = "2014",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:24:22 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 6]{Schneier:2015:SWC}.",
}
@Article{Bennett:2014:QCP,
author = "Charles H. Bennett and Gilles Brassard",
title = "Quantum cryptography: Public key distribution and coin
tossing",
journal = j-THEOR-COMP-SCI,
volume = "560 (part 1)",
number = "??",
pages = "7--11",
day = "4",
month = dec,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Mar 19 06:15:48 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514004241",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Bera:2014:QC,
author = "Subhendu Bera",
title = "Quantum cryptography",
journal = j-LINUX-J,
volume = "2014",
number = "237",
pages = "1:1--1:??",
month = jan,
year = "2014",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Feb 6 07:16:21 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
abstract = "Classical cryptography may not be good enough in
providing security in the near future.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@TechReport{Bernstein:2014:CKR,
author = "Daniel J. Bernstein and Chitchanok Chuengsatiansup and
Tanja Lange",
title = "{Curve41417}: {Karatsuba} revisited",
type = "Report",
institution = "Department of Computer Science, University of Illinois
at Chicago, and Department of Mathematics and Computer
Science, Technische Universiteit Eindhoven",
address = "Chicago, IL 60607-7045, USA and P.O. Box 513, 5600 MB
Eindhoven, The Netherlands",
pages = "19",
day = "6",
month = jul,
year = "2014",
bibdate = "Mon Oct 06 15:45:44 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cr.yp.to/ecdh/curve41417-20140706.pdf",
abstract = "This paper introduces constant-time ARM Cortex-A8 ECDH
software that (1) is faster than the fastest ECDH
option in the latest version of OpenSSL but (2)
achieves a security level above $ 2^{200} $ using a
prime above $ 2^{400} $. For comparison, this OpenSSL
ECDH option is not constant-time and has a security
level of only $ 2^{80} $. The new speeds are achieved
in a quite different way from typical prime-field ECC
software: they rely on a synergy between Karatsuba's
method and choices of radix smaller than the CPU word
size.",
acknowledgement = ack-nhfb,
keywords = "Curve41417; Edwards curves; elliptic curve
cryptography; Karatsuba; performance; radix choices;
reduced refined Karatsuba; refined Karatsuba;
vectorization",
}
@Article{Bernstein:2014:HEC,
author = "Daniel J. Bernstein and Tanja Lange",
title = "Hyper-and-elliptic-curve cryptography",
journal = j-LMS-J-COMPUT-MATH,
volume = "17",
number = "A",
pages = "181--202",
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1112/S1461157014000394",
ISSN = "1461-1570",
bibdate = "Tue Sep 9 12:34:13 MDT 2014",
bibsource = "http://journals.cambridge.org/action/displayJournal?jid=JCM;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lms-j-comput-math.bib",
acknowledgement = ack-nhfb,
ajournal = "LMS J. Comput. Math.",
fjournal = "LMS Journal of Computation and Mathematics",
onlinedate = "05 August 2014",
remark = "Algorithmic Number Theory Symposium XI.",
}
@Article{Bhattacherjee:2014:CAT,
author = "Sanjay Bhattacherjee and Palash Sarkar",
title = "Concrete Analysis and Trade-Offs for the (Complete
Tree) Layered Subset Difference Broadcast Encryption
Scheme",
journal = j-IEEE-TRANS-COMPUT,
volume = "63",
number = "7",
pages = "1709--1722",
month = jul,
year = "2014",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2013.68",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Aug 25 08:24:32 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Bhuyan:2014:DDD,
author = "Monowar H. Bhuyan and H. J. Kashyap and D. K.
Bhattacharyya and J. K. Kalita",
title = "Detecting Distributed Denial of Service Attacks:
Methods, Tools and Future Directions",
journal = j-COMP-J,
volume = "57",
number = "4",
pages = "537--556",
month = apr,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt031",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Mar 26 15:06:42 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/57/4/537.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "March 28, 2013",
}
@Article{Biryukov:2014:DEA,
author = "Alex Biryukov and Jorge {Nakahara, Jr.} and Hamdi
Murat Yildirim",
title = "Differential entropy analysis of the {IDEA} block
cipher",
journal = j-J-COMPUT-APPL-MATH,
volume = "259 (part B)",
number = "??",
pages = "561--570",
day = "15",
month = mar,
year = "2014",
CODEN = "JCAMDI",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:34:02 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042713003981",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@Article{Bojinov:2014:NMC,
author = "Hristo Bojinov and Daniel Sanchez and Paul Reber and
Dan Boneh and Patrick Lincoln",
title = "Neuroscience meets cryptography: crypto primitives
secure against rubber hose attacks",
journal = j-CACM,
volume = "57",
number = "5",
pages = "110--118",
month = may,
year = "2014",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2594445",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed May 21 10:20:12 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Cryptographic systems often rely on the secrecy of
cryptographic keys given to users. Many schemes,
however, cannot resist coercion attacks where the user
is forcibly asked by an attacker to reveal the key.
These attacks, known as rubber hose cryptanalysis, are
often the easiest way to defeat cryptography. We
present a defense against coercion attacks using the
concept of implicit learning from cognitive psychology.
Implicit learning refers to learning of patterns
without any conscious knowledge of the learned pattern.
We use a carefully crafted computer game to allow a
user to implicitly learn a secret password without them
having any explicit or conscious knowledge of the
trained password. While the trained secret can be used
for authentication, participants cannot be coerced into
revealing it since they have no conscious knowledge of
it. We performed a number of user studies using
Amazon's Mechanical Turk to verify that participants
can successfully re-authenticate over time and that
they are unable to reconstruct or even robustly
recognize the trained secret.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Boldyreva:2014:MEW,
author = "Alexandra Boldyreva and Paul Grubbs",
title = "Making encryption work in the cloud",
journal = j-NETWORK-SECURITY,
volume = "2014",
number = "10",
pages = "8--10",
month = oct,
year = "2014",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(14)70101-1",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:12 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485814701011",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Bosch:2014:SPS,
author = "Christoph B{\"o}sch and Pieter Hartel and Willem
Jonker and Andreas Peter",
title = "A Survey of Provably Secure Searchable Encryption",
journal = j-COMP-SURV,
volume = "47",
number = "2",
pages = "18:1--18:??",
month = nov,
year = "2014",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2636328",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Nov 15 15:22:35 MST 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "We survey the notion of provably secure searchable
encryption (SE) by giving a complete and comprehensive
overview of the two main SE techniques: searchable
symmetric encryption (SSE) and public key encryption
with keyword search (PEKS). Since the pioneering work
of Song, Wagner, and Perrig (IEEE S{\&}P '00), the
field of provably secure SE has expanded to the point
where we felt that taking stock would provide benefit
to the community. The survey has been written primarily
for the nonspecialist who has a basic information
security background. Thus, we sacrifice full details
and proofs of individual constructions in favor of an
overview of the underlying key techniques. We
categorize and compare the different SE schemes in
terms of their security, efficiency, and functionality.
For the experienced researcher, we point out
connections between the many approaches to SE and
identify open research problems. Two major conclusions
can be drawn from our work. While the so-called
IND-CKA2 security notion becomes prevalent in the
literature and efficient (sublinear) SE schemes meeting
this notion exist in the symmetric setting, achieving
this strong form of security efficiently in the
asymmetric setting remains an open problem. We observe
that in multirecipient SE schemes, regardless of their
efficiency drawbacks, there is a noticeable lack of
query expressiveness that hinders deployment in
practice.",
acknowledgement = ack-nhfb,
articleno = "18",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Botta:2014:PCI,
author = "Marco Botta and Davide Cavagnino and Victor Pomponiu",
title = "Protecting the Content Integrity of Digital Imagery
with Fidelity Preservation: An Improved Version",
journal = j-TOMCCAP,
volume = "10",
number = "3",
pages = "29:1--29:??",
month = apr,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2568224",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Apr 15 12:20:53 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Fragile watermarking has attracted a lot of attention
in the last decade. An interesting approach, presented
in 2011 by Lin et al., results in very high quality of
the watermarked images. However, after a thorough
examination of the paper, a few improvements are
proposed in our revised version of the algorithm in
order to overcome some shortcomings. In particular,
changes to the pseudocode and modifications to deal
with pixel saturation are suggested, along with a way
to improve the scheme security. Finally, a deeper
analysis of the security is presented.",
acknowledgement = ack-nhfb,
articleno = "29",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Boyle:2014:EO,
author = "Elette Boyle and Kai-Min Chung and Rafael Pass",
title = "On Extractability Obfuscation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "52--73",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_3/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Brakerski:2014:EFH,
author = "Zvika Brakerski and Vinod Vaikuntanathan",
title = "Efficient Fully Homomorphic Encryption from (Standard)
{$ \mathsf {LWE} $}",
journal = j-SIAM-J-COMPUT,
volume = "43",
number = "2",
pages = "831--871",
month = "????",
year = "2014",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/120868669",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Sat Sep 13 11:18:32 MDT 2014",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/43/2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 2014",
}
@Article{Brakerski:2014:LFH,
author = "Zvika Brakerski and Craig Gentry and Vinod
Vaikuntanathan",
title = "(Leveled) Fully Homomorphic Encryption without
Bootstrapping",
journal = j-TOCT,
volume = "6",
number = "3",
pages = "13:1--13:??",
month = jul,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2633600",
ISSN = "1942-3454 (print), 1942-3462 (electronic)",
ISSN-L = "1942-3454",
bibdate = "Thu Oct 1 16:40:04 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toct/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toct.bib",
abstract = "We present a novel approach to fully homomorphic
encryption (FHE) that dramatically improves performance
and bases security on weaker assumptions. A central
conceptual contribution in our work is a new way of
constructing leveled, fully homomorphic encryption
schemes (capable of evaluating arbitrary
polynomial-size circuits of a-priori bounded depth),
without Gentry's bootstrapping procedure. Specifically,
we offer a choice of FHE schemes based on the learning
with error (LWE) or Ring LWE (RLWE) problems that have
2 \lambda security against known attacks. We construct
the following. (1) A leveled FHE scheme that can
evaluate depth-$L$ arithmetic circuits (composed of
fan-in 2 gates) using $ O(\lambda . L 3)$ per-gate
computation, quasilinear in the security parameter.
Security is based on RLWE for an approximation factor
exponential in $L$. This construction does not use the
bootstrapping procedure. (2) A leveled FHE scheme that
can evaluate depth-$L$ arithmetic circuits (composed of
fan-in 2 gates) using $ O (\lambda 2)$ per-gate
computation, which is independent of $L$. Security is
based on RLWE for quasipolynomial factors. This
construction uses bootstrapping as an optimization. We
obtain similar results for LWE, but with worse
performance. All previous (leveled) FHE schemes
required a per-gate computation of \Omega (\lambda
3.5), and all of them relied on subexponential hardness
assumptions. We introduce a number of further
optimizations to our scheme based on the Ring LWE
assumption. As an example, for circuits of large width
(e.g., where a constant fraction of levels have width $
\Omega (\lambda)$), we can reduce the per-gate
computation of the bootstrapped version to $ O
(\lambda)$, independent of $L$, by batching the
bootstrapping operation. At the core of our
construction is a new approach for managing the noise
in lattice-based ciphertexts, significantly extending
the techniques of Brakerski and Vaikuntanathan
[2011b].",
acknowledgement = ack-nhfb,
articleno = "13",
fjournal = "ACM Transactions on Computation Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1190",
remark = "Special issue on innovations in theoretical computer
science 2012 --- Part II.",
}
@Article{Brakerski:2014:VBB,
author = "Zvika Brakerski and Guy N. Rothblum",
title = "Virtual Black-Box Obfuscation for All Circuits via
Generic Graded Encoding",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "1--25",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_1/;
http://link.springer.com/content/pdf/bfm:978-3-642-54242-8/1.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Brubaker:2014:UFA,
author = "Chad Brubaker and Suman Jana and Baishakhi Ray and
Sarfraz Khurshid and Vitaly Shmatikov",
editor = "????",
booktitle = "IEEE Symposium on Security and Privacy",
title = "Using frankencerts for automated adversarial testing
of certificate validation in {SSL\slash TLS}
implementations",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "??--??",
year = "2014",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:36:28 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 15]{Schneier:2015:SWC}.",
}
@Article{Buhrman:2014:PBQ,
author = "Harry Buhrman and Nishanth Chandran and Serge Fehr and
Ran Gelles and Vipul Goyal and Rafail Ostrovsky and
Christian Schaffner",
title = "Position-Based Quantum Cryptography: Impossibility and
Constructions",
journal = j-SIAM-J-COMPUT,
volume = "43",
number = "1",
pages = "150--178",
month = "????",
year = "2014",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/130913687",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Sat Sep 13 11:18:29 MDT 2014",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/43/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 2014",
}
@InProceedings{Calmon:2014:ITM,
author = "Flavio P. Calmon and Mayank Varia and Muriel
M{\'e}dard",
editor = "????",
booktitle = "Proceedings of the 52nd Annual Allerton Conference on
Communication, Control, and Computing, 2014",
title = "On Information-Theoretic Metrics for Symmetric-Key
Encryption and Privacy",
publisher = "????",
address = "????",
pages = "??--??",
year = "2014",
DOI = "",
ISBN = "",
ISBN-13 = "",
LCCN = "",
bibdate = "Wed Nov 05 11:12:36 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.mit.edu/~flavio/Documents/Calmon_Allerton13.pdf",
acknowledgement = ack-nhfb,
pagecount = "6",
}
@Article{Cao:2014:PPM,
author = "Ning Cao and Cong Wang and Ming Li and Kui Ren and
Wenjing Lou",
title = "Privacy-Preserving Multi-Keyword Ranked Search over
Encrypted Cloud Data",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "25",
number = "1",
pages = "222--233",
month = jan,
year = "2014",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2013.45",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Aug 25 07:12:16 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Cao:2014:SCI,
author = "Yan-Pei Cao and Tao Ju and Zhao Fu and Shi-Min Hu",
title = "Shapes and Cryptography: Interactive Image-Guided
Modeling of Extruded Shapes",
journal = j-CGF,
volume = "33",
number = "7",
pages = "101--110",
month = oct,
year = "2014",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/cgf.12478",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Fri Feb 13 14:27:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics World",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "28 Oct 2014",
}
@Article{Ceruzzi:2014:HFT,
author = "P. E. Ceruzzi",
title = "Are Historians Failing to Tell the Real Story about
the History of Computing?",
journal = j-IEEE-ANN-HIST-COMPUT,
volume = "36",
number = "3",
pages = "94--95",
month = jul,
year = "2014",
CODEN = "IAHCEX",
DOI = "https://doi.org/10.1109/MAHC.2014.33",
ISSN = "1058-6180 (print), 1934-1547 (electronic)",
ISSN-L = "1058-6180",
bibdate = "Thu Jan 8 07:26:10 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeeannhistcomput.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Annals of the History of Computing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85",
keywords = "Computer industry; computing history; critical
document declassification; cryptography; cryptologic
history; document handling; history; History; history
of computing; National Security Agency; NSA agencies;
secrecy culture; SIGABA; SIGSALY; vocorder",
}
@Article{Chadwick:2014:AFI,
author = "David W. Chadwick and Kristy Siu and Craig Lee and
Yann Fouillat and Damien Germonville",
title = "Adding Federated Identity Management to {OpenStack}",
journal = j-J-GRID-COMP,
volume = "12",
number = "1",
pages = "3--27",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10723-013-9283-2",
ISSN = "1570-7873 (print), 1572-9184 (electronic)",
ISSN-L = "1570-7873",
bibdate = "Tue Sep 9 17:50:58 MDT 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1570-7873&volume=12&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib",
URL = "http://link.springer.com/article/10.1007/s10723-013-9283-2;
http://link.springer.com/content/pdf/10.1007/s10723-013-9283-2.pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Grid Computing",
journal-URL = "http://link.springer.com/journal/10723",
}
@Article{Chandran:2014:PBC,
author = "Nishanth Chandran and Vipul Goyal and Ryan Moriarty
and Rafail Ostrovsky",
title = "Position-Based Cryptography",
journal = j-SIAM-J-COMPUT,
volume = "43",
number = "4",
pages = "1291--1341",
month = "????",
year = "2014",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/100805005",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Sat Sep 13 11:18:37 MDT 2014",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/43/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 2014",
}
@Article{Chang:2014:RRT,
author = "Chin-Chen Chang and Ting-Fang Cheng",
title = "A Reliable Real-time Multicast Authentication Protocol
with Provable Accuracy",
journal = j-FUND-INFO,
volume = "131",
number = "2",
pages = "167--186",
month = apr,
year = "2014",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2014-1008",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:18:41 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Chapin:2014:SRP,
author = "Peter Chapin and Christian Skalka",
title = "{SpartanRPC}: Remote Procedure Call Authorization in
Wireless Sensor Networks",
journal = j-TISSEC,
volume = "17",
number = "2",
pages = "5:1--5:??",
month = nov,
year = "2014",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2644809",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Nov 19 12:26:42 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "We describe SpartanRPC, a secure middleware technology
that supports cooperation between distinct security
domains in wireless sensor networks. SpartanRPC extends
nesC to provide a link-layer remote procedure call
(RPC) mechanism, along with an enhancement of
configuration wirings that allow specification of
remote, dynamic endpoints. RPC invocation is secured
via an authorization logic that enables servers to
specify access policies and requires clients to prove
authorization. This mechanism is implemented using a
combination of symmetric and public key cryptography.
We report on benchmark testing of a prototype
implementation and on an application of the framework
that supports secure collaborative use and
administration of an existing WSN data-gathering
system.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@InProceedings{Checkoway:2014:PED,
author = "Stephen Checkoway and Matthew Fredrikson and Ruben
Niederhagen and Matthew Green and Tanja Lange and
Thomas Ristenpart and Daniel J. Bernstein and Jake
Maskiewicz and Hovav Schacham",
editor = "????",
booktitle = "USENIX Security Symposium",
title = "On the practical exploitability of {Dual EC} in {TLS}
implementations",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "??--??",
year = "2014",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:37:52 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 16]{Schneier:2015:SWC}.",
}
@Article{Chen:2014:CDP,
author = "Liqun Chen and Hoon Wei Lim and Guomin Yang",
title = "Cross-Domain Password-Based Authenticated Key Exchange
Revisited",
journal = j-TISSEC,
volume = "16",
number = "4",
pages = "15:1--15:??",
month = apr,
year = "2014",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2584681",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon May 5 18:00:10 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "We revisit the problem of secure cross-domain
communication between two users belonging to different
security domains within an open and distributed
environment. Existing approaches presuppose that either
the users are in possession of public key certificates
issued by a trusted certificate authority (CA), or the
associated domain authentication servers share a
long-term secret key. In this article, we propose a
generic framework for designing four-party
password-based authenticated key exchange (4PAKE)
protocols. Our framework takes a different approach
from previous work. The users are not required to have
public key certificates, but they simply reuse their
login passwords, which they share with their respective
domain authentication servers. On the other hand, the
authentication servers, assumed to be part of a
standard PKI, act as ephemeral CAs that certify some
key materials that the users can subsequently use to
exchange and agree on as a session key. Moreover, we
adopt a compositional approach. That is, by treating
any secure two-party password-based key exchange
(2PAKE) protocol and two-party
asymmetric-key/symmetric-key-based key exchange
(2A/SAKE) protocol as black boxes, we combine them to
obtain generic and provably secure 4PAKE protocols.",
acknowledgement = ack-nhfb,
articleno = "15",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Chen:2014:CSI,
author = "Yu Chen and Zongyang Zhang and Dongdai Lin and Zhenfu
Cao",
title = "{CCA}-Secure {IB--KEM} from Identity-Based Extractable
Hash Proof System",
journal = j-COMP-J,
volume = "57",
number = "10",
pages = "1537--1556",
month = oct,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt090",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Sep 27 12:06:41 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://comjnl.oxfordjournals.org/content/57/10/1537",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 13, 2013",
}
@Article{Chen:2014:DSE,
author = "Jie Chen and Hoeteck Wee",
title = "Doubly spatial encryption from {DBDH}",
journal = j-THEOR-COMP-SCI,
volume = "543",
number = "??",
pages = "79--89",
day = "10",
month = jul,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Aug 16 09:03:15 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514004277",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Chen:2014:MLC,
author = "Long Chen and Zhao Zhang",
title = "{MemGuard}: a low cost and energy efficient design to
support and enhance memory system reliability",
journal = j-COMP-ARCH-NEWS,
volume = "42",
number = "3",
pages = "49--60",
month = jun,
year = "2014",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/2678373.2665683",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Wed Dec 3 16:18:50 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "Memory system reliability is increasingly a concern as
memory cell density and capacity continue to grow. The
conventional approach is to use redundant memory bits
for error detection and correction, with significant
storage, cost and power overheads. In this paper, we
propose a novel, system-level scheme called MemGuard
for memory error detection. With OS-based
checkpointing, it is also able to recover program
execution from memory errors. The memory error
detection of MemGuard is motivated by memory integrity
verification using log hashes. It is much stronger than
SECDED in error detection, incurs negligible hardware
cost and energy overhead and no storage overhead, and
is compatible with various memory organizations. It may
play the role of ECC memory in consumer-level computers
and mobile devices, without the shortcomings of ECC
memory. In server computers, it may complement SECDED
ECC or Chipkill Correct by providing even stronger
error detection. We have comprehensively investigated
and evaluated the feasibility and reliability of
MemGuard. We show that using an incremental multiset
hash function and a non-cryptographic hash function,
the performance and energy overheads of MemGuard are
negligible. We use the mathematical deduction and
synthetic simulation to prove that MemGuard is robust
and reliable.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
remark = "ISCA '14 conference proceedings.",
}
@Article{Chen:2014:SBB,
author = "Chien-Chang Chen and Wei-Jie Wu",
title = "A secure {Boolean}-based multi-secret image sharing
scheme",
journal = j-J-SYST-SOFTW,
volume = "92",
number = "??",
pages = "107--114",
month = jun,
year = "2014",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed May 21 08:06:07 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121214000181",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Cheraghchi:2014:NMC,
author = "Mahdi Cheraghchi and Venkatesan Guruswami",
title = "Non-malleable Coding against Bit-Wise and Split-State
Tampering",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "440--464",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_19",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_19/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Cho:2014:DGA,
author = "Michael Cheng Yi Cho and Pokai Chen and Shiuhpyng
Winston Shieh",
title = "{Dmail}: A Globally Authenticated Email Service",
journal = j-COMPUTER,
volume = "47",
number = "5",
pages = "88--91",
month = may,
year = "2014",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2014.119",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Sep 9 18:53:40 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Chou:2014:EMA,
author = "Jue-Sam Chou",
title = "An efficient mutual authentication {RFID} scheme based
on elliptic curve cryptography",
journal = j-J-SUPERCOMPUTING,
volume = "70",
number = "1",
pages = "75--94",
month = oct,
year = "2014",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-013-1073-x",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Fri Feb 13 12:32:14 MST 2015",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=70&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-013-1073-x",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Chu:2014:KAC,
author = "Cheng-Kang Chu and Sherman S. M. Chow and Wen-Guey
Tzeng and Jianying Zhou and Robert H. Deng",
title = "Key-Aggregate Cryptosystem for Scalable Data Sharing
in Cloud Storage",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "25",
number = "2",
pages = "468--477",
month = feb,
year = "2014",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2013.112",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Aug 25 07:12:16 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Chung:2014:RRS,
author = "Kai-Min Chung and Rafail Ostrovsky and Rafael Pass and
Muthuramakrishnan Venkitasubramaniam and Ivan
Visconti",
title = "$4$-Round Resettably-Sound Zero Knowledge",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "192--216",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_9/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{CNRS:2014:NAS,
author = "{CNRS}",
title = "New Algorithm Shakes Up Cryptography",
journal = "Scientific Computing",
day = "15",
month = may,
year = "2014",
bibdate = "Wed May 21 10:05:51 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "See \cite{Barbulescu:2014:HQP}.",
URL = "http://www.scientificcomputing.com/news/2014/05/new-algorithm-shakes-cryptography",
abstract = "From the first paragraph: ``Researchers have solved
one aspect of the discrete logarithm problem. This is
considered to be one of the 'holy grails' of
algorithmic number theory, on which the security of
many cryptographic systems used today is based. The
team at the Laboratoire Lorrain de Recherches en
Informatique et ses Applications (CNRS/Universit{\'e}
de Lorraine/Inria) and the Laboratoire d'Informatique
de Paris 6 (CNRS/UPMC) has devised a new algorithm (1)
that calls into question the security of one variant of
this problem, which has been closely studied since
1976. This result, published on the site of the
International Association of Cryptologic Research and
on the HAL open access archive, was presented at the
international conference Eurocrypt 2014 held in
Copenhagen on 11--15 May 2014 and published in Advances
in cryptology. It discredits several cryptographic
systems that until now were assumed to provide
sufficient security safeguards. Although this work is
still theoretical, it is likely to have repercussions
especially on the cryptographic applications of smart
cards, RFID chips (2), etc.''",
acknowledgement = ack-nhfb,
}
@Article{Cordova:2014:EBS,
author = "Tim Cordova",
title = "Encrypted backup solution: {Home Paranoia Edition}",
journal = j-LINUX-J,
volume = "2014",
number = "237",
pages = "3:1--3:??",
month = jan,
year = "2014",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Feb 6 07:16:21 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
abstract = "A solution for safeguarding your personal
information.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Corrigan-Gibbs:2014:KS,
author = "Henry Corrigan-Gibbs",
title = "Keeping Secrets",
journal = "Stanford Magazine",
volume = "??",
number = "??",
pages = "??--??",
month = nov # "\slash " # dec,
year = "2014",
bibdate = "Sun Mar 12 13:55:13 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://alumni.stanford.edu/get/page/magazine/article/?article_id=74801",
abstract = "Four decades ago, university researchers figured out
the key to computer privacy, sparking a battle with the
National Security Agency that continues today.",
acknowledgement = ack-nhfb,
journal-URL = "https://alumni.stanford.edu/get/page/magazine/back-issues/",
remark = "This article is a readable account of some of the
history of public-key cryptography, and government
attempts to control or suppress it.",
}
@Article{Corthesy:2014:SSD,
author = "S{\'e}bastien Corth{\'e}sy",
title = "Smartphones Set Out to Decipher Cryptographic System",
journal = "Scientific Computing",
day = "25",
month = aug,
year = "2014",
bibdate = "Tue Aug 26 11:24:19 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "The article describes use of thousands of mobile
phones to attempt a parallel brute-force attack on
elliptic-curve and RSA algorithms, in a research
project by Ramasany Gowthami and Arjen Lenstra at the
LACAL laboratory at EPFL, Lausanne, Switzerland.",
URL = "http://www.scientificcomputing.com/news/2014/08/smartphones-set-out-decipher-cryptographic-system",
acknowledgement = ack-nhfb,
}
@Article{Costello:2014:CAS,
author = "Craig Costello and Alyson Deines-Schartz and Kristin
Lauter and Tonghai Yang",
title = "Constructing abelian surfaces for cryptography via
{Rosenhain} invariants",
journal = j-LMS-J-COMPUT-MATH,
volume = "17",
number = "A",
pages = "157--180",
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1112/S1461157014000370",
ISSN = "1461-1570",
bibdate = "Tue Sep 9 12:34:13 MDT 2014",
bibsource = "http://journals.cambridge.org/action/displayJournal?jid=JCM;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lms-j-comput-math.bib",
acknowledgement = ack-nhfb,
ajournal = "LMS J. Comput. Math.",
fjournal = "LMS Journal of Computation and Mathematics",
onlinedate = "05 August 2014",
remark = "Algorithmic Number Theory Symposium XI.",
}
@Misc{Craver:2014:UCC,
author = "Scott Craver",
title = "The underhanded {C} contest",
howpublished = "Web site",
year = "2014",
bibdate = "Mon Mar 09 11:42:38 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://underhanded.xcott.com/",
abstract = "From the Web site: ``The goal of the contest is to
write code that is as readable, clear, innocent and
straightforward as possible, and yet it must fail to
perform at its apparent function. To be more specific,
it should do something subtly evil. Every year, we will
propose a challenge to coders to solve a simple data
processing problem, but with covert malicious behavior.
Examples include miscounting votes, shaving money from
financial transactions, or leaking information to an
eavesdropper. The main goal, however, is to write
source code that easily passes visual inspection by
other programmers.''",
acknowledgement = ack-nhfb,
}
@Article{Criswell:2014:VGP,
author = "John Criswell and Nathan Dautenhahn and Vikram Adve",
title = "{Virtual Ghost}: protecting applications from hostile
operating systems",
journal = j-COMP-ARCH-NEWS,
volume = "42",
number = "1",
pages = "81--96",
month = mar,
year = "2014",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/2654822.2541986",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Mon Aug 18 17:12:47 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "Applications that process sensitive data can be
carefully designed and validated to be difficult to
attack, but they are usually run on monolithic,
commodity operating systems, which may be less secure.
An OS compromise gives the attacker complete access to
all of an application's data, regardless of how well
the application is built. We propose a new system,
Virtual Ghost, that protects applications from a
compromised or even hostile OS. Virtual Ghost is the
first system to do so by combining compiler
instrumentation and run-time checks on operating system
code, which it uses to create ghost memory that the
operating system cannot read or write. Virtual Ghost
interposes a thin hardware abstraction layer between
the kernel and the hardware that provides a set of
operations that the kernel must use to manipulate
hardware, and provides a few trusted services for
secure applications such as ghost memory management,
encryption and signing services, and key management.
Unlike previous solutions, Virtual Ghost does not use a
higher privilege level than the kernel. Virtual Ghost
performs well compared to previous approaches; it
outperforms InkTag on five out of seven of the LMBench
microbenchmarks with improvements between 1.3x and
14.3x. For network downloads, Virtual Ghost experiences
a 45\% reduction in bandwidth at most for small files
and nearly no reduction in bandwidth for large files
and web traffic. An application we modified to use
ghost memory shows a maximum additional overhead of 5\%
due to the Virtual Ghost protections. We also
demonstrate Virtual Ghost's efficacy by showing how it
defeats sophisticated rootkit attacks.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
remark = "ASPLOS '14 conference proceedings.",
}
@Article{Cui:2014:SSA,
author = "Hui Cui and Yi Mu and Man Ho Au",
title = "Signcryption Secure Against Linear Related-Key
Attacks",
journal = j-COMP-J,
volume = "57",
number = "10",
pages = "1472--1483",
month = oct,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt076",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Sep 27 12:06:41 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/57/10/1472",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 4, 2013",
}
@Article{Dachman-Soled:2014:COF,
author = "Dana Dachman-Soled and Mohammad Mahmoody and Tal
Malkin",
title = "Can Optimally-Fair Coin Tossing Be Based on One-Way
Functions?",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "217--239",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_10",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_10/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{DArco:2014:MIC,
author = "P. D'Arco and R. {De Prisco} and A. {De Santis}",
title = "Measure-independent characterization of contrast
optimal visual cryptography schemes",
journal = j-J-SYST-SOFTW,
volume = "95",
number = "??",
pages = "89--99",
month = sep,
year = "2014",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Sep 1 11:30:59 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121214000995",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Deng:2014:CCC,
author = "Robert H. Deng and Yang Xiang and Man Ho Au",
title = "Cryptography in Cloud Computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "30",
number = "??",
pages = "90--90",
month = jan,
year = "2014",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Dec 2 16:57:46 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib;
http://www.sciencedirect.com/science/journal/0167739X",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X13002197",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Deng:2014:TNI,
author = "Lunzhi Deng and Jiwen Zeng",
title = "Two new identity-based threshold ring signature
schemes",
journal = j-THEOR-COMP-SCI,
volume = "535",
number = "??",
pages = "38--45",
day = "22",
month = may,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed May 7 19:04:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514002692",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@TechReport{Dodis:2014:HEY,
author = "Yevgeniy Dodis and Adi Shamir and Noah
Stephens-Davidowitz and Daniel Wichs",
title = "How to Eat Your Entropy and Have it Too --- Optimal
Recovery Strategies for Compromised {RNGs}",
type = "Report",
institution = "Dept. of Computer Science, New York University; Dept.
of Computer Science and Applied Mathematics, Weizmann
Institute; Dept. of Computer Science, Northeastern
University",
address = "New York, NY, USA; Tel Aviv, Israel; Boston, MA, USA",
pages = "27",
day = "3",
month = mar,
year = "2014",
bibdate = "Sat Mar 15 11:39:28 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://eprint.iacr.org/2014/167;
https://www.schneier.com/fortuna.html",
acknowledgement = ack-nhfb,
keywords = "entropy accumulation; Fortuna random-number generator
algorithm; PRG; RNG with input",
}
@Article{Donovan:2014:ATM,
author = "Peter W. Donovan",
title = "{Alan Turing}, {Marshall Hall}, and the Alignment of
{WW2 Japanese Naval} Intercepts",
journal = j-NAMS,
volume = "61",
number = "3",
pages = "258--264",
month = mar,
year = "2014",
CODEN = "AMNOAN",
ISSN = "0002-9920 (print), 1088-9477 (electronic)",
ISSN-L = "0002-9920",
bibdate = "Thu Mar 06 11:24:00 2014",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.ams.org/notices/201403/rnoti-p258.pdf",
acknowledgement = ack-nhfb,
fjournal = "Notices of the American Mathematical Society",
journal-URL = "http://www.ams.org/notices/",
}
@Article{Dupressoir:2014:GGP,
author = "Fran{\c{c}}ois Dupressoir and Andrew D. Gordon and Jan
J{\"u}rjens and David A. Naumann",
title = "Guiding a general-purpose {C} verifier to prove
cryptographic protocols",
journal = j-J-COMP-SECUR,
volume = "22",
number = "5",
pages = "823--866",
month = "????",
year = "2014",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-140508",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:26:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@InProceedings{Durumeric:2014:MH,
author = "Zakir Durumeric and James Kasten and David Adrian and
J. Alex Halderman and Michael Bailey and Frank Li and
Nicholas Weaver and Johanna Amann and Jethro Beekman
and Mathias Payer and others",
editor = "????",
booktitle = "{ACM Internet Measurement Conference}",
title = "The matter of {Heartbleed}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "??--??",
year = "2014",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:55:34 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 30]{Schneier:2015:SWC}.",
}
@Article{Edwards:2014:NRP,
author = "Chris Edwards",
title = "News: Researchers probe security through obscurity",
journal = j-CACM,
volume = "57",
number = "8",
pages = "11--13",
month = aug,
year = "2014",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2632038",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Aug 9 08:01:51 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Obfuscation protects code by making it so impenetrable
that access to it won't help a hacker understand how it
works.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "cryptography; encryption; obfuscation",
}
@Article{Eldib:2014:FVS,
author = "Hassan Eldib and Chao Wang and Patrick Schaumont",
title = "Formal Verification of Software Countermeasures
against Side-Channel Attacks",
journal = j-TOSEM,
volume = "24",
number = "2",
pages = "11:1--11:??",
month = dec,
year = "2014",
CODEN = "ATSMER",
DOI = "https://doi.org/10.1145/2685616",
ISSN = "1049-331X (print), 1557-7392 (electronic)",
ISSN-L = "1049-331X",
bibdate = "Wed Jan 7 15:27:31 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/tosem/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosem.bib",
abstract = "A common strategy for designing countermeasures
against power-analysis-based side-channel attacks is
using random masking techniques to remove the
statistical dependency between sensitive data and
side-channel emissions. However, this process is both
labor intensive and error prone and, currently, there
is a lack of automated tools to formally assess how
secure a countermeasure really is. We propose the first
SMT-solver-based method for formally verifying the
security of a masking countermeasure against such
attacks. In addition to checking whether the sensitive
data are masked by random variables, we also check
whether they are perfectly masked, that is, whether the
intermediate computation results in the implementation
of a cryptographic algorithm are independent of the
secret key. We encode this verification problem using a
series of quantifier-free first-order logic formulas,
whose satisfiability can be decided by an off-the-shelf
SMT solver. We have implemented the proposed method in
a software verification tool based on the LLVM compiler
frontend and the Yices SMT solver. Our experiments on a
set of recently proposed masking countermeasures for
cryptographic algorithms such as AES and MAC-Keccak
show the method is both effective in detecting power
side-channel leaks and scalable for practical use.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Software Engineering and
Methodology",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J790",
}
@InProceedings{Embar:2014:PWO,
author = "Maya Embar and Louis F. {McHugh IV} and William R.
Wesselman",
booktitle = "Proceedings of the 3rd Annual Conference on Research
in Information Technology",
title = "Printer Watermark Obfuscation",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "15--20",
year = "2014",
DOI = "https://doi.org/10.1145/2656434.2656437",
ISBN = "1-4503-2711-7",
ISBN-13 = "978-1-4503-2711-4",
bibdate = "Sat Nov 15 08:53:29 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "RIIT '14",
acknowledgement = ack-nhfb,
acmid = "2656437",
keywords = "firmware; obfuscation; printer; steganography;
template; tracking; watermark; yellow dots",
location = "Atlanta, Georgia, USA",
numpages = "6",
}
@Article{Estebanez:2014:PMC,
author = "C{\'e}sar Est{\'e}banez and Yago Saez and Gustavo
Recio and Pedro Isasi",
title = "Performance of the most common non-cryptographic hash
functions",
journal = j-SPE,
volume = "44",
number = "6",
pages = "681--698",
month = jun,
year = "2014",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.2179",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Wed Sep 10 05:57:34 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "28 Jan 2013",
}
@Article{Faigl:2014:PEC,
author = "Zolt{\'a}n Faigl and Jani Pellikka and L{\'a}szl{\'o}
Bokor and Andrei Gurtov",
title = "Performance evaluation of current and emerging
authentication schemes for future {3GPP} network
architectures",
journal = j-COMP-NET-AMSTERDAM,
volume = "60",
number = "??",
pages = "60--74",
day = "26",
month = feb,
year = "2014",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Fri Feb 28 07:06:34 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128613004180",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Fan:2014:ASA,
author = "Chun-I Fan and Vincent Shi-Ming Huang and He-Ming
Ruan",
title = "Arbitrary-State Attribute-Based Encryption with
Dynamic Membership",
journal = j-IEEE-TRANS-COMPUT,
volume = "63",
number = "8",
pages = "1951--1961",
month = aug,
year = "2014",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2013.83",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Aug 25 08:24:32 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Fan:2014:NCI,
author = "Jia Fan and Yuliang Zheng and Xiaohu Tang",
title = "A New Construction of Identity-Based Signcryption
Without Random Oracles",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "1",
pages = "1--??",
month = jan,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500014",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 29 07:15:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fan:2014:RRS,
author = "Kai Fan and Jie Li and Hui Li and Xiaohui Liang and
Xuemin (Sherman) Shen and Yintang Yang",
title = "{RSEL}: revocable secure efficient lightweight {RFID}
authentication scheme",
journal = j-CCPE,
volume = "26",
number = "5",
pages = "1084--1096",
day = "10",
month = apr,
year = "2014",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3065",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Fri May 30 08:55:33 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "10 Jul 2013",
}
@Article{Farash:2014:CIE,
author = "Mohammad Sabzinejad Farash",
title = "Cryptanalysis and improvement of an efficient mutual
authentication {RFID} scheme based on elliptic curve
cryptography",
journal = j-J-SUPERCOMPUTING,
volume = "70",
number = "2",
pages = "987--1001",
month = nov,
year = "2014",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-014-1272-0",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Fri Feb 13 12:13:17 MST 2015",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=70&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-014-1272-0",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Farash:2014:ECC,
author = "Mohammad Sabzinejad Farash and Mahmoud Ahmadian
Attari",
title = "An efficient client--client password-based
authentication scheme with provable security",
journal = j-J-SUPERCOMPUTING,
volume = "70",
number = "2",
pages = "1002--1022",
month = nov,
year = "2014",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-014-1273-z",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Fri Feb 13 12:13:17 MST 2015",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=70&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-014-1273-z",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Farash:2014:SEI,
author = "Mohammad Sabzinejad Farash and Mahmoud Ahmadian
Attari",
title = "A secure and efficient identity-based authenticated
key exchange protocol for mobile client-server
networks",
journal = j-J-SUPERCOMPUTING,
volume = "69",
number = "1",
pages = "395--411",
month = jul,
year = "2014",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-014-1170-5",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Wed Sep 10 06:45:04 MDT 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=69&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-014-1170-5",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Faugere:2014:MCA,
author = "Jean-Charles Faug{\`e}re and Domingo
G{\'o}mez-P{\'e}rez and Jaime Gutierrez and Ludovic
Perret",
title = "Mathematical and computer algebra techniques in
cryptology",
journal = j-J-SYMBOLIC-COMP,
volume = "64",
number = "??",
pages = "1--2",
month = aug,
year = "2014",
CODEN = "JSYCEH",
ISSN = "0747-7171 (print), 1095-855X (electronic)",
ISSN-L = "0747-7171",
bibdate = "Fri Feb 28 07:39:29 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0747717113001673",
acknowledgement = ack-nhfb,
fjournal = "Journal of Symbolic Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/07477171/",
}
@Article{Faust:2014:CNM,
author = "Sebastian Faust and Pratyay Mukherjee and Jesper Buus
Nielsen and Daniele Venturi",
title = "Continuous Non-malleable Codes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "465--488",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_20",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_20/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ferretti:2014:DCI,
author = "Luca Ferretti and Michele Colajanni and Mirco
Marchetti",
title = "Distributed, Concurrent, and Independent Access to
Encrypted Cloud Databases",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "25",
number = "2",
pages = "437--446",
month = feb,
year = "2014",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2013.154",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Aug 25 07:12:16 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Galindo:2014:LCL,
author = "David Galindo and Srinivas Vivek",
title = "Limits of a conjecture on a leakage-resilient
cryptosystem",
journal = j-INFO-PROC-LETT,
volume = "114",
number = "4",
pages = "192--196",
month = apr,
year = "2014",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Jan 28 08:23:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013002949",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Gao:2014:URA,
author = "Lijun Gao and Maode Ma and Yantai Shu and Yuhua Wei",
title = "An ultralightweight {RFID} authentication protocol
with {CRC} and permutation",
journal = j-J-NETW-COMPUT-APPL,
volume = "41",
number = "??",
pages = "37--46",
month = may,
year = "2014",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:45:00 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804513002269",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Garg:2014:TRS,
author = "Sanjam Garg and Craig Gentry and Shai Halevi and
Mariana Raykova",
title = "Two-Round Secure {MPC} from Indistinguishability
Obfuscation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "74--94",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@TechReport{Genkin:2014:GYH,
author = "Daniel Genkin and Itamar Pipman and Eran Tromer",
title = "Get Your Hands Off My Laptop: Physical Side-Channel
Key-Extraction Attacks on {PCs}",
type = "Report",
institution = "Technion and Tel Aviv University",
address = "Tel Aviv, Israel",
pages = "25",
day = "31",
month = jul,
year = "2014",
bibdate = "Fri Aug 08 12:04:13 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.cs.tau.ac.il/~tromer/handsoff/",
abstract = "We demonstrate physical side-channel attacks on a
popular software implementation of RSA and ElGamal,
running on laptop computers. Our attacks use novel side
channels, based on the observation that the `ground'
electric potential, in many computers, fluctuates in a
computation-dependent way. An attacker can measure this
signal by touching exposed metal on the computer's
chassis with a plain wire, or even with a bare hand.
The signal can also be measured at the remote end of
Ethernet, VGA or USB cables.\par
Through suitable cryptanalysis and signal processing,
we have extracted 4096-bit RSA keys and 3072-bit
ElGamal keys from laptops, via each of these channels,
as well as via power analysis and electromagnetic
probing. Despite the GHz-scale clock rate of the
laptops and numerous noise sources, the full attacks
require a few seconds of measurements using Medium
Frequency signals (around 2 MHz), or one hour using Low
Frequency signals (up to 40 kHz).",
acknowledgement = ack-nhfb,
}
@Article{Ghosh:2014:BBB,
author = "Santosh Ghosh and Ingrid Verbauwhede",
title = "{BLAKE-512}-Based 128-Bit {CCA2} Secure Timing Attack
Resistant {McEliece} Cryptoprocessor",
journal = j-IEEE-TRANS-COMPUT,
volume = "63",
number = "5",
pages = "1124--1133",
month = may,
year = "2014",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2012.271",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Aug 25 08:24:32 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Gilad:2014:PHI,
author = "Yossi Gilad and Amir Herzberg and Haya Shulman",
title = "Off-Path Hacking: The Illusion of Challenge--Response
Authentication",
journal = j-IEEE-SEC-PRIV,
volume = "12",
number = "5",
pages = "68--77",
month = sep # "\slash " # oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2013.130",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Feb 11 15:40:12 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "http://www.computer.org/csdl/mags/sp/2014/05/msp2014050068-abs.html",
abstract-URL = "http://www.computer.org/csdl/mags/sp/2014/05/msp2014050068-abs.html",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Gotzfried:2014:MAT,
author = "Johannes G{\"o}tzfried and Tilo M{\"u}ller",
title = "Mutual Authentication and Trust Bootstrapping towards
Secure Disk Encryption",
journal = j-TISSEC,
volume = "17",
number = "2",
pages = "6:1--6:??",
month = nov,
year = "2014",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2663348",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Nov 19 12:26:42 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "The weakest link in software-based full disk
encryption is the authentication procedure. Since the
master boot record must be present unencrypted in order
to launch the decryption of remaining system parts, it
can easily be manipulated and infiltrated by bootkits
that perform keystroke logging; consequently,
password-based authentication schemes become
attackable. The current technological response, as
enforced by BitLocker, verifies the integrity of the
boot process by use of the trusted platform module.
But, as we show, this countermeasure is insufficient in
practice. We present STARK, the first tamperproof
authentication scheme that mutually authenticates the
computer and the user in order to resist keylogging
during boot. To achieve this, STARK implements trust
bootstrapping from a secure token to the whole PC. The
secure token is an active USB drive that verifies the
integrity of the PC and indicates the verification
status by an LED to the user. This way, users can
ensure the authenticity of the PC before entering their
passwords.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Book{Greenberg:2014:GWB,
author = "Joel Greenberg and Rosamond Welchman",
title = "{Gordon Welchman}: {Bletchley Park}'s architect of
ultra intelligence",
publisher = "Frontline Books",
address = "Barnsley, UK",
pages = "xvi + 286 + 16",
year = "2014",
ISBN = "1-84832-752-8 (hardcover), 1-4738-3463-5 (e-book)",
ISBN-13 = "978-1-84832-752-8 (hardcover), 978-1-4738-3463-7
(e-book)",
LCCN = "TK5102.94 .G744 2014xeb",
bibdate = "Mon Dec 19 12:33:04 MST 2016",
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/cryptography2010.bib",
URL = "http://lib.myilibrary.com?id=943722",
acknowledgement = ack-nhfb,
author-dates = "1946--",
subject = "Welchman, Gordon; Welchman, Gordon; Cryptographers;
Great Britain; Biography; Mathematicians; World War,
1939-1945; Cryptography; Cryptographers; Cryptography;
Mathematicians; BIOGRAPHY and AUTOBIOGRAPHY / Science
and Technology; MATHEMATICS / Essays; MATHEMATICS /
Pre-Calculus; MATHEMATICS / Reference",
}
@Article{Guo:2014:SAS,
author = "Fuchun Guo and Yi Mu and Willy Susilo and Vijay
Varadharajan",
title = "Server-Aided Signature Verification for Lightweight
Devices",
journal = j-COMP-J,
volume = "57",
number = "4",
pages = "481--493",
month = apr,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt003",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Mar 26 15:06:42 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/57/4/481.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "January 30, 2013",
}
@Article{Han:2014:ATS,
author = "Tao Han and Weiming Zhang and Chao Wang and Nenghai Yu
and Yuefei Zhu",
title = "Adaptive $ \pm 1 $ Steganography in Extended Noisy
Region",
journal = j-COMP-J,
volume = "57",
number = "4",
pages = "557--566",
month = apr,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt035",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Mar 26 15:06:42 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/57/4/557.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "April 17, 2013",
}
@Article{Han:2014:ERI,
author = "Qi Han and Yinghui Zhang and Xiaofeng Chen and Hui Li
and Jiaxiang Quan",
title = "Efficient and robust identity-based handoff
authentication for {EAP-based} wireless networks",
journal = j-CCPE,
volume = "26",
number = "8",
pages = "1561--1573",
day = "10",
month = jun,
year = "2014",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3024",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Fri May 30 08:55:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "11 Apr 2013",
}
@Article{Han:2014:GTK,
author = "Fei Han and Jing Qin and Huawei Zhao and Jiankun Hu",
title = "A general transformation from {KP-ABE} to searchable
encryption",
journal = j-FUT-GEN-COMP-SYS,
volume = "30",
number = "??",
pages = "107--115",
month = jan,
year = "2014",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Dec 2 16:57:46 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib;
http://www.sciencedirect.com/science/journal/0167739X",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X13001921",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Han:2014:IBS,
author = "Jinguang Han and Willy Susilo and Yu Mu",
title = "Identity-Based Secure Distributed Data Storage
Schemes",
journal = j-IEEE-TRANS-COMPUT,
volume = "63",
number = "4",
pages = "941--953",
month = apr,
year = "2014",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2013.26",
ISSN = "0018-9340",
ISSN-L = "0018-9340",
bibdate = "Sat Apr 19 10:40:35 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Harn:2014:MTS,
author = "Lein Harn and Miao Fuyou",
title = "Multilevel threshold secret sharing based on the
{Chinese Remainder Theorem}",
journal = j-INFO-PROC-LETT,
volume = "114",
number = "9",
pages = "504--509",
month = sep,
year = "2014",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed May 21 07:45:08 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019014000659",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Book{Harrington:2014:GEF,
author = "Surya Michael Harrington",
title = "{Google Earth} forensics: using {Google Earth}
geo-location in digital forensic investigations",
publisher = pub-ELSEVIER,
address = pub-ELSEVIER:adr,
pages = "vii + 113",
year = "2014",
ISBN = "0-12-800216-6",
ISBN-13 = "978-0-12-800216-2",
LCCN = "????",
bibdate = "Sat Dec 9 11:40:51 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
abstract = "This book explains how to use Google Earth in digital
forensic investigations. This book teaches you how to
leverage Google's free tool to craft compelling
location-based evidence for use in investigations and
in the courtroom. It shows how to extract
location-based data that can be used to display
evidence in compelling audiovisual manners that explain
and inform the data in contextual, meaningful, and
easy-to-understand ways. You will learn how to extract
location-based evidence using the Google Earth program
or app on computers and mobile devices. The book covers
the basics of GPS systems, the usage of Google Earth,
and helps sort through data imported from external
evidence sources and includes tips on presenting
evidence in compelling, easy-to-understand formats.",
acknowledgement = ack-nhfb,
tableofcontents = "\\
Biography \\
1: Google Earth Basics \\
Abstract \\
What is Google Earth? \\
Google Earth for Forensics \\
Flavors of Google Earth \\
Installing Google Earth on Your Computer \\
2: Using Google Earth \\
Abstract \\
Using Google Earth \\
The Google Earth UI \\
Navigation \\
Views \\
Tours \\
Configuration \\
3: GPS, GIS, and Google Earth \\
Abstract \\
Understanding GPS \\
Understanding GIS \\
Geo-Location Information in Pictures \\
4: KML/XML/HTML \\
Abstract \\
Markup Languages and Google Earth \\
Using HTML in Google Earth \\
What is KML? \\
XML \\
KML revisited \\
Learning more about markup languages \\
5: Digital Forensics 101 \\
Abstract \\
What is Digital Forensics? \\
Tools for Recovering Evidence \\
Do you really want to do this? \\
Organizing your case \\
Understanding what you are looking AT \\
6: Working a Case \\
Abstract \\
The practical application of Google Earth forensics \\
Acquiring from a GPS Unit \\
Annotating a crime scene \\
Views and camera angles \\
Legends, logos, and banners \\
Creating a tour of the crime scene \\
Distributing your work in Google Earth \\
Index",
}
@Article{Hasan:2014:TFL,
author = "O. Hasan and S. A. Khayam",
title = "Towards Formal Linear Cryptanalysis using {HOL4}",
journal = j-J-UCS,
volume = "20",
number = "2",
pages = "193--??",
month = "????",
year = "2014",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Tue Sep 9 18:31:47 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_20_2/towards_formal_linear_cryptanalysis",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Hazay:2014:OSA,
author = "Carmit Hazay and Arpita Patra",
title = "One-Sided Adaptively Secure Two-Party Computation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "368--393",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Heather:2014:CPE,
author = "James Heather and Steve Schneider and Vanessa Teague",
title = "Cryptographic protocols with everyday objects",
journal = j-FORM-ASP-COMPUT,
volume = "26",
number = "1",
pages = "37--62",
month = jan,
year = "2014",
CODEN = "FACME5",
DOI = "https://doi.org/10.1007/s00165-013-0274-7",
ISSN = "0934-5043 (print), 1433-299X (electronic)",
ISSN-L = "0934-5043",
bibdate = "Tue Mar 17 20:58:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/formaspcomput.bib",
URL = "http://link.springer.com/article/10.1007/s00165-013-0274-7",
acknowledgement = ack-nhfb,
fjournal = "Formal Aspects of Computing",
journal-URL = "http://link.springer.com/journal/165",
}
@Article{Heil:2014:APH,
author = "Timothy Heil and Anil Krishna and Nicholas Lindberg
and Farnaz Toussi and Steven Vanderwiel",
title = "Architecture and Performance of the Hardware
Accelerators in {IBM}'s {PowerEN} Processor",
journal = j-TOPC,
volume = "1",
number = "1",
pages = "5:1--5:??",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2588888",
ISSN = "2329-4949 (print), 2329-4957 (electronic)",
ISSN-L = "2329-4949",
bibdate = "Fri Oct 17 12:28:03 MDT 2014",
bibsource = "http://topc.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/topc.bib",
abstract = "Computation at the edge of a datacenter has unique
characteristics. It deals with streaming data from
multiple sources, going to multiple destinations, often
requiring repeated application of one or more of
several standard algorithmic kernels. These kernels,
related to encryption, compression, XML Parsing and
regular expression searching on the data, demand a high
data processing rate and power efficiency. This
suggests the use of hardware acceleration for key
functions. However, robust general purpose processing
support is necessary to orchestrate the flow of data
between accelerators, as well as perform tasks that are
not suited to acceleration. Further, these accelerators
must be tightly integrated with the general purpose
computation in order to keep invocation overhead and
latency low. The accelerators must be easy for software
to use, and the system must be flexible enough to
support evolving networking standards. In this article,
we describe and evaluate the architecture of IBM's
PowerEN processor, with a focus on PowerEN's
architectural enhancements and its on-chip hardware
accelerators. PowerEN unites the throughput of
application-specific accelerators with the
programmability of general purpose cores on a single
coherent memory architecture. Hardware acceleration
improves throughput by orders of magnitude in some
cases compared to equivalent computation on the general
purpose cores. By offloading work to the accelerators,
general purpose cores are freed to simultaneously work
on computation less suited to acceleration.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Parallel Computing",
journal-URL = "http://dl.acm.org/citation.cfm?id=2632163",
}
@Article{Herranz:2014:ABS,
author = "Javier Herranz",
title = "Attribute-based signatures from {RSA}",
journal = j-THEOR-COMP-SCI,
volume = "527",
number = "??",
pages = "73--82",
day = "27",
month = mar,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Mar 8 16:44:11 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514000772",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Hirt:2014:BA,
author = "Martin Hirt and Ueli Maurer and Pavel Raykov",
title = "Broadcast Amplification",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "419--439",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_18",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_18/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hoang:2014:IMD,
author = "Anh-Tuan Hoang and Takeshi Fujino",
title = "Intra-Masking Dual-Rail Memory on {LUT} Implementation
for {SCA}-Resistant {AES} on {FPGA}",
journal = j-TRETS,
volume = "7",
number = "2",
pages = "10:1--10:??",
month = jun,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2617595",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Mon Jun 30 18:26:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
abstract = "In current countermeasure design trends against
differential power analysis (DPA), security at gate
level is required in addition to the security
algorithm. Several dual-rail pre-charge logics (DPL)
have been proposed to achieve this goal. Designs using
ASIC can attain this goal owing to its backend design
restrictions on placement and routing. However,
implementing these designs on field programmable gate
arrays (FPGA) without information leakage is still a
problem because of the difficulty involved in the
restrictions on placement and routing on FPGA. This
article describes our novel masked dual-rail
pre-charged memory approach, called `intra-masking
dual-rail memory (IMDRM) on LUT', and its
implementation on FPGA for Side-Channel
Attack-resistant (SCA-resistant) AES. In the proposed
design, all unsafe nodes, such as unmasking and
masking, and parts of dual-rail memory with unsafe
buses (buses that are not masked) are packed into a
single LUT. This makes them balanced and independent of
the placement and routing tools. Inputs and outputs of
all LUTs are masked, and so can be considered safe
signals. Several LUTs can be combined to create a safe
SBox. The design is independent of the cryptographic
algorithm, and hence, it can be applied to available
cryptographic standards such as DES or AES as well as
future standards. It requires no special placement or
route constraints in its implementation. A correlation
power analysis (CPA) attack on 1,000,000 traces of AES
implementation on FPGA showed that the secret
information is well protected against first-order
side-channel attacks. Even though the number of LUTs
used for memory in this implementation is seven times
greater than that of the conventional unprotected
single-rail memory table-lookup AES and three times
greater than the implementation based on a composite
field, it requires a smaller number of LUTs than all
other advanced SCA-resistant implementations such as
the wave dynamic differential logic, masked dual-rail
pre-charge logic, and threshold.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
}
@Article{Homma:2014:TFD,
author = "N. Homma and K. Saito and T. Aoki",
title = "Toward Formal Design of Practical Cryptographic
Hardware Based on {Galois} Field Arithmetic",
journal = j-IEEE-TRANS-COMPUT,
volume = "63",
number = "10",
pages = "2604--2613",
month = oct,
year = "2014",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2013.131",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Nov 06 07:29:34 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "128-bit AES datapath; advanced encryption standard;
AES processors; arithmetic circuits; computer algebra;
computer-aided design; cryptographic hardware;
cryptographic processors; Cryptographic processors;
cryptography; formal method; formal verification;
Galois field; Galois fields; Galois-field arithmetic;
GF arithmetic circuits; graph representation; graph
theory; Grobner basis; hierarchical graph structures;
multiplicative inversion circuits; polynomial
reduction; symbol manipulation; symbolic computation
techniques",
}
@Article{Houmansadr:2014:NBW,
author = "Amir Houmansadr and Negar Kiyavash and Nikita
Borisov",
title = "Non-blind watermarking of network flows",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "4",
pages = "1232--1244",
month = aug,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2272740",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:29 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Linking network flows is an important problem in
intrusion detection as well as anonymity. Passive
traffic analysis can link flows, but requires long
periods of observation to reduce errors. Active traffic
analysis, also known as flow watermarking, allows for
better precision and is more scalable. Previous flow
watermarks introduce significant delays to the traffic
flow as a side effect of using a blind detection
scheme; this enables attacks that detect and remove the
watermark, while at the same time slowing down
legitimate traffic. We propose the first non-blind
approach for flow watermarking, called RAINBOW, that
improves watermark invisibility by inserting delays
hundreds of times smaller than previous blind
watermarks, hence reduces the watermark interference on
network flows. We derive and analyze the optimum
detectors for RAINBOW as well as the passive traffic
analysis under different traffic models by using
hypothesis testing. Comparing the detection performance
of RAINBOW and the passive approach, we observe that
both RAINBOW and passive traffic analysis perform
similarly good in the case of uncorrelated traffic,
however the RAINBOW detector drastically outperforms
the optimum passive detector in the case of correlated
network flows. This justifies the use of non-blind
watermarks over passive traffic analysis even though
both approaches have similar scalability constraints.
We confirm our analysis by simulating the detectors and
testing them against large traces of real network
flows.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hsieh:2014:AMU,
author = "Wen-Bin Hsieh and Jenq-Shiou Leu",
title = "An anonymous mobile user authentication protocol using
self-certified public keys based on multi-server
architectures",
journal = j-J-SUPERCOMPUTING,
volume = "70",
number = "1",
pages = "133--148",
month = oct,
year = "2014",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-014-1135-8",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Fri Feb 13 12:32:14 MST 2015",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=70&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-014-1135-8",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Hsu:2014:VWR,
author = "Fu-Hau Hsu and Min-Hao Wu and Cheng-Hsing Yang and
Shiuh-Jeng Wang",
title = "Visible watermarking with reversibility of multimedia
images for ownership declarations",
journal = j-J-SUPERCOMPUTING,
volume = "70",
number = "1",
pages = "247--268",
month = oct,
year = "2014",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-014-1258-y",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Fri Feb 13 12:32:14 MST 2015",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=70&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-014-1258-y",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@InProceedings{Huang:2014:AFS,
author = "Lin-Shung Huang and Alex Rice and Erling Ellingsen and
Collin Jackson",
editor = "????",
booktitle = "{IEEE Symposium on Security and Privacy}",
title = "Analyzing forged {SSL} certificates in the wild",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "??--??",
year = "2014",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 12:09:56 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 43]{Schneier:2015:SWC}.",
}
@Article{Huang:2014:FOS,
author = "Xinyi Huang and Xiaofeng Chen and Jin Li and Yang
Xiang and Li Xu",
title = "Further Observations on Smart-Card-Based
Password-Authenticated Key Agreement in Distributed
Systems",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "25",
number = "7",
pages = "1767--1775",
month = jul,
year = "2014",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2013.230",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Aug 25 07:12:16 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Huang:2014:SWC,
author = "Yi-Li Huang and Fang-Yie Leu and Ilsun You and Yao-Kuo
Sun",
title = "A secure wireless communication system integrating
{RSA}, {Diffie--Hellman} {PKDS}, intelligent
protection-key chains and a {Data Connection Core} in a
{$4$G} environment",
journal = j-J-SUPERCOMPUTING,
volume = "67",
number = "3",
pages = "635--652",
month = mar,
year = "2014",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-013-0958-z",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Mar 8 14:59:14 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=67&issue=3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-013-0958-z",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Huber:2014:TPW,
author = "Stefan Huber and Martin Held and Peter Meerwald and
Roland Kwitt",
title = "Topology-Preserving Watermarking of Vector Graphics",
journal = j-INT-J-COMPUT-GEOM-APPL,
volume = "24",
number = "1",
pages = "61--??",
month = mar,
year = "2014",
CODEN = "IJCAEV",
DOI = "https://doi.org/10.1142/S0218195914500034",
ISSN = "0218-1959",
ISSN-L = "0218-1959",
bibdate = "Wed Oct 29 06:39:33 MDT 2014",
bibsource = "http://ejournals.wspc.com.sg/ijcga/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijcga.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computational Geometry and
Applications (IJCGA)",
journal-URL = "http://www.worldscientific.com/loi/ijcga",
}
@Article{Hur:2014:SDR,
author = "Junbeom Hur and Kyungtae Kang",
title = "Secure Data Retrieval for Decentralized
Disruption-Tolerant Military Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "1",
pages = "16--26",
month = feb,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2012.2210729",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Mar 4 18:22:52 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Mobile nodes in military environments such as a
battlefield or a hostile region are likely to suffer
from intermittent network connectivity and frequent
partitions. Disruption-tolerant network (DTN)
technologies are becoming successful solutions that
allow wireless devices carried by soldiers to
communicate with each other and access the confidential
information or command reliably by exploiting external
storage nodes. Some of the most challenging issues in
this scenario are the enforcement of authorization
policies and the policies update for secure data
retrieval. Ciphertext-policy attribute-based encryption
(CP-ABE) is a promising cryptographic solution to the
access control issues. However, the problem of applying
CP-ABE in decentralized DTNs introduces several
security and privacy challenges with regard to the
attribute revocation, key escrow, and coordination of
attributes issued from different authorities. In this
paper, we propose a secure data retrieval scheme using
CP-ABE for decentralized DTNs where multiple key
authorities manage their attributes independently. We
demonstrate how to apply the proposed mechanism to
securely and efficiently manage the confidential data
distributed in the disruption-tolerant military
network.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hurlburt:2014:BBC,
author = "G. F. Hurlburt and I. Bojanova",
title = "{Bitcoin}: Benefit or Curse?",
journal = j-IT-PRO,
volume = "16",
number = "3",
pages = "10--15",
month = may,
year = "2014",
CODEN = "IPMAFM",
DOI = "https://doi.org/10.1109/MITP.2014.28",
ISSN = "1520-9202 (print), 1941-045x (electronic)",
ISSN-L = "1520-9202",
bibdate = "Thu Nov 30 15:24:52 2017",
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/virtual-machines.bib",
acknowledgement = ack-nhfb,
fjournal = "{IT} Professional",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6294",
keywords = "bitcoin crypto-currency model; bitcoin technology;
cloud; cryptocurrency; Cryptography; Data mining;
financial data processing; foreign exchange trading;
information technology; Internet of Anything; Internet
of Things; Internet/Web technologies; Market research;
mobile; mobile commerce; Mobile communication; mobile
devices; Online banking; virtual currency;
Virtualization",
}
@Article{Ioannou:2014:PKC,
author = "Lawrence M. Ioannou and Michele Mosca",
title = "Public-key cryptography based on bounded quantum
reference frames",
journal = j-THEOR-COMP-SCI,
volume = "560 (part 1)",
number = "??",
pages = "33--45",
day = "4",
month = dec,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Dec 2 19:05:23 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S030439751400694X",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Ishai:2014:PCP,
author = "Yuval Ishai and Mor Weiss",
title = "Probabilistically Checkable Proofs of Proximity with
Zero-Knowledge",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "121--145",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_6/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jiang:2014:TEA,
author = "Shaoquan Jiang",
title = "Timed encryption with application to deniable key
exchange",
journal = j-THEOR-COMP-SCI,
volume = "560 (part 2)",
number = "??",
pages = "172--189",
day = "4",
month = dec,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Dec 2 19:05:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S030439751400098X",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Jiang:2014:UIS,
author = "Shaoquan Jiang",
title = "On Unconditional $ \mu $-Security of Private Key
Encryption",
journal = j-COMP-J,
volume = "57",
number = "10",
pages = "1570--1579",
month = oct,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt097",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Sep 27 12:06:41 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/57/10/1570",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 26, 2013",
}
@Article{Jo:2014:ODE,
author = "Heeseung Jo and Seung-Tae Hong and Jae-Woo Chang and
Dong Hoon Choi",
title = "Offloading data encryption to {GPU} in database
systems",
journal = j-J-SUPERCOMPUTING,
volume = "69",
number = "1",
pages = "375--394",
month = jul,
year = "2014",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-014-1159-0",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Wed Sep 10 06:45:04 MDT 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=69&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-014-1159-0",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Juels:2014:HEE,
author = "Ari Juels and Thomas Ristenpart",
title = "Honey Encryption: Encryption beyond the Brute-Force
Barrier",
journal = j-IEEE-SEC-PRIV,
volume = "12",
number = "4",
pages = "59--62",
month = jul # "\slash " # aug,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2014.67",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Feb 11 15:40:11 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "http://www.computer.org/csdl/mags/sp/2014/04/msp2014040059-abs.html",
abstract-URL = "http://www.computer.org/csdl/mags/sp/2014/04/msp2014040059-abs.html",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Juels:2014:INC,
author = "Ari Juels and Bonnie Wong",
title = "The interplay of neuroscience and cryptography:
technical perspective",
journal = j-CACM,
volume = "57",
number = "5",
pages = "109--109",
month = may,
year = "2014",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2594446",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed May 21 10:20:12 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Kai:2014:FSD,
author = "Hiroshi Kai and Keita Ueda",
title = "Fake Shares Detection on a Visual Secret Sharing
Scheme by Rational Interpolation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "124--126",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733707",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In the visual secret sharing scheme based on
polynomial interpolation, e.g. Lin and Tsai's scheme,
fake share images may give incorrect secret
information. We propose a method to identify or detect
them using a technique by rational interpolation.",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Karpovsky:2014:DSS,
author = "M. Karpovsky and Zhen Wang",
title = "Design of Strongly Secure Communication and
Computation Channels by Nonlinear Error Detecting
Codes",
journal = j-IEEE-TRANS-COMPUT,
volume = "63",
number = "11",
pages = "2716--2728",
month = nov,
year = "2014",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2013.146",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Nov 06 07:39:04 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "channel coding; computation channels; computational
systems; Cryptography; decoding; decoding method;
device-under-attack; Encoding; encoding method; error
detection codes; error patterns; fault injection
attacks; Hamming distance; multivariate Horner scheme;
Nonlinear codes; nonlinear codes; nonlinear encoding
functions; nonlinear error detecting codes; Orbits;
reed-muller codes; Robustness; secret sharing; secure
communication; secure cryptographic devices; secure
hardware; telecommunication security; Vectors",
}
@Article{Khalil:2014:CIM,
author = "Issa Khalil and Abdallah Khreishah and Muhammad
Azeem",
title = "{Consolidated Identity Management System} for secure
mobile cloud computing",
journal = j-COMP-NET-AMSTERDAM,
volume = "65",
number = "??",
pages = "99--110",
day = "2",
month = jun,
year = "2014",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Apr 28 15:51:30 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128614001194",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Khan:2014:IPR,
author = "Abdul Nasir Khan and M. L. Mat Kiah and Sajjad A.
Madani and Mazhar Ali and Atta ur Rehman Khan and
Shahaboddin Shamshirband",
title = "Incremental proxy re-encryption scheme for mobile
cloud computing environment",
journal = j-J-SUPERCOMPUTING,
volume = "68",
number = "2",
pages = "624--651",
month = may,
year = "2014",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-013-1055-z",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Wed Sep 10 06:44:57 MDT 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=68&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-013-1055-z",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Khan:2014:MEK,
author = "Muhammad Khurram Khan and Saru Kumari and Mridul K.
Gupta",
title = "More efficient key-hash based fingerprint remote
authentication scheme using mobile device",
journal = j-COMPUTING,
volume = "96",
number = "9",
pages = "793--816",
month = sep,
year = "2014",
CODEN = "CMPTA2",
DOI = "https://doi.org/10.1007/s00607-013-0308-2",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
bibdate = "Wed Feb 11 07:42:25 MST 2015",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=96&issue=9;
https://www.math.utah.edu/pub/tex/bib/computing.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://link.springer.com/article/10.1007/s00607-013-0308-2",
acknowledgement = ack-nhfb,
fjournal = "Computing",
journal-URL = "http://link.springer.com/journal/607",
}
@Article{Kheiri:2014:CCV,
author = "Ahmed Kheiri and Ender {\"O}zcan",
title = "Constructing Constrained-Version of Magic Squares
Using Selection Hyper-heuristics",
journal = j-COMP-J,
volume = "57",
number = "3",
pages = "469--479",
month = mar,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt130",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Feb 27 14:02:47 MST 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "See correction \cite{Kheiri:2015:CCC}.",
URL = "http://comjnl.oxfordjournals.org/content/57/3/469.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 11, 2013",
}
@Article{Kifer:2014:PFM,
author = "Daniel Kifer and Ashwin Machanavajjhala",
title = "{Pufferfish}: a framework for mathematical privacy
definitions",
journal = j-TODS,
volume = "39",
number = "1",
pages = "3:1--3:??",
month = jan,
year = "2014",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/2514689",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Feb 5 11:31:16 MST 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "In this article, we introduce a new and general
privacy framework called Pufferfish. The Pufferfish
framework can be used to create new privacy definitions
that are customized to the needs of a given
application. The goal of Pufferfish is to allow experts
in an application domain, who frequently do not have
expertise in privacy, to develop rigorous privacy
definitions for their data sharing needs. In addition
to this, the Pufferfish framework can also be used to
study existing privacy definitions. We illustrate the
benefits with several applications of this privacy
framework: we use it to analyze differential privacy
and formalize a connection to attackers who believe
that the data records are independent; we use it to
create a privacy definition called hedging privacy,
which can be used to rule out attackers whose prior
beliefs are inconsistent with the data; we use the
framework to define and study the notion of composition
in a broader context than before; we show how to apply
the framework to protect unbounded continuous
attributes and aggregate information; and we show how
to use the framework to rigorously account for prior
data releases.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Database Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
}
@Article{Kim:2014:MBM,
author = "Heeseok Kim and Dong-Guk Han and Seokhie Hong and
Jaecheol Ha",
title = "Message blinding method requiring no multiplicative
inversion for {RSA}",
journal = j-TECS,
volume = "13",
number = "4",
pages = "80:1--80:??",
month = feb,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2560020",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue Mar 11 18:33:06 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "This article proposes a new message blinding methods
requiring no multiplicative inversion for RSA. Most
existing message blinding methods for RSA additionally
require the multiplicative inversion, even though
computational complexity of this operation is $ O(n^3)
$ which is equal to that of the exponentiation. Thus,
this additional operation is known to be the main
drawback of the existing message blinding methods for
RSA. In addition to requiring no additional
multiplicative inversion, our new countermeasure
provides the security against various power analysis
attacks as well as general differential power
analysis.",
acknowledgement = ack-nhfb,
articleno = "80",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
}
@Article{Kiyoshima:2014:CRB,
author = "Susumu Kiyoshima and Yoshifumi Manabe and Tatsuaki
Okamoto",
title = "Constant-Round Black-Box Construction of Composable
Multi-Party Computation Protocol",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "343--367",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lago-Fernandez:2014:NAA,
author = "J. Lago-Fern{\'a}ndez and F. Gil-Casti{\~n}eira and F.
J. Gonz{\'a}lez-Casta{\~n}o and A.
Rom{\'a}n-Portabales",
title = "A new approach to authenticating and encrypting {Voice
over Internet Protocol} communications",
journal = j-SPE,
volume = "44",
number = "5",
pages = "593--619",
month = may,
year = "2014",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.2175",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Wed Sep 10 05:57:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "12 Dec 2012",
}
@Article{Lallie:2014:PCM,
author = "Harjinder Singh Lallie",
title = "The Problems and Challenges of Managing Crowd Sourced
Audio-Visual Evidence",
journal = j-FUTURE-INTERNET,
volume = "6",
number = "2",
pages = "190--202",
day = "01",
month = apr,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi6020190",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:51 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/6/2/190",
abstract = "A number of recent incidents, such as the Stanley Cup
Riots, the uprisings in the Middle East and the London
riots have demonstrated the value of crowd sourced
audio-visual evidence wherein citizens submit
audio-visual footage captured on mobile phones and
other devices to aid governmental institutions,
responder agencies and law enforcement authorities to
confirm the authenticity of incidents and, in the case
of criminal activity, to identify perpetrators. The use
of such evidence can present a significant logistical
challenge to investigators, particularly because of the
potential size of data gathered through such mechanisms
and the added problems of time-lining disparate sources
of evidence and, subsequently, investigating the
incident(s). In this paper we explore this problem and,
in particular, outline the pressure points for an
investigator. We identify and explore a number of
particular problems related to the secure receipt of
the evidence, imaging, tagging and then time-lining the
evidence, and the problem of identifying duplicate and
near duplicate items of audio-visual evidence.",
acknowledgement = ack-nhfb,
remark = "Special Issue Contemporary and Future Digital
Forensics.",
}
@Article{Laszka:2014:STC,
author = "Aron Laszka and Benjamin Johnson and Pascal
Sch{\"o}ttle and Jens Grossklags and Rainer B{\"o}hme",
title = "Secure Team Composition to Thwart Insider Threats and
Cyber-Espionage",
journal = j-TOIT,
volume = "14",
number = "2--3",
pages = "19:1--19:??",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2663499",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Tue Oct 28 17:00:43 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We develop a formal nondeterministic game model for
secure team composition to counter cyber-espionage and
to protect organizational secrets against an attacker
who tries to sidestep technical security mechanisms by
offering a bribe to a project team member. The game
captures the adversarial interaction between the
attacker and the project manager who has a secret she
wants to protect but must share with a team of
individuals selected from within her organization. Our
interdisciplinary work is important in the face of the
multipronged approaches utilized by well-motivated
attackers to circumvent the fortifications of otherwise
well-defended targets.",
acknowledgement = ack-nhfb,
articleno = "19",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Le:2014:IMX,
author = "Duc-Phong Le and Chik How Tan",
title = "Improved {Miller}'s Algorithm for Computing Pairings
on {Edwards} Curves",
journal = j-IEEE-TRANS-COMPUT,
volume = "63",
number = "10",
pages = "2626--2632",
month = oct,
year = "2014",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2013.125",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Nov 06 07:29:34 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "curve pairing computation; Edwards curves; elliptic
curve cryptography; embedding degree; group law
operation; Miller algorithm; Miller's algorithm;
pairing computation; pairing-based cryptography;
pairing-based cryptosystems; pairing-friendly elliptic
curves; public key cryptography; scalar
multiplications; Tate pairings; Weierstrass curve; Weil
pairings; Weil/Tate pairings",
}
@Article{Lee:2014:NDH,
author = "Ya-Lin Lee and Wen-Hsiang Tsai",
title = "A new data hiding method via revision history records
on collaborative writing platforms",
journal = j-TOMCCAP,
volume = "10",
number = "2",
pages = "20:1--20:??",
month = feb,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2534408",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Mar 13 07:37:57 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "A new data hiding method via collaboratively-written
articles with forged revision history records on
collaborative writing platforms is proposed. The hidden
message is camouflaged as a stego-document consisting
of a stego-article and a revision history created
through a simulated process of collaborative writing.
The revisions are forged using a database constructed
by mining word sequences used in real cases from an
English Wikipedia XML dump. Four characteristics of
article revisions are identified and utilized to embed
secret messages, including the author of each revision,
the number of corrected word sequences, the content of
the corrected word sequences, and the word sequences
replacing the corrected ones. Related problems arising
in utilizing these characteristics for data hiding are
identified and solved skillfully, resulting in an
effective multiway method for hiding secret messages
into the revision history. To create more realistic
revisions, Huffman coding based on the word sequence
frequencies collected from Wikipedia is applied to
encode the word sequences. Good experimental results
show the feasibility of the proposed method.",
acknowledgement = ack-nhfb,
articleno = "20",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Lee:2014:SPB,
author = "Jooyoung Lee and Daesung Kwon",
title = "Security of permutation-based compression function
{\tt lp231}",
journal = j-INFO-PROC-LETT,
volume = "114",
number = "7",
pages = "372--381",
month = jul,
year = "2014",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri Mar 21 18:32:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019014000325",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Li:2014:ARM,
author = "Cai Li and Jiankun Hu",
title = "Attacks via record multiplicity on cancelable
biometrics templates",
journal = j-CCPE,
volume = "26",
number = "8",
pages = "1593--1605",
day = "10",
month = jun,
year = "2014",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3042",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Fri May 30 08:55:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "30 Apr 2013",
}
@Article{Li:2014:EMK,
author = "Ruixuan Li and Zhiyong Xu and Wanshang Kang and Kin
Choong Yow and Cheng-Zhong Xu",
title = "Efficient multi-keyword ranked query over encrypted
data in cloud computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "30",
number = "??",
pages = "179--190",
month = jan,
year = "2014",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Dec 2 16:57:46 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib;
http://www.sciencedirect.com/science/journal/0167739X",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1300143X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Li:2014:IBD,
author = "Fagen Li and Pan Xiong and Chunhua Jin",
title = "Identity-based deniable authentication for ad hoc
networks",
journal = j-COMPUTING,
volume = "96",
number = "9",
pages = "843--853",
month = sep,
year = "2014",
CODEN = "CMPTA2",
DOI = "https://doi.org/10.1007/s00607-013-0321-5",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
bibdate = "Wed Feb 11 07:42:25 MST 2015",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=96&issue=9;
https://www.math.utah.edu/pub/tex/bib/computing.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://link.springer.com/article/10.1007/s00607-013-0321-5",
acknowledgement = ack-nhfb,
fjournal = "Computing",
journal-URL = "http://link.springer.com/journal/607",
}
@Article{Li:2014:PSC,
author = "Jiguo Li and Haiting Du and Yichen Zhang and Tao Li
and Yuexin Zhang",
title = "Provably secure certificate-based key-insulated
signature scheme",
journal = j-CCPE,
volume = "26",
number = "8",
pages = "1546--1560",
day = "10",
month = jun,
year = "2014",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3019",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Fri May 30 08:55:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "8 Apr 2013",
}
@Article{Li:2014:SCA,
author = "Peng Li and Debin Gao and Michael K. Reiter",
title = "{StopWatch}: a Cloud Architecture for Timing Channel
Mitigation",
journal = j-TISSEC,
volume = "17",
number = "2",
pages = "8:1--8:??",
month = nov,
year = "2014",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2670940",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Nov 19 12:26:42 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "This article presents StopWatch, a system that defends
against timing-based side-channel attacks that arise
from coresidency of victims and attackers in
infrastructure-as-a-service clouds. StopWatch
triplicates each cloud-resident guest virtual machine
(VM) and places replicas so that the three replicas of
a guest VM are coresident with nonoverlapping sets of
(replicas of) other VMs. StopWatch uses the timing of
I/O events at a VM's replicas collectively to determine
the timings observed by each one or by an external
observer, so that observable timing behaviors are
similarly likely in the absence of any other
individual, coresident VMs. We detail the design and
implementation of StopWatch in Xen, evaluate the
factors that influence its performance, demonstrate its
advantages relative to alternative defenses against
timing side channels with commodity hardware, and
address the problem of placing VM replicas in a cloud
under the constraints of StopWatch so as to still
enable adequate cloud utilization.",
acknowledgement = ack-nhfb,
articleno = "8",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Li:2014:SOA,
author = "Jin Li and Xinyi Huang and Jingwei Li and Xiaofeng
Chen and Yang Xiang",
title = "Securely Outsourcing Attribute-Based Encryption with
Checkability",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "25",
number = "8",
pages = "2201--2210",
month = aug,
year = "2014",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2013.271",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Aug 25 07:12:16 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Lian:2014:SSA,
author = "Yanling Lian and Xinyi Huang and Yi Mu",
title = "{SA$^3$}: Self-adaptive anonymous authentication for
dynamic authentication policies",
journal = j-FUT-GEN-COMP-SYS,
volume = "30",
number = "??",
pages = "133--139",
month = jan,
year = "2014",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Dec 2 16:57:46 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X13001210",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Liang:2014:CCS,
author = "Kaitai Liang and Cheng-Kang Chu and Xiao Tan and
Duncan S. Wong and Chunming Tang and Jianying Zhou",
title = "Chosen-ciphertext secure multi-hop identity-based
conditional proxy re-encryption with constant-size
ciphertexts",
journal = j-THEOR-COMP-SCI,
volume = "539",
number = "??",
pages = "87--105",
day = "19",
month = jun,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Jun 28 08:55:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514003326",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Lin:2014:IVW,
author = "Pei-Yu Lin",
title = "Imperceptible visible watermarking based on postcamera
histogram operation",
journal = j-J-SYST-SOFTW,
volume = "95",
number = "??",
pages = "194--208",
month = sep,
year = "2014",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Sep 1 11:30:59 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121214001071",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Litton:2014:TFA,
author = "James Litton",
title = "Two-factor authentication system for {Apache} and
{SSH}",
journal = j-LINUX-J,
volume = "2014",
number = "239",
pages = "4:1--4:??",
month = mar,
year = "2014",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Tue Apr 1 05:49:35 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
abstract = "Implementing a two-factor solution doesn't have to be
hard. With a little bit of ingenuity, you can implement
a simple, self-contained solution in just a few
minutes.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Liu:2014:CRA,
author = "Jingwei Liu and Zonghua Zhang and Xiaofeng Chen and
Kyung Sup Kwak",
title = "Certificateless Remote Anonymous Authentication
Schemes for Wireless Body Area Networks",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "25",
number = "2",
pages = "332--342",
month = feb,
year = "2014",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2013.145",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Aug 25 07:12:16 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Liu:2014:DAF,
author = "Hongbo Liu and Hui Wang and Yingying Chen and Dayong
Jia",
title = "Defending against Frequency-Based Attacks on
Distributed Data Storage in Wireless Networks",
journal = j-TOSN,
volume = "10",
number = "3",
pages = "49:1--49:??",
month = apr,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2594774",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Wed May 21 09:27:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "As wireless networks become more pervasive, the amount
of the wireless data is rapidly increasing. One of the
biggest challenges of wide adoption of distributed data
storage is how to store these data securely. In this
work, we study the frequency-based attack, a type of
attack that is different from previously well-studied
ones, that exploits additional adversary knowledge of
domain values and/or their exact/approximate
frequencies to crack the encrypted data. To cope with
frequency-based attacks, the straightforward 1-to-1
substitution encryption functions are not sufficient.
We propose a data encryption strategy based on 1-to- n
substitution via dividing and emulating techniques to
defend against the frequency-based attack, while
enabling efficient query evaluation over encrypted
data. We further develop two frameworks, incremental
collection and clustered collection, which are used to
defend against the global frequency-based attack when
the knowledge of the global frequency in the network is
not available. Built upon our basic encryption schemes,
we derive two mechanisms, direct emulating and dual
encryption, to handle updates on the data storage for
energy-constrained sensor nodes and wireless devices.
Our preliminary experiments with sensor nodes and
extensive simulation results show that our data
encryption strategy can achieve high security guarantee
with low overhead.",
acknowledgement = ack-nhfb,
articleno = "49",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Liu:2014:PKE,
author = "Shengli Liu and Fangguo Zhang and Kefei Chen",
title = "Public-key encryption scheme with selective opening
chosen-ciphertext security based on the {Decisional
Diffie--Hellman} assumption",
journal = j-CCPE,
volume = "26",
number = "8",
pages = "1506--1519",
day = "10",
month = jun,
year = "2014",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3021",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Fri May 30 08:55:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "18 Apr 2013",
}
@Article{Liu:2014:SCS,
author = "Bin Liu and Ralph R. Martin and Ji-Wu Huang and
Shi-Min Hu",
title = "Shapes and Cryptography: Structure Aware Visual
Cryptography",
journal = j-CGF,
volume = "33",
number = "7",
pages = "141--150",
month = oct,
year = "2014",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/cgf.12482",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Fri Feb 13 14:27:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics World",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "28 Oct 2014",
}
@Article{Lopez-Garcia:2014:PBB,
author = "Lourdes L{\'o}pez-Garc{\'\i}a and Luis J. Dominguez
Perez and Francisco Rodr{\'\i}guez-Henr{\'\i}quez",
title = "A Pairing-Based Blind Signature E-Voting Scheme",
journal = j-COMP-J,
volume = "57",
number = "10",
pages = "1460--1471",
month = oct,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt069",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Sep 27 12:06:41 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/57/10/1460",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "July 16, 2013",
}
@Article{Lu:2014:DAN,
author = "Jiqiang Lu and Wun-She Yap and Matt Henricksen and
Swee-Huay Heng",
title = "Differential attack on nine rounds of the {SEED} block
cipher",
journal = j-INFO-PROC-LETT,
volume = "114",
number = "3",
pages = "116--123",
month = mar,
year = "2014",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Dec 9 09:33:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S002001901300272X",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Lu:2014:HOM,
author = "Jiqiang Lu and Yongzhuang Wei and Jongsung Kim and
Enes Pasalic",
title = "The higher-order meet-in-the-middle attack and its
application to the {Camellia} block cipher",
journal = j-THEOR-COMP-SCI,
volume = "527",
number = "??",
pages = "102--122",
day = "27",
month = mar,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Mar 8 16:44:11 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514000802",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Lucamarini:2014:QKD,
author = "Marco Lucamarini and Stefano Mancini",
title = "Quantum key distribution using a two-way quantum
channel",
journal = j-THEOR-COMP-SCI,
volume = "560 (part 1)",
number = "??",
pages = "46--61",
day = "4",
month = dec,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Dec 2 19:05:23 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514006951",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Lukowiak:2014:CEB,
author = "Marcin Lukowiak and Stanislaw Radziszowski and James
Vallino and Christopher Wood",
title = "Cybersecurity Education: Bridging the Gap Between
Hardware and Software Domains",
journal = j-TOCE,
volume = "14",
number = "1",
pages = "2:1--2:??",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2538029",
ISSN = "1946-6226",
bibdate = "Tue Apr 1 06:15:14 MDT 2014",
bibsource = "http://www.acm.org/pubs/toce;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toce.bib",
abstract = "With the continuous growth of cyberinfrastructure
throughout modern society, the need for secure
computing and communication is more important than ever
before. As a result, there is also an increasing need
for entry-level developers who are capable of designing
and building practical solutions for systems with
stringent security requirements. This calls for careful
attention to algorithm choice and implementation
method, as well as trade-offs between hardware and
software implementations. This article describes
motivation and efforts taken by three departments at
Rochester Institute of Technology (Computer
Engineering, Computer Science, and Software
Engineering) that were focused on creating a
multidisciplinary course that integrates the
algorithmic, engineering, and practical aspects of
security as exemplified by applied cryptography. In
particular, the article presents the structure of this
new course, topics covered, lab tools and results from
the first two spring quarter offerings in 2011 and
2012.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Computing Education",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1193",
}
@Article{Luo:2014:ARP,
author = "Jia Ning Luo and Ming Hour Yang",
title = "An anonymous e-rental protocol based on {ID}-based
cryptography and {NFC}",
journal = j-J-SUPERCOMPUTING,
volume = "70",
number = "1",
pages = "31--53",
month = oct,
year = "2014",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-013-1051-3",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Fri Feb 13 12:32:14 MST 2015",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=70&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-013-1051-3",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Book{Macrakis:2014:PLS,
author = "Kristie Macrakis",
title = "Prisoners, lovers, and spies: the story of invisible
ink from {Herodotus} to {al-Qaeda}",
publisher = pub-YALE,
address = pub-YALE:adr,
pages = "xiv + 377",
year = "2014",
ISBN = "0-300-17925-1 (hardcover)",
ISBN-13 = "978-0-300-17925-5 (hardcover)",
LCCN = "Z104.5 .M33 2014",
bibdate = "Fri Nov 13 05:44:21 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/isis2010.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Writing, Invisible; History; Invisible inks;
Confidential communications; Espionage; Equipment and
supplies",
tableofcontents = "The art of love and war \\
Intrigue and inquisition \\
Confessing secrets \\
Invisible landscapes \\
Revolutionary ink \\
Magic \\
The secret-ink war \\
The United States enters the secret-ink war \\
Visible Nazis \\
The mystery of the microdot \\
Invisible spy catchers \\
Out in the cold \\
Hiding in porn sites",
}
@Article{Mahmoody:2014:PPK,
author = "Mohammad Mahmoody and Hemanta K. Maji and Manoj
Prabhakaran",
title = "On the Power of Public-Key Encryption in Secure
Computation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "240--264",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_11/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Maimut:2014:AET,
author = "Diana Maimut and Reza Reyhanitabar",
title = "Authenticated Encryption: Toward Next-Generation
Algorithms",
journal = j-IEEE-SEC-PRIV,
volume = "12",
number = "2",
pages = "70--72",
month = mar # "\slash " # apr,
year = "2014",
DOI = "https://doi.org/10.1109/MSP.2014.19",
ISSN = "1540-7993",
ISSN-L = "1540-7993",
bibdate = "Wed May 21 17:20:35 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Maity:2014:FIR,
author = "Hirak Kumar Maity and Santi P. Maity",
title = "{FPGA} implementation of reversible watermarking in
digital images using reversible contrast mapping",
journal = j-J-SYST-SOFTW,
volume = "96",
number = "??",
pages = "93--104",
month = oct,
year = "2014",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Sep 1 11:31:01 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121214001393",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Marasco:2014:SAS,
author = "Emanuela Marasco and Arun Ross",
title = "A Survey on Antispoofing Schemes for Fingerprint
Recognition Systems",
journal = j-COMP-SURV,
volume = "47",
number = "2",
pages = "28:1--28:??",
month = nov,
year = "2014",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2617756",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Nov 15 15:22:35 MST 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Several issues related to the vulnerability of
fingerprint recognition systems to attacks have been
highlighted in the biometrics literature. One such
vulnerability involves the use of artificial fingers,
where materials such as Play-Doh, silicone, and gelatin
are inscribed with fingerprint ridges. Researchers have
demonstrated that some commercial fingerprint
recognition systems can be deceived when these
artificial fingers are placed on the sensor; that is,
the system successfully processes the ensuing
fingerprint images, thereby allowing an adversary to
spoof the fingerprints of another individual. However,
at the same time, several countermeasures that
discriminate between live fingerprints and spoof
artifacts have been proposed. While some of these
antispoofing schemes are hardware based, several
software-based approaches have been proposed as well.
In this article, we review the literature and present
the state of the art in fingerprint antispoofing.",
acknowledgement = ack-nhfb,
articleno = "28",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Matsuda:2014:CCS,
author = "Takahiro Matsuda and Goichiro Hanaoka",
title = "Chosen Ciphertext Security via Point Obfuscation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "95--120",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Matsuda:2014:IBP,
author = "Takahiro Matsuda",
title = "On the Impossibility of Basing Public-Coin One-Way
Permutations on Trapdoor Permutations",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "265--290",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_12",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_12/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Micali:2014:CMS,
author = "Silvio Micali and Michael O. Rabin",
title = "Cryptography miracles, secure auctions, matching
problem verification",
journal = j-CACM,
volume = "57",
number = "2",
pages = "85--93",
month = feb,
year = "2014",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2574871",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Feb 15 18:20:04 MST 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "A solution to the persistent problem of preventing
collusion in Vickrey auctions.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Miller:2014:ADS,
author = "Andrew Miller and Michael Hicks and Jonathan Katz and
Elaine Shi",
title = "Authenticated data structures, generically",
journal = j-SIGPLAN,
volume = "49",
number = "1",
pages = "411--423",
month = jan,
year = "2014",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2578855.2535851",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Tue Mar 4 17:04:57 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
note = "POPL '14 conference proceedings.",
abstract = "An authenticated data structure (ADS) is a data
structure whose operations can be carried out by an
untrusted prover, the results of which a verifier can
efficiently check as authentic. This is done by having
the prover produce a compact proof that the verifier
can check along with each operation's result. ADSs thus
support outsourcing data maintenance and processing
tasks to untrusted servers without loss of integrity.
Past work on ADSs has focused on particular data
structures (or limited classes of data structures), one
at a time, often with support only for particular
operations. This paper presents a generic method, using
a simple extension to a ML-like functional programming
language we call \lambda o (lambda-auth), with which
one can program authenticated operations over any data
structure defined by standard type constructors,
including recursive types, sums, and products. The
programmer writes the data structure largely as usual
and it is compiled to code to be run by the prover and
verifier. Using a formalization of \lambda o we prove
that all well-typed \lambda o programs result in code
that is secure under the standard cryptographic
assumption of collision-resistant hash functions. We
have implemented \lambda o as an extension to the OCaml
compiler, and have used it to produce authenticated
versions of many interesting data structures including
binary search trees, red-black+ trees, skip lists, and
more. Performance experiments show that our approach is
efficient, giving up little compared to the
hand-optimized data structures developed previously.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
}
@Article{Minamoto:2014:BDI,
author = "Teruya Minamoto and Ryuji Ohura",
title = "A blind digital image watermarking method based on the
dyadic wavelet transform and interval arithmetic",
journal = j-APPL-MATH-COMP,
volume = "226",
number = "??",
pages = "306--319",
day = "1",
month = jan,
year = "2014",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Dec 23 09:52:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300313010850",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003/",
}
@Article{Mondal:2014:DSM,
author = "Subijit Mondal and Subhashis Maitra",
title = "Data security-modified {AES} algorithm and its
applications",
journal = j-COMP-ARCH-NEWS,
volume = "42",
number = "2",
pages = "1--8",
month = may,
year = "2014",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/2669594.2669596",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Mon Sep 15 16:43:20 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "Now a days with the rapid development of multimedia
technologies, research on safety and security are
becoming more important. Multimedia data are generated
and transmitted through the communication channels and
the wireless media. The efficiencies of encryption
based on different existing algorithms are not up to
the satisfactory limit. Hence researchers are trying to
modify the existing algorithm or even develop new
algorithms that help to increase security with a little
encryption time. Here in this paper, we have furnished
a new technology to modify the AES algorithm which
gives more security with a little encryption time and
which can be used to encrypt using 128-bit key.
Theoretical analysis on the proposed algorithm with the
existing reveals the novelty of our work. Here we have
proposed a technique to randomize the key and hidden
the key data into an encrypted digital image using the
basics concept of cryptography and also using the
concept of digital watermarking, the concept of
key-hide has also been encrypted. We have also proposed
a new technique to reposition the pixels to break the
correlation between them. So, the proposed scheme
offers a more secure and cost effective mechanism for
encryption.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Moody:2014:DMW,
author = "Oliver Moody",
title = "Death of man who cracked {Hitler}'s code",
journal = "{The Times [London]}",
day = "27",
month = mar,
year = "2014",
bibdate = "Sat Sep 20 10:37:04 2014",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.thetimes.co.uk/tto/news/uk/defence/article4046291.ece",
acknowledgement = ack-nhfb,
keywords = "Alan Turing; Enigma cipher machine; Lorenz cipher
machine",
remark = "The story begins: ``Raymond `Jerry' Roberts, the last
remaining codebreaker from a Bletchley Park team that
deciphered Hitler's messages, has died at the age of
93.''",
}
@Article{Mukhopadhyay:2014:EMP,
author = "Debapriyay Mukhopadhyay and Subhas C. Nandy",
title = "Efficient multiple-precision integer division
algorithm",
journal = j-INFO-PROC-LETT,
volume = "114",
number = "3",
pages = "152--157",
month = mar,
year = "2014",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2013.10.005",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Dec 9 09:33:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
note = "This paper provides a correction to the algorithm
presented in \cite{Huang:2005:EMP}, and also supplies a
complicated correctness proof.",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013002627",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
keywords = "computational arithmetic; cryptography; division
algorithm; normalization",
}
@Article{Naeem:2014:EIC,
author = "Ensherah A. Naeem and Mustafa M. Abd Elnaby and Naglaa
F. Soliman and Alaa M. Abbas and Osama S. Faragallah
and Noura Semary and Mohiy M. Hadhoud and Saleh A.
Alshebeili and Fathi E. Abd El-Samie",
title = "Efficient implementation of chaotic image encryption
in transform domains",
journal = j-J-SYST-SOFTW,
volume = "97",
number = "??",
pages = "118--127",
month = nov,
year = "2014",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Sep 22 07:57:58 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121214001575",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Newell:2014:NCR,
author = "Andrew Newell and Hongyi Yao and Alex Ryker and Tracey
Ho and Cristina Nita-Rotaru",
title = "Node-Capture Resilient Key Establishment in Sensor
Networks: Design Space and New Protocols",
journal = j-COMP-SURV,
volume = "47",
number = "2",
pages = "24:1--24:??",
month = nov,
year = "2014",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2636344",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Nov 15 15:22:35 MST 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Key management is required for basic security services
of confidentiality, integrity, and data source
authentication. Wireless sensor networks (WSNs) are a
challenging environment to provide such services due to
the resource constraints and the increased likelihood
of nodes to be captured. Various key management
techniques were proposed that trade off resilience to
node capture and overhead in terms of communication and
memory. We identify the main factors influencing the
design space of key management protocols for sensor
networks and describe representative protocols that
trade off the number of links established,
communication overhead, and resilience to node capture.
These trade-offs are due to using direct, pathbased, or
multipath-based communication to establish secure
links. We propose a new multipath protocol relying on
an encoding scheme tailored for WSNs and analyze the
effects of key pre-distribution on multipath key
establishment. We provide extensive simulations to
understand the trade-offs between resilience to node
compromise and communication overhead under numerous
network scenarios. This comparison highlights the
trade-offs between these vastly different key
management schemes. For the newer class of key
management schemes-multipath based-we quantify
experimentally the additional communication overhead
required for extra paths and the improvement in
resilience from using these paths.",
acknowledgement = ack-nhfb,
articleno = "24",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Nguyen:2014:DDI,
author = "Thanhvu Nguyen and Deepak Kapur and Westley Weimer and
Stephanie Forrest",
title = "{DIG}: a Dynamic Invariant Generator for Polynomial
and Array Invariants",
journal = j-TOSEM,
volume = "23",
number = "4",
pages = "30:1--30:??",
month = aug,
year = "2014",
CODEN = "ATSMER",
DOI = "https://doi.org/10.1145/2556782",
ISSN = "1049-331X (print), 1557-7392 (electronic)",
ISSN-L = "1049-331X",
bibdate = "Tue Oct 7 19:00:54 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/tosem/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosem.bib",
abstract = "This article describes and evaluates DIG, a dynamic
invariant generator that infers invariants from
observed program traces, focusing on numerical and
array variables. For numerical invariants, DIG supports
both nonlinear equalities and inequalities of arbitrary
degree defined over numerical program variables. For
array invariants, DIG generates nested relations among
multidimensional array variables. These properties are
nontrivial and challenging for current static and
dynamic invariant analysis methods. The key difference
between DIG and existing dynamic methods is its
generative technique, which infers invariants directly
from traces, instead of using traces to filter out
predefined templates. To generate accurate invariants,
DIG employs ideas and tools from the mathematical and
formal methods domains, including equation solving,
polyhedra construction, and theorem proving; for
example, DIG represents and reasons about polynomial
invariants using geometric shapes. Experimental results
on 27 mathematical algorithms and an implementation of
AES encryption provide evidence that DIG is effective
at generating invariants for these programs.",
acknowledgement = ack-nhfb,
articleno = "30",
fjournal = "ACM Transactions on Software Engineering and
Methodology",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J790",
}
@InProceedings{Nichols:2014:CSS,
author = "Tyler Nichols and Joe Pletcher and Braden Hollembaek
and Adam Bates and Dave Tian and Abdulrahman Alkhelaifi
and Kevin Butler",
editor = "????",
booktitle = "{ACM Conference on Computer and Communications
Security}",
title = "{CertShim}: Securing {SSL} certificate verification
through dynamic linking",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "??--??",
year = "2014",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 15:55:28 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 60]{Schneier:2015:SWC}.",
}
@Article{Nieto:2014:FSH,
author = "Juan Manuel Gonz{\'a}lez Nieto and Mark Manulis and
Dongdong Sun",
title = "Forward-Secure Hierarchical Predicate Encryption",
journal = j-COMP-J,
volume = "57",
number = "4",
pages = "510--536",
month = apr,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt029",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Mar 26 15:06:42 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/57/4/510.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "April 7, 2013",
}
@Article{Nikiforakis:2014:BYO,
author = "N. Nikiforakis and G. Acar",
title = "Browse at your own risk",
journal = j-IEEE-SPECTRUM,
volume = "51",
number = "8",
pages = "30--35",
month = aug,
year = "2014",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2014.6866435",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Access control; advertising data processing;
Authentication; browser fingerprinting; Browsers;
cookies; Fingerprint recognition; Internet; online
advertising network; online front-ends; Privacy;
security of data; third-party tracking",
}
@Article{Niksefat:2014:ZPP,
author = "Salman Niksefat and Babak Sadeghiyan and Payman
Mohassel and Saeed Sadeghian",
title = "{ZIDS}: a Privacy-Preserving Intrusion Detection
System Using Secure Two-Party Computation Protocols",
journal = j-COMP-J,
volume = "57",
number = "4",
pages = "494--509",
month = apr,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt019",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Mar 26 15:06:42 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/57/4/494.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "March 12, 2013",
}
@Article{Niu:2014:RDW,
author = "Pan-pan Niu and Xiang-yang Wang and Hong-ying Yang and
Pei Wang and Ai-long Wang",
title = "A Robust Digital Watermarking Based on Local Complex
Angular Radial Transform",
journal = j-FUND-INFO,
volume = "135",
number = "3",
pages = "243--268",
month = jul,
year = "2014",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2014-1121",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:19:56 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Nose:2014:SWS,
author = "Peter Nose",
title = "Security weaknesses of a signature scheme and
authenticated key agreement protocols",
journal = j-INFO-PROC-LETT,
volume = "114",
number = "3",
pages = "107--115",
month = mar,
year = "2014",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Dec 9 09:33:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013002731",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Misc{Orejel:2014:E,
author = "Jorge Luis Orejel",
title = "{ENIGMA}",
howpublished = "Web posting adapted from chapter of unpublished
textbook, \booktitle{Applied Algorithms and Data
Structures}.",
day = "20",
month = oct,
year = "2014",
bibdate = "Sat Nov 15 08:47:58 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.codeproject.com/Articles/831015/ENIGMA",
acknowledgement = ack-nhfb,
remark = "This article includes a software implementation of the
ENIGMA machine.",
}
@Article{Orlandi:2014:SCN,
author = "Claudio Orlandi and Rafail Ostrovsky and Vanishree Rao
and Amit Sahai and Ivan Visconti",
title = "Statistical Concurrent Non-malleable Zero Knowledge",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "167--191",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ortiz-Yepes:2014:BSA,
author = "D. A. Ortiz-Yepes and R. J. Hermann and H. Steinauer
and P. Buhler",
title = "Bringing strong authentication and transaction
security to the realm of mobile devices",
journal = j-IBM-JRD,
volume = "58",
number = "1",
pages = "4:1--4:11",
month = jan # "--" # feb,
year = "2014",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/JRD.2013.2287810",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Sat Feb 15 16:52:52 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Orumiehchiha:2014:PAN,
author = "Mohammad Ali Orumiehchiha and Josef Pieprzyk and Ron
Steinfeld",
title = "Practical attack on {NLM--MAC} scheme",
journal = j-INFO-PROC-LETT,
volume = "114",
number = "10",
pages = "547--550",
month = oct,
year = "2014",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Jun 28 08:47:36 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019014000696",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Pandey:2014:ACR,
author = "Omkant Pandey",
title = "Achieving Constant Round Leakage-Resilient
Zero-Knowledge",
journal = j-LECT-NOTES-COMP-SCI,
volume = "8349",
pages = "146--166",
year = "2014",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-54242-8_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 21 08:39:11 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_7/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-54242-8",
book-URL = "http://www.springerlink.com/content/978-3-642-54242-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pang:2014:PPA,
author = "Hweehwa Pang and Xuhua Ding",
title = "Privacy-Preserving Ad-Hoc Equi-Join on Outsourced
Data",
journal = j-TODS,
volume = "39",
number = "3",
pages = "23:1--23:??",
month = sep,
year = "2014",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/2629501",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Oct 7 18:54:33 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "In IT outsourcing, a user may delegate the data
storage and query processing functions to a third-party
server that is not completely trusted. This gives rise
to the need to safeguard the privacy of the database as
well as the user queries over it. In this article, we
address the problem of running ad hoc equi-join queries
directly on encrypted data in such a setting. Our
contribution is the first solution that achieves
constant complexity per pair of records that are
evaluated for the join. After formalizing the privacy
requirements pertaining to the database and user
queries, we introduce a cryptographic construct for
securely joining records across relations. The
construct protects the database with a strong
encryption scheme. Moreover, information disclosure
after executing an equi-join is kept to the
minimum-that two input records combine to form an
output record if and only if they share common join
attribute values. There is no disclosure on records
that are not part of the join result. Building on this
construct, we then present join algorithms that
optimize the join execution by eliminating the need to
match every record pair from the input relations. We
provide a detailed analysis of the cost of the
algorithms and confirm the analysis through extensive
experiments with both synthetic and benchmark
workloads. Through this evaluation, we tease out useful
insights on how to configure the join algorithms to
deliver acceptable execution time in practice.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Database Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
}
@Article{Papadopoulos:2014:LQA,
author = "Stavros Papadopoulos and Graham Cormode and Antonios
Deligiannakis and Minos Garofalakis",
title = "Lightweight Query Authentication on Streams",
journal = j-TODS,
volume = "39",
number = "4",
pages = "30:1--30:??",
month = dec,
year = "2014",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/2656336",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Jan 7 15:35:46 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "We consider a stream outsourcing setting, where a data
owner delegates the management of a set of disjoint
data streams to an untrusted server. The owner
authenticates his streams via signatures. The server
processes continuous queries on the union of the
streams for clients trusted by the owner. Along with
the results, the server sends proofs of result
correctness derived from the owner's signatures, which
are verifiable by the clients. We design novel
constructions for a collection of fundamental problems
over streams represented as linear algebraic queries.
In particular, our basic schemes authenticate dynamic
vector sums, matrix products, and dot products. These
techniques can be adapted for authenticating a wide
range of important operations in streaming
environments, including group-by queries, joins,
in-network aggregation, similarity matching, and event
processing. We also present extensions to address the
case of sliding window queries, and when multiple
clients are interested in different subsets of the
data. These methods take advantage of a novel nonce
chaining technique that we introduce, which is used to
reduce the verification cost without affecting any
other costs. All our schemes are lightweight and offer
strong cryptographic guarantees derived from formal
definitions and proofs. We experimentally confirm the
practicality of our schemes in the
performance-sensitive streaming setting.",
acknowledgement = ack-nhfb,
articleno = "30",
fjournal = "ACM Transactions on Database Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
}
@Article{Papakostas:2014:MBL,
author = "G. A. Papakostas and E. D. Tsougenis and D. E.
Koulouriotis",
title = "Moment-based local image watermarking via genetic
optimization",
journal = j-APPL-MATH-COMP,
volume = "227",
number = "??",
pages = "222--236",
day = "15",
month = jan,
year = "2014",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jan 27 18:25:32 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300313012046",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003/",
}
@Article{Park:2014:FRI,
author = "Jeong Soo Park and Ki Seok Bae and Yong Je Choi and
Doo Ho Choi",
title = "A fault-resistant implementation of {AES} using
differential bytes between input and output",
journal = j-J-SUPERCOMPUTING,
volume = "67",
number = "3",
pages = "615--634",
month = mar,
year = "2014",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-013-0950-7",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Mar 8 14:59:14 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=67&issue=3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-013-0950-7",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Permpoontanalarp:2014:FTG,
author = "Yongyuth Permpoontanalarp and Panupong Sornkhom",
title = "On-the-fly Trace Generation Approach to the Security
Analysis of Cryptographic Protocols: Coloured {Petri}
Nets-based Method",
journal = j-FUND-INFO,
volume = "130",
number = "4",
pages = "423--466",
month = oct,
year = "2014",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2014-999",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:18:29 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Powers:2014:OSCa,
author = "Shawn Powers",
title = "The open-source classroom: encrypting your cat
photos",
journal = j-LINUX-J,
volume = "2014",
number = "237",
pages = "8:1--8:??",
month = jan,
year = "2014",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Feb 6 07:16:21 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
acknowledgement = ack-nhfb,
articleno = "8",
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Premnath:2014:EHR,
author = "Sriram Nandha Premnath and Jessica Croft and Neal
Patwari and Sneha Kumar Kasera",
title = "Efficient High-Rate Secret Key Extraction in Wireless
Sensor Networks Using Collaboration",
journal = j-TOSN,
volume = "11",
number = "1",
pages = "2:1--2:??",
month = aug,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2541289",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Tue Aug 26 18:16:52 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Secret key establishment is a fundamental requirement
for private communication between two entities. In this
article, we propose and evaluate a new approach for
secret key extraction where multiple sensors
collaborate in exchanging probe packets and collecting
channel measurements. Essentially, measurements from
multiple channels have a substantially higher
differential entropy compared to the measurements from
a single channel, thereby resulting in more randomness
in the information source for key extraction, and this
in turn produces stronger secret keys. We also explore
the fundamental trade-off between the quadratic
increase in the number of measurements of the channels
due to multiple nodes per group versus a linear
reduction in the sampling rate and a linear increase in
the time gap between bidirectional measurements. To
experimentally evaluate collaborative secret key
extraction in wireless sensor networks, we first build
a simple yet flexible testbed with multiple TelosB
sensor nodes. Next, we perform large-scale experiments
with different configurations of collaboration. Our
experiments show that in comparison to the $ 1 \times 1
$ configuration, collaboration among sensor nodes
significantly increases the secret bit extraction per
second, per probe, as well as per millijoule of
transmission energy. In addition, we show that the
collaborating nodes can improve the performance further
when they exploit both space and frequency
diversities.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Pun:2014:GIT,
author = "Chi-Man Pun and Ka-Cheng Choi",
title = "Generalized integer transform based reversible
watermarking algorithm using efficient location map
encoding and adaptive thresholding",
journal = j-COMPUTING,
volume = "96",
number = "10",
pages = "951--973",
month = oct,
year = "2014",
CODEN = "CMPTA2",
DOI = "https://doi.org/10.1007/s00607-013-0357-6",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
bibdate = "Wed Feb 11 07:42:25 MST 2015",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=96&issue=10;
https://www.math.utah.edu/pub/tex/bib/computing.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://link.springer.com/article/10.1007/s00607-013-0357-6",
acknowledgement = ack-nhfb,
fjournal = "Computing",
journal-URL = "http://link.springer.com/journal/607",
}
@Article{Qian:2014:IAF,
author = "Zhenxing Qian and Xinpeng Zhang",
title = "Improved anti-forensics of {JPEG} compression",
journal = j-J-SYST-SOFTW,
volume = "91",
number = "??",
pages = "100--108",
month = may,
year = "2014",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2013.12.043",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri Mar 14 17:00:13 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121214000168",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Rankin:2014:HEY,
author = "Kyle Rankin",
title = "Hack and \slash: encrypt your dog ({Mutt} and {GPG})",
journal = j-LINUX-J,
volume = "2014",
number = "242",
pages = "7:1--7:??",
month = jun,
year = "2014",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Wed Jul 9 16:16:00 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Ren:2014:HHM,
author = "Jian Ren and Jie Wu and Yun Li and Jian Li",
title = "Hop-by-Hop Message Authentication and Source Privacy
in Wireless Sensor Networks",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "25",
number = "5",
pages = "1223--1232",
month = may,
year = "2014",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2013.119",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Aug 25 07:12:16 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@TechReport{Rivest:2014:SSR,
author = "Ronald L. Rivest and Jacob C. N. Schuldt",
title = "{Spritz} ---- a spongy {RC4}-like stream cipher and
hash function",
type = "Report",
institution = "MIT CSAIL and Research Institute for Secure Systems",
address = "Cambridge, MA 02139, USA and AIST, Japan",
pages = "30",
day = "27",
month = oct,
year = "2014",
bibdate = "Sat Nov 15 08:26:10 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://people.csail.mit.edu/rivest/pubs/RS14.pdf",
abstract = "This note reconsiders the design of the stream cipher
RC4, and proposes an improved variant, which we call
`Spritz' (since the output comes in fine drops rather
than big blocks.)\par
Our work leverages the considerable cryptanalytic work
done on the original RC4 and its proposed variants. It
also uses simulations extensively to search for biases
and to guide the selection of intermediate
expressions.\par
We estimate that Spritz can produce output with about
24 cycles/byte of computation. Furthermore, our
statistical tests suggest that about $ 2^{81} $ bytes
of output are needed before one can reasonably
distinguish Spritz output from random output; this is a
marked improvement over RC4.\par
In addition, we formulate Spritz as a `sponge (or
sponge-like) function,' [5], which can Absorb new data
at any time, and from which one can Squeeze
pseudorandom output sequences of arbitrary length.
Spritz can thus be easily adapted for use as a
cryptographic hash function, an encryption algorithm,
or a message-authentication code generator. (However,
in hash-function mode, Spritz is rather slow.)",
acknowledgement = ack-nhfb,
keywords = "Absorb; cryptographic hash function; encryption;
message authentication code; RC4; sponge function;
Spritz; Squeeze; stream cipher",
}
@Article{Ruj:2014:DAC,
author = "Sushmita Ruj and Milos Stojmenovic and Amiya Nayak",
title = "Decentralized Access Control with Anonymous
Authentication of Data Stored in Clouds",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "25",
number = "2",
pages = "384--394",
month = feb,
year = "2014",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2013.38",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Aug 25 07:12:16 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Book{Sacco:2014:MC,
author = "Luigi Sacco",
title = "Manuale di crittografia. ({Italian}) [{Manual} of
cryptography]",
publisher = "Apogeo",
address = "Milano, Italia",
edition = "Fourth",
pages = "????",
year = "2014",
bibdate = "Tue Dec 26 07:04:56 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
language = "Italian",
}
@Article{Safkhani:2014:CCA,
author = "Masoumeh Safkhani and Pedro Peris-Lopez and Julio
Cesar Hernandez-Castro and Nasour Bagheri",
title = "Cryptanalysis of the {Cho et al.} protocol: a
hash-based {RFID} tag mutual authentication protocol",
journal = j-J-COMPUT-APPL-MATH,
volume = "259 (part B)",
number = "??",
pages = "571--577",
day = "15",
month = mar,
year = "2014",
CODEN = "JCAMDI",
DOI = "https://doi.org/10.1016/j.cam.2013.09.073",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:34:02 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2010.bib",
note = "See \cite{Cho:2012:CBF}.",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042713005281",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@Article{Sahillioglu:2014:SCM,
author = "Y. Sahillio{\u{g}}lu and Y. Yemez",
title = "Shapes and Cryptography: Multiple Shape Correspondence
by Dynamic Programming",
journal = j-CGF,
volume = "33",
number = "7",
pages = "121--130",
month = oct,
year = "2014",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/cgf.12480",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Fri Feb 13 14:27:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics World",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "28 Oct 2014",
}
@Article{Sakalli:2014:ACC,
author = "Muharrem Tolga Sakalli and Bora Aslan",
title = "On the algebraic construction of cryptographically
good $ 32 \times 32 $ binary linear transformations",
journal = j-J-COMPUT-APPL-MATH,
volume = "259 (part B)",
number = "??",
pages = "485--494",
day = "15",
month = mar,
year = "2014",
CODEN = "JCAMDI",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:34:02 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042713002719",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@Article{Santos:2014:ACD,
author = "Ricardo Jorge Santos and Jorge Bernardino and Marco
Vieira",
title = "Approaches and Challenges in Database Intrusion
Detection",
journal = j-SIGMOD,
volume = "43",
number = "3",
pages = "36--47",
month = sep,
year = "2014",
CODEN = "SRECD8",
DOI = "https://doi.org/10.1145/2694428.2694435",
ISSN = "0163-5808 (print), 1943-5835 (electronic)",
ISSN-L = "0163-5808",
bibdate = "Thu Dec 4 17:09:38 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigmod.bib",
abstract = "Databases often support enterprise business and store
its secrets. This means that securing them from data
damage and information leakage is critical. In order to
deal with intrusions against database systems, Database
Intrusion Detection Systems (DIDS) are frequently used.
This paper presents a survey on the main database
intrusion detection techniques currently available and
discusses the issues concerning their application at
the database server layer. The identified weak spots
show that most DIDS inadequately deal with many
characteristics of specific database systems, such as
ad hoc workloads and alert management issues in data
warehousing environments, for example. Based on this
analysis, research challenges are presented, and
requirements and guidelines for the design of new or
improved DIDS are proposed. The main finding is that
the development and benchmarking of specifically
tailored DIDS for the context in which they operate is
a relevant issue, and remains a challenge. We trust
this work provides a strong incentive to open the
discussion between both the security and database
research communities.",
acknowledgement = ack-nhfb,
fjournal = "SIGMOD Record (ACM Special Interest Group on
Management of Data)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J689",
}
@Article{Sarkar:2014:PEK,
author = "Santanu Sarkar",
title = "Proving empirical key-correlations in {RC4}",
journal = j-INFO-PROC-LETT,
volume = "114",
number = "5",
pages = "234--238",
month = may,
year = "2014",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Jan 28 08:23:05 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019014000039",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Savas:2014:SMQ,
author = "Erkay Savas and Serdar Suer Erdem and Kazim Yumbul",
title = "On Selection of Modulus of Quadratic Codes for the
Protection of Cryptographic Operations against Fault
Attacks",
journal = j-IEEE-TRANS-COMPUT,
volume = "63",
number = "5",
pages = "1182--1196",
month = may,
year = "2014",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2012.236",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Aug 25 08:24:32 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Scarani:2014:BPQ,
author = "Valerio Scarani and Christian Kurtsiefer",
title = "The black paper of quantum cryptography: Real
implementation problems",
journal = j-THEOR-COMP-SCI,
volume = "560 (part 1)",
number = "??",
pages = "27--32",
day = "4",
month = dec,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Dec 2 19:05:23 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514006938",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Schillewaert:2014:CCA,
author = "Jeroen Schillewaert and Koen Thas",
title = "Construction and Comparison of Authentication Codes",
journal = j-SIAM-J-DISCR-MATH,
volume = "28",
number = "1",
pages = "474--489",
month = "????",
year = "2014",
CODEN = "SJDMEC",
DOI = "https://doi.org/10.1137/130920988",
ISSN = "0895-4801 (print), 1095-7146 (electronic)",
ISSN-L = "0895-4801",
bibdate = "Thu Feb 12 07:10:09 MST 2015",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SIDMA/28/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/siamjdiscrmath.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Discrete Mathematics",
journal-URL = "http://epubs.siam.org/sidma",
onlinedate = "January 2014",
}
@Article{Seo:2014:RHI,
author = "Jae Hong Seo and Keita Emura",
title = "Revocable hierarchical identity-based encryption",
journal = j-THEOR-COMP-SCI,
volume = "542",
number = "??",
pages = "44--62",
day = "3",
month = jul,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Jun 28 08:55:53 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514003363",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Seyedzadeh:2014:RCI,
author = "Seyed Mohammad Seyedzadeh and Benyamin Norouzi and
Sattar Mirzakuchaki",
title = "{RGB} color image encryption based on {Choquet} fuzzy
integral",
journal = j-J-SYST-SOFTW,
volume = "97",
number = "??",
pages = "128--139",
month = nov,
year = "2014",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Sep 22 07:57:58 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121214001563",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Shakiba:2014:CCI,
author = "Mohsen Shakiba and Mohammad Dakhilalian and Hamid
Mala",
title = "On computational complexity of impossible differential
cryptanalysis",
journal = j-INFO-PROC-LETT,
volume = "114",
number = "5",
pages = "252--255",
month = may,
year = "2014",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Jan 28 08:23:05 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013003116",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Shen:2014:ERC,
author = "Limin Shen and Futai Zhang and Yinxia Sun",
title = "Efficient Revocable Certificateless Encryption Secure
in the Standard Model",
journal = j-COMP-J,
volume = "57",
number = "4",
pages = "592--601",
month = apr,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt040",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Mar 26 15:06:42 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/57/4/592.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "April 30, 2013",
}
@Article{Shen:2014:LES,
author = "Xuemin Shen",
title = "A Lightweight Encryption Scheme for Network-Coded
Mobile Ad Hoc Networks",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "25",
number = "9",
pages = "2211--2221",
month = sep,
year = "2014",
CODEN = "ITDSEO",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Feb 12 13:58:32 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://www.computer.org/csdl/trans/td/2014/09/06559980-abs.html",
abstract-URL = "http://www.computer.org/csdl/trans/td/2014/09/06559980-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Shmueli:2014:IDE,
author = "Erez Shmueli and Ronen Vaisenberg and Ehud Gudes and
Yuval Elovici",
title = "Implementing a database encryption solution, design
and implementation issues",
journal = j-COMPUT-SECUR,
volume = "44",
number = "??",
pages = "33--50",
month = jul,
year = "2014",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:38 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404814000509",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Shu:2014:DAS,
author = "Yuanchao Shu and Yu Jason Gu and Jiming Chen",
title = "Dynamic Authentication with Sensory Information for
the Access Control Systems",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "25",
number = "2",
pages = "427--436",
month = feb,
year = "2014",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2013.153",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Aug 25 07:12:16 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Sipiran:2014:SCA,
author = "Ivan Sipiran and Robert Gregor and Tobias Schreck",
title = "Shapes and Cryptography: Approximate Symmetry
Detection in Partial {$3$D} Meshes",
journal = j-CGF,
volume = "33",
number = "7",
pages = "131--140",
month = oct,
year = "2014",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/cgf.12481",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Fri Feb 13 14:27:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics World",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "28 Oct 2014",
}
@Article{Sirivianos:2014:LSF,
author = "Michael Sirivianos and Kyungbaek Kim and Jian Wei Gan
and Xiaowei Yang",
title = "Leveraging Social Feedback to Verify Online Identity
Claims",
journal = j-TWEB,
volume = "8",
number = "2",
pages = "9:1--9:??",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2543711",
ISSN = "1559-1131 (print), 1559-114X (electronic)",
ISSN-L = "1559-1131",
bibdate = "Tue Apr 1 05:42:19 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tweb.bib",
abstract = "Anonymity is one of the main virtues of the Internet,
as it protects privacy and enables users to express
opinions more freely. However, anonymity hinders the
assessment of the veracity of assertions that online
users make about their identity attributes, such as age
or profession. We propose FaceTrust, a system that uses
online social networks to provide lightweight identity
credentials while preserving a user's anonymity.
FaceTrust employs a ``game with a purpose'' design to
elicit the opinions of the friends of a user about the
user's self-claimed identity attributes, and uses
attack-resistant trust inference to assign veracity
scores to identity attribute assertions. FaceTrust
provides credentials, which a user can use to
corroborate his assertions. We evaluate our proposal
using a live Facebook deployment and simulations on a
crawled social graph. The results show that our
veracity scores are strongly correlated with the ground
truth, even when dishonest users make up a large
fraction of the social network and employ the Sybil
attack.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on the Web (TWEB)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1062",
}
@Article{Soupionis:2014:GTA,
author = "Yannis Soupionis and Remous-Aris Koutsiamanis and
Pavlos Efraimidis and Dimitris Gritzalis",
title = "A game-theoretic analysis of preventing spam over
{Internet Telephony} via audio {CAPTCHA}-based
authentication",
journal = j-J-COMP-SECUR,
volume = "22",
number = "3",
pages = "383--413",
month = "????",
year = "2014",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-140496",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:26:16 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Staff:2014:KYS,
author = "{CACM Staff}",
title = "Know your steganographic enemy",
journal = j-CACM,
volume = "57",
number = "5",
pages = "8--8",
month = may,
year = "2014",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2601402",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed May 21 10:20:12 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Stankovski:2014:CFE,
author = "Tomislav Stankovski and Peter V. E. McClintock and
Aneta Stefanovska",
title = "Coupling Functions Enable Secure Communications",
journal = j-PHYS-REV-X,
volume = "4",
number = "1",
pages = "011026",
month = feb,
year = "2014",
CODEN = "PRXHAE",
DOI = "https://doi.org/10.1103/PhysRevX.4.011026",
ISSN = "2160-3308",
bibdate = "Fri Apr 4 18:43:06 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://link.aps.org/doi/10.1103/PhysRevX.4.011026;
http://www.rdmag.com/news/2014/04/unbreakable-security-codes-inspired-nature",
acknowledgement = ack-nhfb,
fjournal = "Physical Review X",
journal-URL = "http://prx.aps.org/browse",
keywords = "secure encryption",
numpages = "9",
xxjournal-url = "http://journals.aps.org/prx/",
}
@Article{Stanton:2014:BRB,
author = "Jeffrey M. Stanton and Ben Rothke",
title = "Book Reviews: {{\booktitle{Burdens of Proof:
Cryptographic Culture and Evidence Law in the Age of
Electronic Documents}} --- by Jean-Fran{\c{c}}ois
Blanchette}",
journal = j-J-ASSOC-INF-SCI-TECHNOL,
volume = "65",
number = "7",
pages = "1509--1510",
month = jul,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1002/asi.23137",
ISSN = "2330-1643 (print), 2330-1643 (electronic)",
ISSN-L = "2330-1643",
bibdate = "Fri Sep 11 12:15:13 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jaist.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the Association for Information Science and
Technology",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2330-1643",
onlinedate = "26 Feb 2014",
}
@Article{Sui:2014:DAH,
author = "Yan Sui and Xukai Zou and Eliza Y. Du and Feng Li",
title = "Design and Analysis of a Highly User-Friendly, Secure,
Privacy-Preserving, and Revocable Authentication
Method",
journal = j-IEEE-TRANS-COMPUT,
volume = "63",
number = "4",
pages = "902--916",
month = apr,
year = "2014",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2013.25",
ISSN = "0018-9340",
ISSN-L = "0018-9340",
bibdate = "Sat Apr 19 10:40:35 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Svozil:2014:NCC,
author = "Karl Svozil",
title = "Non-contextual chocolate balls versus value indefinite
quantum cryptography",
journal = j-THEOR-COMP-SCI,
volume = "560 (part 1)",
number = "??",
pages = "82--90",
day = "4",
month = dec,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Dec 2 19:05:23 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514006975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Syta:2014:SAA,
author = "Ewa Syta and Henry Corrigan-Gibbs and Shu-Chun Weng
and David Wolinsky and Bryan Ford and Aaron Johnson",
title = "Security Analysis of Accountable Anonymity in
{Dissent}",
journal = j-TISSEC,
volume = "17",
number = "1",
pages = "4:1--4:??",
month = aug,
year = "2014",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2629621",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Aug 11 19:17:17 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "Users often wish to communicate anonymously on the
Internet, for example, in group discussion or instant
messaging forums. Existing solutions are vulnerable to
misbehaving users, however, who may abuse their
anonymity to disrupt communication. Dining
Cryptographers Networks (DC-nets) leave groups
vulnerable to denial-of-service and Sybil attacks; mix
networks are difficult to protect against traffic
analysis; and accountable voting schemes are unsuited
to general anonymous messaging. Dissent is the first
general protocol offering provable anonymity and
accountability for moderate-size groups, while
efficiently handling unbalanced communication demands
among users. We present an improved and hardened
dissent protocol, define its precise security
properties, and offer rigorous proofs of these
properties. The improved protocol systematically
addresses the delicate balance between provably hiding
the identities of well-behaved users, while provably
revealing the identities of disruptive users, a
challenging task because many forms of misbehavior are
inherently undetectable. The new protocol also
addresses several nontrivial attacks on the original
dissent protocol stemming from subtle design flaws.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Tang:2014:PAB,
author = "Ming Tang and Zhenlong Qiu and Weijie Li and Weijin
Sun and Xiaobo Hu and Huanguo Zhang",
title = "Power analysis based reverse engineering on the secret
round function of block ciphers",
journal = j-CCPE,
volume = "26",
number = "8",
pages = "1531--1545",
day = "10",
month = jun,
year = "2014",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3068",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Fri May 30 08:55:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "20 Jun 2013",
}
@Article{Tao:2014:CFS,
author = "Jia Tao and Giora Slutzki and Vasant Honavar",
title = "A Conceptual Framework for Secrecy-preserving
Reasoning in Knowledge Bases",
journal = j-TOCL,
volume = "16",
number = "1",
pages = "3:1--3:??",
month = dec,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2637477",
ISSN = "1529-3785 (print), 1557-945X (electronic)",
ISSN-L = "1529-3785",
bibdate = "Fri Mar 6 10:01:34 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/tocl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tocl.bib",
abstract = "In many applications, Knowledge Bases (KBs) contain
confidential or private information (secrets). The KB
should be able to use this secret information in its
reasoning process but in answering user queries care
must be exercised so that secrets are not revealed to
unauthorized users. We consider this problem under the
Open World Assumption (OWA) in a setting with multiple
querying agents $ M_1 $, \ldots{}, $ M_m $ that can
pose queries against the KB K and selectively share
answers that they receive from K with one or more other
querying agents. We assume that for each $ M_i $, the
KB has a prespecified set of secrets $ S_i $ that need
to be protected from $ M_i $. Communication between
querying agents is modeled by a communication graph, a
directed graph with self-loops. We introduce a general
framework and propose an approach to secrecy-preserving
query answering based on sound and complete proof
systems. The idea is to hide the truthful answer from a
querying agent $ M_i $ by feigning ignorance without
lying (i.e., to provide the answer `Unknown' to a query
$q$ if it needs to be protected). Under the OWA, a
querying agent cannot distinguish between the case that
$q$ is being protected (for reasons of secrecy) and the
case that it cannot be inferred from K. In the
pre-query stage we compute a set of envelopes $ E_1$,
\ldots{}, $ E_m$ (restricted to a finite subset of the
set of formulae that are entailed by K) so that $ S_i
\subseteq E_i$, and a query \alpha posed by agent $
M_i$ can be answered truthfully whenever $ \alpha \not
\in E_i$ and $ \isonot \alpha \not \in E_i$. After the
pre-query stage, the envelope is updated as needed. We
illustrate this approach with two simple cases: the
Propositional Horn KBs and the Description Logic AL
KBs.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Computational Logic",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J773",
}
@Article{Tariq:2014:SBL,
author = "Muhammad Adnan Tariq and Boris Koldehofe and Kurt
Rothermel",
title = "Securing Broker-Less Publish\slash Subscribe Systems
Using Identity-Based Encryption",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "25",
number = "2",
pages = "518--528",
month = feb,
year = "2014",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2013.256",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Aug 25 07:12:16 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Taylor:2014:WSE,
author = "Dave Taylor",
title = "Work the shell: easy watermarking with {ImageMagick}",
journal = j-LINUX-J,
volume = "2014",
number = "237",
pages = "6:1--6:??",
month = jan,
year = "2014",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Feb 6 07:16:21 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Thabit:2014:RRW,
author = "Rasha Thabit and Bee Ee Khoo",
title = "Robust reversible watermarking scheme using {Slantlet}
transform matrix",
journal = j-J-SYST-SOFTW,
volume = "88",
number = "??",
pages = "74--86",
month = feb,
year = "2014",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Jan 27 19:15:03 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121213002380",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Tian:2014:DFS,
author = "Haibo Tian and Xiaofeng Chen and Willy Susilo",
title = "Deniability and forward secrecy of one-round
authenticated key exchange",
journal = j-J-SUPERCOMPUTING,
volume = "67",
number = "3",
pages = "671--690",
month = mar,
year = "2014",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-013-0968-x",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Mar 8 14:59:14 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=67&issue=3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-013-0968-x",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Tiplea:2014:NSC,
author = "Ferucio Laurentiu Tiplea and Constantin Catalin
Dragan",
title = "A necessary and sufficient condition for the
asymptotic idealness of the {GRS} threshold secret
sharing scheme",
journal = j-INFO-PROC-LETT,
volume = "114",
number = "6",
pages = "299--303",
month = jun,
year = "2014",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri Feb 28 07:46:24 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019014000179",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Toxen:2014:NSS,
author = "Bob Toxen",
title = "The {NSA} and {Snowden}: securing the all-seeing eye",
journal = j-CACM,
volume = "57",
number = "5",
pages = "44--51",
month = may,
year = "2014",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2594502",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed May 21 10:20:12 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "How good security at the NSA could have stopped him.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Tripunitara:2014:CKM,
author = "Mahesh V. Tripunitara and Jeffrey Lok Tin Woo",
title = "Composing {Kerberos} and {Multimedia Internet KEYing
(MIKEY)} for Authenticated Transport of Group Keys",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "25",
number = "4",
pages = "898--907",
month = apr,
year = "2014",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2013.81",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Aug 25 07:12:16 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/tpds/archives.htm",
}
@Article{Tu:2014:EPB,
author = "Hang Tu and Neeraj Kumar and Debiao He and Jongsung
Kim",
title = "An efficient password-based three-party authenticated
multiple key exchange protocol for wireless mobile
networks",
journal = j-J-SUPERCOMPUTING,
volume = "70",
number = "1",
pages = "224--235",
month = oct,
year = "2014",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-014-1198-6",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Fri Feb 13 12:32:14 MST 2015",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=70&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-014-1198-6",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Misc{VenafiLabs:2014:VLQ,
author = "{Venafi Labs}",
title = "{Venafi Labs Q3 Heartbleed} threat research analysis",
howpublished = "Web site.",
year = "2014",
bibdate = "Mon Mar 09 15:46:39 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.venafi.com/assets/pdf/wp/Venafi_Labs_Q3_Heartbleed_Threat_Research_Analysis.pdf",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 51]{Schneier:2015:SWC}.",
}
@Article{Viennot:2014:MSG,
author = "Nicolas Viennot and Edward Garcia and Jason Nieh",
title = "A measurement study of {Google Play}",
journal = j-SIGMETRICS,
volume = "42",
number = "1",
pages = "221--233",
month = jun,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2637364.2592003",
ISSN = "0163-5999 (print), 1557-9484 (electronic)",
ISSN-L = "0163-5999",
bibdate = "Fri Jun 27 06:38:48 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
abstract = "Although millions of users download and use
third-party Android applications from the Google Play
store, little information is known on an aggregated
level about these applications. We have built
PlayDrone, the first scalable Google Play store
crawler, and used it to index and analyze over
1,100,000 applications in the Google Play store on a
daily basis, the largest such index of Android
applications. PlayDrone leverages various hacking
techniques to circumvent Google's roadblocks for
indexing Google Play store content, and makes
proprietary application sources available, including
source code for over 880,000 free applications. We
demonstrate the usefulness of PlayDrone in decompiling
and analyzing application content by exploring four
previously unaddressed issues: the characterization of
Google Play application content at large scale and its
evolution over time, library usage in applications and
its impact on application portability, duplicative
application content in Google Play, and the
ineffectiveness of OAuth and related service
authentication mechanisms resulting in malicious users
being able to easily gain unauthorized access to user
data and resources on Amazon Web Services and
Facebook.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journal-URL = "http://portal.acm.org/toc.cfm?id=J618",
}
@Article{Visegrady:2014:SCV,
author = "T. Visegrady and S. Dragone and M. Osborne",
title = "Stateless cryptography for virtual environments",
journal = j-IBM-JRD,
volume = "58",
number = "1",
pages = "5:1--5:10",
month = jan # "--" # feb,
year = "2014",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/JRD.2013.2287811",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Sat Feb 15 16:52:52 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
@Article{Vivek:2014:CSC,
author = "Srinivas Vivek and C. E. Veni Madhavan",
title = "{Cubic Sieve Congruence} of the {Discrete Logarithm
Problem}, and fractional part sequences",
journal = j-J-SYMBOLIC-COMP,
volume = "64",
number = "??",
pages = "22--34",
month = aug,
year = "2014",
CODEN = "JSYCEH",
ISSN = "0747-7171 (print), 1095-855X (electronic)",
ISSN-L = "0747-7171",
bibdate = "Fri Feb 28 07:39:29 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0747717113001703",
acknowledgement = ack-nhfb,
fjournal = "Journal of Symbolic Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/07477171/",
}
@Article{Vrakas:2014:OUI,
author = "Nikos Vrakas and Dimitris Geneiatakis and Costas
Lambrinoudakis",
title = "Obscuring users' identity in {VoIP\slash IMS}
environments",
journal = j-COMPUT-SECUR,
volume = "43",
number = "??",
pages = "145--158",
month = jun,
year = "2014",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:37 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404814000510",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Wahaballa:2014:MLS,
author = "Abubaker Wahaballa and Osman Wahballa and Fagen Li and
Mohammed Ramadan and Zhiguang Qin",
title = "Multiple-Layered Securities Using Steganography and
Cryptography",
journal = j-INT-J-COMPUT-APPL,
volume = "36",
number = "3",
pages = "93--100",
year = "2014",
DOI = "https://doi.org/10.2316/Journal.202.2014.3.202-3917",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:29:29 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2014.3.202-3917",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Wang:2014:ATF,
author = "Ding Wang and Ping Wang",
title = "On the anonymity of two-factor authentication schemes
for wireless sensor networks: Attacks, principle and
solutions",
journal = j-COMP-NET-AMSTERDAM,
volume = "73",
number = "??",
pages = "41--57",
day = "14",
month = nov,
year = "2014",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Oct 20 06:32:36 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128614002643",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Wang:2014:CGR,
author = "Zongyue Wang and Hongbo Yu and Xiaoyun Wang",
title = "Cryptanalysis of {GOST R} hash function",
journal = j-INFO-PROC-LETT,
volume = "114",
number = "12",
pages = "655--662",
month = dec,
year = "2014",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Aug 16 12:31:39 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019014001458",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Wang:2014:IIA,
author = "Huaqun Wang",
title = "Insecurity of {`Improved Anonymous Multi-Receiver
Identity-Based Encryption'}",
journal = j-COMP-J,
volume = "57",
number = "4",
pages = "636--638",
month = apr,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt052",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Mar 26 15:06:42 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "See \cite{Chien:2012:IAM}.",
URL = "http://comjnl.oxfordjournals.org/content/57/4/636.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "May 30, 2013",
}
@Article{Wang:2014:NAI,
author = "Xiaojing Wang and Qizhao Yuan and Hongliang Cai and
Jiajia Fang",
title = "A New Approach to Image Sharing with High-Security
Threshold Structure",
journal = j-J-ACM,
volume = "61",
number = "6",
pages = "39:1--39:??",
month = nov,
year = "2014",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/2666470",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
bibdate = "Wed Jan 7 15:12:00 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "Image sharing is an attractive research subject in
computer image techniques and in the information
security field. This article presents a novel scheme of
image sharing with a $ (t, n) $ high-security threshold
structure. The scheme can encode secret images into n
shadow images in such a way that all the shadow images
are in a perfect and ideal $ (t, n) $ threshold
structure, while each shadow image has its own visual
content assigned at random. The most common method to
implement image sharing is based on interpolation
polynomial over the field $ F_p $ = \{0, 1, 2,\ldots{},
p 1\} [Shamir 1979]. In this article, the authors
present a new approach to image sharing and its
computation based on algebraic-geometry code over the
pixel value field GF($ 2^m$).",
acknowledgement = ack-nhfb,
articleno = "39",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Wang:2014:NDH,
author = "Zhiwei Wang and Guozi Sun and Danwei Chen",
title = "A new definition of homomorphic signature for identity
management in mobile cloud computing",
journal = j-J-COMP-SYS-SCI,
volume = "80",
number = "3",
pages = "546--553",
month = may,
year = "2014",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2013.06.010",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:25 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000013001190",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Wang:2014:RAW,
author = "Xian-gyang Wang and Pan-pan Niu and Hong-ying Yang and
Yan Zhang and Tian-xiao Ma",
title = "A Robust Audio Watermarking Scheme using Higher-order
Statistics in Empirical Mode Decomposition Domain",
journal = j-FUND-INFO,
volume = "130",
number = "4",
pages = "467--490",
month = oct,
year = "2014",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2014-1000",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:18:29 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Watanabe:2014:OAC,
author = "Shun Watanabe and Ryutaroh Matsumoto and Tomohiko
Uyematsu",
title = "Optimal axis compensation in quantum key distribution
protocols over unital channels",
journal = j-THEOR-COMP-SCI,
volume = "560 (part 1)",
number = "??",
pages = "91--106",
day = "4",
month = dec,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Dec 2 19:05:23 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514006987",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Watts:2014:ICB,
author = "Steve Watts",
title = "Intelligent combination --- the benefits of tokenless
two-factor authentication",
journal = j-NETWORK-SECURITY,
volume = "2014",
number = "8",
pages = "17--20",
month = aug,
year = "2014",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(14)70082-0",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:10 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485814700820",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Watts:2014:PYI,
author = "Steve Watts",
title = "Protecting your identity when working remotely",
journal = j-NETWORK-SECURITY,
volume = "2014",
number = "1",
pages = "5--7",
month = jan,
year = "2014",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(14)70005-4",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:03 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485814700054",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Wei:2014:EEF,
author = "Guiyi Wei and Rongxing Lu and Jun Shao",
title = "{EFADS}: Efficient, flexible and anonymous data
sharing protocol for cloud computing with proxy
re-encryption",
journal = j-J-COMP-SYS-SCI,
volume = "80",
number = "8",
pages = "1549--1562",
month = dec,
year = "2014",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2014.04.021",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:27 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000014000658",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Wei:2014:IDC,
author = "Yuechuan Wei and Xiaoyuan Yang and Chao Li",
title = "Impossible differential cryptanalysis on cipher {E2}",
journal = j-CCPE,
volume = "26",
number = "8",
pages = "1477--1489",
day = "10",
month = jun,
year = "2014",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3043",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Fri May 30 08:55:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "10 May 2013",
}
@Article{Wen:2014:MZC,
author = "Long Wen and Meiqin Wang and Andrey Bogdanov and
Huaifeng Chen",
title = "Multidimensional zero-correlation attacks on
lightweight block cipher {HIGHT}: Improved
cryptanalysis of an {ISO} standard",
journal = j-INFO-PROC-LETT,
volume = "114",
number = "6",
pages = "322--330",
month = jun,
year = "2014",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri Feb 28 07:46:24 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019014000088",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Whitworth:2014:SPC,
author = "Jeff Whitworth and Shan Suthaharan",
title = "Security problems and challenges in a machine
learning-based hybrid big data processing network
systems",
journal = j-SIGMETRICS,
volume = "41",
number = "4",
pages = "82--85",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2627534.2627560",
ISSN = "0163-5999 (print), 1557-9484 (electronic)",
ISSN-L = "0163-5999",
bibdate = "Wed May 21 15:15:25 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
abstract = "The data source that produces data continuously in
high volume and high velocity with large varieties of
data types creates Big Data, and causes problems and
challenges to Machine Learning (ML) techniques that
help extract, analyze and visualize important
information. To overcome these problems and challenges,
we propose to make use of the hybrid networking model
that consists of multiple components such as Hadoop
distributed file system (HDFS), cloud storage system,
security module and ML unit. Processing of Big Data in
this networking environment with ML technique requires
user interaction and additional storage hence some
artificial delay between the arrivals of data domains
through external storage can help HDFSto process the
Big Data efficiently. To address this problem we
suggest using public cloud for data storage which will
induce meaningful time delay to the data while making
use of its storage capability. However, the use of
public cloud will lead to security vulnerability to the
data transmission and storage. Therefore, we need some
form of security algorithm that provides a flexible
key-based encryption technique that can provide
tradeoffs between time-delay, security strength and
storage risks. In this paper we propose a model for
using public cloud provider trust levels to select
encryption types for data storage for use within a Big
Data analytics network topology.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journal-URL = "http://portal.acm.org/toc.cfm?id=J618",
}
@Article{Xiang:2014:PBA,
author = "Yong Xiang and I. Natgunanathan and Song Guo and
Wanlei Zhou and S. Nahavandi",
title = "Patchwork-Based Audio Watermarking Method Robust to
De-synchronization Attacks",
journal = j-IEEE-ACM-TASLP,
volume = "22",
number = "9",
pages = "1413--1423",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1109/TASLP.2014.2328175",
ISSN = "2329-9290",
ISSN-L = "2329-9290",
bibdate = "Mon Oct 5 06:29:39 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Xie:2014:SCP,
author = "Qi Xie and Guilin Wang and Fubiao Xia and Deren Chen",
title = "Self-certified proxy convertible authenticated
encryption: formal definitions and a provably secure
scheme",
journal = j-CCPE,
volume = "26",
number = "5",
pages = "1038--1051",
day = "10",
month = apr,
year = "2014",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3058",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Fri May 30 08:55:33 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "10 Jun 2013",
}
@Article{Xu:2014:AHA,
author = "Chang Xu and Hua Guo and Zhoujun Li and Yi Mu",
title = "Affiliation-Hiding Authenticated Asymmetric Group Key
Agreement Based on Short Signature",
journal = j-COMP-J,
volume = "57",
number = "10",
pages = "1580--1590",
month = oct,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt098",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Sep 27 12:06:41 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/57/10/1580",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 6, 2013",
}
@Article{Xu:2014:TBH,
author = "Li Xu and Yuan He and Xiaofeng Chen and Xinyi Huang",
title = "Ticket-based handoff authentication for wireless mesh
networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "73",
number = "??",
pages = "185--194",
day = "14",
month = nov,
year = "2014",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Oct 20 06:32:36 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128614002886",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Xue:2014:LDP,
author = "Kaiping Xue and Peilin Hong and Changsha Ma",
title = "A lightweight dynamic pseudonym identity based
authentication and key agreement protocol without
verification tables for multi-server architecture",
journal = j-J-COMP-SYS-SCI,
volume = "80",
number = "1",
pages = "195--206",
month = feb,
year = "2014",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2013.07.004",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:24 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000013001426",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Yang:2014:BEB,
author = "Yang Yang",
title = "Broadcast encryption based non-interactive key
distribution in {MANETs}",
journal = j-J-COMP-SYS-SCI,
volume = "80",
number = "3",
pages = "533--545",
month = may,
year = "2014",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2013.06.009",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:25 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000013001189",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Yang:2014:IBI,
author = "Guomin Yang and Chik How Tan and Yi Mu and Willy
Susilo and Duncan S. Wong",
title = "Identity based identification from algebraic coding
theory",
journal = j-THEOR-COMP-SCI,
volume = "520",
number = "??",
pages = "51--61",
day = "6",
month = feb,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Jan 9 16:56:40 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397513006786",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Yang:2014:MDF,
author = "Ying Yang and Ioannis Ivrissimtzis",
title = "Mesh Discriminative Features for {$3$D} Steganalysis",
journal = j-TOMCCAP,
volume = "10",
number = "3",
pages = "27:1--27:??",
month = apr,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2535555",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Apr 15 12:20:53 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "We propose a steganalytic algorithm for triangle
meshes, based on the supervised training of a
classifier by discriminative feature vectors. After a
normalization step, the triangle mesh is calibrated by
one step of Laplacian smoothing and then a feature
vector is computed, encoding geometric information
corresponding to vertices, edges and faces. For a given
steganographic or watermarking algorithm, we create a
training set containing unmarked meshes and meshes
marked by that algorithm, and train a classifier using
Quadratic Discriminant Analysis. The performance of the
proposed method was evaluated on six well-known
watermarking/steganographic schemes with satisfactory
accuracy rates.",
acknowledgement = ack-nhfb,
articleno = "27",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Yang:2014:PST,
author = "Haomin Yang and Yaoxue Zhang and Yuezhi Zhou and
Xiaoming Fu and Hao Liu and Athanasios V. Vasilakos",
title = "Provably secure three-party authenticated key
agreement protocol using smart cards",
journal = j-COMP-NET-AMSTERDAM,
volume = "58",
number = "??",
pages = "29--38",
day = "15",
month = jan,
year = "2014",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Feb 5 08:36:58 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128613002867",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Yao:2014:NCR,
author = "Hongyi Yao and Danilo Silva and Sidharth Jaggi and
Michael Langberg",
title = "Network codes resilient to jamming and eavesdropping",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "6",
pages = "1978--1987",
month = dec,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2294254",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Feb 12 18:29:37 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider the problem of communicating information
over a network secretly and reliably in the presence of
a hidden adversary who can eavesdrop and inject
malicious errors. We provide polynomial-time
distributed network codes that are
information-theoretically rate-optimal for this
scenario, improving on the rates achievable in prior
work by Ngai et al. Ourmain contribution shows that as
long as the sum of the number of links the adversary
can jam (denoted by Z O ) and the number of links he
can eavesdrop on (denoted by ZI ) is less than the
network capacity (denoted by C ) (i.e., ZO + ZI {$<$} C
), our codes can communicate (with vanishingly small
error probability) a single bit correctly and without
leaking any information to the adversary.We then use
this scheme as a module to design codes that allow
communication at the source rate of C --- ZO when there
are no security requirements, and codes that allow
communication at the source rate of C --- ZO --- ZI
while keeping the communicated message provably secret
from the adversary. Interior nodes are oblivious to the
presence of adversaries and perform random linear
network coding; only the source and destination need to
be tweaked. We also prove that the rate-region obtained
is information-theoretically optimal. In proving our
results, we correct an error in prior work by a subset
of the authors in this paper.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ye:2014:NIE,
author = "Ruisong Ye",
title = "A Novel Image Encryption Scheme Based on Generalized
Multi-sawtooth Maps",
journal = j-FUND-INFO,
volume = "133",
number = "1",
pages = "87--104",
month = jan,
year = "2014",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2014-1063",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:19:23 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@TechReport{Ylonen:2014:SAA,
author = "Tatu Ylonen and Karen Scarfone and Murugiah Souppaya",
title = "Security of Automated Access Management Using {Secure
Shell (SSH)}",
type = "Technical report",
number = "NISTIR 7966 (draft)",
institution = pub-NIST,
address = pub-NIST:adr,
year = "2014",
bibdate = "Mon Sep 01 13:10:13 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://csrc.nist.gov/publications/drafts/nistir-7966/nistir_7966_draft.pdf",
acknowledgement = ack-nhfb,
}
@Article{Yuen:2014:TCT,
author = "Tsz Hon Yuen and Willy Susilo and Yi Mu",
title = "Towards a cryptographic treatment of publish\slash
subscribe systems",
journal = j-J-COMP-SECUR,
volume = "22",
number = "1",
pages = "33--67",
month = "????",
year = "2014",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-130486",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:26:08 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Zeng:2014:NFC,
author = "Shengke Zeng and Shaoquan Jiang",
title = "A New Framework for Conditionally Anonymous Ring
Signature",
journal = j-COMP-J,
volume = "57",
number = "4",
pages = "567--578",
month = apr,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt036",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Mar 26 15:06:42 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/57/4/567.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "May 6, 2013",
}
@Book{Zetter:2014:CZD,
author = "Kim Zetter",
title = "Countdown to Zero Day: {Stuxnet} and the launch of the
world's first digital weapon",
publisher = "Crown",
address = "New York, NY, USA",
pages = "????",
year = "2014",
ISBN = "0-7704-3617-X (hardcover), 0-7704-3619-6 (paperback),
0-7704-3618-8 (e-book)",
ISBN-13 = "978-0-7704-3617-9 (hardcover), 978-0-7704-3619-3
(paperback), 978-0-7704-3618-6 (ebook)",
LCCN = "UG593 .Z48 2014",
bibdate = "Mon Nov 24 12:20:25 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
abstract = "Top cybersecurity journalist Kim Zetter tells the
story behind the virus that sabotaged Iran's nuclear
efforts and shows how its existence has ushered in a
new age of warfare--one in which a digital attack can
have the same destructive capability as a megaton bomb.
In January 2010, inspectors with the International
Atomic Energy Agency noticed that centrifuges at an
Iranian uranium enrichment plant were failing at an
unprecedented rate. The cause was a complete mystery
--- apparently as much to the technicians replacing the
centrifuges as to the inspectors observing them. Then,
five months later, a seemingly unrelated event
occurred: A computer security firm in Belarus was
called in to troubleshoot some computers in Iran that
were crashing and rebooting repeatedly. At first, the
firm's programmers believed the malicious code on the
machines was a simple, routine piece of malware. But as
they and other experts around the world investigated,
they discovered a mysterious virus of unparalleled
complexity. They had, they soon learned, stumbled upon
the world's first digital weapon. For Stuxnet, as it
came to be known, was unlike any other virus or worm
built before: Rather than simply hijacking targeted
computers or stealing information from them, it escaped
the digital realm to wreak actual, physical destruction
on a nuclear facility. In these pages, Wired journalist
Kim Zetter draws on her extensive sources and expertise
to tell the story behind Stuxnet's planning, execution,
and discovery, covering its genesis in the corridors of
Bush's White House and its unleashing on systems in
Iran --- and telling the spectacular, unlikely tale of
the security geeks who managed to unravel a sabotage
campaign years in the making. But \booktitle{Countdown
to Zero Day} ranges far beyond Stuxnet itself. Here,
Zetter shows us how digital warfare developed in the
US. She takes us inside today's flourishing zero-day
`grey markets,' in which intelligence agencies and
militaries pay huge sums for the malicious code they
need to carry out infiltrations and attacks. She
reveals just how vulnerable many of our own critical
systems are to Stuxnet-like strikes, from nation-state
adversaries and anonymous hackers alike --- and shows
us just what might happen should our infrastructure be
targeted by such an attack. Propelled by Zetter's
unique knowledge and access, and filled with
eye-opening explanations of the technologies involved,
\booktitle{Countdown to Zero Day} is a comprehensive
and prescient portrait of a world at the edge of a new
kind of war.\par
This story of the virus that destroyed Iran's nuclear
centrifuges, by top cybersecurity journalist Kim
Zetter, shows that the door has been opened on a new
age of warfare --- one in which a digital attack can
have the same destructive capability as a megaton bomb
dropped from an airplane",
acknowledgement = ack-nhfb,
subject = "Cyberspace operations (Military science); United
States; Network-centric operations (Military science);
Israel; Computer crimes; Investigation; Iran; Case
studies; Rootkits (Computer software); Uranium
enrichment; Equipment and supplies; Sabotage; Nuclear
arms control; Nuclear nonproliferation; Foreign
relations; POLITICAL SCIENCE / Political Freedom and
Security / Intelligence; COMPUTERS / Security /
General; COMPUTERS / General",
tableofcontents = "The case of the centrifuges \\
Early warning \\
500 kilobytes of mystery \\
Natanz \\
Stuxnet deconstructed \\
Springtime for Ahmadinejad \\
digging for zero days \\
Zero-day paydays \\
The payload \\
Industrial controls out of control \\
Precision weapon \\
A digital plot is hatched \\
A new fighting domain \\
Digital warheads \\
Son of Stuxnet \\
Flame \\
Olympic Games \\
The mystery of the centrifuges \\
Qualified success \\
Digital Pandora",
}
@Article{Zhang:2014:EFH,
author = "Xiaojun Zhang and Chunxiang Xu and Chunhua Jin and Run
Xie and Jining Zhao",
title = "Efficient fully homomorphic encryption from {RLWE}
with an extension to a threshold encryption scheme",
journal = j-FUT-GEN-COMP-SYS,
volume = "36",
number = "??",
pages = "180--186",
month = jul,
year = "2014",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Apr 28 15:56:06 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X13002422",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Zhang:2014:GCS,
author = "Yinghui Zhang and Xiaofeng Chen and Jin Li and Hui
Li",
title = "Generic construction for secure and efficient handoff
authentication schemes in {EAP}-based wireless
networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "75 (part A)",
number = "??",
pages = "192--211",
day = "24",
month = dec,
year = "2014",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Fri Nov 28 11:25:17 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128614003648",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Zhang:2014:LFL,
author = "Mingwu Zhang and Chunzhi Wang and Kirill Morozov",
title = "{LR-FEAD}: leakage-tolerating and attribute-hiding
functional encryption mechanism with delegation in
affine subspaces",
journal = j-J-SUPERCOMPUTING,
volume = "70",
number = "3",
pages = "1405--1432",
month = dec,
year = "2014",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-014-1234-6",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Fri Feb 13 12:13:22 MST 2015",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=70&issue=3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-014-1234-6",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Zhang:2014:NCM,
author = "Miao Zhang and Xiaojun Tong",
title = "A new chaotic map based image encryption schemes for
several image formats",
journal = j-J-SYST-SOFTW,
volume = "98",
number = "??",
pages = "140--154",
month = dec,
year = "2014",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri Oct 24 05:50:53 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121214001915",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Zhao:2014:TAH,
author = "Yifan Zhao and Swee-Won Lo and Robert H. Deng and
Xuhua Ding",
title = "Technique for authenticating {H.264\slash SVC} and its
performance evaluation over wireless mobile networks",
journal = j-J-COMP-SYS-SCI,
volume = "80",
number = "3",
pages = "520--532",
month = may,
year = "2014",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2013.06.008",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:25 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000013001177",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Zhou:2014:SAC,
author = "Lan Zhou and Vijay Varadharajan and Michael Hitchens",
title = "Secure administration of cryptographic role-based
access control for large-scale cloud storage systems",
journal = j-J-COMP-SYS-SCI,
volume = "80",
number = "8",
pages = "1518--1533",
month = dec,
year = "2014",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2014.04.019",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:27 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000014000634",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Zhuang:2014:SCA,
author = "Yixin Zhuang and Ming Zou and Nathan Carr and Tao Ju",
title = "Shapes and Cryptography: Anisotropic geodesics for
live-wire mesh segmentation",
journal = j-CGF,
volume = "33",
number = "7",
pages = "111--120",
month = oct,
year = "2014",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/cgf.12479",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Fri Feb 13 14:27:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics World",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "28 Oct 2014",
}
@Article{Zielinska:2014:TS,
author = "Elzbieta Zieli{\'n}ska and Wojciech Mazurczyk and
Krzysztof Szczypiorski",
title = "Trends in steganography",
journal = j-CACM,
volume = "57",
number = "3",
pages = "86--95",
month = mar,
year = "2014",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2566590.2566610",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Feb 27 17:17:45 MST 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Methods for embedding secret data are more
sophisticated than their ancient predecessors, but the
basic principles remain unchanged.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Abdulrahman:2015:NRR,
author = "E. A. H. Abdulrahman and A. Reyhani-Masoleh",
title = "New Regular Radix-8 Scheme for Elliptic Curve Scalar
Multiplication without Pre-Computation",
journal = j-IEEE-TRANS-COMPUT,
volume = "64",
number = "2",
pages = "438--451",
month = feb,
year = "2015",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2013.213",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Mar 4 17:06:17 MST 2015",
bibsource = "ghttps://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@TechReport{Adrian:2015:IFS,
author = "David Adrian and Karthikeyan Bhargavan and Zakir
Durumeric and Pierrick Gaudry and Matthew Green and J.
Alex Halderman and Nadia Heninger and Drew Springall
and Emmanuel Thom{\'e} and Luke Valenta and Benjamin
VanderSloot and Eric Wustrow and Santiago
Zanella-B{\'e}guelink and Paul Zimmermann",
title = "Imperfect Forward Secrecy: How {Diffie--Hellman} Fails
in Practice",
type = "Report",
institution = "INRIA Paris-Rocquencourt [and others]",
address = "Rocquencourt, France",
pages = "13",
day = "21",
month = may,
year = "2015",
bibdate = "Thu May 21 15:08:22 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://weakdh.org/;
https://weakdh.org/imperfect-forward-secrecy.pdf",
abstract = "We investigate the security of Diffie--Hellman key
exchange as used in popular Internet protocols and find
it to be less secure than widely believed. First, we
present a novel flaw in TLS that allows a
man-in-the-middle to downgrade connections to
export-grade Diffie--Hellman. To carry out this attack,
we implement the number field sieve discrete log
algorithm. After a week-long precomputation for a
specified 512-bit group, we can compute arbitrary
discrete logs in this group in minutes. We find that
82\% of vulnerable servers use a single 512-bit group,
allowing us to compromise connections to 7\% of Alexa
Top Million HTTPS sites. In response, major browsers
are being changed to reject short groups.\par
We go on to consider Diffie--Hellman with 768- and
1024-bit groups. A small number of fixed or
standardized groups are in use by millions of TLS, SSH,
and VPN servers. Performing precomputations on a few of
these groups would allow a passive eavesdropper to
decrypt a large fraction of Internet traffic. In the
1024-bit case, we estimate that such computations are
plausible given nation-state resources, and a close
reading of published NSA leaks shows that the agency's
attacks on VPNs are consistent with having achieved
such a break. We conclude that moving to stronger key
exchange methods should be a priority for the Internet
community.",
acknowledgement = ack-nhfb,
}
@Article{Agosta:2015:OPP,
author = "Giovanni Agosta and Alessandro Barenghi and Alessandro
{Di Federico} and Gerardo Pelosi",
title = "{OpenCL} performance portability for general-purpose
computation on graphics processor units: an exploration
on cryptographic primitives",
journal = j-CCPE,
volume = "27",
number = "14",
pages = "3633--3660",
day = "25",
month = sep,
year = "2015",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3358",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Sep 28 09:32:54 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/pvm.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "29 Aug 2014",
}
@Article{Ahani:2015:SRB,
author = "S. Ahani and S. Ghaemmaghami and Z. J. Wang",
title = "A Sparse Representation-Based Wavelet Domain Speech
Steganography Method",
journal = j-IEEE-ACM-TASLP,
volume = "23",
number = "1",
pages = "80--91",
month = jan,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/TASLP.2014.2372313",
ISSN = "2329-9290",
ISSN-L = "2329-9290",
bibdate = "Mon Oct 5 06:29:41 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeeacmtaslp.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6570655",
}
@Article{Aiash:2015:FAA,
author = "Mahdi Aiash",
title = "A formal analysis of authentication protocols for
mobile devices in next generation networks",
journal = j-CCPE,
volume = "27",
number = "12",
pages = "2938--2953",
day = "25",
month = aug,
year = "2015",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3260",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Jul 25 19:54:09 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "18 Mar 2014",
}
@Article{Aiash:2015:IAA,
author = "Mahdi Aiash and Jonathan Loo",
title = "An integrated authentication and authorization
approach for the network of information architecture",
journal = j-J-NETW-COMPUT-APPL,
volume = "50",
number = "??",
pages = "73--79",
month = apr,
year = "2015",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sat Aug 8 15:46:38 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804514001349",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Alam:2015:ACF,
author = "Shahid Alam and Issa Traore and Ibrahim Sogukpinar",
title = "Annotated Control Flow Graph for Metamorphic Malware
Detection",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2608--2621",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu148",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2608",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "December 15, 2014",
}
@TechReport{Albrecht:2015:FBR,
author = "Martin R. Albrecht and Davide Papini and Kenneth G.
Paterson and Ricardo Villanueva-Polanco",
title = "Factoring 512-bit {RSA} Moduli for Fun (and a Profit
of \$9,000)",
type = "Report",
institution = "Information Security Group Royal Holloway, University
of London",
address = "London, UK",
pages = "3",
day = "13",
month = mar,
year = "2015",
bibdate = "Sat Mar 21 09:34:09 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://martinralbrecht.files.wordpress.com/2015/03/freak-scan1.pdf",
abstract = "The recent FREAK attack highlighted widespread support
for export-grade RSA keys in TLS servers. We present
the results of an IPv4-wide survey of TLS servers
performed roughly one week after FREAK was announced.
We found that only 9.7\% of servers now support such
export-grade RSA keys. However, we also found that some
keys are repeated with high frequency, making each of
them an attractive target for a direct factoring
attack; one key in particular was repeated 28,394
times. We also computed the pairwise gcds of all the
export-grade RSA moduli that we found, leading to 90
factorisations. These moduli correspond to 294
different hosts. The computation took less than 3
minutes on an 8-core system, saving the \$9,000 that a
cloud computation would have cost if each modulus had
been attacked directly. We consider this to be a good
return on investment for a Friday afternoon's work.",
acknowledgement = ack-nhfb,
}
@Article{Altaf:2015:LPM,
author = "Muhammad Shoaib Bin Altaf and David A. Wood",
title = "{LogCA}: A Performance Model for Hardware
Accelerators",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "14",
number = "2",
pages = "132--135",
month = jul # "\slash " # dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2014.2360182",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "To address the Dark Silicon problem, architects have
increasingly turned to special-purpose hardware
accelerators to improve the performance and energy
efficiency of common computational kernels, such as
encryption and compression. Unfortunately, the latency
and overhead required to off-load a computation to an
accelerator sometimes outweighs the potential benefits,
resulting in a net decrease in performance or energy
efficiency. To help architects and programmers reason
about these trade-offs, we have developed the LogCA
model, a simple performance model for hardware
accelerators. LogCA provides a simplified abstraction
of a hardware accelerator characterized by five key
parameters. We have validated the model against a
variety of accelerators, ranging from on-chip
cryptographic accelerators in Sun's UltraSparc T2 and
Intel's Sandy Bridge to both discrete and integrated
GPUs.",
acknowledgement = ack-nhfb,
affiliation = "Bin Altaf, MS (Reprint Author), Univ Wisconsin,
Madison, WI 53706 USA. Bin Altaf, Muhammad Shoaib;
Wood, David A., Univ Wisconsin, Madison, WI 53706
USA.",
author-email = "shoaibbinalt@wisc.edu david@cs.wisc.edu",
da = "2019-06-20",
doc-delivery-number = "CZ7DC",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "NSF [CNS-1117280, CCF-1218323,
CNS-1302260]",
funding-text = "We thank Mark Hill, Michael Swift, Rathijit Sen, and
the members of the Wisconsin Multifacet group for their
comments on the paper. This work is supported in part
with NSF grants CNS-1117280, CCF-1218323, and
CNS-1302260. The views expressed herein are not
necessarily those of the NSF. Professor Wood has
significant financial interests in AMD, Google and
Panasas.",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "Accelerators; heterogeneous systems; modeling
techniques; performance of systems",
number-of-cited-references = "12",
research-areas = "Computer Science",
times-cited = "0",
unique-id = "Altaf:2015:LPM",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Anand:2015:ICL,
author = "Kapil Anand and Rajeev Barua",
title = "Instruction-Cache Locking for Improving Embedded
Systems Performance",
journal = j-TECS,
volume = "14",
number = "3",
pages = "53:1--53:??",
month = apr,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2700100",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue Apr 21 17:21:32 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Cache memories in embedded systems play an important
role in reducing the execution time of applications.
Various kinds of extensions have been added to cache
hardware to enable software involvement in replacement
decisions, improving the runtime over a purely
hardware-managed cache. Novel embedded systems, such as
Intel's XScale and ARM Cortex processors, facilitate
locking one or more lines in cache; this feature is
called cache locking. We present a method in for
instruction-cache locking that is able to reduce the
average-case runtime of a program. We demonstrate that
the optimal solution for instruction cache locking can
be obtained in polynomial time. However, a fundamental
lack of correlation between cache hardware and software
program points renders such optimal solutions
impractical. Instead, we propose two practical
heuristics-based approaches to achieve cache locking.
First, we present a static mechanism for locking the
cache, in which the locked contents of the cache are
kept fixed over the execution of the program. Next, we
present a dynamic mechanism that accounts for changing
program requirements at runtime. We devise a
cost--benefit model to discover the memory addresses
that should be locked in the cache. We implement our
scheme inside a binary rewriter, widening the
applicability of our scheme to binaries compiled using
any compiler. Results obtained on a suite of MiBench
benchmarks show that our static mechanism results in
20\% improvement in the instruction-cache miss rate on
average and up to 18\% improvement in the execution
time on average for applications having instruction
accesses as a bottleneck, compared to no cache locking.
The dynamic mechanism improves the cache miss rate by
35\% on average and execution time by 32\% on
instruction-cache-constrained applications.",
acknowledgement = ack-nhfb,
articleno = "53",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@InProceedings{Andrysco:2015: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",
crossref = "IEEE:2015:ISS",
pages = "623--639",
year = "2015",
DOI = "https://doi.org/10.1109/SP.2015.44",
bibdate = "Mon Feb 10 08:54:26 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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. 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:2015:BRDa,
author = "Anonymous",
title = "Book Review: {{\booktitle{Digital Identity
Management}}, Maryline Laurent and Samia Bouzefrane.
ISTE Press\slash Elsevier. ISBN 978-1-78548-004-1}",
journal = j-NETWORK-SECURITY,
volume = "2015",
number = "9",
pages = "4--4",
month = sep,
year = "2015",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(15)30078-7",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:23 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485815300787",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2015:BSU,
author = "Anonymous",
title = "Blind Signatures Using Offline Repositories Provide
New Level of Security",
journal = j-SCI-COMPUT,
volume = "??",
number = "??",
pages = "??--??",
day = "15",
month = may,
year = "2015",
CODEN = "SCHRCU",
ISSN = "1930-5753 (print), 1930-6156 (electronic)",
ISSN-L = "1930-5753",
bibdate = "Mon May 18 10:39:07 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.scientificcomputing.com/news/2015/05/blind-signatures-using-offline-repositories-provide-new-level-security",
acknowledgement = ack-nhfb,
fjournal = "Scientific Computing",
journal-URL = "http://digital.scientificcomputing.com/scientificcomputing/",
remark = "News story about research in
\cite{Ribeiro:2015:QBS}.",
}
@Article{Anonymous:2015:CEB,
author = "Anonymous",
title = "Cryptography for Everyone: Bringing End-to-end
Encryption to the Masses",
journal = "Scientific Computing",
volume = "??",
number = "??",
pages = "??--??",
day = "17",
month = mar,
year = "2015",
bibdate = "Wed Mar 18 18:16:46 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.scientificcomputing.com/news/2015/03/cryptography-everyone-bringing-end-end-encryption-masses",
acknowledgement = ack-nhfb,
keywords = "Fraunhofer-Gesellschaft; public-key cryptography;
CeBIT 2015; German identity card;
Volksverschl{\"u}sselung",
}
@Article{Anonymous:2015:QCS,
author = "Anonymous",
title = "Quantum Cryptography Security Hole Revealed,
Energy-time Entanglement Vulnerable to Attack",
journal = j-SCI-COMPUT,
volume = "??",
number = "??",
pages = "??--??",
day = "12",
month = dec,
year = "2015",
CODEN = "SCHRCU",
ISSN = "1930-5753 (print), 1930-6156 (electronic)",
ISSN-L = "1930-5753",
bibdate = "Mon Jan 18 15:07:47 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "See research article \cite{Jogenfors:2015:HBT}.",
URL = "http://www.scientificcomputing.com/news/2015/12/quantum-cryptography-security-hole-revealed-energy-time-entanglement-vulnerable-attack",
acknowledgement = ack-nhfb,
fjournal = "Scientific Computing",
journal-URL = "http://digital.scientificcomputing.com/scientificcomputing/",
}
@Article{Anonymous:2015:UGB,
author = "Anonymous",
title = "{UK Government} battles tech firms over encryption",
journal = j-NETWORK-SECURITY,
volume = "2015",
number = "11",
pages = "1--2",
month = nov,
year = "2015",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(15)30094-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:26 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485815300945",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Appel:2015:VCP,
author = "Andrew W. Appel",
title = "Verification of a Cryptographic Primitive: {SHA-256}",
journal = j-TOPLAS,
volume = "37",
number = "2",
pages = "7:1--7:??",
month = apr,
year = "2015",
CODEN = "ATPSDT",
DOI = "https://doi.org/10.1145/2701415",
ISSN = "0164-0925 (print), 1558-4593 (electronic)",
ISSN-L = "0164-0925",
bibdate = "Thu Apr 16 18:32:12 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toplas/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toplas.bib",
abstract = "This article presents a full formal machine-checked
verification of a C program: the OpenSSL implementation
of SHA-256. This is an interactive proof of functional
correctness in the Coq proof assistant, using the
Verifiable C program logic. Verifiable C is a
separation logic for the C language, proved sound with
respect to the operational semantics for C, connected
to the CompCert verified optimizing C compiler.",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Transactions on Programming Languages and
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783",
}
@Article{Arias-Cabarcos:2015:BIP,
author = "Patricia Arias-Cabarcos and Florina Almenarez and
Ruben Trapero and Daniel Diaz-Sanchez and Andres
Marin",
title = "Blended Identity: Pervasive {IdM} for Continuous
Authentication",
journal = j-IEEE-SEC-PRIV,
volume = "13",
number = "3",
pages = "32--39",
month = may # "\slash " # jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2015.62",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Mon Aug 3 11:45:33 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "http://www.computer.org/csdl/mags/sp/2015/03/msp2015030032-abs.html",
abstract-URL = "http://www.computer.org/csdl/mags/sp/2015/03/msp2015030032-abs.html",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Arnold:2015:NGH,
author = "T. W. Arnold and M. Check and E. A. Dames and J. Dayka
and S. Dragone and D. Evans and W. Santiago Fernandez
and M. D. Hocker and R. Kisley and T. E. Morris and J.
Petreshock and K. Werner",
title = "The next generation of highly reliable and secure
encryption for the {IBM z13}",
journal = j-IBM-JRD,
volume = "59",
number = "4--5",
pages = "6:1--6:13",
month = jul # "\slash " # sep,
year = "2015",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/JRD.2015.2430071",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Wed Oct 21 11:38:12 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Arshad:2015:SAI,
author = "Hamed Arshad and Morteza Nikooghadam",
title = "Security analysis and improvement of two
authentication and key agreement schemes for session
initiation protocol",
journal = j-J-SUPERCOMPUTING,
volume = "71",
number = "8",
pages = "3163--3180",
month = aug,
year = "2015",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-015-1434-8",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Aug 8 12:23:12 MDT 2015",
bibsource = "http://link.springer.com/journal/11227/71/8;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-015-1434-8",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Asaar:2015:IBM,
author = "Maryam Rajabzadeh Asaar and Mahmoud Salmasizadeh and
Willy Susilo",
title = "An Identity-Based Multi-Proxy Multi-Signature Scheme
Without Bilinear Pairings and its Variants",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "1021--1039",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu037",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/1021",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "May 15, 2014",
}
@Article{Atighehchi:2015:NME,
author = "Kevin Atighehchi and Alexis Bonnecaze and Gabriel
Risterucci",
title = "New models for efficient authenticated dictionaries",
journal = j-COMPUT-SECUR,
volume = "53",
number = "??",
pages = "203--214",
month = sep,
year = "2015",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:42 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404815000607",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Attrapadung:2015:RGS,
author = "Nuttapong Attrapadung and Keita Emura and Goichiro
Hanaoka and Yusuke Sakai",
title = "Revocable Group Signature with Constant-Size
Revocation List",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2698--2715",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv026",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2698",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "April 22, 2015",
}
@Article{Aysu:2015:FRT,
author = "Aydin Aysu and Bilgiday Yuce and Patrick Schaumont",
title = "The Future of Real-Time Security: Latency-Optimized
Lattice-Based Digital Signatures",
journal = j-TECS,
volume = "14",
number = "3",
pages = "43:1--43:??",
month = may,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2724714",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Sat Dec 9 08:08:56 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Advances in quantum computing have spurred a
significant amount of research into public-key
cryptographic algorithms that are resistant against
postquantum cryptanalysis. Lattice-based cryptography
is one of the important candidates because of its
reasonable complexity combined with reasonable
signature sizes. However, in a postquantum world, not
only the cryptography will change but also the
computing platforms. Large amounts of
resource-constrained embedded systems will connect to a
cloud of powerful server computers. We present an
optimization technique for lattice-based signature
generation on such embedded systems; our goal is to
optimize latency rather than throughput. Indeed, on an
embedded system, the latency of a single signature for
user identification or message authentication is more
important than the aggregate signature generation rate.
We build a high-performance implementation using
hardware\slash software codesign techniques. The key
idea is to partition the signature generation scheme
into offline and online phases. The signature scheme
allows this separation because a large portion of the
computation does not depend on the message to be signed
and can be handled before the message is given. Then,
we can map complex precomputation operations in
software on a low-cost processor and utilize hardware
resources to accelerate simpler online operations. To
find the optimum hardware architecture for the target
platform, we define and explore the design space and
implement two design configurations. We realize our
solutions on the Altera Cyclone-IV CGX150 FPGA. The
implementation consists of a NIOS soft-core processor
and a low-latency hash and polynomial multiplication
engine. On average, the proposed low-latency
architecture can generate a signature with a latency of
96 clock cycles at 40MHz, resulting in a response time
of 2.4 $ \mu $ s for a signing request. On equivalent
platforms, this corresponds to a performance
improvement of 33 and 105 times compared to previous
hardware and software implementations, respectively.",
acknowledgement = ack-nhfb,
articleno = "43",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Azarderakhsh:2015:PHS,
author = "Reza Azarderakhsh and Arash Reyhani-Masoleh",
title = "Parallel and High-Speed Computations of Elliptic Curve
Cryptography Using Hybrid-Double Multipliers",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "26",
number = "6",
pages = "1668--1677",
month = jun,
year = "2015",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2014.2323062",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Jun 4 19:34:14 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://csdl.computer.org/csdl/trans/td/2015/06/06814322-abs.html",
abstract-URL = "http://csdl.computer.org/csdl/trans/td/2015/06/06814322-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Bagheri:2015:NNA,
author = "Kadijeh Bagheri and Mohammad-Reza Sadeghi",
title = "A new non-associative cryptosystem based on {NTOW}
public key cryptosystem and octonions algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "13--13",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768582",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bard:2015:PRO,
author = "Gregory V. Bard and Theodore McDonnough",
title = "Plaintext recovery for one-time pads used twice",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "17--18",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768596",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Barkatullah:2015:GCF,
author = "Javed Barkatullah and Timo Hanke",
title = "{Goldstrike 1}: {CoinTerra}'s First-Generation
Cryptocurrency Mining Processor for {Bitcoin}",
journal = j-IEEE-MICRO,
volume = "35",
number = "2",
pages = "68--76",
month = mar # "\slash " # apr,
year = "2015",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/MM.2015.13",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu Nov 30 15:24:52 2017",
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/ieeemicro.bib",
URL = "http://www.computer.org/csdl/mags/mi/2015/02/mmi2015020068-abs.html",
abstract-URL = "http://www.computer.org/csdl/mags/mi/2015/02/mmi2015020068-abs.html",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
keywords = "application specific integrated circuits; Application
specific integrated circuits; Blockchain; CoinTerra;
CoinTerra first-generation cryptocurrency mining
processor; CoinTerra first-generation {Bitcoin} mining
processor; Computer security; Cryptography;
cryptography; custom ASIC processors; Data mining; data
mining; electronic money; Energy efficiency; energy
efficiency; GoldStrike; Goldstrike 1; Online banking;
SHA-256; Terraminer IV; {Bitcoin}; {Bitcoin} ASIC;
{Bitcoin} mining; {Bitcoin} mining appliances;
{Bitcoin} mining machine",
}
@TechReport{Barker:2015:RKM,
author = "Elaine Barker and Quynh Dang",
title = "Recommendation for Key Management. {Part 3}:
Application-Specific Key Management Guidance",
type = "NIST Special Publication",
number = "800-57 Part 3 Revision 1",
institution = pub-NIST,
address = pub-NIST:adr,
pages = "vii + 94",
month = jan,
year = "2015",
DOI = "https://doi.org/10.6028/NIST.SP.800-57pt3r1",
bibdate = "Thu Apr 11 13:59:47 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://nvlpubs.nist.gov/nistpubs/specialpublications/nist.sp.800-57pt3r1.pdf",
abstract = "NIST Special Publication 800-57 provides cryptographic
key management guidance. It consists of three parts.
Part 1 provides general guidance and best practices for
the management of cryptographic keying material. Part 2
provides guidance on policy and security planning
requirements for U.S. government agencies. Finally,
Part 3 provides guidance when using the cryptographic
features of current systems.",
acknowledgement = ack-nhfb,
keywords = "accreditation; assurances; authentication;
authorization; availability; backup; certification;
compromise; confidentiality; cryptanalysis;
cryptographic key; cryptographic module; digital
signature; key management; key management policy; key
recovery; private key; public key; public key
infrastructure; security plan; trust anchor;
validation",
}
@Article{Barthe:2015:HAC,
author = "Gilles Barthe",
title = "High-Assurance Cryptography: Cryptographic Software We
Can Trust",
journal = j-IEEE-SEC-PRIV,
volume = "13",
number = "5",
pages = "86--89",
month = sep # "\slash " # oct,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2015.112",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Sat Oct 31 11:38:22 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "http://csdl.computer.org/csdl/mags/sp/2015/05/msp2015050086-abs.html",
abstract-URL = "http://csdl.computer.org/csdl/mags/sp/2015/05/msp2015050086-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Basin:2015:ISC,
author = "David Basin and Cas Cremers and Kunihiko Miyazaki and
Sasa Radomirovic and Dai Watanabe",
title = "Improving the Security of Cryptographic Protocol
Standards",
journal = j-IEEE-SEC-PRIV,
volume = "13",
number = "3",
pages = "24--31",
month = may # "\slash " # jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2013.162",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Mon Aug 3 11:45:33 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "http://www.computer.org/csdl/mags/sp/2015/03/msp2015030024-abs.html",
abstract-URL = "http://www.computer.org/csdl/mags/sp/2015/03/msp2015030024-abs.html",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Bellovin:2015:WRC,
author = "Steven M. Bellovin",
title = "What a Real Cybersecurity Bill Should Address",
journal = j-IEEE-SEC-PRIV,
volume = "13",
number = "3",
pages = "92--92",
month = may # "\slash " # jun,
year = "2015",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Mon Aug 3 11:45:33 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "http://www.computer.org/csdl/mags/sp/2015/03/msp2015030092.html",
abstract-URL = "http://www.computer.org/csdl/mags/sp/2015/03/msp2015030092-abs.html",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
journal-URL = "https://publications.computer.org/security-and-privacy/",
}
@Article{Benaloh:2015:EEV,
author = "Josh Benaloh and Ronald L. Rivest and Peter Y. A. Ryan
and Philip B. Stark and Vanessa Teague and Poorvi L.
Vora",
title = "End-to-end verifiability",
journal = "arxiv.org",
volume = "??",
number = "??",
pages = "??--??",
day = "15",
month = apr,
year = "2015",
bibdate = "Sat Oct 31 11:30:14 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://arxiv.org/abs/1504.03778",
abstract = "This pamphlet describes end-to-end election
verifiability (E2E-V) for a nontechnical audience:
election officials, public policymakers, and anyone
else interested in secure, transparent, evidence-based
electronic elections.",
acknowledgement = ack-nhfb,
}
@Article{Bernstein:2015:SPS,
author = "Daniel J. Bernstein and Daira Hopwood and Andreas
H{\"u}lsing and Tanja Lange and Ruben Niederhagen and
Louiza Papachristodoulou and Michael Schneider and
Peter Schwabe and Zooko Wilcox-O'Hearn",
title = "{SPHINCS}: Practical Stateless Hash-Based Signatures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "9056",
pages = "368--397",
year = "2015",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-662-46800-5_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 31 16:23:33 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "https://link.springer.com/chapter/10.1007/978-3-662-46800-5_15",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
journal-URL = "http://link.springer.com/bookseries/558",
remark = "Proceedings of the International Conference on Theory
and Applications of Cryptographic Techniques (EUROCRYPT
15)",
}
@Article{Bhasin:2015:EFB,
author = "Shivam Bhasin and Jean-Luc Danger and Sylvain Guilley
and Wei He",
title = "Exploiting {FPGA} Block Memories for Protected
Cryptographic Implementations",
journal = j-TRETS,
volume = "8",
number = "3",
pages = "16:1--16:??",
month = may,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2629552",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Tue May 19 17:05:24 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
abstract = "Modern field programmable gate arrays (FPGAs) are
power packed with features to facilitate designers.
Availability of features like large block memory
(BRAM), digital signal processing cores, and embedded
CPU makes the design strategy of FPGAs quite different
from ASICs. FPGAs are also widely used in
security-critical applications where protection against
known attacks is of prime importance. We focus on
physical attacks that target physical implementations.
To design countermeasures against such attacks, the
strategy for FPGA designers should be different from
that in ASIC. The available features should be
exploited to design compact and strong countermeasures.
In this article, we propose methods to exploit the
BRAMs in FPGAs for designing compact countermeasures.
Internal BRAM can be used to optimize intrinsic
countermeasures such as masking and dual-rail logics,
which otherwise have significant overhead (at least $ 2
\times $) compared to unprotected ones. The
optimizations are applied on a real AES-128
co-processor and tested for area overhead and
resistance on Xilinx Virtex-5 chips. The presented
masking countermeasure has an overhead of only 16\%
when applied on AES. Moreover, the dual-rail precharge
logic (DPL) countermeasure has been optimized to pack
the whole sequential part in the BRAM, hence enhancing
the security. Proper robustness evaluations are
conducted to analyze the optimization in terms of area
and security.",
acknowledgement = ack-nhfb,
articleno = "16",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
}
@Article{Bidgoly:2015:MQV,
author = "Amir Jalaly Bidgoly and Behrouz Tork Ladani",
title = "Modelling and Quantitative Verification of Reputation
Systems Against Malicious Attackers",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2567--2582",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu130",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2567",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 18, 2014",
}
@Article{Blasco:2015:HDT,
author = "Jorge Blasco and Juan E. Tapiador and Pedro
Peris-Lopez and Guillermo Suarez-Tangil",
title = "Hindering data theft with encrypted data trees",
journal = j-J-SYST-SOFTW,
volume = "101",
number = "??",
pages = "147--158",
month = mar,
year = "2015",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Jan 27 06:18:33 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121214002775",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Blondeau:2015:IDA,
author = "C{\'e}line Blondeau",
title = "Impossible differential attack on $ 13$-round
{Camellia-192}",
journal = j-INFO-PROC-LETT,
volume = "115",
number = "9",
pages = "660--666",
month = sep,
year = "2015",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu May 28 06:02:28 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015000472",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Bollman:2015:PWI,
author = "Dorothy Bollman and Alcibiades Bustillo and Einstein
Morales",
title = "Parallel Watermarking of Images in the Frequency
Domain",
journal = j-SCPE,
volume = "16",
number = "2",
pages = "205--217",
month = "????",
year = "2015",
CODEN = "????",
ISSN = "1895-1767",
ISSN-L = "1895-1767",
bibdate = "Mon Jan 7 06:46:46 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/scpe.bib",
URL = "https://www.scpe.org/index.php/scpe/article/view/1090",
acknowledgement = ack-nhfb,
fjournal = "Scalable Computing: Practice and Experience",
journal-URL = "http://www.scpe.org/",
}
@Article{Bonneau:2015:PEI,
author = "Joseph Bonneau and Cormac Herley and Paul C. van
Oorschot and Frank Stajano",
title = "Passwords and the evolution of imperfect
authentication",
journal = j-CACM,
volume = "58",
number = "7",
pages = "78--87",
month = jul,
year = "2015",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2699390",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Jul 28 10:56:51 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2015/7/188731/fulltext",
abstract = "Theory on passwords has lagged practice, where large
providers use back-end smarts to survive with imperfect
technology.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Boorghany:2015:CIL,
author = "Ahmad Boorghany and Siavash Bayat Sarmadi and Rasool
Jalili",
title = "On Constrained Implementation of Lattice-Based
Cryptographic Primitives and Schemes on Smart Cards",
journal = j-TECS,
volume = "14",
number = "3",
pages = "42:1--42:??",
month = apr,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2700078",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue Apr 21 17:21:32 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Most lattice-based cryptographic schemes with a
security proof suffer from large key sizes and heavy
computations. This is also true for the simpler case of
authentication protocols that are used on smart cards
as a very-constrained computing environment. Recent
progress on ideal lattices has significantly improved
the efficiency and made it possible to implement
practical lattice-based cryptography on constrained
devices. However, to the best of our knowledge, no
previous attempts have been made to implement
lattice-based schemes on smart cards. In this article,
we provide the results of our implementation of several
state-of-the-art lattice-based authentication protocols
on smart cards and a microcontroller widely used in
smart cards. Our results show that only a few of the
proposed lattice-based authentication protocols can be
implemented using limited resources of such constrained
devices; however, cutting-edge ones are suitably
efficient to be used practically on smart cards.
Moreover, we have implemented fast Fourier transform
(FFT) and discrete Gaussian sampling with different
typical parameter sets, as well as versatile
lattice-based public-key encryptions. These results
have noticeable points that help to design or optimize
lattice-based schemes for constrained devices.",
acknowledgement = ack-nhfb,
articleno = "42",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Bouabana-Tebibel:2015:PSE,
author = "Thouraya Bouabana-Tebibel and Abdellah Kaci",
title = "Parallel search over encrypted data under attribute
based encryption on the Cloud Computing",
journal = j-COMPUT-SECUR,
volume = "54",
number = "??",
pages = "77--91",
month = oct,
year = "2015",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:43 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404815000577",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Bradbury:2015:BSB,
author = "D. Bradbury",
title = "In blocks [Security {Bitcoin}]",
journal = "Engineering Technology",
volume = "10",
number = "2",
pages = "68--71",
month = mar,
year = "2015",
DOI = "https://doi.org/10.1049/et.2015.0208",
ISSN = "1750-9637 (print), 1750-9645 (electronic)",
ISSN-L = "1750-9637",
bibdate = "Thu Nov 30 15:24:52 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
keywords = "bitcoin; blockchain; computer crime; cryptography;
double spending; electronic money; interoperability;
open systems; risk management; risk reduction; users
funds security",
}
@Article{Brocardo:2015:AVM,
author = "Marcelo Luiz Brocardo and Issa Traore and Isaac
Woungang",
title = "Authorship verification of e-mail and tweet messages
applied for continuous authentication",
journal = j-J-COMP-SYS-SCI,
volume = "81",
number = "8",
pages = "1429--1440",
month = dec,
year = "2015",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2014.12.019",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:30 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000014001834",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Buchanan:2015:FIW,
author = "William J. Buchanan and David Lanc and Elochukwu
Ukwandu and Lu Fan and Gordon Russell and Owen Lo",
title = "The Future {Internet}: a World of Secret Shares",
journal = j-FUTURE-INTERNET,
volume = "7",
number = "4",
pages = "445--464",
day = "24",
month = nov,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi7040445",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:54 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/7/4/445",
abstract = "The Public Key Infrastructure (PKI) is crumbling,
partially due to the lack of a strong understanding of
how encryption actually works, but also due to
weaknesses in its implementation. This paper outlines
an Internet storage technique using secret sharing
methods which could be used to overcome the problems
inherent with PKI, while supporting new types of
architectures incorporating such things as automated
failover and break-glass data recovery. The paper
outlines a novel architecture: SECRET, which supports a
robust cloud-based infrastructure with in-built privacy
and failover. In order to understand the performance
overhead of SECRET, the paper outlines a range of
experiments that investigate the overhead of this and
other secret share methods.",
acknowledgement = ack-nhfb,
remark = "Special Issue Internet Security.",
}
@Article{Buckley:2015:RVV,
author = "N. Buckley and A. K. Nagar and S. Arumugam",
title = "On Real-valued Visual Cryptographic Basis Matrices",
journal = j-J-UCS,
volume = "21",
number = "12",
pages = "1536--??",
month = "????",
year = "2015",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Wed Sep 7 16:47:22 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_21_12/on_real_valued_visual",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Bugliesi:2015:ART,
author = "Michele Bugliesi and Stefano Calzavara and Fabienne
Eigner and Matteo Maffei",
title = "Affine Refinement Types for Secure Distributed
Programming",
journal = j-TOPLAS,
volume = "37",
number = "4",
pages = "11:1--11:??",
month = aug,
year = "2015",
CODEN = "ATPSDT",
DOI = "https://doi.org/10.1145/2743018",
ISSN = "0164-0925 (print), 1558-4593 (electronic)",
ISSN-L = "0164-0925",
bibdate = "Thu Aug 13 17:33:50 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/toplas/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toplas.bib",
abstract = "Recent research has shown that it is possible to
leverage general-purpose theorem-proving techniques to
develop powerful type systems for the verification of a
wide range of security properties on application code.
Although successful in many respects, these type
systems fall short of capturing resource-conscious
properties that are crucial in large classes of modern
distributed applications. In this article, we propose
the first type system that statically enforces the
safety of cryptographic protocol implementations with
respect to authorization policies expressed in affine
logic. Our type system draws on a novel notion of
``exponential serialization'' of affine formulas, a
general technique to protect affine formulas from the
effect of duplication. This technique allows formulate
of an expressive logical encoding of the authentication
mechanisms underpinning distributed resource-aware
authorization policies. We discuss the effectiveness of
our approach on two case studies: the EPMO e-commerce
protocol and the Kerberos authentication protocol. We
finally devise a sound and complete type-checking
algorithm, which is the key to achieving an efficient
implementation of our analysis technique.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Programming Languages and
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783",
}
@Article{Bugliesi:2015:CPB,
author = "Michele Bugliesi and Stefano Calzavara and Riccardo
Focardi and Wilayat Khan",
title = "{CookiExt}: Patching the browser against session
hijacking attacks",
journal = j-J-COMP-SECUR,
volume = "23",
number = "4",
pages = "509--537",
month = "????",
year = "2015",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-150529",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:26:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Calzavara:2015:SLA,
author = "Stefano Calzavara and Gabriele Tolomei and Andrea
Casini and Michele Bugliesi and Salvatore Orlando",
title = "A Supervised Learning Approach to Protect Client
Authentication on the {Web}",
journal = j-TWEB,
volume = "9",
number = "3",
pages = "15:1--15:??",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2754933",
ISSN = "1559-1131 (print), 1559-114X (electronic)",
ISSN-L = "1559-1131",
bibdate = "Fri Aug 7 10:27:41 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tweb.bib",
abstract = "Browser-based defenses have recently been advocated as
an effective mechanism to protect potentially insecure
web applications against the threats of session
hijacking, fixation, and related attacks. In existing
approaches, all such defenses ultimately rely on
client-side heuristics to automatically detect cookies
containing session information, to then protect them
against theft or otherwise unintended use. While
clearly crucial to the effectiveness of the resulting
defense mechanisms, these heuristics have not, as yet,
undergone any rigorous assessment of their adequacy. In
this article, we conduct the first such formal
assessment, based on a ground truth of 2,464 cookies we
collect from 215 popular websites of the Alexa ranking.
To obtain the ground truth, we devise a semiautomatic
procedure that draws on the novel notion of
authentication token, which we introduce to capture
multiple web authentication schemes. We test existing
browser-based defenses in the literature against our
ground truth, unveiling several pitfalls both in the
heuristics adopted and in the methods used to assess
them. We then propose a new detection method based on
supervised learning, where our ground truth is used to
train a set of binary classifiers, and report on
experimental evidence that our method outperforms
existing proposals. Interestingly, the resulting
classifiers, together with our hands-on experience in
the construction of the ground truth, provide new
insight on how web authentication is actually
implemented in practice.",
acknowledgement = ack-nhfb,
articleno = "15",
fjournal = "ACM Transactions on the Web (TWEB)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1062",
}
@Article{Cascudo:2015:SSN,
author = "Ignacio Cascudo and Ronald Cramer and Diego Mirandola
and Carles Padr{\'o} and Chaoping Xing",
title = "On Secret Sharing with Nonlinear Product
Reconstruction",
journal = j-SIAM-J-DISCR-MATH,
volume = "29",
number = "2",
pages = "1114--1131",
month = "????",
year = "2015",
CODEN = "SJDMEC",
DOI = "https://doi.org/10.1137/130931886",
ISSN = "0895-4801 (print), 1095-7146 (electronic)",
ISSN-L = "0895-4801",
bibdate = "Sat Aug 8 07:28:14 MDT 2015",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SIDMA/29/2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/siamjdiscrmath.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Discrete Mathematics",
journal-URL = "http://epubs.siam.org/sidma",
onlinedate = "January 2015",
}
@Article{Cass:2015:SE,
author = "Stephen Cass",
title = "A simple {Enigma}",
journal = j-IEEE-SPECTRUM,
volume = "52",
number = "1",
pages = "19--20",
month = jan,
year = "2015",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2015.6995623",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Ciphers; Cryptography; Electromechanical devices;
Enigma cipher machine; Military communication; Military
computing",
}
@Article{Cerf:2015:CTN,
author = "Vinton G. Cerf",
title = "{Cerf}'s up: There is nothing new under the sun",
journal = j-CACM,
volume = "58",
number = "2",
pages = "7--7",
month = feb,
year = "2015",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2714559",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Feb 10 13:56:49 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2015/2/182649/fulltext",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "cryptography; steganography; Voynich Manuscript;
William Friedman",
}
@Article{Chakraborty:2015:SSC,
author = "D. Chakraborty and C. Mancillas-Lopez and P. Sarkar",
title = "{STES}: A Stream Cipher Based Low Cost Scheme for
Securing Stored Data",
journal = j-IEEE-TRANS-COMPUT,
volume = "64",
number = "9",
pages = "2691--2707",
month = "????",
year = "2015",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2014.2366739",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Sep 28 12:03:47 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Chen:2015:SSS,
author = "Yu-Chi Chen",
title = "{SPEKS}: Secure Server-Designation Public Key
Encryption with Keyword Search against Keyword Guessing
Attacks",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "922--933",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu013",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/922",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "March 5, 2014",
}
@Article{Chen:2015:TCP,
author = "Shangdi Chen and Xiaolian Zhang",
title = "Three constructions of perfect authentication codes
from projective geometry over finite fields",
journal = j-APPL-MATH-COMP,
volume = "253",
number = "??",
pages = "308--317",
day = "15",
month = feb,
year = "2015",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Wed Feb 18 09:36:23 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2015.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300314017494",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003/",
}
@Article{Cheng:2015:OMU,
author = "Rong Cheng and Fangguo Zhang",
title = "Obfuscation for multi-use re-encryption and its
application in cloud computing",
journal = j-CCPE,
volume = "27",
number = "8",
pages = "2170--2190",
day = "10",
month = jun,
year = "2015",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3399",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Jul 25 19:54:07 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "1 Oct 2014",
}
@Article{Cho:2015:CBF,
author = "Jung-Sik Cho and Young-Sik Jeong and Sang Oh Park",
title = "Consideration on the brute-force attack cost and
retrieval cost: a hash-based radio-frequency
identification {(RFID)} tag mutual authentication
protocol",
journal = j-COMPUT-MATH-APPL,
volume = "69",
number = "1",
pages = "58--65",
month = jan,
year = "2015",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:51:39 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122112001393",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Chong:2015:SID,
author = "Stephen Chong and Christian Skalka and Jeffrey A.
Vaughan",
title = "Self-Identifying Data for Fair Use",
journal = j-JDIQ,
volume = "5",
number = "3",
pages = "11:1--11:??",
month = feb,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2687422",
ISSN = "1936-1955",
bibdate = "Tue Mar 3 14:42:39 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/jdqi/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jdiq.bib",
abstract = "Public-use earth science datasets are a useful
resource with the unfortunate feature that their
provenance is easily disconnected from their content.
``Fair-use policies'' typically associated with these
datasets require appropriate attribution of providers
by users, but sound and complete attribution is
difficult if provenance information is lost. To address
this, we introduce a technique to directly associate
provenance information with sensor datasets. Our
technique is similar to traditional watermarking but is
intended for application to unstructured time-series
datasets. Our approach is potentially imperceptible
given sufficient margins of error in datasets and is
robust to a number of benign but likely transformations
including truncation, rounding, bit-flipping, sampling,
and reordering. We provide algorithms for both one-bit
and blind mark checking and show how our system can be
adapted to various data representation types. Our
algorithms are probabilistic in nature and are
characterized by both combinatorial and empirical
analyses. Mark embedding can be applied at any point in
the data life cycle, allowing adaptation of our scheme
to social or scientific concerns.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "Journal of Data and Information Quality (JDIQ)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1191",
}
@Article{Chretien:2015:SPP,
author = "R{\'e}my Chr{\'e}tien and V{\'e}ronique Cortier and
St{\'e}phanie Delaune",
title = "From Security Protocols to Pushdown Automata",
journal = j-TOCL,
volume = "17",
number = "1",
pages = "3:1--3:??",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2811262",
ISSN = "1529-3785 (print), 1557-945X (electronic)",
ISSN-L = "1529-3785",
bibdate = "Sat Jan 9 10:42:43 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/tocl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tocl.bib",
abstract = "Formal methods have been very successful in analyzing
security protocols for reachability properties such as
secrecy or authentication. In contrast, there are very
few results for equivalence-based properties, crucial
for studying, for example, privacy-like properties such
as anonymity or vote secrecy. We study the problem of
checking equivalence of security protocols for an
unbounded number of sessions. Since replication leads
very quickly to undecidability (even in the simple case
of secrecy), we focus on a limited fragment of
protocols (standard primitives but pairs, one variable
per protocol's rules) for which the secrecy
preservation problem is known to be decidable.
Surprisingly, this fragment turns out to be undecidable
for equivalence. Then, restricting our attention to
deterministic protocols, we propose the first
decidability result for checking equivalence of
protocols for an unbounded number of sessions. This
result is obtained through a characterization of
equivalence of protocols in terms of equality of
languages of (generalized, real-time) deterministic
pushdown automata. We further show that checking for
equivalence of protocols is actually equivalent to
checking for equivalence of generalized, real-time
deterministic pushdown automata. Very recently, the
algorithm for checking for equivalence of deterministic
pushdown automata has been implemented. We have
implemented our translation from protocols to pushdown
automata, yielding the first tool that decides
equivalence of (some class of) protocols, for an
unbounded number of sessions. As an application, we
have analyzed some protocols of the literature
including a simplified version of the basic access
control (BAC) protocol used in biometric passports.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Computational Logic",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J773",
}
@Article{Cooke:2015:FSM,
author = "Patrick Cooke and Lu Hao and Greg Stitt",
title = "Finite-State-Machine Overlay Architectures for Fast
{FPGA} Compilation and Application Portability",
journal = j-TECS,
volume = "14",
number = "3",
pages = "54:1--54:??",
month = apr,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2700082",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue Apr 21 17:21:32 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Despite significant advantages, wider usage of
field-programmable gate arrays (FPGAs) has been limited
by lengthy compilation and a lack of portability.
Virtual-architecture overlays have partially addressed
these problems, but previous work focuses mainly on
heavily pipelined applications with minimal control
requirements. We expand previous work by enabling more
flexible control via overlay architectures for
finite-state machines. Although not appropriate for
control-intensive circuits, the presented architectures
reduced compilation times of control changes in a
convolution case study from 7 hours to less than 1
second, with no performance overhead and an area
overhead of 0.2\%.",
acknowledgement = ack-nhfb,
articleno = "54",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Culnane:2015:VVV,
author = "Chris Culnane and Peter Y. A. Ryan and Steve Schneider
and Vanessa Teague",
title = "{vVote}: a Verifiable Voting System",
journal = j-TISSEC,
volume = "18",
number = "1",
pages = "3:1--3:??",
month = jun,
year = "2015",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2746338",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Jun 10 08:04:25 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "The Pr{\^e}t {\`a} Voter cryptographic voting system
was designed to be flexible and to offer voters a
familiar and easy voting experience. In this article,
we present our development of the Pr{\^e}t {\`a} Voter
design to a practical implementation used in a real
state election in November 2014, called vVote. As well
as solving practical engineering challenges, we have
also had to tailor the system to the idiosyncrasies of
elections in the Australian state of Victoria and the
requirements of the Victorian Electoral Commission.
This article includes general background, user
experience, and details of the cryptographic protocols
and human processes. We explain the problems, present
solutions, then analyze their security properties and
explain how they tie in to other design decisions.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Das:2015:DCS,
author = "Debasish Das and Utpal Sharma and D. K.
Bhattacharyya",
title = "Detection of Cross-Site Scripting Attack under
Multiple Scenarios",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "808--822",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt133",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/808",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 14, 2013",
}
@Article{DeCarneDeCarnavalet:2015:LSE,
author = "Xavier {De Carn{\'e} De Carnavalet} and Mohammad
Mannan",
title = "A Large-Scale Evaluation of High-Impact Password
Strength Meters",
journal = j-TISSEC,
volume = "18",
number = "1",
pages = "1:1--1:??",
month = jun,
year = "2015",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2739044",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Jun 10 08:04:25 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "Passwords are ubiquitous in our daily digital lives.
They protect various types of assets ranging from a
simple account on an online newspaper website to our
health information on government websites. However, due
to the inherent value they protect, attackers have
developed insights into cracking/guessing passwords
both offline and online. In many cases, users are
forced to choose stronger passwords to comply with
password policies; such policies are known to alienate
users and do not significantly improve password
quality. Another solution is to put in place proactive
password-strength meters/checkers to give feedback to
users while they create new passwords. Millions of
users are now exposed to these meters on highly popular
web services that use user-chosen passwords for
authentication. More recently, these meters are also
being built into popular password managers, which
protect several user secrets including passwords.
Recent studies have found evidence that some meters
actually guide users to choose better passwords-which
is a rare bit of good news in password research.
However, these meters are mostly based on ad hoc
design. At least, as we found, most vendors do not
provide any explanation for their design choices,
sometimes making them appear as a black box. We analyze
password meters deployed in selected popular websites
and password managers. We document obfuscated
source-available meters, infer the algorithm behind the
closed-source ones, and measure the strength labels
assigned to common passwords from several password
dictionaries. From this empirical analysis with
millions of passwords, we shed light on how the server
end of some web service meters functions and provide
examples of highly inconsistent strength outcomes for
the same password in different meters, along with
examples of many weak passwords being labeled as strong
or even excellent. These weaknesses and inconsistencies
may confuse users in choosing a stronger password, and
thus may weaken the purpose of these meters. On the
other hand, we believe these findings may help improve
existing meters and possibly make them an effective
tool in the long run.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Book{Delfs:2015:ICP,
author = "Hans Delfs and Helmut Knebl",
title = "Introduction to Cryptography: Principles and
Applications",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Third",
pages = "xx + 508 + 5",
year = "2015",
DOI = "https://doi.org/10.1007/978-3-662-47974-2",
ISBN = "3-662-47973-7 (paper), 3-662-47974-5 (e-book)",
ISBN-13 = "978-3-662-47973-5 (paper), 978-3-662-47974-2
(e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.A25; QA76.9.D35",
bibdate = "Sat Jun 10 08:35:23 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Information Security and Cryptography",
URL = "http://link.springer.com/book/10.1007/978-3-662-47974-2",
abstract = "The first part of this book covers the key concepts of
cryptography on an undergraduate level, from encryption
and digital signatures to cryptographic protocols.
Essential techniques are demonstrated in protocols for
key exchange, user identification, electronic elections
and digital cash. In the second part, more advanced
topics are addressed, such as the bit security of
one-way functions and computationally perfect
pseudorandom bit generators. The security of
cryptographic schemes is a central topic. Typical
examples of provably secure encryption and signature
schemes and their security proofs are given. Though
particular attention is given to the mathematical
foundations, no special background in mathematics is
presumed. The necessary algebra, number theory and
probability theory are included in the appendix. Each
chapter closes with a collection of exercises. In the
second edition the authors added a complete description
of the AES, an extended section on cryptographic hash
functions, and new sections on random oracle proofs and
public-key encryption schemes that are provably secure
against adaptively-chosen-ciphertext attacks. The third
edition is a further substantive extension, with new
topics added, including: elliptic curve cryptography;
Paillier encryption; quantum cryptography; the new
SHA-3 standard for cryptographic hash functions; a
considerably extended section on electronic elections
and Internet voting; mix nets; and zero-knowledge
proofs of shuffles. The book is appropriate for
undergraduate and graduate students in computer
science, mathematics, and engineering.",
acknowledgement = ack-nhfb,
shorttableofcontents = "Introduction \\
Symmetric-Key Encryption \\
Public-Key Cryptography \\
Cryptographic Protocols \\
Probabilistic Algorithms \\
One-Way Functions and the Basic Assumptions \\
Bit Security of One-Way Functions \\
One-Way Functions and Pseudorandomness \\
Provably Secure Encryption \\
Unconditional Security of Cryptosystems \\
Provably Secure Digital Signatures \\
App. A, Algebra and Number Theory \\
App. B, Probabilities and Information Theory \\
References \\
Index",
subject = "Computer science; Informatique; Computer security;
S{\'e}curit{\'e} informatique; Data structures
(Computer science); Structures de donn{\'e}es
(Informatique); Mathematics; Math{\'e}matiques; Number
theory; Th{\'e}orie des nombres; Computer science;
Mathematics; Computer security; Data structures
(Computer science); Number theory.",
tableofcontents = "1. Introduction / 1 \\
1.1 Encryption and Secrecy / 1 \\
1.2 The Objectives of Cryptography / 2 \\
1.3 Attacks / 4 \\
1.4 Cryptographic Protocols / 5 \\
1.5 Provable Security / 6 \\
2. Symmetric-Key Cryptography / 11 \\
2.1 Symmetric-Key Encryption / 11 \\
2.1.1 Stream Ciphers / 12 \\
2.1.2 Block Ciphers / 15 \\
2.1.3 DES / 16 \\
2.1.4 AES / 19 \\
2.1.5 Modes of Operation / 25 \\
2.2 Cryptographic Hash Functions / 30 \\
2.2.1 Security Requirements for Hash Functions / 30 \\
2.2.2 Construction of Hash Functions / 32 \\
2.2.3 Data Integrity and Message Authentication / 42
\\
2.2.4 Hash Functions as Random Functions / 44 \\
3. Public-Key Cryptography / 49 \\
3.1 The Concept of Public-Key Cryptography / 49 \\
3.2 Modular Arithmetic / 51 \\
3.2.1 The Integers / 51 \\
3.2.2 The Integers Modulo n / 53 \\
3.3 RSA : / 58 \\
3.3.1 Key Generation and Encryption / 58 \\
3.3.2 Attacks Against RSA Encryption / 62 \\
3.3.3 Probabilistic RSA Encryption / 67 \\
3.3.4 Digital Signatures The Basic Scheme / 70 \\
3.3.5 Signatures with Hash Functions / 71 \\
3.4 The Discrete Logarithm / 77 \\
3.4.1 ElGamal Encryption / 77 \\
3.4.2 ElGamal Signatures / 78 \\
3.4.3 Digital Signature Algorithm / 80 \\
3.4.4 ElGamal Encryption in a Prime-Order Subgroup / 82
\\
3.5 Modular Squaring / 85 \\
3.5.1 Rabin's Encryption / 85 \\
3.5.2 Rabin's Signature Scheme / 86 \\
3.6 Homomorphic Encryption Algorithms / 87 \\
3.6.1 ElGamal Encryption / 87 \\
3.6.2 Paillier Encryption / 88 \\
3.6.3 Re-encryption of Ciphertexts / 89 \\
3.7 Elliptic Curve Cryptography / 90 \\
3.7.1 Selecting the Curve and the Base Point / 93 \\
3.7.2 Diffie-Hellman Key Exchange / 98 \\
3.7.3 ElGamal Encryption / 100 \\
3.7.4 Elliptic Curve Digital Signature Algorithm / 102
\\
4. Cryptographic Protocols / 107 \\
4.1 Key Exchange and Entity Authentication / 107 \\
4.1.1 Kerberos / 108 \\
4.1.2 Diffie-Hellman Key Agreement Ill 4.1.3 Key
Exchange and Mutual Authentication / 112 \\
4.1.4 Station-to-Station Protocol / 114 \\
4.1.5 Public-Key Management Techniques / 115 \\
4.2 Identification Schemes / 117 \\
4.2.1 Interactive Proof Systems / 117 \\
4.2.2 Simplified Fiat--Shamir Identification Scheme /
119 \\
4.2.3 Zero-Knowledge / 121 \\
4.2.4 Fiat--Shamir Identification Scheme / 123 \\
4.2.5 Fiat--Shamir Signature Scheme / 125 \\
4.3 Commitment Schemes / 126 \\
4.3.1 A Commitment Scheme Based on Quadratic Residues /
127 \\
4.3.2 A Commitment Scheme Based on Discrete Logarithms
/ 128 \\
4.3.3 Homomorphic Commitments / 129 \\
4.4 Secret Sharing / 130 \\
4.5 Verifiable Electronic Elections / 133 \\
4.5.1 A Multi-authority Election Scheme / 135 \\
4.5.2 Proofs of Knowledge / 138 \\
4.5.3 Non-interactive Proofs of Knowledge / 142 \\
4.5.4 Extension to Multi-way Elections / 143 \\
4.5.5 Eliminating the Trusted Center / 144 \\
4.6 Mix Nets and Shuffles / 146 \\
4.6.1 Decryption Mix Nets / 147 \\
4.6.2 Re-encryption Mix Nets / 150 \\
4.6.3 Proving Knowledge of the Plaintext / 153 \\
4.6.4 Zero-Knowledge Proofs of Shuffles / 154 \\
4.7 Receipt-Free and Coercion-Resistant Elections / 168
\\
4.7.1 Receipt-Freeriess by Randomized Re-encryption /
169 \\
4.7.2 A Coercion-Resistant Protocol / 176 \\
4.8 Digital Cash / 184 \\
4.8.1 Blindly Issued Proofs / 186 \\
4.8.2 A Fair Electronic Cash System / 192 \\
4.8.3 Underlying Problems / 197 \\
5. Probabilistic Algorithms / 203 \\
5.1 Coin-Tossing Algorithms / 203 \\
5.2 Monte Carlo and Las Vegas Algorithms / 208 \\
6. One-Way Functions and the Basic Assumptions / 215
\\
6.1 A Notation for Probabilities / 216 \\
6.2 Discrete Exponential Function / 217 \\
6.3 Uniform Sampling Algorithms / 223 \\
6.4 Modular Powers / 226 \\
6.5 Modular Squaring / 229 \\
6.6 Quadratic Residuosity Property / 230 \\
6.7 Formal Definition of One-Way Functions / 231 \\
6.8 Hard-Core Predicates / 235 \\
7. Bit Security of One-Way Functions / 243 \\
7.1 Bit Security of the Exp Family / 243 \\
7.2 Bit Security of the RSA Family / 250 \\
7.3 Bit Security of the Square Family / 258 \\
8. One-Way Functions and Pseudorandomness / 267 \\
8.1 Computationally Perfect Pseudorandom Bit Generators
/ 267 \\
8.2 Yao's Theorem / 275 \\
9. Provably Secure Encryption / 283 \\
9.1 Classical Information-Theoretic Security / 284 \\
9.2 Perfect Secrecy and Probabilistic Attacks / 288 \\
9.3 Public-Key One-Time Pads / 292 \\
9.4 Passive Eavesdroppers / 294 \\
9.5 Chosen-Ciphertext Attacks / 301 \\
9.5.1 A Security Proof in the Random Oracle Model / 304
\\
9.5.2 Security Under Standard Assumptions / 313 \\
10. Unconditional Security of Cryptosystems / 321 \\
10.1 The Bounded Storage Model / 322 \\
10.2 The Noisy Channel Model / 332 \\
10.3 Unconditionally Secure Message Authentication /
333 \\
10.3.1 Almost Universal Classes of Hash Functions / 333
\\
10.3.2 Message Authentication with Universal Hash
Families / 335 \\
10.3.3 Authenticating Multiple Messages / 336 \\
10.4 Collision Entropy and Privacy Amplification / 337
\\
10.4.1 Renyi Entropy / 338 \\
10.4.2 Privacy Amplification / 340 \\
10.4.3 Extraction of a Secret Key / 341 \\
10.5 Quantum Key Distribution / 343 \\
10.5.1 Quantum Bits and Quantum Measurements / 344 \\
10.5.2 The BB84 Protocol / 350 \\
10.5.3 Estimation of the Error Rate / 353 \\
10.5.4 Intercept-and-Resend Attacks / 354 \\
10.5.5 Information Reconciliation / 362 \\
10.5.6 Exchanging a Secure Key - An Example / 367 \\
10.5.7 General Attacks and Security Proofs / 368 \\
11. Provably Secure Digital Signatures / 373 \\
11.1 Attacks and Levels of Security / 373 \\
11.2 Claw-Free Pairs and Collision-Resistant Hash
Functions / 376 \\
11.3 Authentication-Tree-Based Signatures / 379 \\
11.4 A State-Free Signature Scheme / 381 \\
A. Algebra and Number Theory / 397 \\
A.l The Integers / 397 \\
A.2 Residues / 403 \\
A.3 The Chinese Remainder Theorem / 407 \\
A.4 Primitive Roots and the Discrete Logarithm / 409
\\
A.5 Polynomials and Finite Fields / 413 \\
A.5.1 The Ring of Polynomials / 413 \\
A.5.2 Residue Class Rings / 415 \\
A.5.3 Finite Fields / 417 \\
A.6 Solving Quadratic Equations in Binary Fields / 419
\\
A.7 Quadratic Residues / 421 \\
A.8 Modular Square Roots / 426 \\
A.9 The Group Z*n2 / 430 \\
A.10 Primes and Primality Tests / 432 \\
A. 11 Elliptic Curves / 437 \\
A. 11.1 Plane Curves / 438 \\
A.11.2 Normal Forms of Elliptic Curves / 446 \\
A. 11.3 Point Addition on Elliptic Curves / 449 \\
A.11.4 Group Order and Group Structure of Elliptic
Curves / 455 \\
B. Probabilities and Information Theory / 459 \\
B.l Finite Probability Spaces and Random Variables /
459 \\
B.2 Some Useful and Important Inequalities / 467 \\
B.3 The Weak Law of Large Numbers / 470 \\
B.4 Distance Measures / 472 \\
B.5 Basic Concepts of Information Theory / 476 \\
References / 483 \\
Index / 501",
}
@Article{DeLuca:2015:SUS,
author = "Alexander {De Luca} and Janne Lindqvist",
title = "Is Secure and Usable {Smartphone} Authentication
Asking Too Much?",
journal = j-COMPUTER,
volume = "48",
number = "5",
pages = "64--68",
month = may,
year = "2015",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2015.134",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Jun 9 06:31:54 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://csdl.computer.org/csdl/mags/co/2015/05/mco2015050064-abs.html",
abstract-URL = "http://csdl.computer.org/csdl/mags/co/2015/05/mco2015050064-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Dimitrakakis:2015:ELA,
author = "Christos Dimitrakakis and Aikaterini Mitrokotsa and
Serge Vaudenay",
title = "Expected loss analysis for authentication in
constrained channels",
journal = j-J-COMP-SECUR,
volume = "23",
number = "3",
pages = "309--329",
month = "????",
year = "2015",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-140521",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:26:40 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Ding:2015:CWF,
author = "Lin Ding and Chenhui Jin and Jie Guan and Shaowu Zhang
and Ting Cui and Dong Han and Wei Zhao",
title = "Cryptanalysis of {WG} Family of Stream Ciphers",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2677--2685",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv024",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2677",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "April 20, 2015",
}
@Article{Djuric:2015:FSF,
author = "Zoran Djuric and Dragan Gasevic",
title = "{FEIPS}: a Secure Fair-Exchange Payment System for
{Internet} Transactions",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2537--2556",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu120",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2537",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 5, 2014",
}
@Article{Dong:2015:SSS,
author = "Xin Dong and Jiadi Yu and Yanmin Zhu and Yingying Chen
and Yuan Luo and Minglu Li",
title = "{SECO}: Secure and scalable data collaboration
services in cloud computing",
journal = j-COMPUT-SECUR,
volume = "50",
number = "??",
pages = "91--105",
month = may,
year = "2015",
CODEN = "CPSEDU",
DOI = "https://doi.org/10.1016/j.cose.2015.01.003",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:41 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404815000048",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Doroz:2015:AFH,
author = "Y. Doroz and E. Ozturk and B. Sunar",
title = "Accelerating Fully Homomorphic Encryption in
Hardware",
journal = j-IEEE-TRANS-COMPUT,
volume = "64",
number = "6",
pages = "1509--1521",
month = "????",
year = "2015",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2014.2345388",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Jun 10 07:41:35 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Doychev:2015:CTS,
author = "Goran Doychev and Boris K{\"o}pf and Laurent Mauborgne
and Jan Reineke",
title = "{CacheAudit}: a Tool for the Static Analysis of Cache
Side Channels",
journal = j-TISSEC,
volume = "18",
number = "1",
pages = "4:1--4:??",
month = jun,
year = "2015",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2756550",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Jun 10 08:04:25 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "We present CacheAudit, a versatile framework for the
automatic, static analysis of cache side channels.
CacheAudit takes as input a program binary and a cache
configuration and derives formal, quantitative security
guarantees for a comprehensive set of side-channel
adversaries, namely, those based on observing cache
states, traces of hits and misses, and execution times.
Our technical contributions include novel abstractions
to efficiently compute precise overapproximations of
the possible side-channel observations for each of
these adversaries. These approximations then yield
upper bounds on the amount of information that is
revealed. In case studies, we apply CacheAudit to
binary executables of algorithms for sorting and
encryption, including the AES implementation from the
PolarSSL library, and the reference implementations of
the finalists of the eSTREAM stream cipher competition.
The results we obtain exhibit the influence of cache
size, line size, associativity, replacement policy, and
coding style on the security of the executables and
include the first formal proofs of security for
implementations with countermeasures such as preloading
and data-independent memory access patterns.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Dreier:2015:BFP,
author = "Jannik Dreier and Jean-Guillaume Dumas and Pascal
Lafourcade",
title = "{Brandt}'s fully private auction protocol revisited",
journal = j-J-COMP-SECUR,
volume = "23",
number = "5",
pages = "587--610",
month = "????",
year = "2015",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-150535",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:26:46 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Durcheva:2015:SAI,
author = "Mariana Durcheva",
title = "Some applications of idempotent semirings in public
key cryptography",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "19--19",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768600",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ebadi:2015:DPN,
author = "Hamid Ebadi and David Sands and Gerardo Schneider",
title = "Differential Privacy: Now it's Getting Personal",
journal = j-SIGPLAN,
volume = "50",
number = "1",
pages = "69--81",
month = jan,
year = "2015",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2775051.2677005",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Tue May 12 17:41:19 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "Differential privacy provides a way to get useful
information about sensitive data without revealing much
about any one individual. It enjoys many nice
compositionality properties not shared by other
approaches to privacy, including, in particular,
robustness against side-knowledge. Designing
differentially private mechanisms from scratch can be a
challenging task. One way to make it easier to
construct new differential private mechanisms is to
design a system which allows more complex mechanisms
(programs) to be built from differentially private
building blocks in principled way, so that the
resulting programs are guaranteed to be differentially
private by construction. This paper is about a new
accounting principle for building differentially
private programs. It is based on a simple
generalisation of classic differential privacy which we
call Personalised Differential Privacy (PDP). In PDP
each individual has its own personal privacy level. We
describe ProPer, a interactive system for implementing
PDP which maintains a privacy budget for each
individual. When a primitive query is made on data
derived from individuals, the provenance of the
involved records determines how the privacy budget of
an individual is affected: the number of records
derived from Alice determines the multiplier for the
privacy decrease in Alice's budget. This offers some
advantages over previous systems, in particular its
fine-grained character allows better utilisation of the
privacy budget than mechanisms based purely on the
concept of global sensitivity, and it applies naturally
to the case of a live database where new individuals
are added over time. We provide a formal model of the
ProPer approach, prove that it provides personalised
differential privacy, and describe a prototype
implementation based on McSherry's PINQ system.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "POPL '15 conference proceedings.",
}
@Article{El-Razouk:2015:NHI,
author = "H. El-Razouk and A. Reyhani-Masoleh and Guang Gong",
title = "New Hardware Implementations of {WG} and {WG}-
{StreamCiphers} Using Polynomial Basis",
journal = j-IEEE-TRANS-COMPUT,
volume = "64",
number = "7",
pages = "2020--2035",
month = jul,
year = "2015",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2014.2346207",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sat Aug 1 08:53:41 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{English:2015:SME,
author = "Rosanne English",
title = "Simulating and modelling the effectiveness of
graphical password intersection attacks",
journal = j-CCPE,
volume = "27",
number = "12",
pages = "3089--3107",
day = "25",
month = aug,
year = "2015",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3196",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Jul 25 19:54:09 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "18 Dec 2013",
}
@Article{Enos:2015:IBS,
author = "Graham Enos and Yuliang Zheng",
title = "An {ID}-based signcryption scheme with compartmented
secret sharing for unsigncryption",
journal = j-INFO-PROC-LETT,
volume = "115",
number = "2",
pages = "128--133",
month = feb,
year = "2015",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Nov 20 09:46:44 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019014001537",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Fallahpour:2015:AWB,
author = "M. Fallahpour and D. Megias",
title = "Audio Watermarking Based on {Fibonacci} Numbers",
journal = j-IEEE-ACM-TASLP,
volume = "23",
number = "8",
pages = "1273--1282",
month = aug,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/TASLP.2015.2430818",
ISSN = "2329-9290",
ISSN-L = "2329-9290",
bibdate = "Mon Oct 5 06:29:45 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fibquart.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{Fan:2015:IRD,
author = "Xinyu Fan and Guomin Yang and Yi Mu and Yong Yu",
title = "On Indistinguishability in Remote Data Integrity
Checking",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "823--830",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt137",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/823",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 17, 2013",
}
@Article{Fanti:2015:SVS,
author = "Giulia Fanti and Peter Kairouz and Sewoong Oh and
Pramod Viswanath",
title = "Spy vs. Spy: Rumor Source Obfuscation",
journal = j-SIGMETRICS,
volume = "43",
number = "1",
pages = "271--284",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2796314.2745866",
ISSN = "0163-5999 (print), 1557-9484 (electronic)",
ISSN-L = "0163-5999",
bibdate = "Fri Sep 18 06:59:51 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
abstract = "Anonymous messaging platforms, such as Secret, Yik Yak
and Whisper, have emerged as important social media for
sharing one's thoughts without the fear of being judged
by friends, family, or the public. Further, such
anonymous platforms are crucial in nations with
authoritarian governments; the right to free expression
and sometimes the personal safety of the author of the
message depend on anonymity. Whether for fear of
judgment or personal endangerment, it is crucial to
keep anonymous the identity of the user who initially
posted a sensitive message. In this paper, we consider
an adversary who observes a snapshot of the spread of a
message at a certain time. Recent advances in rumor
source detection shows that the existing messaging
protocols are vulnerable against such an adversary. We
introduce a novel messaging protocol, which we call
adaptive diffusion, and show that it spreads the
messages fast and achieves a perfect obfuscation of the
source when the underlying contact network is an
infinite regular tree: all users with the message are
nearly equally likely to have been the origin of the
message. Experiments on a sampled Facebook network show
that it effectively hides the location of the source
even when the graph is finite, irregular and has
cycles.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journal-URL = "http://portal.acm.org/toc.cfm?id=J618",
}
@Article{Farash:2015:PSE,
author = "Mohammad Sabzinejad Farash and Sk Hafizul Islam and
Mohammad S. Obaidat",
title = "A provably secure and efficient two-party
password-based explicit authenticated key exchange
protocol resistance to password guessing attacks",
journal = j-CCPE,
volume = "27",
number = "17",
pages = "4897--4913",
day = "10",
month = dec,
year = "2015",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3477",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue Feb 9 06:13:20 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "17 Mar 2015",
}
@Article{Ferreira:2015:LPA,
author = "Anselmo Ferreira and Luiz C. Navarro and Giuliano
Pinheiro and Jefersson A. dos Santos and Anderson
Rocha",
title = "Laser printer attribution: Exploring new features and
beyond",
journal = "Forensic Science International",
volume = "247",
number = "0",
pages = "105--125",
year = "2015",
DOI = "https://doi.org/10.1016/j.forsciint.2014.11.030",
ISSN = "0379-0738",
bibdate = "Wed Jan 28 10:08:12 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "See also \cite{Jiang:2010:NMS}.",
URL = "http://www.sciencedirect.com/science/article/pii/S0379073814005064",
abstract = "With a huge amount of printed documents nowadays,
identifying their source is useful for criminal
investigations and also to authenticate digital copies
of a document. In this paper, we propose novel
techniques for laser printer attribution. Our solutions
do not need very high resolution scanning of the
investigated document and explore the multidirectional,
multiscale and low-level gradient texture patterns
yielded by printing devices. The main contributions of
this work are: (1) the description of printed areas
using multidirectional and multiscale co-occurring
texture patterns; (2) description of texture on
low-level gradient areas by a convolution texture
gradient filter that emphasizes textures in specific
transition areas and (3) the analysis of printer
patterns in segments of interest, which we call frames,
instead of whole documents or only printed letters. We
show by experiments in a well documented dataset that
the proposed methods outperform techniques described in
the literature and present near-perfect classification
accuracy being very promising for deployment in
real-world forensic investigations.",
acknowledgement = ack-nhfb,
keywords = "Banding; Benford's Law; Printer forensics; Texture
patterns",
}
@Article{Fiore:2015:EIB,
author = "Ugo Fiore and Francesco Rossi",
title = "Embedding an Identity-Based Short Signature as a
Digital Watermark",
journal = j-FUTURE-INTERNET,
volume = "7",
number = "4",
pages = "393--404",
day = "23",
month = oct,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi7040393",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:54 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/7/4/393",
abstract = "Digital watermarking aims at protecting multimedia
content by hiding into it some data that can be used
for such purposes as, for example, intellectual
property protection or integrity control. Sometimes,
the owner of an image would prefer to not transmit,
publish, or hand to a cloud service the original image,
but rather an encrypted version of it. Encrypted images
allow for less embedding room with respect to their
unencrypted counterparts, as there is less spatial
correlation to leverage upon. An architecture for
embedding as payload the digital signature of an
encrypted image, by means of a reversible watermarking
technique, is presented in this work. A noteworthy
point is the use of an identity-based cryptosystem to
avoid certificate management and improve performance.
In addition, the use of IBS-1, a recently proposed
signature scheme, allows for a reduction in the size of
the signature.",
acknowledgement = ack-nhfb,
}
@Article{Fisher:2015:CS,
author = "Charles Fisher",
title = "Cipher security",
journal = j-LINUX-J,
volume = "2015",
number = "257",
pages = "2:1--2:??",
month = sep,
year = "2015",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Tue Dec 8 06:34:02 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
URL = "http://dl.acm.org/ft_gateway.cfm?id=2846057",
abstract = "Best-practice approaches to close known exploits and
strengthen communication security.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Forbes:2015:CTC,
author = "Michael A. Forbes and Amir Shpilka",
title = "Complexity Theory Column 88: Challenges in Polynomial
Factorization",
journal = j-SIGACT,
volume = "46",
number = "4",
pages = "32--49",
month = dec,
year = "2015",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2852040.2852051",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
bibdate = "Tue Feb 16 11:18:42 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
abstract = "Algebraic complexity theory studies the complexity of
computing (multivariate) polynomials efficiently using
algebraic circuits. This succinct representation leads
to fundamental algorithmic challenges such as the
polynomial identity testing (PIT) problem (decide
nonzeroness of the computed polynomial) and the
polynomial factorization problem (compute succinct
representations of the factors of the circuit). While
the Schwartz-Zippel-DeMillo-Lipton Lemma
[Sch80,Zip79,DL78] gives an easy randomized algorithm
for PIT, randomized algorithms for factorization
require more ideas as given by Kaltofen [Kal89].
However, even derandomizing PIT remains a fundamental
problem in understanding the power of randomness. In
this column, we survey the factorization problem,
discussing the algorithmic ideas as well as the
applications to other problems. We then discuss the
challenges ahead, in particular focusing on the goal of
obtaining deterministic factoring algorithms. While
deterministic PIT algorithms have been developed for
various restricted circuit classes, there are very few
corresponding factoring algorithms. We discuss some
recent progress on the divisibility testing problem
(test if a given polynomial divides another given
polynomial) which captures some of the difficulty of
factoring. Along the way we attempt to highlight key
challenges whose solutions we hope will drive progress
in the area.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Frattolillo:2015:WPP,
author = "Franco Frattolillo",
title = "Watermarking Protocols: Problems, Challenges and a
Possible Solution",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "944--960",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu015",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/944",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "March 13, 2014",
}
@Article{Fu:2015:TVG,
author = "Dong Lai Fu and Xin Guang Peng and Yu Li Yang",
title = "Trusted Validation for Geolocation of Cloud Data",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2595--2607",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu144",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2595",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "December 15, 2014",
}
@Article{Gao:2015:GCC,
author = "Wei Gao and Guilin Wang and Xueli Wang and Kefei
Chen",
title = "Generic Construction of Certificate-Based Encryption
from Certificateless Encryption Revisited",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2747--2757",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv045",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2747",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "July 1, 2015",
}
@Article{Garcia-Martinez:2015:HEB,
author = "M. Garc{\'\i}a-Mart{\'\i}nez and L. J.
Onta{\~n}{\'o}n-Garc{\'\i}a and E. Campos-Cant{\'o}n
and S. Celikovsk{\'y}",
title = "Hyperchaotic encryption based on multi-scroll
piecewise linear systems",
journal = j-APPL-MATH-COMP,
volume = "270",
number = "??",
pages = "413--424",
day = "1",
month = nov,
year = "2015",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Thu Nov 5 06:24:28 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2015.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300315010929",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003/",
}
@Article{Garcia-Morchon:2015:HCR,
author = "Oscar Garc{\'\i}a-Morch{\'o}n and Ronald Rietman and
Ludo Tolhuizen and Domingo G{\'o}mez and Jaime
Guti{\'e}rrez",
title = "{HIMMO}: a collusion-resistant identity-based scheme
for symmetric key generation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "19--19",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768601",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Giambruno:2015:GGB,
author = "Laura Giambruno and Sabrina Mantaci and Jean
N{\'e}raud and Carla Selmi",
title = "A Generalization of {Girod}'s Bidirectional Decoding
Method to Codes with a Finite Deciphering Delay",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "6",
pages = "733--??",
month = sep,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500410",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 7 08:40:07 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Misc{Giry:2015:BCK,
author = "Damien Giry",
title = "BlueKrypt Cryptographic Key Length Recommendation",
howpublished = "Web site",
day = "26",
month = feb,
year = "2015",
bibdate = "Fri May 01 17:26:51 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.keylength.com/",
abstract = "In most cryptographic functions, the key length is an
important security parameter. Both academic and private
organizations provide recommendations and mathematical
formulas to approximate the minimum key size
requirement for security. Despite the availability of
these publications, choosing an appropriate key size to
protect your system from attacks remains a headache as
you need to read and understand all these papers.
This web site implements mathematical formulas and
summarizes reports from well-known organizations
allowing you to quickly evaluate the minimum security
requirements for your system. You can also easily
compare all these techniques and find the appropriate
key length for your desired level of protection. The
lengths provided here are designed to resist
mathematical attacks; they do not take algorithmic
attacks, hardware flaws, etc. into account.",
acknowledgement = ack-nhfb,
}
@Article{Gope:2015:RLA,
author = "Prosanta Gope and Tzonelih Hwang",
title = "A realistic lightweight authentication protocol
preserving strong anonymity for securing {RFID}
system",
journal = j-COMPUT-SECUR,
volume = "55",
number = "??",
pages = "271--280",
month = nov,
year = "2015",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:43 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404815000681",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Gorbunov:2015:ABE,
author = "Sergey Gorbunov and Vinod Vaikuntanathan and Hoeteck
Wee",
title = "Attribute-Based Encryption for Circuits",
journal = j-J-ACM,
volume = "62",
number = "6",
pages = "45:1--45:??",
month = dec,
year = "2015",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/2824233",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
bibdate = "Mon Dec 21 17:57:46 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "In an attribute-based encryption (ABE) scheme, a
ciphertext is associated with an $l$-bit public index
ind and a message $m$, and a secret key is associated
with a Boolean predicate $P$. The secret key allows
decrypting the ciphertext and learning $m$ if and only
if $ P({\rm ind}) = 1$. Moreover, the scheme should be
secure against collusions of users, namely, given
secret keys for polynomially many predicates, an
adversary learns nothing about the message if none of
the secret keys can individually decrypt the
ciphertext. We present attribute-based encryption
schemes for circuits of any arbitrary polynomial size,
where the public parameters and the ciphertext grow
linearly with the depth of the circuit. Our
construction is secure under the standard learning with
errors (LWE) assumption. Previous constructions of
attribute-based encryption were for Boolean formulas,
captured by the complexity class NC$^1$. In the course
of our construction, we present a new framework for
constructing ABE schemes. As a by-product of our
framework, we obtain ABE schemes for polynomial-size
branching programs, corresponding to the complexity
class LOGSPACE, under quantitatively better
assumptions.",
acknowledgement = ack-nhfb,
articleno = "45",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Gravier:2015:WOD,
author = "Sylvain Gravier and J{\'e}r{\^o}me Javelle and Mehdi
Mhalla and Simon Perdrix",
title = "On weak odd domination and graph-based quantum secret
sharing",
journal = j-THEOR-COMP-SCI,
volume = "598",
number = "??",
pages = "129--137",
day = "20",
month = sep,
year = "2015",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Sep 16 10:32:16 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397515004806",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Gregio:2015:TTM,
author = "Andr{\'e} Ricardo Abed Gr{\'e}gio and Vitor Monte
Afonso and Dario Sim{\~o}es Fernandes Filho and Paulo
L{\'\i}cio de Geus and Mario Jino",
title = "Toward a Taxonomy of Malware Behaviors",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2758--2777",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv047",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2758",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "July 13, 2015",
}
@Article{Grimes:2015:CCT,
author = "William Grimes",
title = "Cracking Codes through the Centuries",
journal = j-NY-TIMES,
volume = "??",
number = "??",
pages = "??--??",
day = "4",
month = feb,
year = "2015",
CODEN = "NYTIAO",
ISSN = "0362-4331 (print), 1542-667X, 1553-8095",
ISSN-L = "0362-4331",
bibdate = "Thu Feb 05 06:20:13 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "New York Times",
journal-URL = "http://www.nytimes.com/",
keywords = "Enigma; Sigaba",
remark = "This article describes the exhibition ``Decoding the
Renaissance: 500 Years of Codes and Ciphers'' at the
Folger Shakespeare Library during February 2015.",
}
@Article{Gu:2015:EIB,
author = "Ke Gu and Weijia Jia and Chunlin Jiang",
title = "Efficient Identity-Based Proxy Signature in the
Standard Model",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "792--807",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt132",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/792",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 11, 2013",
}
@Article{Gupta:2015:GEM,
author = "Vinay Gupta",
title = "Guest Eof: a machine for keeping secrets?",
journal = j-LINUX-J,
volume = "2015",
number = "254",
pages = "7:1--7:??",
month = jun,
year = "2015",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Tue Sep 22 17:33:58 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
URL = "http://dl.acm.org/ft_gateway.cfm?id=2807685",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Guyeux:2015:ECS,
author = "Christophe Guyeux and Rapha{\"e}l Couturier and
Pierre-Cyrille H{\'e}am",
title = "Efficient and cryptographically secure generation of
chaotic pseudorandom numbers on {GPU}",
journal = j-J-SUPERCOMPUTING,
volume = "71",
number = "10",
pages = "3877--3903",
month = oct,
year = "2015",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-015-1479-8",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Tue Sep 29 10:07:24 MDT 2015",
bibsource = "http://link.springer.com/journal/11227/71/10;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://link.springer.com/article/10.1007/s11227-015-1479-8",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Hald:2015:RRA,
author = "David Hald and Alex Udakis",
title = "Rethinking remote authentication: time to kiss tokens
goodbye?",
journal = j-NETWORK-SECURITY,
volume = "2015",
number = "6",
pages = "15--17",
month = jun,
year = "2015",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(15)30050-7",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:20 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485815300507",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Hardesty:2015:BAC,
author = "Larry Hardesty",
title = "A basis for all cryptography",
journal = "{R\&D} Magazine",
volume = "??",
number = "??",
pages = "??--??",
day = "28",
month = oct,
year = "2015",
bibdate = "Wed Oct 28 09:03:25 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.rdmag.com/news/2015/10/basis-all-cryptography",
acknowledgement = ack-nhfb,
keywords = "functional encryption; indistinguishability
obfuscation",
}
@Article{Harn:2015:DTS,
author = "Lein Harn and Ching-Fang Hsu",
title = "Dynamic threshold secret reconstruction and its
application to the threshold cryptography",
journal = j-INFO-PROC-LETT,
volume = "115",
number = "11",
pages = "851--857",
month = nov,
year = "2015",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Jul 25 09:11:21 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015001106",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{He:2015:IEI,
author = "Debiao He and Mingwu Zhang and Baowen Xu",
title = "Insecurity of an Efficient Identity-Based Proxy
Signature in the Standard Model",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2507--2508",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu097",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2507",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 26, 2014",
}
@Article{He:2015:SSQ,
author = "Zhian He and Wai Kit Wong and Ben Kao and David Wai
Lok Cheung and Rongbin Li and Siu Ming Yiu and Eric
Lo",
title = "{SDB}: a secure query processing system with data
interoperability",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "8",
number = "12",
pages = "1876--1879",
month = aug,
year = "2015",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.14778/2824032.2824090",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Wed Sep 16 18:23:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "We address security issues in a cloud database system
which employs the DBaaS model --- a data owner (DO)
exports data to a cloud database service provider (SP).
To provide data security, sensitive data is encrypted
by the DO before it is uploaded to the SP. Compared to
existing secure query processing systems like CryptDB
[7] and MONOMI [8], in which data operations (e.g.,
comparison or addition) are supported by specialized
encryption schemes, our demo system, SDB, is
implemented based on a set of data-interoperable secure
operators, i.e., the output of an operator can be used
as input of another operator. As a result, SDB can
support a wide range of complex queries (e.g., all
TPC-H queries) efficiently. In this demonstration, we
show how our SDB prototype supports secure query
processing on complex workload like TPC-H. We also
demonstrate how our system protects sensitive
information from malicious attackers.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
}
@Article{Heath:2015:HNS,
author = "Nick Heath",
title = "Hacking the {Nazis}: The secret story of the women who
broke {Hitler}'s codes",
journal = "TechRepublic",
volume = "??",
number = "??",
pages = "??--??",
day = "26",
month = mar,
year = "2015",
bibdate = "Tue Apr 21 11:09:42 2015",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.techrepublic.com/article/the-women-who-helped-crack-nazi-codes-at-bletchley-park/",
acknowledgement = ack-nhfb,
}
@Article{Hinarejos:2015:MES,
author = "M. Francisca Hinarejos and Andreu Pere Isern-Dey{\`a}
and Josep-Llu{\'\i}s Ferrer-Gomila and Magdalena
Payeras-Capell{\`a}",
title = "{MC-2D}: an Efficient and Scalable Multicoupon
Scheme",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "758--778",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt119",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/758",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "October 14, 2013",
}
@Article{Hmood:2015:ACA,
author = "Haider Salim Hmood and Zhitang Li and Hasan Khalaf
Abdulwahid and Yang Zhang",
title = "Adaptive Caching Approach to Prevent {DNS} Cache
Poisoning Attack",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "973--985",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu023",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/973",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "April 7, 2014",
}
@Article{Hoffmann:2015:LBQb,
author = "Leah Hoffmann",
title = "Last byte: {Q\&A}: A Passion for Pairings",
journal = j-CACM,
volume = "58",
number = "9",
pages = "128--ff",
month = sep,
year = "2015",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2800615",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Aug 27 19:08:25 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2015/9/191171/fulltext",
abstract = "Dan Boneh on pairing-based cryptography, multilinear
maps, and how an 1,800-year-old ``intellectual
curiosity'' became the foundation of all secure network
traffic.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Hong:2015:RSM,
author = "Wien Hong and Gwoboa Horng and Chih-Wei Shiu and
Tung-Shou Chen and Yu-Chi Chen",
title = "Reversible Steganographic Method Using Complexity
Control and Human Visual System",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2583--2594",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu142",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2583",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "December 2, 2014",
}
@Article{Howe:2015:PLB,
author = "James Howe and Thomas P{\"o}ppelmann and M{\'a}ire
O'Neill and Elizabeth O'Sullivan and Tim G{\"u}neysu",
title = "Practical Lattice-Based Digital Signature Schemes",
journal = j-TECS,
volume = "14",
number = "3",
pages = "41:1--41:??",
month = apr,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2724713",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue Apr 21 17:21:32 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Digital signatures are an important primitive for
building secure systems and are used in most real-world
security protocols. However, almost all popular
signature schemes are either based on the factoring
assumption (RSA) or the hardness of the discrete
logarithm problem (DSA/ECDSA). In the case of classical
cryptanalytic advances or progress on the development
of quantum computers, the hardness of these closely
related problems might be seriously weakened. A
potential alternative approach is the construction of
signature schemes based on the hardness of certain
lattice problems that are assumed to be intractable by
quantum computers. Due to significant research
advancements in recent years, lattice-based schemes
have now become practical and appear to be a very
viable alternative to number-theoretic cryptography. In
this article, we focus on recent developments and the
current state of the art in lattice-based digital
signatures and provide a comprehensive survey
discussing signature schemes with respect to
practicality. Additionally, we discuss future research
areas that are essential for the continued development
of lattice-based cryptography.",
acknowledgement = ack-nhfb,
articleno = "41",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Hua:2015:TSE,
author = "Guang Hua and J. Goh and V. L. L. Thing",
title = "Time-Spread Echo-Based Audio Watermarking With
Optimized Imperceptibility and Robustness",
journal = j-IEEE-ACM-TASLP,
volume = "23",
number = "2",
pages = "227--239",
month = feb,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/TASLP.2014.2387385",
ISSN = "2329-9290",
ISSN-L = "2329-9290",
bibdate = "Mon Oct 5 06:29:42 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Huang:2015:CEA,
author = "Xinyi Huang and J. K. Liu and Shaohua Tang and Yang
Xiang and Kaitai Liang and Li Xu and Jianying Zhou",
title = "Cost-Effective Authentic and Anonymous Data Sharing
with Forward Security",
journal = j-IEEE-TRANS-COMPUT,
volume = "64",
number = "4",
pages = "971--983",
month = apr,
year = "2015",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2014.2315619",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jun 4 19:46:38 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Huang:2015:MSE,
author = "Chanying Huang and Hwaseong Lee and Hyoseung Kim and
Dong Hoon Lee",
title = "{mvSERS}: a Secure Emergency Response Solution for
Mobile Healthcare in Vehicular Environments",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2461--2475",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu083",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2461",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 24, 2014",
}
@Article{Huang:2015:PAP,
author = "Kaibin Huang and Raylin Tso and Yu-Chi Chen and Sk Md
Mizanur Rahman and Ahmad Almogren and Atif Alamri",
title = "{PKE-AET}: Public Key Encryption with Authorized
Equality Test",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2686--2697",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv025",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2686",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "April 20, 2015",
}
@Article{Imai:2015:IRR,
author = "Shigeyoshi Imai and Kaoru Kurosawa",
title = "Improved reconstruction of {RSA} private-keys from
their fraction",
journal = j-INFO-PROC-LETT,
volume = "115",
number = "6--8",
pages = "630--632",
month = jun # "\slash " # aug,
year = "2015",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu May 28 06:03:49 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015000368",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Islam:2015:LFP,
author = "Sk Hafizul Islam and Fagen Li",
title = "Leakage-Free and Provably Secure Certificateless
Signcryption Scheme Using Bilinear Pairings",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2636--2648",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv002",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2636",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "January 30, 2015",
}
@Article{Islam:2015:MBA,
author = "Md Saiful Islam and Naif Alajlan",
title = "Model-based Alignment of Heartbeat Morphology for
Enhancing Human Recognition Capability",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2622--2635",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu150",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2622",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "December 15, 2014",
}
@Article{Jin:2015:NCD,
author = "Chunhua Jin and Chunxiang Xu and Fagen Li and Xiaojun
Zhang",
title = "A novel certificateless deniable authentication
protocol",
journal = j-INT-J-COMPUT-APPL,
volume = "37",
number = "3-4",
pages = "181--192",
year = "2015",
DOI = "https://doi.org/10.1080/1206212X.2016.1188564",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:30:08 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2016.1188564",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "06 Jun 2016",
}
@Article{Jogenfors:2015:HBT,
author = "Jonathan Jogenfors and Ashraf Mohamed Elhassan and
Johan Ahrens and Mohamed Bourennane and Jan-{\AA}ke
Larsson",
title = "Hacking the {Bell} Test Using Classical Light in
Energy--Time Entanglement-Based Quantum Key
Distribution",
journal = j-SCI-ADV,
volume = "1",
number = "11",
pages = "e1500793",
day = "18",
month = dec,
year = "2015",
CODEN = "SACDAF",
DOI = "https://doi.org/10.1126/sciadv.1500793",
ISSN = "2375-2548",
ISSN-L = "2375-2548",
bibdate = "Mon Jan 18 15:09:00 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://advances.sciencemag.org/content/1/11/e1500793",
acknowledgement = ack-nhfb,
fjournal = "Science Advances",
journal-URL = "http://advances.sciencemag.org/content/by/year",
}
@Book{Johnson:2015:NGA,
author = "Kevin Wade Johnson",
title = "The neglected giant: {Agnes Meyer Driscoll}",
volume = "10",
publisher = "National Security Agency, Center for Cryptologic
History",
address = "Fort George G. Meade, MD, USA",
pages = "66",
year = "2015",
LCCN = "????",
bibdate = "Thu Dec 28 09:50:21 MST 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Center for Cryptologic History special series",
abstract = "Although Agnes May Meyer, later Agnes May Driscoll,
was the Navy's principal cryptanalyst of many years,
spent over 40 years in cryptology, became a member of
the Cryptologic Hall of Honor, and has principal credit
for personally breaking two major codes\slash ciphers,
she was curiously neglected during her career and
after. Never credited with as much as she believed was
her due, never promoted in grade with her peers, even
now she is not always ranked with those she regarded as
peers. Although considered one of the giants of
American cryptology, she is nevertheless rarely
mentioned in the same breath as a William Friedman or a
Laurance Safford, even though she began her code and
cipher work in 1918, contemporary with Friedman. Should
she be ranked with them? Has she been neglected by
history? We will consider exactly that.",
acknowledgement = ack-nhfb,
subject = "Driscoll, Alice Meyer; Cryptographers; United States;
Biography",
subject-dates = "1889--1971",
}
@Article{Kanwal:2015:TTM,
author = "Ayesha Kanwal and Rahat Masood and Muhammad Awais
Shibli and Rafia Mumtaz",
title = "Taxonomy for Trust Models in Cloud Computing",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "601--626",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu138",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/601",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "December 8, 2014",
}
@Article{Karakoc:2015:AKA,
author = "F. Karako{\c{c}} and H. Demirci and A. E. Harmanci",
title = "{AKF}: a key alternating {Feistel} scheme for
lightweight cipher designs",
journal = j-INFO-PROC-LETT,
volume = "115",
number = "2",
pages = "359--367",
month = feb,
year = "2015",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Nov 20 09:46:44 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019014002257",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Book{Katz:2015:IMC,
author = "Jonathan Katz and Yehuda Lindell",
title = "Introduction to modern cryptography",
publisher = pub-TAYLOR-FRANCIS,
address = pub-TAYLOR-FRANCIS:adr,
edition = "Second",
pages = "583",
year = "2015",
ISBN = "1-4665-7026-1 (hardcover)",
ISBN-13 = "978-1-4665-7026-9 (hardcover)",
LCCN = "QA76.9.A25 K36 2014",
bibdate = "Sat Aug 15 16:27:31 MDT 2020",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
series = "Chapman and hall/CRC cryptography and network security
series",
abstract = "Cryptography is ubiquitous and plays a key role in
ensuring data secrecy and integrity as well as in
securing computer systems more broadly. Introduction to
Modern Cryptography provides a rigorous yet accessible
treatment of this fascinating subject. The authors
introduce the core principles of modern cryptography,
with an emphasis on formal definitions, clear
assumptions, and rigorous proofs of security. The book
begins by focusing on private-key cryptography,
including an extensive treatment of private-key
encryption, message authentication codes, and hash
functions. The authors also present design principles
for widely used stream ciphers and block ciphers
including RC4, DES, and AES, plus provide provable
constructions of stream ciphers and block ciphers from
lower-level primitives. The second half of the book
covers public-key cryptography, beginning with a
self-contained introduction to the number theory needed
to understand the RSA, Diffie--Hellman, and El Gamal
cryptosystems (and others), followed by a thorough
treatment of several standardized public-key encryption
and digital signature schemes. Integrating a more
practical perspective without sacrificing rigor, this
widely anticipated Second Edition offers improved
treatment of: Stream ciphers and block ciphers,
including modes of operation and design principles;
Authenticated encryption and secure communication
sessions; Hash functions, including hash-function
applications and design principles Attacks on poorly
implemented cryptography, including attacks on
chained-CBC encryption, padding-oracle attacks, and
timing attacks. The random-oracle model and its
application to several standardized, widely used
public-key encryption and signature schemes;
Elliptic-curve cryptography and associated standards
such as DSA/ECDSA and DHIES/ECIES Containing updated
exercises and worked examples, Introduction to Modern
Cryptography, Second Edition can serve as a textbook.",
acknowledgement = ack-nhfb,
subject = "Computer security; Cryptography; COMPUTERS; Operating
Systems; General.; Security; Cryptography.;
MATHEMATICS; Combinatorics.; Computer security;
Cryptography",
tableofcontents = "I: Introduction and classical cryptography \\
1: Introduction \\
2: Perfectly secret encryption \\
II: Private-key (symmetric) cryptography \\
3: Private-key encryption \\
4: Message authentication codes \\
5: Hash functions and applications \\
6: Practical constructions of symmetric-key primitives
\\
7: *Theoretical constructions of symmetric-key
primitives \\
III: Public-key (asymmetric) cryptography \\
8: Number theory and cryptographic hardness assumptions
\\
9: *Algorithms for factoring and computing discrete
logarithms \\
10: Key management and the public-key revolution \\
11: Public-key encryption \\
12: Digital signature schemes \\
13: *Advanced topics in public-key encryption \\
Index of common notation \\
Appendix A: Mathematical background \\
Appendix B: Basic algorithmic number theory",
}
@Article{Kawamoto:2015:LSH,
author = "Junpei Kawamoto",
title = "A Locality Sensitive Hashing Filter for Encrypted
Vector Databases",
journal = j-FUND-INFO,
volume = "137",
number = "2",
pages = "291--304",
month = apr,
year = "2015",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2015-1180",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:20:24 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Keblusek:2015:BRK,
author = "Marika Keblusek",
title = "Book Review: {Kristie Macrakis, \booktitle{Prisoners,
Lovers, and Spies: The Story of Invisible Ink from
Herodotus to Al-Qaeda}}",
journal = j-ISIS,
volume = "106",
number = "3",
pages = "692--693",
month = sep,
year = "2015",
CODEN = "ISISA4",
DOI = "https://doi.org/10.1086/683195",
ISSN = "0021-1753 (print), 1545-6994 (electronic)",
ISSN-L = "0021-1753",
bibdate = "Thu Nov 12 18:41:59 MST 2015",
bibsource = "http://www.jstor.org/action/showPublication?journalCode=isis;
http://www.jstor.org/stable/10.1086/681973;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/isis2010.bib",
URL = "http://www.jstor.org/stable/10.1086/683195",
acknowledgement = ack-nhfb,
fjournal = "Isis",
journal-URL = "http://www.jstor.org/page/journal/isis/about.html",
}
@Article{Kent:2015:AGA,
author = "Alexander D. Kent and Lorie M. Liebrock and Joshua C.
Neil",
title = "Authentication graphs: Analyzing user behavior within
an enterprise network",
journal = j-COMPUT-SECUR,
volume = "48",
number = "??",
pages = "150--166",
month = feb,
year = "2015",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:40 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404814001321",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Khan:2015:CMB,
author = "Abdul Nasir Khan and M. L. Mat Kiah and Mazhar Ali",
title = "A Cloud-Manager-Based Re-Encryption Scheme for Mobile
Users in Cloud Environment: a Hybrid Approach",
journal = j-J-GRID-COMP,
volume = "13",
number = "4",
pages = "651--675",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10723-015-9352-9",
ISSN = "1570-7873 (print), 1572-9184 (electronic)",
ISSN-L = "1570-7873",
bibdate = "Thu Apr 7 10:29:30 MDT 2016",
bibsource = "http://link.springer.com/journal/10723/13/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib",
URL = "http://link.springer.com/article/10.1007/s10723-015-9352-9",
acknowledgement = ack-nhfb,
fjournal = "Journal of Grid Computing",
journal-URL = "http://link.springer.com/journal/10723",
}
@Article{Kim:2015:CEH,
author = "Y. Kim",
title = "Comments on {``An Efficient Homomorphic MAC with Small
Key Size for Authentication in Network Coding}",
journal = j-IEEE-TRANS-COMPUT,
volume = "64",
number = "12",
pages = "3619--3620",
month = "????",
year = "2015",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2409859",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Nov 9 17:50:21 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
note = "See \cite{Cheng:2013:EHM}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@TechReport{Koblitz:2015:RWE,
author = "Neal Koblitz and Alfred J. Menezes",
title = "A Riddle Wrapped in an Enigma",
type = "Report",
institution = "????",
address = "????",
pages = "1--20",
day = "1",
month = nov,
year = "2015",
bibdate = "Mon Nov 16 05:55:00 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://eprint.iacr.org/2015/1018.pdf",
abstract = "In August 2015 the U.S. National Security Agency (NSA)
released a major policy statement on the need for
post-quantum cryptography (PQC). This announcement will
be a great stimulus to the development,
standardization, and commercialization of new
quantumsafe algorithms. However, certain peculiarities
in the wording and timing of the statement have puzzled
many people and given rise to much speculation
concerning the NSA, elliptic curve cryptography (ECC),
and quantum-safe cryptography. Our purpose is to
attempt to evaluate some of the theories that have been
proposed.",
acknowledgement = ack-nhfb,
}
@Article{Kong:2015:CSM,
author = "Jia Hao Kong and Li-Minn Ang and Kah Phooi Seng",
title = "A comprehensive survey of modern symmetric
cryptographic solutions for resource constrained
environments",
journal = j-J-NETW-COMPUT-APPL,
volume = "49",
number = "??",
pages = "15--50",
month = mar,
year = "2015",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:45:20 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804514002136",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Kumar:2015:RGB,
author = "Sachin Kumar and Rajendra Kumar Sharma",
title = "Random-Grid Based Region Incrementing Visual Secret
Sharing",
journal = j-FUND-INFO,
volume = "137",
number = "3",
pages = "369--386",
month = jul,
year = "2015",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2015-1185",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:20:31 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Kupcu:2015:OAS,
author = "Alptekin K{\"u}p{\c{c}}{\"u}",
title = "Official Arbitration with Secure Cloud Storage
Application",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "831--852",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt138",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/831",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "December 5, 2013",
}
@Article{Lackey:2015:UHP,
author = "Scott Lackey",
title = "Using {\tt hiera} with {\tt puppet}",
journal = j-LINUX-J,
volume = "2015",
number = "251",
pages = "1:1--1:??",
month = mar,
year = "2015",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Apr 2 16:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
URL = "http://dl.acm.org/ft_gateway.cfm?id=2754912",
abstract = "Use Hiera to encrypt sensitive data in Puppet.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Lathey:2015:IEE,
author = "Ankita Lathey and Pradeep K. Atrey",
title = "Image Enhancement in Encrypted Domain over Cloud",
journal = j-TOMCCAP,
volume = "11",
number = "3",
pages = "38:1--38:??",
month = jan,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2656205",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Feb 5 17:03:39 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Cloud-based multimedia systems are becoming
increasingly common. These systems offer not only
storage facility, but also high-end computing
infrastructure which can be used to process data for
various analysis tasks ranging from low-level data
quality enhancement to high-level activity and behavior
identification operations. However, cloud data centers,
being third party servers, are often prone to
information leakage, raising security and privacy
concerns. In this article, we present a Shamir's secret
sharing based method to enhance the quality of
encrypted image data over cloud. Using the proposed
method we show that several image enhancement
operations such as noise removal, antialiasing, edge
and contrast enhancement, and dehazing can be performed
in encrypted domain with near-zero loss in accuracy and
minimal computation and data overhead. Moreover, the
proposed method is proven to be information
theoretically secure.",
acknowledgement = ack-nhfb,
articleno = "38",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Lazarus:2015:RE,
author = "M. Lazarus",
title = "Radar everywhere",
journal = j-IEEE-SPECTRUM,
volume = "52",
number = "2",
pages = "52--59",
month = feb,
year = "2015",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2015.7024512",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 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/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Aircraft; aircraft detection; app-based ride sharing;
Command and control systems; cryptocurrencies;
government regulators; History; innovation; innovation
management; Military communications; modern industrial
society; radar applications; radar speed guns; Radar
tracking; technologies-including drones",
}
@Article{Lee:2015:SAS,
author = "Kwangsu Lee and Dong Hoon Lee and Moti Yung",
title = "Sequential aggregate signatures with short public keys
without random oracles",
journal = j-THEOR-COMP-SCI,
volume = "579",
number = "??",
pages = "100--125",
day = "10",
month = may,
year = "2015",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Apr 2 07:37:28 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397515001164",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Lee:2015:TSS,
author = "Cheng-Chi Lee and Yan-Ming Lai",
title = "Toward a Secure Single Sign-On Mechanism for
Distributed Computer Networks",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "934--943",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu014",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/934",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "March 2, 2014",
}
@Article{Li:2015:ANA,
author = "Jie Li and Huang Lu and Mohsen Guizani",
title = "{ACPN}: A Novel Authentication Framework with
Conditional Privacy-Preservation and Non-Repudiation
for {VANETs}",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "26",
number = "4",
pages = "938--948",
month = apr,
year = "2015",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2014.2308215",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Jun 4 19:34:08 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://csdl.computer.org/csdl/trans/td/2015/04/06748095-abs.html",
abstract-URL = "http://csdl.computer.org/csdl/trans/td/2015/04/06748095-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Li:2015:CEH,
author = "Chen Li and Le Chen and Rongxing Lu and Hui Li",
title = "Comment on {``An Efficient Homomorphic MAC with Small
Key Size for Authentication in Network Coding''}",
journal = j-IEEE-TRANS-COMPUT,
volume = "64",
number = "3",
pages = "882--883",
month = mar,
year = "2015",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2389800",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Mar 17 18:41:22 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
note = "See \cite{Cheng:2013:EHM}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Li:2015:FSC,
author = "Jiguo Li and Huiyun Teng and Xinyi Huang and Yichen
Zhang and Jianying Zhou",
title = "A Forward-Secure Certificate-Based Signature Scheme",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "853--866",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt141",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/853",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "December 3, 2013",
}
@Article{Li:2015:IBE,
author = "Jin Li and Jingwei Li and Xiaofeng Chen and Chunfu Jia
and Wenjing Lou",
title = "Identity-Based Encryption with Outsourced Revocation
in Cloud Computing",
journal = j-IEEE-TRANS-COMPUT,
volume = "64",
number = "2",
pages = "??--??",
month = feb,
year = "2015",
CODEN = "ITCOB4",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Feb 11 14:05:05 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Li:2015:NAC,
author = "Jin Li and Xiaofeng Chen and Jingwei Li and Chunfu Jia
and Jianfeng Ma and Wenjing Lou",
title = "New access control systems based on outsourced
attribute-based encryption",
journal = j-J-COMP-SECUR,
volume = "23",
number = "6",
pages = "659--683",
month = "????",
year = "2015",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-150533",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:26:51 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Lian:2015:GRG,
author = "Chunfeng Lian and Liaojun Pang and Jimin Liang",
title = "Generalized Random Grid-Based Visual Secret Sharing
for General Access Structures",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2426--2442",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu078",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2426",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 21, 2014",
}
@Article{Liang:2015:CPA,
author = "Kaitai Liang and Liming Fang and Duncan S. Wong and
Willy Susilo",
title = "A ciphertext-policy attribute-based proxy
re-encryption scheme for data sharing in public
clouds",
journal = j-CCPE,
volume = "27",
number = "8",
pages = "2004--2027",
day = "10",
month = jun,
year = "2015",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3397",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Jul 25 19:54:07 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "13 Oct 2014",
}
@Article{Liang:2015:EFC,
author = "Kaitai Liang and Willy Susilo and Joseph K. Liu and
Duncan S. Wong",
title = "Efficient and Fully {CCA} Secure Conditional Proxy
Re-Encryption from Hierarchical Identity-Based
Encryption",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2778--2792",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv050",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2778",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "July 19, 2015",
}
@Article{Liang:2015:SEC,
author = "Kaitai Liang and Man Ho Au and Joseph K. Liu and Willy
Susilo and Duncan S. Wong and Guomin Yang and Yong Yu
and Anjia Yang",
title = "A secure and efficient {Ciphertext-Policy
Attribute-Based Proxy Re-Encryption} for cloud data
sharing",
journal = j-FUT-GEN-COMP-SYS,
volume = "52",
number = "??",
pages = "95--108",
month = nov,
year = "2015",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Jul 25 08:56:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X14002507",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Lin:2015:CND,
author = "Hui Lin and Jia Hu and Jianfeng Ma and Li Xu and Li
Yang",
title = "{CRM}: a New Dynamic Cross-Layer Reputation
Computation Model in Wireless Networks",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "656--667",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu075",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/656",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 16, 2014",
}
@Article{Lin:2015:DVS,
author = "Pei-Yu Lin",
title = "Double Verification Secret Sharing Mechanism Based on
Adaptive Pixel Pair Matching",
journal = j-TOMCCAP,
volume = "11",
number = "3",
pages = "36:1--36:??",
month = jan,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2700291",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Feb 5 17:03:39 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Verifiability is essential for the secret sharing
approach, which allows the involved participants to
detect cheaters during the secret retrieval process. In
this article, we propose a double verification secret
sharing (DVSS) mechanism that can not only prevent
fraudulent participants but also satisfy the
requirements of secret payload, camouflage, image
fidelity and lossless revealed secret. DVSS offers
double verification process to enhance the cheater
detectability; experimental results reveal that the
designed scheme can share larger secret capacity and
retain superior image quality than the related secret
sharing methods.",
acknowledgement = ack-nhfb,
articleno = "36",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Lin:2015:IAA,
author = "Xi-Jun Lin and Lin Sun and Haipeng Qu",
title = "Insecurity of an anonymous authentication for
privacy-preserving {IoT} target-driven applications",
journal = j-COMPUT-SECUR,
volume = "48",
number = "??",
pages = "142--149",
month = feb,
year = "2015",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:40 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404814001229",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Lin:2015:SSE,
author = "Chung-Hsiang Lin and De-Yu Shen and Yi-Jung Chen and
Chia-Lin Yang and Cheng-Yuan Michael Wang",
title = "{SECRET}: a Selective Error Correction Framework for
Refresh Energy Reduction in {DRAMs}",
journal = j-TACO,
volume = "12",
number = "2",
pages = "19:1--19:??",
month = jul,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2747876",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Fri Aug 7 09:46:00 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
abstract = "DRAMs are used as the main memory in most computing
systems today. Studies show that DRAMs contribute to a
significant part of overall system power consumption.
One of the main challenges in low-power DRAM design is
the inevitable refresh process. Due to process
variation, memory cells exhibit retention time
variations. Current DRAMs use a single refresh period
determined by the cell with the largest leakage. Since
prolonging refresh intervals introduces retention
errors, a set of previous works adopt conventional
error-correcting code (ECC) to correct retention
errors. However, these approaches introduce significant
area and energy overheads. In this article, we propose
a novel error correction framework for retention errors
in DRAMs, called SECRET (selective error correction for
refresh energy reduction). The key observations we make
are that retention errors are hard errors rather than
soft errors, and only few DRAM cells have large
leakage. Therefore, instead of equipping error
correction capability for all memory cells as existing
ECC schemes, we only allocate error correction
information to leaky cells under a refresh interval.
Our SECRET framework contains two parts: an offline
phase to identify memory cells with retention errors
given a target error rate and a low-overhead error
correction mechanism. The experimental results show
that among all test cases performed, the proposed
SECRET framework can reduce refresh power by 87.2\% and
overall DRAM power up to 18.57\% with negligible area
and performance overheads.",
acknowledgement = ack-nhfb,
articleno = "19",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Liu:2015:GTB,
author = "Shaohui Liu and Anand Paul and Guochao Zhang and
Gwanggil Jeon",
title = "A game theory-based block image compression method in
encryption domain",
journal = j-J-SUPERCOMPUTING,
volume = "71",
number = "9",
pages = "3353--3372",
month = sep,
year = "2015",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-015-1413-0",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Tue Sep 29 10:07:23 MDT 2015",
bibsource = "http://link.springer.com/journal/11227/71/9;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-015-1413-0",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Liu:2015:IAC,
author = "Qingzhong Liu and Zhongxue Chen",
title = "Improved Approaches with Calibrated Neighboring Joint
Density to Steganalysis and Seam-Carved Forgery
Detection in {JPEG} Images",
journal = j-TIST,
volume = "5",
number = "4",
pages = "63:1--63:??",
month = jan,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2560365",
ISSN = "2157-6904 (print), 2157-6912 (electronic)",
ISSN-L = "2157-6904",
bibdate = "Wed Feb 11 12:29:09 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tist.bib",
abstract = "Steganalysis and forgery detection in image forensics
are generally investigated separately. We have designed
a method targeting the detection of both steganography
and seam-carved forgery in JPEG images. We analyze the
neighboring joint density of the DCT coefficients and
reveal the difference between the untouched image and
the modified version. In realistic detection, the
untouched image and the modified version may not be
obtained at the same time, and different JPEG images
may have different neighboring joint density features.
By exploring the self-calibration under different shift
recompressions, we propose calibrated neighboring joint
density-based approaches with a simple feature set to
distinguish steganograms and tampered images from
untouched ones. Our study shows that this approach has
multiple promising applications in image forensics.
Compared to the state-of-the-art steganalysis
detectors, our approach delivers better or comparable
detection performances with a much smaller feature set
while detecting several JPEG-based steganographic
systems including DCT-embedding-based adaptive
steganography and Yet Another Steganographic Scheme
(YASS). Our approach is also effective in detecting
seam-carved forgery in JPEG images. By integrating
calibrated neighboring density with spatial domain rich
models that were originally designed for steganalysis,
the hybrid approach obtains the best detection accuracy
to discriminate seam-carved forgery from an untouched
image. Our study also offers a promising manner to
explore steganalysis and forgery detection together.",
acknowledgement = ack-nhfb,
articleno = "63",
fjournal = "ACM Transactions on Intelligent Systems and Technology
(TIST)",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1318",
}
@Article{Liu:2015:IEP,
author = "H. Liu and L. Chen and Z. Davar and M. R. Pour",
title = "Insecurity of an Efficient Privacy-preserving Public
Auditing Scheme for Cloud Data Storage",
journal = j-J-UCS,
volume = "21",
number = "3",
pages = "473--??",
month = "????",
year = "2015",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Wed Sep 7 16:47:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_21_3/insecurity_of_an_efficient",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Liu:2015:IMB,
author = "Chao-Liang Liu and Cheng-Jung Tsai and Ting-Yi Chang
and Wang-Jui Tsai and Po-Kai Zhong",
title = "Implementing multiple biometric features for a
recall-based graphical keystroke dynamics
authentication system on a smart phone",
journal = j-J-NETW-COMPUT-APPL,
volume = "53",
number = "??",
pages = "128--139",
month = jul,
year = "2015",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sat Aug 8 15:46:40 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804515000612",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Liu:2015:LBD,
author = "Huacui Liu and Chenhui Jin",
title = "Lower Bounds of Differential and Linear Active
{$S$}-boxes for {$3$D}-like Structure",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "904--921",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu010",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/904",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "March 2, 2014",
}
@Article{Liu:2015:MSG,
author = "Chao-Liang Liu and Wang-Jui Tsai and Ting-Yi Chang and
Chun-Cheng Peng and Peng-Shiang Wong",
title = "Meaningful Share Generation for $ (2, 2)$-Multiple
Visual Secret Sharing Scheme Without Pixel Expansion",
journal = j-COMP-J,
volume = "58",
number = "7",
pages = "1598--1606",
month = jul,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu105",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Jul 28 10:40:55 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/7/1598",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 11, 2014",
}
@Article{Liu:2015:SAA,
author = "Zhusong Liu and Hongyang Yan and Zhike Li",
title = "Server-aided anonymous attribute-based authentication
in cloud computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "52",
number = "??",
pages = "61--66",
month = nov,
year = "2015",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Jul 25 08:56:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X14002544",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Liu:2015:SAB,
author = "Hong Liu and Huansheng Ning and Qingxu Xiong and
Laurence T. Yang",
title = "Shared Authority Based Privacy-Preserving
Authentication Protocol in Cloud Computing",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "26",
number = "1",
pages = "241--251",
month = jan,
year = "2015",
CODEN = "ITDSEO",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Feb 12 13:58:35 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://www.computer.org/csdl/trans/td/2015/01/06748054-abs.html",
abstract-URL = "http://www.computer.org/csdl/trans/td/2015/01/06748054-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Liu:2015:SDS,
author = "Chen Liu and Chengmo Yang",
title = "Secure and Durable {(SEDURA)}: an Integrated
Encryption and Wear-leveling Framework for {PCM}-based
Main Memory",
journal = j-SIGPLAN,
volume = "50",
number = "5",
pages = "12:1--12:??",
month = may,
year = "2015",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2808704.2754969",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Fri Jul 31 19:39:44 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "Phase changing memory (PCM) is considered a promising
candidate for next-generation main-memory. Despite its
advantages of lower power and high density, PCM faces
critical security challenges due to its non-volatility:
data are still accessible by the attacker even if the
device is detached from a power supply. While
encryption has been widely adopted as the solution to
protect data, it not only creates additional
performance and energy overhead during data
encryption\slash decryption, but also hurts PCM
lifetime by introducing more writes to PCM cells. In
this paper, we propose a framework that integrates
encryption and wear-leveling so as to mitigate the
adverse impact of encryption on PCM performance and
lifetime. Moreover, by randomizing the address space
during wear-leveling, an extra level of protection is
provided to the data in memory. We propose two
algorithms that respectively prioritize data security
and memory lifetime, allowing designers to trade-off
between these two factors based on their needs.
Compared to previous encryption techniques, the
proposed SEDURA framework is able to deliver both more
randomness to protect data and more balanced PCM
writes, thus effectively balancing the three aspects of
data security, application performance, and device
lifetime.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "LCTES '15 conference proceedings.",
}
@Article{Liu:2015:SSP,
author = "Jianghua Liu and Xinyi Huang and Joseph K. Liu",
title = "Secure sharing of {Personal Health Records} in cloud
computing: {Ciphertext-Policy Attribute-Based
Signcryption}",
journal = j-FUT-GEN-COMP-SYS,
volume = "52",
number = "??",
pages = "67--76",
month = nov,
year = "2015",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Jul 25 08:56:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X14002076",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Loeb:2015:MGM,
author = "Larry Loeb",
title = "{Microsoft}, {Google}, {Mozilla} Abandon {RC4}
Cryptographic Standard",
journal = j-INFORMATION-WEEK,
volume = "??",
number = "??",
pages = "??",
day = "2",
month = sep,
year = "2015",
CODEN = "INFWE4",
ISSN = "8750-6874",
ISSN-L = "1938-3371",
bibdate = "Tue Sep 08 17:58:54 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.informationweek.com/software/enterprise-applications/microsoft-google-mozilla-abandon-rc4-cryptographic-standard/a/d-id/1322032",
abstract = "With Microsoft, Google, and Mozilla turning against
the RC4 cryptographic suite, the standard will likely
die in 2016.",
acknowledgement = ack-nhfb,
fjournal = "Information Week",
}
@Article{Lopriore:2015:PCR,
author = "Lanfranco Lopriore",
title = "Password Capabilities Revisited",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "782--791",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt131",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/782",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 11, 2013",
}
@Article{Lopriore:2015:PMD,
author = "Lanfranco Lopriore",
title = "Password Management: Distribution, Review and
Revocation",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2557--2566",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu125",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2557",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 9, 2014",
}
@Article{Lotz:2015:SCS,
author = "Volkmar Lotz and Francesco {Di Cerbo} and Michele
Bezzi and Samuel Paul Kaluvuri and Antonino Sabetta and
Slim Trabelsi",
title = "Security Certification for Service-Based Business
Ecosystems",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "709--723",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt101",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/709",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "October 15, 2013",
}
@Article{Lubicz:2015:GMA,
author = "David Lubicz and Damien Robert",
title = "A generalisation of {Miller}'s algorithm and
applications to pairing computations on abelian
varieties",
journal = j-J-SYMBOLIC-COMP,
volume = "67",
number = "??",
pages = "68--92",
month = mar # "\slash " # apr,
year = "2015",
CODEN = "JSYCEH",
DOI = "https://doi.org/10.1016/j.jsc.2014.08.001",
ISSN = "0747-7171 (print), 1095-855X (electronic)",
ISSN-L = "0747-7171",
bibdate = "Wed Sep 3 08:32:01 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0747717114000510",
acknowledgement = ack-nhfb,
fjournal = "Journal of Symbolic Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/07477171/",
keywords = "Abelian varieties; cryptography; elliptic curves;
Miller's algorithm; Pairing computations; Tate pairing;
Weil pairing",
}
@Article{Ma:2015:PKE,
author = "Sha Ma and Mingwu Zhang and Qiong Huang and Bo Yang",
title = "Public Key Encryption with Delegated Equality Test in
a Multi-User Setting",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "986--1002",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu026",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/986",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "April 4, 2014",
}
@Article{Maeng:2015:TAU,
author = "YoungJae Maeng and Aziz Mohaisen and Mun-Kyu Lee and
DaeHun Nyang",
title = "Transaction authentication using complementary
colors",
journal = j-COMPUT-SECUR,
volume = "48",
number = "??",
pages = "167--181",
month = feb,
year = "2015",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:40 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404814001473",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Mansfield-Devine:2015:MIC,
author = "Steve Mansfield-Devine",
title = "Managing identity for a competitive edge",
journal = j-NETWORK-SECURITY,
volume = "2015",
number = "1",
pages = "14--18",
month = jan,
year = "2015",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(15)70010-3",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:15 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485815700103",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Mao:2015:PUA,
author = "Qian Mao and K. Bharanitharan and Chin-Chen Chang",
title = "A Proxy User Authentication Protocol Using
Source-Based Image Morphing",
journal = j-COMP-J,
volume = "58",
number = "7",
pages = "1573--1584",
month = jul,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu094",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Jul 28 10:40:55 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/7/1573",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 26, 2014",
}
@Article{Marquez-Corbella:2015:ECP,
author = "Irene M{\'a}rquez-Corbella and Ruud Pellikaan",
title = "Error-correcting pairs: a new approach to code-based
cryptography",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "21--21",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768606",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Massolino:2015:OSC,
author = "Pedro Maat C. Massolino and Paulo S. L. M. Barreto and
Wilson V. Ruggiero",
title = "Optimized and Scalable Co-Processor for {McEliece}
with Binary {Goppa} Codes",
journal = j-TECS,
volume = "14",
number = "3",
pages = "45:1--45:??",
month = apr,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2736284",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue Apr 21 17:21:32 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Asymmetric cryptographic primitives are essential to
enable secure communications in public networks or
public mediums. Such primitives can be deployed as
software libraries or hardware co-processors, the
latter being more commonly employed in systems on chip
(SoC) scenarios, embedded devices, or
application-specific servers. Unfortunately, the most
commonly available solutions, based on RSA or elliptic
curve cryptography (ECC), are highly processing
intensive due to the underlying extended-precision
modular arithmetic. Consequently, they are not
available on highly constrained platforms. Aiming to
tackle this issue, we here investigate an alternative
asymmetric encryption scheme that relies on lightweight
arithmetic: McEliece. This scheme is especially
appealing because, being based on error correction
codes, it displays a simpler arithmetic and leads to
better performance when compared to RSA or ECC. To
evaluate the implementation of this scheme in hardware,
we propose and analyze a flexible architecture whose
security level and time versus area usage
characteristics can be reconfigured as desired. The
proposed architecture is suitable to all usual security
levels, ranging from 80 to 256 bits. It is also very
efficient, being able to perform data decryption with
binary Goppa codes in 56$ \mu $ s with 3,402 slices on
a Xilinx Spartan-3AN FPGA, whereas the best-known
result in the literature for the same FPGA is 115$ \mu
$ s with 7,331 slices. Alternatively, the architecture
can operate with quasi-dyadic Goppa (QD-Goppa) codes,
which involves smaller keys than traditional binary
Goppa codes. In the latter case, for an 80-bit security
level, the decryption operation can take from 1.1ms
with 1,129 slices to 68$ \mu $ s with 8,268 slices. By
choosing a more hardware-friendly decoding algorithm,
focusing hardware resources on most bottleneck
operations and sharing hardware resource for two
different algorithms, better results than the those in
the literature were obtained.",
acknowledgement = ack-nhfb,
articleno = "45",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Mathew:2015:NMB,
author = "Jimson Mathew and Rajat Subhra Chakraborty and Durga
Prasad Sahoo and Yuanfan Yang and Dhiraj K. Pradhan",
title = "A Novel Memristor-Based Hardware Security Primitive",
journal = j-TECS,
volume = "14",
number = "3",
pages = "60:1--60:??",
month = apr,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2736285",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue Apr 21 17:21:32 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Memristor is an exciting new addition to the
repertoire of fundamental circuit elements.
Alternatives to many security protocols originally
employing traditional mathematical cryptography involve
novel hardware security primitives, such as Physically
Unclonable Functions (PUFs). In this article, we
propose a novel hybrid memristor-CMOS PUF circuit and
demonstrate its suitability through extensive
simulations of environmental and process variation
effects. The proposed PUF circuit has substantially
less hardware overhead than previously proposed
memristor-based PUF circuits while being inherently
resistant to machine learning-based modeling attacks
because of challenge-dependent delays of the memristor
stages. The proposed PUF can be conveniently used in
many security applications and protocols based on
hardware-intrinsic security.",
acknowledgement = ack-nhfb,
articleno = "60",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Mayron:2015:BAM,
author = "Liam M. Mayron",
title = "Biometric Authentication on Mobile Devices",
journal = j-IEEE-SEC-PRIV,
volume = "13",
number = "3",
pages = "70--73",
month = may # "\slash " # jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2015.67",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Mon Aug 3 11:45:33 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "http://www.computer.org/csdl/mags/sp/2015/03/msp2015030070-abs.html",
abstract-URL = "http://www.computer.org/csdl/mags/sp/2015/03/msp2015030070-abs.html",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Book{McKusick:2015:DIF,
author = "Marshall Kirk McKusick and George V. Neville-Neil and
Robert N. M. Watson",
title = "The design and implementation of the {FreeBSD}
operating system",
publisher = pub-AW,
address = pub-AW:adr,
edition = "Second",
pages = "xxx + 886",
year = "2015",
ISBN = "0-321-96897-2 (hardcover)",
ISBN-13 = "978-0-321-96897-5 (hardcover)",
LCCN = "QA76.774.F74 M35 2015",
bibdate = "Sun Oct 4 11:28:07 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://proquest.safaribooksonline.com/9780133761825",
acknowledgement = ack-nhfb,
subject = "FreeBSD; Free computer software; Operating systems
(Computers)",
tableofcontents = "About This eBook \\
Title Page \\
Copyright Page \\
Dedication \\
Contents \\
Preface \\
UNIX-like Systems \\
Berkeley Software Distributions \\
Material Covered in this Book \\
Use by Computer Professionals \\
Use in Courses on Operating Systems \\
Organization \\
Getting BSD \\
Acknowledgments \\
References \\
About the Authors \\
Part I: Overview \\
1. History and Goals \\
1.1 History of the UNIX System \\
1.2 BSD and Other Systems \\
1.3 The Transition of BSD to Open Source \\
1.4 The FreeBSD Development Model \\
2. Design Overview of FreeBSD \\
2.1 FreeBSD Facilities and the Kernel \\
2.2 Kernel Organization \\
2.3 Kernel Services \\
2.4 Process Management \\
2.5 Security \\
2.6 Memory Management \\
2.7 I/O System Overview \\
2.8 Devices \\
2.9 The Fast Filesystem \\
2.10 The Zettabyte Filesystem \\
2.11 The Network Filesystem \\
2.12 Interprocess Communication \\
2.13 Network-Layer Protocols \\
2.14 Transport-Layer Protocols \\
2.15 System Startup and Shutdown \\
3. Kernel Services \\
3.1 Kernel Organization \\
3.2 System Calls \\
3.3 Traps and Interrupts \\
3.4 Clock Interrupts \\
3.5 Memory-Management Services \\
3.6 Timing Services \\
3.7 Resource Services \\
3.8 Kernel Tracing Facilities \\
Part II: Processes \\
4. Process Management \\
4.1 Introduction to Process Management \\
4.2 Process State \\
4.3 Context Switching \\
4.4 Thread Scheduling \\
4.5 Process Creation \\
4.6 Process Termination \\
4.7 Signals \\
4.8 Process Groups and Sessions \\
4.9 Process Debugging \\
5. Security \\
5.1 Operating-System Security \\
5.2 Security Model \\
5.3 Process Credentials \\
5.4 Users and Groups \\
5.5 Privilege Model \\
5.6 Interprocess Access Control \\
5.7 Discretionary Access Control \\
5.8 Capsicum Capability Model \\
5.9 Jails \\
5.10 Mandatory Access-Control Framework \\
5.11 Security Event Auditing \\
5.12 Cryptographic Services \\
5.13 GELI Full-Disk Encryption \\
6. Memory Management \\
6.1 Terminology \\
6.2 Overview of the FreeBSD Virtual-Memory System \\
6.3 Kernel Memory Management \\
6.4 Per-Process Resources \\
6.5 Shared Memory \\
6.6 Creation of a New Process \\
6.7 Execution of a File \\
6.8 Process Manipulation of Its Address Space \\
6.9 Termination of a Process \\
6.10 The Pager Interface \\
6.11 Paging \\
6.12 Page Replacement \\
6.13 Portability \\
Part III: I/O System \\
7. I/O System Overview \\
7.1 Descriptor Management and Services \\
7.2 Local Interprocess Communication \\
7.3 The Virtual-Filesystem Interface \\
7.4 Filesystem-Independent Services \\
7.5 Stackable Filesystems \\
8. Devices \\
8.1 Device Overview \\
8.2 I/O Mapping from User to Device \\
8.3 Character Devices \\
8.4 Disk Devices \\
8.5 Network Devices \\
8.6 Terminal Handling \\
8.7 The GEOM Layer \\
8.8 The CAM Layer \\
8.9 Device Configuration \\
8.10 Device Virtualization \\
9. The Fast Filesystem \\
9.1 Hierarchical Filesystem Management \\
9.2 Structure of an Inode \\
9.3 Naming \\
9.4 Quotas \\
9.5 File Locking \\
9.6 Soft Updates \\
9.7 Filesystem Snapshots \\
9.8 Journaled Soft Updates \\
9.9 The Local Filestore \\
9.10 The Berkeley Fast Filesystem \\
10. The Zettabyte Filesystem \\
10.1 Introduction \\
10.2 ZFS Organization \\
10.3 ZFS Structure \\
10.4 ZFS Operation \\
10.5 ZFS Design Tradeoffs \\
11. The Network Filesystem \\
11.1 Overview \\
11.2 Structure and Operation \\
11.3 NFS Evolution \\
Part IV: Interprocess Communication \\
12. Interprocess Communication \\
12.1 Interprocess-Communication Model \\
12.2 Implementation Structure and Overview \\
12.3 Memory Management \\
12.4 IPC Data Structures \\
12.5 Connection Setup \\
12.6 Data Transfer \\
12.7 Socket Shutdown \\
12.8 Network-Communication Protocol Internal Structure
\\
12.9 Socket-to-Protocol Interface \\
12.10 Protocol-to-Protocol Interface \\
12.11 Protocol-to-Network Interface \\
12.12 Buffering and Flow Control \\
12.13 Network Virtualization \\
13. Network-Layer Protocols \\
13.1 Internet Protocol Version / 4 \\ \\
13.2 Internet Control Message Protocols (ICMP) \\
13.3 Internet Protocol Version / 6 \\ \\
13.4 Internet Protocols Code Structure \\
13.5 Routing \\
13.6 Raw Sockets \\
13.7 Security \\
13.8 Packet-Processing Frameworks \\
14. Transport-Layer Protocols \\
14.1 Internet Ports and Associations \\
14.2 User Datagram Protocol (UDP) \\
14.3 Transmission Control Protocol (TCP) \\
14.4 TCP Algorithms \\
14.5 TCP Input Processing \\
14.6 TCP Output Processing \\
14.7 Stream Control Transmission Protocol (SCTP) \\
Part V: System Operation \\
15. System Startup and Shutdown \\
15.1 Firmware and BIOSes \\
15.2 Boot Loaders \\
15.3 Kernel Boot \\
15.4 User-Level Initialization \\
15.5 System Operation \\
Glossary \\
Index \\
FreeBSD Kernel Internals on Video \\
Advanced FreeBSD Course on Video \\
FreeBSD Networking from the Bottom Up on Video \\
CSRG Archive CD-ROMs \\
History of UNIX at Berkeley \\
Teaching a Course Using This Book \\
Code Snippets",
}
@Article{Meng:2015:CRS,
author = "Xianmeng Meng and Xuexin Zheng",
title = "Cryptanalysis of {RSA} with a small parameter
revisited",
journal = j-INFO-PROC-LETT,
volume = "115",
number = "11",
pages = "858--862",
month = nov,
year = "2015",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Jul 25 09:11:21 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S002001901500109X",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Merlo:2015:MEP,
author = "Alessio Merlo and Mauro Migliardi and Paolo
Fontanelli",
title = "Measuring and estimating power consumption in
{Android} to support energy-based intrusion detection",
journal = j-J-COMP-SECUR,
volume = "23",
number = "5",
pages = "611--637",
month = "????",
year = "2015",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-150530",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:26:46 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Meshram:2015:EIB,
author = "Chandrashekhar Meshram",
title = "An efficient {ID}-based cryptographic encryption based
on discrete logarithm problem and integer factorization
problem",
journal = j-INFO-PROC-LETT,
volume = "115",
number = "2",
pages = "351--358",
month = feb,
year = "2015",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Nov 20 09:46:44 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019014002221",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Mohd:2015:SLB,
author = "Bassam J. Mohd and Thaier Hayajneh and Athanasios V.
Vasilakos",
title = "A survey on lightweight block ciphers for low-resource
devices: Comparative study and open issues",
journal = j-J-NETW-COMPUT-APPL,
volume = "58",
number = "??",
pages = "73--93",
month = dec,
year = "2015",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Feb 8 11:55:17 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804515002076",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Moufek:2015:MCB,
author = "Hamza Moufek and Kenza Guenda",
title = "{McEliece} cryptosystem based on punctured
convolutional codes and the pseudo-random generators",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "21--21",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768607",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Moulick:2015:RDS,
author = "Subhayan Roy Moulick",
title = "Review of: {{\booktitle{Digital Signatures}} by
Jonathan Katz}",
journal = j-SIGACT,
volume = "46",
number = "1",
pages = "10--12",
month = mar,
year = "2015",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2744447.2744450",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
bibdate = "Tue Feb 16 11:18:41 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Natarajan:2015:MAD,
author = "V. Natarajan and Shina Sheen and R. Anitha",
title = "Multilevel Analysis to Detect Covert Social Botnet in
Multimedia Social Networks",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "679--687",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu063",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/679",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "July 22, 2014",
}
@Article{Negre:2015:NPA,
author = "C. Negre and J.-M. Robert",
title = "New Parallel Approaches for Scalar Multiplication in
Elliptic Curve over Fields of Small Characteristic",
journal = j-IEEE-TRANS-COMPUT,
volume = "64",
number = "10",
pages = "2875--2890",
month = oct,
year = "2015",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2389817",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Oct 13 06:51:51 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Neville-Neil:2015:KVH,
author = "George V. Neville-Neil",
title = "Kode Vicious: Hickory dickory doc",
journal = j-CACM,
volume = "58",
number = "8",
pages = "27--28",
month = aug,
year = "2015",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2790834",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Jul 28 10:56:55 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2015/8/189849/fulltext",
abstract = "On null encryption and automated documentation.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Ning:2015:APB,
author = "Huansheng Ning and Hong Liu and Laurence T. Yang",
title = "Aggregated-Proof Based Hierarchical Authentication
Scheme for the {Internet of Things}",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "26",
number = "3",
pages = "657--667",
month = mar,
year = "2015",
CODEN = "ITDSEO",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Feb 12 13:58:36 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://www.computer.org/csdl/trans/td/2015/03/06767153-abs.html",
abstract-URL = "http://www.computer.org/csdl/trans/td/2015/03/06767153-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@TechReport{NIST:2015:SSP,
author = "{NIST}",
title = "{SHA-3} Standard: Permutation-Based Hash and
Extendable-Output Functions",
type = "FIPS PUB",
number = "202",
institution = pub-NIST,
address = pub-NIST:adr,
pages = "viii + 29",
year = "2015",
DOI = "https://doi.org/10.6028/NIST.FIPS.202",
bibdate = "Sat Dec 10 16:05:20 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/mathcw.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
abstract = "This Standard specifies the Secure Hash Algorithm-3
(SHA-3) family of functions on binary data. Each of the
SHA-3 functions is based on an instance of the KECCAK
algorithm that NIST selected as the winner of the SHA-3
Cryptographic Hash Algorithm Competition. This Standard
also specifies the KECCAK-p family of mathematical
permutations, including the permutation that underlies
KECCAK, in order to facilitate the development of
additional permutation-based cryptographic
functions.\par
The SHA-3 family consists of four cryptographic hash
functions, called SHA3-224, SHA3-256, SHA3-384, and
SHA3-512, and two extendable-output functions (XOFs),
called SHAKE128 and SHAKE256.\par
Hash functions are components for many important
information security applications, including (1) the
generation and verification of digital signatures, (2)
key derivation, and (3) pseudorandom bit generation.
The hash functions specified in this Standard
supplement the SHA-1 hash function and the SHA-2 family
of hash functions that are specified in FIPS 180-4, the
Secure Hash Standard.
Extendable-output functions are different from hash
functions, but it is possible to use them in similar
ways, with the flexibility to be adapted directly to
the requirements of individual applications, subject to
additional security considerations.",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography; extendable-output
function; Federal Information Processing Standard; hash
algorithm; hash function; information security; KECCAK;
message digest; permutation; SHA-3; sponge
construction; sponge function; XOF",
}
@Article{Niu:2015:CRS,
author = "Danmei Niu and Lanlan Rui and Cheng Zhong and Xuesong
Qiu",
title = "A Composition and Recovery Strategy for Mobile Social
Network Service in Disaster",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "700--708",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu044",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/700",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "June 3, 2014",
}
@Article{Niu:2015:NAS,
author = "Ben Niu and Xiaoyan Zhu and Qinghua Li and Jie Chen
and Hui Li",
title = "A novel attack to spatial cloaking schemes in
location-based services",
journal = j-FUT-GEN-COMP-SYS,
volume = "49",
number = "??",
pages = "125--132",
month = aug,
year = "2015",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Apr 29 07:41:59 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X14002209",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Ntantogian:2015:GTF,
author = "Christoforos Ntantogian and Stefanos Malliaros and
Christos Xenakis",
title = "{Gaithashing}: a two-factor authentication scheme
based on gait features",
journal = j-COMPUT-SECUR,
volume = "52",
number = "??",
pages = "17--32",
month = jul,
year = "2015",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:42 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404815000413",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Misc{Oliynykov:2015:NES,
author = "Roman Oliynykov and Ivan Gorbenko and Oleksandr
Kazymyrov and Victor Ruzhentsev and Oleksandr Kuznetsov
and Yurii Gorbenko and Oleksandr Dyrda and Viktor
Dolgov and Andrii Pushkaryov and Ruslan Mordvinov and
Dmytro Kaidalov",
title = "A New Encryption Standard of {Ukraine}: The {Kalyna}
Block Cipher",
howpublished = "Cryptology ePrint Archive, Report 2015/650",
year = "2015",
bibdate = "Sat Apr 15 17:57:47 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://eprint.iacr.org/2015/650",
acknowledgement = ack-nhfb,
}
@Article{Pal:2015:SDC,
author = "Jiban K. Pal",
title = "Scientometric dimensions of cryptographic research",
journal = j-SCIENTOMETRICS,
volume = "105",
number = "1",
pages = "179--202",
month = oct,
year = "2015",
CODEN = "SCNTDX",
DOI = "https://doi.org/10.1007/s11192-015-1661-z",
ISSN = "0138-9130 (print), 1588-2861 (electronic)",
ISSN-L = "0138-9130",
bibdate = "Mon Oct 5 09:09:51 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/scientometrics2010.bib",
URL = "http://link.springer.com/article/10.1007/s11192-015-1661-z",
acknowledgement = ack-nhfb,
fjournal = "Scientometrics",
journal-URL = "http://link.springer.com/journal/11192",
}
@Article{Papadopoulos:2015:PAP,
author = "Dimitrios Papadopoulos and Charalampos Papamanthou and
Roberto Tamassia and Nikos Triandopoulos",
title = "Practical authenticated pattern matching with optimal
proof size",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "8",
number = "7",
pages = "750--761",
month = feb,
year = "2015",
CODEN = "????",
ISSN = "2150-8097",
bibdate = "Wed Apr 15 19:04:24 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "We address the problem of authenticating pattern
matching queries over textual data that is outsourced
to an untrusted cloud server. By employing
cryptographic accumulators in a novel optimal
integrity-checking tool built directly over a suffix
tree, we design the first authenticated data structure
for verifiable answers to pattern matching queries
featuring fast generation of constant-size proofs. We
present two main applications of our new construction
to authenticate: (i) pattern matching queries over text
documents, and (ii) exact path queries over XML
documents. Answers to queries are verified by proofs of
size at most 500 bytes for text pattern matching, and
at most 243 bytes for exact path XML search,
independently of the document or answer size. By
design, our authentication schemes can also be
parallelized to offer extra efficiency during data
outsourcing. We provide a detailed experimental
evaluation of our schemes showing that for both
applications the times required to compute and verify a
proof are very small --- e.g., it takes less than $ 10
\mu $ s to generate a proof for a pattern (mis)match of
$ 10^2 $ characters in a text of $ 10^6 $ characters,
once the query has been evaluated.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Patsakis:2015:PSM,
author = "Constantinos Patsakis and Athanasios Zigomitros and
Achilleas Papageorgiou and Agusti Solanas",
title = "Privacy and Security for Multimedia Content shared on
{OSNs}: Issues and Countermeasures",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "518--535",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu066",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/518",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "July 31, 2014",
}
@Article{Pei:2015:SWT,
author = "Qingqi Pei and Dingyu Yan and Lichuan Ma and Zi Li and
Yang Liao",
title = "A Strong and Weak Ties Feedback-Based Trust Model in
Multimedia Social Networks",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "627--643",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv017",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/627",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Perazzo:2015:DRL,
author = "Pericle Perazzo and Pavel Skvortsov and Gianluca
Dini",
title = "On Designing Resilient Location-Privacy Obfuscators",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2649--2664",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv009",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2649",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "February 11, 2015",
}
@Article{Pereira:2015:PKE,
author = "Mayana Pereira and Rafael Dowsley and Anderson C. A.
Nascimento and Goichiro Hanaoka",
title = "Public-Key Encryption Schemes with Bounded {CCA}
Security and Optimal Ciphertext Length Based on the
{CDH} and {HDH} Assumptions",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2738--2746",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv040",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2738",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "June 8, 2015",
}
@Article{Popa:2015:HCD,
author = "R. A. Popa and N. Zeldovich",
title = "How to compute with data you can't see",
journal = j-IEEE-SPECTRUM,
volume = "52",
number = "8",
pages = "42--47",
month = aug,
year = "2015",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2015.7164401",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Computer hacking; Computer security; cryptography;
data security; Databases; Encryption; encryption;
Internet; Web applications",
}
@Article{Premarathne:2015:LDD,
author = "Uthpala Subodhani Premarathne and Ibrahim Khalil and
Mohammed Atiquzzaman",
title = "Location-dependent disclosure risk based decision
support framework for persistent authentication in
pervasive computing applications",
journal = j-COMP-NET-AMSTERDAM,
volume = "88",
number = "??",
pages = "161--177",
day = "9",
month = sep,
year = "2015",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Jul 25 08:35:39 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128615001954",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Proudfoot:2015:WTH,
author = "D. Proudfoot",
title = "What {Turing} himself said about the imitation game",
journal = j-IEEE-SPECTRUM,
volume = "52",
number = "7",
pages = "42--47",
month = jul,
year = "2015",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2015.7131694",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Computers; Cryptography; Encoding; Game theory;
History; imitation game; learning (artificial
intelligence); machine thinking; Nazi naval codes;
Turing machines; Turing, Alan",
}
@Article{Rabbachin:2015:WNI,
author = "Alberto Rabbachin and Andrea Conti and Moe Z. Win",
title = "Wireless network intrinsic secrecy",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "1",
pages = "56--69",
month = feb,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2297339",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Aug 28 06:01:29 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Wireless secrecy is essential for communication
confidentiality, health privacy, public safety,
information superiority, and economic advantage in the
modern information society. Contemporary security
systems are based on cryptographic primitives and can
be complemented by techniques that exploit the
intrinsic properties of a wireless environment. This
paper develops a foundation for design and analysis of
wireless networks with secrecy provided by intrinsic
properties such as node spatial distribution, wireless
propagation medium, and aggregate network interference.
We further propose strategies that mitigate
eavesdropping capabilities, and we quantify their
benefits in terms of network secrecy metrics. This
research provides insights into the essence of wireless
network intrinsic secrecy and offers a new perspective
on the role of network interference in communication
confidentiality.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Radke:2015:CFA,
author = "Kenneth Radke and Colin Boyd and Juan Gonzalez Nieto
and Harry Bartlett",
title = "{CHURNs}: Freshness Assurance for Humans",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2404--2425",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu073",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2404",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 24, 2014",
}
@Article{Rajendran:2015:FAB,
author = "J. Rajendran and Huan Zhang and Chi Zhang and G. S.
Rose and Youngok Pino and O. Sinanoglu and R. Karri",
title = "Fault Analysis-Based Logic Encryption",
journal = j-IEEE-TRANS-COMPUT,
volume = "64",
number = "2",
pages = "??--??",
month = feb,
year = "2015",
CODEN = "ITCOB4",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Feb 11 14:05:05 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Rauscher:2015:FMT,
author = "Karl Frederick Rauscher",
title = "Forum: A Matter of Trust",
journal = j-SCI-AMER,
volume = "312",
number = "3",
pages = "8--8",
month = mar,
year = "2015",
CODEN = "SCAMAC",
DOI = "https://doi.org/10.1038/scientificamerican0315-8",
ISSN = "0036-8733 (print), 1946-7087 (electronic)",
ISSN-L = "0036-8733",
bibdate = "Mon Mar 9 16:32:36 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sciam2010.bib;
http://www.nature.com/scientificamerican",
URL = "http://www.nature.com/scientificamerican/journal/v312/n3/full/scientificamerican0315-8.html;
http://www.nature.com/scientificamerican/journal/v312/n3/pdf/scientificamerican0315-8.pdf",
acknowledgement = ack-nhfb,
fjournal = "Scientific American",
remark = "The author calls for separation of commercial
enterprises from government security agencies, with
contractual penalties against government covert
security compromises.",
}
@Article{Reeve:2015:ARC,
author = "Tom Reeve",
title = "Aged {RC4} cipher to be shunned by security conscious
browsers",
journal = "SC Magazine",
volume = "??",
number = "??",
pages = "??",
day = "2",
month = sep,
year = "2015",
bibdate = "Tue Sep 08 17:57:09 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.scmagazine.com/aged-rc4-cipher-to-be-shunned-by-security-conscious-browsers/article/436521/",
abstract = "In an apparent coordinated announcement, Google,
Mozilla and Microsoft announced that they would stop
using the RC4 stream cipher in their respective
browsers.",
acknowledgement = ack-nhfb,
}
@Article{Ren:2015:ASE,
author = "Jianbao Ren and Yong Qi and Yuehua Dai and Xiaoguang
Wang and Yi Shi",
title = "{AppSec}: a Safe Execution Environment for Security
Sensitive Applications",
journal = j-SIGPLAN,
volume = "50",
number = "7",
pages = "187--199",
month = jul,
year = "2015",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2817817.2731199",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Tue Feb 16 12:01:42 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "Malicious OS kernel can easily access user's private
data in main memory and pries human-machine interaction
data, even one that employs privacy enforcement based
on application level or OS level. This paper introduces
AppSec, a hypervisor-based safe execution environment,
to protect both the memory data and human-machine
interaction data of security sensitive applications
from the untrusted OS transparently. AppSec provides
several security mechanisms on an untrusted OS. AppSec
introduces a safe loader to check the code integrity of
application and dynamic shared objects. During runtime,
AppSec protects application and dynamic shared objects
from being modified and verifies kernel memory accesses
according to application's intention. AppSec provides a
devices isolation mechanism to prevent the
human-machine interaction devices being accessed by
compromised kernel. On top of that, AppSec further
provides a privileged-based window system to protect
application's X resources. The major advantages of
AppSec are threefold. First, AppSec verifies and
protects all dynamic shared objects during runtime.
Second, AppSec mediates kernel memory access according
to application's intention but not encrypts all
application's data roughly. Third, AppSec provides a
trusted I/O path from end-user to application. A
prototype of AppSec is implemented and shows that
AppSec is efficient and practical.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "VEE '15 conference proceedings.",
}
@Article{Ribeiro:2015:QBS,
author = "J. Ribeiro and A. Souto and P. Mateus",
title = "Quantum blind signature with an offline repository",
journal = "International Journal of Quantum Information",
volume = "13",
number = "2",
pages = "1550016",
month = "????",
year = "2015",
DOI = "https://doi.org/10.1142/S0219749915500161",
bibdate = "Mon May 18 10:40:50 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "See also news story \cite{Anonymous:2015:BSU}.",
URL = "www.worldscientific.com/doi/pdf/10.1142/S0219749915500161",
acknowledgement = ack-nhfb,
keywords = "Bell states; Quantum blind signatures; trusted party",
pagecount = "21",
}
@Article{Rossi:2015:IBS,
author = "Francesco Rossi and Giovanni Schmid",
title = "Identity-based secure group communications using
pairings",
journal = j-COMP-NET-AMSTERDAM,
volume = "89",
number = "??",
pages = "32--43",
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2015.07.007",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Tue Sep 8 19:39:32 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128615002303",
acknowledgement = ack-nhfb,
keywords = "Group key agreement; Identity-based cryptography;
Pairing-based signatures",
}
@Article{Roy:2015:SCP,
author = "Arpan Roy and Santonu Sarkar and Rajeshwari Ganesan
and Geetika Goel",
title = "Secure the Cloud: From the Perspective of a
Service-Oriented Organization",
journal = j-COMP-SURV,
volume = "47",
number = "3",
pages = "41:1--41:??",
month = apr,
year = "2015",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2693841",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Apr 16 18:47:49 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "In response to the revival of virtualized technology
by Rosenblum and Garfinkel [2005], NIST defined cloud
computing, a new paradigm in service computing
infrastructures. In cloud environments, the basic
security mechanism is ingrained in virtualization ---
that is, the execution of instructions at different
privilege levels. Despite its obvious benefits, the
caveat is that a crashed virtual machine (VM) is much
harder to recover than a crashed workstation. When
crashed, a VM is nothing but a giant corrupt binary
file and quite unrecoverable by standard disk-based
forensics. Therefore, VM crashes should be avoided at
all costs. Security is one of the major contributors to
such VM crashes. This includes compromising the
hypervisor, cloud storage, images of VMs used
infrequently, and remote cloud client used by the
customer as well as threat from malicious insiders.
Although using secure infrastructures such as private
clouds alleviate several of these security problems,
most cloud users end up using cheaper options such as
third-party infrastructures (i.e., private clouds),
thus a thorough discussion of all known security issues
is pertinent. Hence, in this article, we discuss
ongoing research in cloud security in order of the
attack scenarios exploited most often in the cloud
environment. We explore attack scenarios that call for
securing the hypervisor, exploiting co-residency of
VMs, VM image management, mitigating insider threats,
securing storage in clouds, abusing lightweight
software-as-a-service clients, and protecting data
propagation in clouds. Wearing a practitioner's
glasses, we explore the relevance of each attack
scenario to a service company like Infosys. At the same
time, we draw parallels between cloud security research
and implementation of security solutions in the form of
enterprise security suites for the cloud. We discuss
the state of practice in the form of enterprise
security suites that include cryptographic solutions,
access control policies in the cloud, new techniques
for attack detection, and security quality assurance in
clouds.",
acknowledgement = ack-nhfb,
articleno = "41",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Ruoti:2015:WJS,
author = "Scott Ruoti and Jeff Andersen and Daniel Zappala and
Kent Seamons",
title = "Why {Johnny} Still, Still Can't Encrypt: Evaluating
the Usability of a Modern {PGP} Client",
journal = "arxiv.org",
volume = "??",
number = "??",
pages = "1--5",
day = "29",
month = oct,
year = "2015",
bibdate = "Mon Nov 16 05:52:32 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://arxiv.org/pdf/1510.08555.pdf",
abstract = "This paper presents the results of a laboratory study
involving Mailvelope, a modern PGP client that
integrates tightly with existing webmail providers. In
our study, we brought in pairs of participants and had
them attempt to use Mailvelope to communicate with each
other. Our results shown that more than a decade and a
half after Why Johnny Can't Encrypt, modern PGP tools
are still unusable for the masses. We finish with a
discussion of pain points encountered using Mailvelope,
and discuss what might be done to address them in
future PGP systems",
acknowledgement = ack-nhfb,
}
@Article{Rupp:2015:CTM,
author = "Andy Rupp and Foteini Baldimtsi and Gesine
Hinterw{\"a}lder and Christof Paar",
title = "Cryptographic Theory Meets Practice: Efficient and
Privacy-Preserving Payments for Public Transport",
journal = j-TISSEC,
volume = "17",
number = "3",
pages = "10:1--10:??",
month = mar,
year = "2015",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2699904",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Fri Mar 27 17:03:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "We propose a new lightweight cryptographic payment
scheme for transit systems, called P4R
(Privacy-Preserving Pre-Payments with Refunds), which
is suitable for low-cost user devices with limited
capabilities. Using P4R, users deposit money to obtain
one-show credentials, where each credential allows the
user to make an arbitrary ride on the system. The trip
fare is determined on-the-fly at the end of the trip.
If the deposit for the credential exceeds this fare,
the user obtains a refund. Refund values collected over
several trips are aggregated in a single token, thereby
saving memory and increasing privacy. Our solution
builds on Brands's e-cash scheme to realize the
prepayment system and on Boneh-Lynn-Shacham (BLS)
signatures to implement the refund capabilities.
Compared to a Brands-only solution for transportation
payment systems, P4R allows us to minimize the number
of coins a user needs to pay for his rides and thus
minimizes the number of expensive withdrawal
transactions, as well as storage requirements for the
fairly large coins. Moreover, P4R enables flexible
pricing because it allows for exact payments of
arbitrary amounts (within a certain range) using a
single fast paying (and refund) transaction.
Fortunately, the mechanisms enabling these features
require very little computational overhead. Choosing
contemporary security parameters, we implemented P4R on
a prototyping payment device and show its suitability
for future transit payment systems. Estimation results
demonstrate that the data required for 20 rides consume
less than 10KB of memory, and the payment and refund
transactions during a ride take less than half a
second. We show that malicious users are not able to
cheat the system by receiving a refund that exceeds the
overall deposit minus the overall fare and can be
identified during double-spending checks. At the same
time, the system protects the privacy of honest users
in that transactions are anonymous (except for
deposits) and trips are unlinkable.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Russo:2015:FPT,
author = "Alejandro Russo",
title = "Functional pearl: two can keep a secret, if one of
them uses {Haskell}",
journal = j-SIGPLAN,
volume = "50",
number = "9",
pages = "280--288",
month = sep,
year = "2015",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2858949.2784756",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Tue Feb 16 12:01:43 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "For several decades, researchers from different
communities have independently focused on protecting
confidentiality of data. Two distinct technologies have
emerged for such purposes: Mandatory Access Control
(MAC) and Information-Flow Control (IFC)-the former
belonging to operating systems (OS) research, while the
latter to the programming languages community. These
approaches restrict how data gets propagated within a
system in order to avoid information leaks. In this
scenario, Haskell plays a unique privileged role: it is
able to protect confidentiality via libraries. This
pearl presents a monadic API which statically protects
confidentiality even in the presence of advanced
features like exceptions, concurrency, and mutable data
structures. Additionally, we present a mechanism to
safely extend the library with new primitives, where
library designers only need to indicate the read and
write effects of new operations.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "ICFP '15 conference proceedings.",
}
@Article{Ryan:2015:EEVa,
author = "Peter Y. A. Ryan and Steve Schneider and Vanessa
Teague",
title = "End-to-End Verifiability in Voting Systems, from
Theory to Practice",
journal = j-IEEE-SEC-PRIV,
volume = "13",
number = "3",
pages = "59--62",
month = may # "\slash " # jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2015.54",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Mon Aug 3 11:45:33 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "http://www.computer.org/csdl/mags/sp/2015/03/msp2015030059-abs.html",
abstract-URL = "http://www.computer.org/csdl/mags/sp/2015/03/msp2015030059-abs.html",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Ryan:2015:EEVb,
author = "Peter Y. A. Ryan and Steve Schneider and Vanessa
Teague",
title = "End-to-End Verifiability in Voting Systems, from
Theory to Practice",
journal = j-COMPUT-EDGE,
volume = "1",
number = "10",
pages = "9--11",
month = oct,
year = "2015",
ISSN = "2376-113X",
bibdate = "Sat Oct 31 11:24:26 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.computer.org/cms/Computer.org/computing-edge/ce-oct15-final.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computing Edge",
journal-URL = "http://www.computer.org/web/computingedge",
}
@Article{Saevanee:2015:CUA,
author = "Hataichanok Saevanee and Nathan Clarke and Steven
Furnell and Valerio Biscione",
title = "Continuous user authentication using multi-modal
biometrics",
journal = j-COMPUT-SECUR,
volume = "53",
number = "??",
pages = "234--246",
month = sep,
year = "2015",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:42 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404815000875",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Sarkar:2015:DFA,
author = "S. Sarkar and S. Banik and S. Maitra",
title = "Differential Fault Attack against Grain Family with
Very Few Faults and Minimal Assumptions",
journal = j-IEEE-TRANS-COMPUT,
volume = "64",
number = "6",
pages = "1647--1657",
month = jun,
year = "2015",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2014.2339854",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Jun 10 07:41:35 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Sarreshtedari:2015:WMD,
author = "S. Sarreshtedari and M. A. Akhaee and A. Abbasfar",
title = "A Watermarking Method for Digital Speech
Self-Recovery",
journal = j-IEEE-ACM-TASLP,
volume = "23",
number = "11",
pages = "1917--1925",
month = nov,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/TASLP.2015.2456431",
ISSN = "2329-9290",
ISSN-L = "2329-9290",
bibdate = "Mon Oct 5 06:29:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Sasdrich:2015:ICS,
author = "Pascal Sasdrich and Tim G{\"u}neysu",
title = "Implementing {Curve25519} for Side-Channel--Protected
Elliptic Curve Cryptography",
journal = j-TRETS,
volume = "9",
number = "1",
pages = "3:1--3:??",
month = nov,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2700834",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Tue Dec 22 16:19:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
abstract = "For security-critical embedded applications Elliptic
Curve Cryptography (ECC) has become the predominant
cryptographic system for efficient key agreement and
digital signatures. However, ECC still involves complex
modular arithmetic that is a particular burden for
small processors. In this context, Bernstein proposed
the highly efficient ECC instance Curve25519 that
particularly enables efficient software implementations
at a security level comparable to AES-128 with inherent
resistance to simple power analysis (SPA) and timing
attacks. In this work, we show that Curve25519 is
likewise competitive on FPGAs even when countermeasures
to thwart side-channel power analysis are included. Our
basic multicore DSP-based architectures achieves a
maximal performance of more than 32,000 point
multiplications per second on a Xilinx Zynq 7020 FPGA.
Including a mix of side-channel countermeasures to
impede simple and differential power analysis, we still
achieve more than 27,500 point multiplications per
second with a moderate increase in logic resources.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
}
@Article{Savage:2015:NVS,
author = "Neil Savage",
title = "News: Visualizing sound",
journal = j-CACM,
volume = "58",
number = "2",
pages = "15--17",
month = feb,
year = "2015",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2693430",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Feb 10 13:56:49 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2015/2/182639/fulltext",
abstract = "New techniques capture speech by looking for the
vibrations it causes.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "cryptography; eavesdropping",
remark = "The article describes progress in recovering
comprehensible speech from vibrations of objects in
video films.",
}
@Article{Savas:2015:GMA,
author = "Erkay Sava{\c{s}} and Cemal Y{\i}lmaz",
title = "A Generic Method for the Analysis of a Class of Cache
Attacks: a Case Study for {AES}",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2716--2737",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv027",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2716",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "April 23, 2015",
}
@Article{Schaefer:2015:BRB,
author = "Edward F. Schaefer",
title = "Book Review: {{\booktitle{The Mathematics of
Encryption: An Elementary Introduction}}, Reviewed
work(s): The Mathematics of Encryption: An Elementary
Introduction. By Margaret Cozzens and Steven J. Miller.
American Mathematical Society, Providence, RI, 2013,
xviii + 332 pp., ISBN 978-0-8218-8321-1, \$49.00}",
journal = j-AMER-MATH-MONTHLY,
volume = "122",
number = "1",
pages = "83--88",
month = jan,
year = "2015",
CODEN = "AMMYAE",
DOI = "https://doi.org/10.4169/amer.math.monthly.122.01.83",
ISSN = "0002-9890 (print), 1930-0972 (electronic)",
ISSN-L = "0002-9890",
bibdate = "Thu Mar 19 08:36:23 MDT 2015",
bibsource = "http://www.jstor.org/stable/10.4169/amermathmont.122.issue-01;
https://www.math.utah.edu/pub/tex/bib/amermathmonthly2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.jstor.org/stable/10.4169/amer.math.monthly.122.01.83",
acknowledgement = ack-nhfb,
fjournal = "American Mathematical Monthly",
journal-URL = "http://www.jstor.org/journals/00029890.html",
}
@Article{Schaffer:2015:ECA,
author = "Kim B. Schaffer",
title = "Expanding Continuous Authentication with Mobile
Devices",
journal = j-COMPUTER,
volume = "48",
number = "11",
pages = "92--95",
month = nov,
year = "2015",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2015.333",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Mon Jan 4 18:58:36 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.computer.org/csdl/mags/co/2015/11/mco2015110092-abs.html",
abstract-URL = "http://www.computer.org/csdl/mags/co/2015/11/mco2015110092-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Schaumont:2015:IEP,
author = "Patrick Schaumont and Maire O'Neill and Tim
G{\"u}neysu",
title = "Introduction for Embedded Platforms for Cryptography
in the Coming Decade",
journal = j-TECS,
volume = "14",
number = "3",
pages = "40:1--40:??",
month = apr,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2745710",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue Apr 21 17:21:32 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
acknowledgement = ack-nhfb,
articleno = "40",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Book{Schneier:2015:DGH,
author = "Bruce Schneier",
title = "{Data and Goliath}: the hidden battles to collect your
data and control your world",
publisher = pub-NORTON,
address = pub-NORTON:adr,
pages = "383",
year = "2015",
ISBN = "0-393-24481-4 (hardcover)",
ISBN-13 = "978-0-393-24481-6 (hardcover)",
LCCN = "HM846 .S362 2015",
bibdate = "Fri Mar 13 16:17:25 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.democracynow.org/2015/3/13/data_and_goliath_bruce_schneier_on;
http://www.democracynow.org/blog/2015/3/13/part_2_bruce_schneier_on_the",
acknowledgement = ack-nhfb,
author-dates = "1963--",
subject = "Electronic surveillance; Social aspects; Information
technology; Computer security; Privacy, Right of;
Social control",
tableofcontents = "Data as a by-product of computing \\
Data as surveillance \\
Analyzing our data \\
The business of surveillance \\
Government surveillance and control \\
Consolidation of institutional control \\
Political liberty and justice \\
Commercial fairness and equality \\
Business competitiveness \\
Privacy \\
Security \\
Principles \\
Solutions for government \\
Solutions for corporations \\
Solutions for the rest of us \\
Social norms and the big data trade-off",
}
@TechReport{Schneier:2015:SWC,
author = "Bruce Schneier and Matthew Fredrikson and Tadayoshi
Kohno and Thomas Ristenpart",
title = "Surreptitiously Weakening Cryptographic Systems",
type = "Report",
institution = "Co3 Systems; University of Wisconsin; University of
Washington",
address = "????; Madison, WI, USA; Seattle, WA, USA",
day = "9",
month = feb,
year = "2015",
bibdate = "Mon Mar 02 11:53:19 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://eprint.iacr.org/2015/097",
acknowledgement = ack-nhfb,
}
@Article{Seo:2015:AEC,
author = "Seog Chung Seo and Taehong Kim and Seokhie Hong",
title = "Accelerating elliptic curve scalar multiplication over
{$ {\rm GF}(2^m) $} on graphic hardwares",
journal = j-J-PAR-DIST-COMP,
volume = "75",
number = "??",
pages = "152--167",
month = jan,
year = "2015",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2014.09.001",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Tue Nov 25 18:17:38 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731514001646",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315/",
}
@Article{Shahandashti:2015:RUP,
author = "Siamak F. Shahandashti and Reihaneh Safavi-Naini and
Nashad Ahmed Safa",
title = "Reconciling user privacy and implicit authentication
for mobile devices",
journal = j-COMPUT-SECUR,
volume = "53",
number = "??",
pages = "215--233",
month = sep,
year = "2015",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:42 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404815000838",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Shao:2015:SAS,
author = "Zhi-Yi Shao and Bo Yang",
title = "On security against the server in designated tester
public key encryption with keyword search",
journal = j-INFO-PROC-LETT,
volume = "115",
number = "12",
pages = "957--961",
month = dec,
year = "2015",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Aug 20 06:19:48 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015001283",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Shen:2015:CSC,
author = "Emily Shen and Mayank Varia and Robert K. Cunningham
and W. Konrad Vesey",
title = "Cryptographically Secure Computation",
journal = j-COMPUTER,
volume = "48",
number = "4",
pages = "78--81",
month = apr,
year = "2015",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2015.101",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Jun 9 06:31:50 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://csdl.computer.org/csdl/mags/co/2015/04/mco2015040078-abs.html",
abstract-URL = "http://csdl.computer.org/csdl/mags/co/2015/04/mco2015040078-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Shi:2015:CTS,
author = "Run-hua Shi and Hong Zhong and Shun Zhang",
title = "Comments on two schemes of identity-based user
authentication and key agreement for mobile
client-server networks",
journal = j-J-SUPERCOMPUTING,
volume = "71",
number = "11",
pages = "4015--4018",
month = nov,
year = "2015",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-015-1496-7",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Mon Jan 25 08:18:10 MST 2016",
bibsource = "http://link.springer.com/journal/11227/71/11;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-015-1496-7",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Shiaeles:2015:FII,
author = "Stavros N. Shiaeles and Maria Papadaki",
title = "{FHSD}: an Improved {IP} Spoof Detection Method for
{Web} {DDoS} Attacks",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "892--903",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu007",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/892",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "February 21, 2014",
}
@Article{Shim:2015:SDA,
author = "Kyung-Ah Shim and Cheol-Min Park",
title = "A Secure Data Aggregation Scheme Based on Appropriate
Cryptographic Primitives in Heterogeneous Wireless
Sensor Networks",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "26",
number = "8",
pages = "2128--2139",
month = aug,
year = "2015",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2014.2346764",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Aug 3 11:58:55 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://www.computer.org/csdl/trans/td/2015/08/06875932-abs.html",
abstract-URL = "http://www.computer.org/csdl/trans/td/2015/08/06875932-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@InProceedings{Shrestha:2015:CIS,
author = "Ajaya Shrestha and Arun Timalsina",
booktitle = "{2015 9th International Conference on Software,
Knowledge, Information Management and Applications
(SKIMA)}",
title = "Color image steganography technique using {Daubechies}
discrete wavelet transform",
publisher = pub-IEEE,
address = pub-IEEE:adr,
month = dec,
year = "2015",
DOI = "https://doi.org/10.1109/skima.2015.7400039",
bibdate = "Sat Mar 10 14:29:20 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
pagecount = "7",
}
@Article{Shu:2015:PML,
author = "Tao Shu and Yingying Chen and Jie Yang",
title = "Protecting multi-lateral localization privacy in
pervasive environments",
journal = j-IEEE-TRANS-NETWORKING,
volume = "23",
number = "5",
pages = "1688--1701",
month = oct,
year = "2015",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2478881",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jan 5 18:36:30 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Location-based services (LBSs) have raised serious
privacy concerns in the society, due to the possibility
of leaking a mobile user's location information in
enabling location-dependent services. While existing
location-privacy studies are mainly focused on
preventing the leakage of a user's location in
accessing the LBS server, the possible privacy leakage
in the calculation of the user's location, i.e., the
localization, has been largely ignored. Such a privacy
leakage stems from the fact that a localization
algorithm typically takes the location of anchors
(reference points for localization) as input, and
generates the target's location as output. As such, the
location of anchors and target could be leaked to
others. An adversary could further utilize the leakage
of anchor's locations to attack the localization
infrastructure and undermine the accurate estimation of
the target's location. To address this issue, in this
paper, we study the multilateral privacy-preserving
localization problem, whereby the location of a target
is calculated without the need of revealing anchors'
location, and the knowledge of the localization
outcome, i.e., the target's location, is strictly
limited to the target itself. To fully protect the
user's privacy, our study protects not only the user's
exact location information (the geo-coordinates), but
also any side information that may lead to a coarse
estimate of the location. We formulate the problem as a
secure least-squared-error (LSE) estimation for an
overdetermined linear system and develop three
privacy-preserving solutions by leveraging combinations
of information-hiding and homomorphic encryption. These
solutions provide different levels of protection for
location-side information and resilience to node
collusion and have the advantage of being able to trade
a user's privacy requirements for better computation
and communication efficiency. Through numerical
results, we verify the significant efficiency
improvement of the proposed schemes over existing
multiparty secure LSE algorithms.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shyu:2015:VCR,
author = "Shyong Jian Shyu",
title = "Visual cryptograms of random grids for threshold
access structures",
journal = j-THEOR-COMP-SCI,
volume = "565",
number = "??",
pages = "30--49",
day = "2",
month = feb,
year = "2015",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Jan 7 16:00:37 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514008408",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Simion:2015:RST,
author = "Emil Simion",
title = "The Relevance of Statistical Tests in Cryptography",
journal = j-IEEE-SEC-PRIV,
volume = "13",
number = "1",
pages = "66--70",
month = jan # "\slash " # feb,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2015.16",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Feb 11 15:40:13 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "http://www.computer.org/csdl/mags/sp/2015/01/msp2015010066-abs.html",
abstract-URL = "http://www.computer.org/csdl/mags/sp/2015/01/msp2015010066-abs.html",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Simmonds:2015:DII,
author = "Paul Simmonds",
title = "The digital identity issue",
journal = j-NETWORK-SECURITY,
volume = "2015",
number = "8",
pages = "8--13",
month = aug,
year = "2015",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(15)30069-6",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:22 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485815300696",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Singh:2015:EST,
author = "Dilraj Singh and Amardeep Singh",
title = "Enhanced Secure Trusted {AODV} {(ESTA)} Protocol to
Mitigate Blackhole Attack in Mobile Ad Hoc Networks",
journal = j-FUTURE-INTERNET,
volume = "7",
number = "3",
pages = "342--362",
day = "23",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi7030342",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:54 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/7/3/342",
abstract = "The self-organizing nature of the Mobile Ad hoc
Networks (MANETs) provide a communication channel
anywhere, anytime without any pre-existing network
infrastructure. However, it is exposed to various
vulnerabilities that may be exploited by the malicious
nodes. One such malicious behavior is introduced by
blackhole nodes, which can be easily introduced in the
network and, in turn, such nodes try to crumble the
working of the network by dropping the maximum data
under transmission. In this paper, a new protocol is
proposed which is based on the widely used Ad hoc
On-Demand Distance Vector (AODV) protocol, Enhanced
Secure Trusted AODV (ESTA), which makes use of multiple
paths along with use of trust and asymmetric
cryptography to ensure data security. The results,
based on NS-3 simulation, reveal that the proposed
protocol is effectively able to counter the blackhole
nodes in three different scenarios.",
acknowledgement = ack-nhfb,
}
@Book{Smith:2015:DBP,
author = "Michael Smith",
title = "The Debs of {Bletchley Park} and other stories",
publisher = "Aurum Press",
address = "London, UK",
pages = "298 + 8",
year = "2015",
ISBN = "1-78131-387-3 (hardcover), 1-78131-388-1",
ISBN-13 = "978-1-78131-387-9 (hardcover), 978-1-78131-388-6",
LCCN = "D810.S7 S65 2015",
bibdate = "Thu Dec 28 10:06:30 MST 2017",
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/cryptography2010.bib",
abstract = "At the peak of Bletchley's success, a total of twelve
thousand people worked there of whom more than eight
thousand were women. In \booktitle{The Debs of
Bletchley Park AND Other Stories}, author Michael
Smith, trustee of Bletchley Park and chair of the
Trust's Historical Advisory Committee, tells their
tale. Through interviews with the women themselves and
unique access to the Bletchley Park archives, Smith
reveals how they came to be there, the lives they gave
up to do `their bit' for the war effort, and the part
they played in the vital work of `Station X'.",
acknowledgement = ack-nhfb,
author-dates = "1952 May 1--",
subject = "World War, 1939--1945; Cryptography; Electronic
intelligence; Great Britain; Women; Cryptography;
Electronic intelligence; Women; Bletchley Park (Milton
Keynes, England); History; England; Milton Keynes;
Bletchley Park",
tableofcontents = "The biggest lunatic asylum in Britain \\
Breaking Enigma \\
Sink the Bismarck \\
The Wrens arrive \\
Let's call the whole thing off \\
Turing and the U-boats \\
Dilly's girls \\
The world's first electronic computer \\
The Jappy Waaf \\
An extraordinary army of people",
}
@Book{Smith:2015:HHB,
author = "Christopher Smith",
title = "The hidden history of {Bletchley Park}: a social and
organisational history, 1939--1945",
publisher = "Palgrave Macmillan",
address = "New York, NY, USA",
pages = "vii + 238",
year = "2015",
DOI = "https://doi.org/10.1057/9781137484932",
ISBN = "1-137-48492-6",
ISBN-13 = "978-1-137-48492-5",
LCCN = "D810.C88 C653 2015",
bibdate = "Wed Dec 21 12:21:44 MST 2016",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy1608/2015015176-d.html;
http://www.loc.gov/catdir/enhancements/fy1608/2015015176-t.html",
abstract = "Bletchley Park is typically described as a `unique'
institution, a conclusion derived from the
eccentricities of its most celebrated staff members,
its perceived egalitarian and collegiate working
environment, and the extreme secrecy surrounding its
activities. Yet contrary to this popular image of
Bletchley Park, the agency developed over the course of
the war into a highly regimented, highly professional
--- and highly typical --- wartime institution.
Notwithstanding the veil of secrecy that permeated
every level of its operation, the agency faced the same
kinds of logistical, organizational and administrative
challenges common to organizations during the war and
in many respects responded in a `typical' fashion.
Similarly, prevalent social norms within British
society dominated the day-to-day lives of staff
members. Meanwhile, the agency was able to function and
remain secret in no small part thanks to the
willingness of local people to accept a surprising
degree of wartime inconvenience and restriction.",
acknowledgement = ack-nhfb,
author-dates = "1986--",
subject = "World War, 1939--1945; Cryptography; Secret service;
Great Britain; Electronic intelligence; England;
Bletchley (Buckinghamshire); Women; Intelligence
service; Social aspects; History; 20th century;
Corporate culture; Bletchley (Buckinghamshire,
England); Social conditions",
tableofcontents = "Introduction \\
1. The Organisation of the Government Code and Cypher
School \\
2. Recruitment at GC and CS: 1919--1945 \\
3. On-duty Life at the Government Code and Cypher
School \\
4. The Administration of Off-Duty Life and Staff
Welfare \\
5. Off-Duty Life: Staff Experience \\
6. Bletchley Park and its Impact on the Local Community
\\
Conclusion",
}
@Article{Somanatha:2015:RAK,
author = "Revathi Bangalore Somanatha and J. William Atwood",
title = "Router authentication, key management, and adjacency
management for securing inter-router control messages",
journal = j-COMP-NET-AMSTERDAM,
volume = "79",
number = "??",
pages = "68--90",
day = "14",
month = mar,
year = "2015",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Feb 23 09:22:20 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128614004691",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Song:2015:ADT,
author = "WeiTao Song and Bin Hu",
title = "Approach to Detecting Type-Flaw Attacks Based on
Extended Strand Spaces",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "572--587",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu106",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/572",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "October 14, 2014",
}
@Article{Steel:2015:APF,
author = "Graham Steel",
title = "Automated Proof and Flaw-Finding Tools in
Cryptography",
journal = j-IEEE-SEC-PRIV,
volume = "13",
number = "2",
pages = "81--83",
month = mar # "\slash " # apr,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2015.22",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Jun 4 19:11:45 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "http://www.computer.org/csdl/mags/sp/2015/02/msp2015020081-abs.html",
abstract-URL = "http://www.computer.org/csdl/mags/sp/2015/02/msp2015020081-abs.html",
acknowledgement = ack-nhfb,
}
@Article{Stenn:2015:SNT,
author = "Harlan Stenn",
title = "Securing {Network Time Protocol}",
journal = j-CACM,
volume = "58",
number = "2",
pages = "48--51",
month = feb,
year = "2015",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2697397",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Feb 10 13:56:49 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2015/2/182654/fulltext",
abstract = "Crackers discover how to use NTP as a weapon for
abuse.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Misc{Stevens:2015:FCF,
author = "Marc Stevens and Pierre Karpman and Thomas Peyrin",
title = "Freestart collision on full {SHA-1}",
howpublished = "Cryptology ePrint Archive, Report 2015/967.",
year = "2015",
bibdate = "Thu Oct 15 06:33:53 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "https://eprint.iacr.org/2015/967",
abstract = "We present in this article a freestart collision
example for SHA-1, i.e., a collision for its internal
compression function. This is the first practical break
of the full SHA-1, reaching all 80 out of 80 steps,
while only 10 days of computation on a 64 GPU cluster
were necessary to perform the attack. This work builds
on a continuous series of cryptanalytic advancements on
SHA-1 since the theoretical collision attack
breakthrough in 2005. In particular, we extend the
recent freestart collision work on reduced-round SHA-1
from CRYPTO 2015 that leverages the computational power
of graphic cards and adapt it to allow the use of
boomerang speed-up techniques. We also leverage the
cryptanalytic techniques by Stevens from EUROCRYPT 2013
to obtain optimal attack conditions, which required
further refinements for this work.\par
Freestart collisions, like the one presented here, do
not directly imply a collision for SHA-1. However, this
work is an important milestone towards an actual SHA-1
collision and it further shows how graphics cards can
be used very efficiently for these kind of attacks.
Based on the state-of-the-art collision attack on SHA-1
by Stevens from EUROCRYPT 2013, we are able to present
new projections on the computational/financial cost
required by a SHA-1 collision computation. These
projections are significantly lower than previously
anticipated by the industry, due to the use of the more
cost efficient graphics cards compared to regular
CPUs.\par
We therefore recommend the industry, in particular
Internet browser vendors and Certification Authorities,
to retract SHA-1 soon. We hope the industry has learned
from the events surrounding the cryptanalytic breaks of
MD5 and will retract SHA-1 before example signature
forgeries appear in the near future. With our new cost
projections in mind, we strongly and urgently recommend
against a recent proposal to extend the issuance of
SHA-1 certificates with a year in the CAB/forum (vote
closes October 9 2015).",
acknowledgement = ack-nhfb,
keywords = "cryptanalysis; freestart collision; GPU
implementation; hash function; public-key cryptography
/ SHA-1",
}
@Article{Stickney:2015:CBS,
author = "Zephorene Stickney",
title = "Code Breakers: The Secret Service",
journal = "Wheaton Quarterly",
volume = "??",
number = "??",
pages = "??--??",
month = "Summer",
year = "2015",
bibdate = "Sun Dec 31 07:51:47 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://wheatoncollege.edu/news/code-breakers-secret-service/",
acknowledgement = ack-nhfb,
remark = "The URL points to a Spring 2011 issue.",
}
@Article{Sun:2015:FSW,
author = "Shi-Feng Sun and Dawu Gu and Zhengan Huang",
title = "Fully Secure Wicked Identity-Based Encryption Against
Key Leakage Attacks",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2520--2536",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu110",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2520",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 12, 2014",
}
@Article{Suresh:2015:AGU,
author = "Chandra K. H. Suresh and Sule Ozev and Ozgur
Sinanoglu",
title = "Adaptive Generation of Unique {IDs} for Digital Chips
through Analog Excitation",
journal = j-TODAES,
volume = "20",
number = "3",
pages = "46:1--46:??",
month = jun,
year = "2015",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/2732408",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Aug 7 08:47:44 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "Globalization of the integrated circuit design and
manufacturing flow has successfully ameliorated design
complexity and fabrication cost challenges, and helped
deliver cost-effective products while meeting stringent
time-to-market requirements. On the flip side, it has
resulted in various forms of security vulnerabilities
in the supply chain that involves designers, fabs, test
facilities, and distributors until the end-product
reaches customers. One of the biggest threats to
semiconductor industry today is the entry of aged,
reject, or cloned parts, that is, counterfeit chips,
into the supply chain, leading to annual revenue losses
in the order of billions of dollars. While traceability
of chips between trusted parties can help monitor the
supply chain at various points in the flow, existing
solutions are in the form of integrating costly
hardware units on chip, or utilizing easy-to-circumvent
inspection-based detection techniques. In this article,
we propose a technique for adaptive unique ID
generation that leverages process variations, enabling
chip traceability. The proposed method stimulates
digital chips with an analog signal from the supply
lines, which serve as primary inputs to each gate in
the signal path. Using a sinusoidal signal that
exercises the transistors as gain components, we create
a chip-specific response that can be post-processed
into a digital ID. The proposed technique enables quick
and cost-effective authenticity validation that
requires no on-chip hardware support. Our simulation
and experimentation on actual chips show that the
proposed technique is capable of generating unique IDs
even in the presence of environmental noise.",
acknowledgement = ack-nhfb,
articleno = "46",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Swierczynski:2015:PSE,
author = "Pawel Swierczynski and Amir Moradi and David Oswald
and Christof Paar",
title = "Physical Security Evaluation of the Bitstream
Encryption Mechanism of {Altera Stratix II} and
{Stratix III} {FPGAs}",
journal = j-TRETS,
volume = "7",
number = "4",
pages = "7:1--7:??",
month = jan,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2629462",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Fri Feb 13 07:24:19 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
abstract = "To protect Field-Programmable Gate Array (FPGA)
designs against Intellectual Property (IP) theft and
related issues such as product cloning, all major FPGA
manufacturers offer a mechanism to encrypt the
bitstream that is used to configure the FPGA. From a
mathematical point of view, the employed encryption
algorithms (e.g., Advanced Encryption Standard (AES) or
3DES) are highly secure. However, it has been shown
that the bitstream encryption feature of several FPGA
families is susceptible to side-channel attacks based
on measuring the power consumption of the cryptographic
module. In this article, we present the first
successful attack on the bitstream encryption of the
Altera Stratix II and Stratix III FPGA families. To
this end, we analyzed the Quartus II software and
reverse engineered the details of the proprietary and
unpublished schemes used for bitstream encryption on
Stratix II and Stratix III. Using this knowledge, we
demonstrate that the full 128-bit AES key of a Stratix
II as well as the full 256-bit AES key of a Stratix III
can be recovered by means of side-channel attacks. In
both cases, the attack can be conducted in a few hours.
The complete bitstream of these FPGAs that are
(seemingly) protected by the bitstream encryption
feature can hence fall into the hands of a competitor
or criminal-possibly implying system-wide damage if
confidential information such as proprietary encryption
schemes or secret keys programmed into the FPGA are
extracted. In addition to lost IP, reprogramming the
attacked FPGA with modified code, for instance, to
secretly plant a hardware Trojan, is a particularly
dangerous scenario for many security-critical
applications.",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
}
@Article{Tamayo:2015:AFH,
author = "Matthew Tamayo",
title = "Algebraic full homomorphic encryption and resisting
{Gr{\"o}bner} basis cryptanalysis",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "63--63",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815160",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Tang:2015:CER,
author = "Ying-Kai Tang and Sherman S. M. Chow and Joseph K.
Liu",
title = "Comments on {`Efficient Revocable Certificateless
Encryption Secure in the Standard Model'}",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "779--781",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt127",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/779",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 1, 2013",
}
@Article{Tang:2015:ECP,
author = "Qiang Tang and Hua Ma and Xiaofeng Chen",
title = "Extend the Concept of Public Key Encryption with
Delegated Search",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "724--734",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt102",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/724",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 6, 2013",
}
@Article{Tang:2015:ETE,
author = "Qiang Tang",
title = "From Ephemerizer to Timed-Ephemerizer: Achieve Assured
Lifecycle Enforcement for Sensitive Data",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "1003--1020",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu030",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/1003",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "May 2, 2014",
}
@Article{Tang:2015:HAC,
author = "Zhaohui Tang",
title = "Homomorphic authentication codes for network coding",
journal = j-CCPE,
volume = "27",
number = "15",
pages = "3892--3911",
month = oct,
year = "2015",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3079",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Sep 28 09:32:54 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "4 Jul 2013",
}
@Article{Tian:2015:IBP,
author = "Miaomiao Tian",
title = "Identity-based proxy re-signatures from lattices",
journal = j-INFO-PROC-LETT,
volume = "115",
number = "4",
pages = "462--467",
month = apr,
year = "2015",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Jan 20 08:43:02 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S002001901400266X",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Tilli:2015:GCR,
author = "Andrea Tilli and Andrea Bartolini and Matteo Cacciari
and Luca Benini",
title = "Guaranteed Computational Resprinting via
Model-Predictive Control",
journal = j-TECS,
volume = "14",
number = "3",
pages = "48:1--48:??",
month = apr,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2724715",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue Apr 21 17:21:32 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Today and future many-core systems are facing the
utilization wall and dark silicon problems, for which
not all the processing engines can be powered at the
same time as this will lead to a power consumption
higher than the Total Design Power (TDP) budget.
Recently, computational sprinting approaches addressed
the problem by exploiting the intrinsic thermal
capacitance of the chip and the properties of common
applications, which require intense, but temporary, use
of resources. The thermal capacitance, possibly
augmented with phase change materials, enables the
temporary activation of all the resources
simultaneously, although they largely exceed the
steady-state thermal design power. In this article, we
present an innovative and low-overhead hierarchical
model-predictive controller for managing thermally safe
sprinting with predictable resprinting rate, which
ensures the correct execution of mixed-criticality
tasks. Well-targeted simulations, also based on real
workload benchmarks, show the applicability and the
effectiveness of our solution.",
acknowledgement = ack-nhfb,
articleno = "48",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Tseng:2015:LFI,
author = "Yuh-Min Tseng and Tung-Tso Tsai and Sen-Shan Huang",
title = "Leakage-Free {ID}-Based Signature",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "750--757",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt116",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/750",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "October 11, 2013",
}
@Article{Tupakula:2015:TES,
author = "Udaya Tupakula and Vijay Varadharajan",
title = "Trust Enhanced Security for Tenant Transactions in the
Cloud Environment",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2388--2403",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu048",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2388",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "June 17, 2014",
}
@Article{Unruh:2015:RQT,
author = "Dominique Unruh",
title = "Revocable Quantum Timed-Release Encryption",
journal = j-J-ACM,
volume = "62",
number = "6",
pages = "49:1--49:??",
month = dec,
year = "2015",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/2817206",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
bibdate = "Mon Dec 21 17:57:46 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "Timed-release encryption is a kind of encryption
scheme in which a recipient can decrypt only after a
specified amount of time T (assuming that we have a
moderately precise estimate of his computing power). A
revocable timed-release encryption is one where, before
the time T is over, the sender can ``give back'' the
timed-release encryption, provably loosing all access
to the data. We show that revocable timed-release
encryption without trusted parties is possible using
quantum cryptography (while trivially impossible
classically). Along the way, we develop two proof
techniques in the quantum random oracle model that we
believe may have applications also for other protocols.
Finally, we also develop another new primitive, unknown
recipient encryption, which allows us to send a message
to an unknown/unspecified recipient over an insecure
network in such a way that at most one recipient will
get the message.",
acknowledgement = ack-nhfb,
articleno = "49",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Vernize:2015:MNI,
author = "Grazielle Vernize and Andr{\'e} Luiz Pires Guedes and
Luiz Carlos Pessoa Albini",
title = "Malicious Nodes Identification for Complex Network
Based on Local Views",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2476--2491",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu086",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2476",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 30, 2014",
}
@Article{Vigil:2015:IAN,
author = "Mart{\'\i}n Vigil and Johannes Buchmann and Daniel
Cabarcas and Christian Weinert and Alexander
Wiesmaier",
title = "Integrity, authenticity, non-repudiation, and proof of
existence for long-term archiving: a survey",
journal = j-COMPUT-SECUR,
volume = "50",
number = "??",
pages = "16--32",
month = may,
year = "2015",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:41 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404814001849",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Vlachos:2015:DPC,
author = "Michail Vlachos and Johannes Schneider and Vassilios
G. Vassiliadis",
title = "On Data Publishing with Clustering Preservation",
journal = j-TKDD,
volume = "9",
number = "3",
pages = "23:1--23:??",
month = apr,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2700403",
ISSN = "1556-4681 (print), 1556-472X (electronic)",
ISSN-L = "1556-4681",
bibdate = "Tue Apr 14 09:22:28 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/tkdd/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tkdd.bib",
abstract = "The emergence of cloud-based storage services is
opening up new avenues in data exchange and data
dissemination. This has amplified the interest in
right-protection mechanisms to establish ownership in
the event of data leakage. Current right-protection
technologies, however, rarely provide strong guarantees
on dataset utility after the protection process. This
work presents techniques that explicitly address this
topic and provably preserve the outcome of certain
mining operations. In particular, we take special care
to guarantee that the outcome of hierarchical
clustering operations remains the same before and after
right protection. Our approach considers all prevalent
hierarchical clustering variants: single-, complete-,
and average-linkage. We imprint the ownership in a
dataset using watermarking principles, and we derive
tight bounds on the expansion/contraction of distances
incurred by the process. We leverage our analysis to
design fast algorithms for right protection without
exhaustively searching the vast design space. Finally,
because the right-protection process introduces a
user-tunable distortion on the dataset, we explore the
possibility of using this mechanism for data
obfuscation. We quantify the tradeoff between
obfuscation and utility for spatiotemporal datasets and
discover very favorable characteristics of the process.
An additional advantage is that when one is interested
in both right-protecting and obfuscating the original
data values, the proposed mechanism can accomplish both
tasks simultaneously.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Knowledge Discovery from Data
(TKDD)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1054",
}
@Article{Vliegen:2015:SRD,
author = "Jo Vliegen and Nele Mentens and Ingrid Verbauwhede",
title = "Secure, Remote, Dynamic Reconfiguration of {FPGAs}",
journal = j-TRETS,
volume = "7",
number = "4",
pages = "8:1--8:??",
month = jan,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2629423",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Fri Feb 13 07:24:19 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
abstract = "With the widespread availability of broadband
Internet, Field-Programmable Gate Arrays (FPGAs) can
get remote updates in the field. This provides hardware
and software updates, and enables issue solving and
upgrade ability without device modification. In order
to prevent an attacker from eavesdropping or
manipulating the configuration data, security is a
necessity. This work describes an architecture that
allows the secure, remote reconfiguration of an FPGA.
The architecture is partially dynamically
reconfigurable and it consists of a static partition
that handles the secure communication protocol and a
single reconfigurable partition that holds the main
application. Our solution distinguishes itself from
existing work in two ways: it provides entity
authentication and it avoids the use of a trusted third
party. The former provides protection against active
attackers on the communication channel, while the
latter reduces the number of reliable entities.
Additionally, this work provides basic countermeasures
against simple power-oriented side-channel analysis
attacks. The result is an implementation that is
optimized toward minimal resource occupation. Because
configuration updates occur infrequently, configuration
speed is of minor importance with respect to area. A
prototype of the proposed design is implemented, using
5,702 slices and having minimal downtime.",
acknowledgement = ack-nhfb,
articleno = "8",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
}
@Article{VonMaurich:2015:IQM,
author = "Ingo {Von Maurich} and Tobias Oder and Tim
G{\"u}neysu",
title = "Implementing {QC--MDPC} {McEliece} Encryption",
journal = j-TECS,
volume = "14",
number = "3",
pages = "44:1--44:??",
month = apr,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2700102",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue Apr 21 17:21:32 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "With respect to performance, asymmetric code-based
cryptography based on binary Goppa codes has been
reported as a highly interesting alternative to RSA and
ECC. A major drawback is still the large keys in the
range between 50 and 100KB that prevented real-world
applications of code-based cryptosystems so far. A
recent proposal by Misoczki et al. showed that
quasi-cyclic moderate-density parity-check (QC-MDPC)
codes can be used in McEliece encryption, reducing the
public key to just 0.6KB to achieve an 80-bit security
level. In this article, we provide optimized decoding
techniques for MDPC codes and survey several efficient
implementations of the QC-MDPC McEliece cryptosystem.
This includes high-speed and lightweight architectures
for reconfigurable hardware, efficient coding styles
for ARM's Cortex-M4 microcontroller, and novel
high-performance software implementations that fully
employ vector instructions. Finally, we conclude that
McEliece encryption in combination with QC-MDPC codes
not only enables high-performance implementations but
also allows for lightweight designs on a wide range of
different platforms.",
acknowledgement = ack-nhfb,
articleno = "44",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Vu:2015:NAN,
author = "Hai L. Vu and Kenneth K. Khaw and Tsong Yueh Chen",
title = "A New Approach for Network Vulnerability Analysis",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "878--891",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt149",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/878",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "January 5, 2014",
}
@Article{Wang:2015:EFF,
author = "Wei Wang and Yin Hu and Lianmu Chen and Xinming Huang
and B. Sunar",
title = "Exploring the Feasibility of Fully Homomorphic
Encryption",
journal = j-IEEE-TRANS-COMPUT,
volume = "64",
number = "3",
pages = "698--706",
month = mar,
year = "2015",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2013.154",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Mar 17 18:41:22 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Wang:2015:HAD,
author = "Xing Wang and Nga Lam Or and Ziyan Lu and Derek Pao",
title = "Hardware Accelerator to Detect Multi-Segment Virus
Patterns",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2443--2460",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu079",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2443",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 22, 2014",
}
@Article{Wang:2015:RSA,
author = "Yang Wang and Willy Susilo and Man Ho Au",
title = "Revisiting Security Against the Arbitrator in
Optimistic Fair Exchange",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2665--2676",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv011",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2665",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "February 12, 2015",
}
@Article{Watts:2015:HGA,
author = "Steve Watts",
title = "The holy grail of authentication",
journal = j-NETWORK-SECURITY,
volume = "2015",
number = "12",
pages = "18--19",
month = dec,
year = "2015",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(15)30113-6",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:27 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485815301136",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Wei:2015:CPK,
author = "Puwen Wei and Yuliang Zheng",
title = "On the Construction of Public Key Encryption with
Sender Recovery",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "1",
pages = "1--??",
month = jan,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411550001X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 14 10:17:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wei:2015:FST,
author = "Jianghong Wei and Wenfen Liu and Xuexian Hu",
title = "Forward-Secure Threshold Attribute-Based Signature
Scheme",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2492--2506",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu095",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2492",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 25, 2014",
}
@Article{Wei:2015:TPE,
author = "Lei Wei and Michael K. Reiter",
title = "Toward practical encrypted email that supports
private, regular-expression searches",
journal = j-INT-J-INFO-SEC,
volume = "14",
number = "5",
pages = "397--416",
month = oct,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-014-0268-3",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Tue Jan 23 16:01:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://link.springer.com/article/10.1007/s10207-014-0268-3;
http://link.springer.com/content/pdf/10.1007/s10207-014-0268-3.pdf",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
keywords = "Cloud security; Private search on encrypted data;
Regular-expression search",
}
@Article{Wendzel:2015:CME,
author = "S. Wendzel and C. Palmer",
title = "Creativity in Mind: Evaluating and Maintaining
Advances in Network Steganographic Research",
journal = j-J-UCS,
volume = "21",
number = "12",
pages = "1684--??",
month = "????",
year = "2015",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Wed Sep 7 16:47:22 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_21_12/creativity_in_mind_evaluating",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Book{West:2015:EC,
author = "Tom West",
title = "The {Einstein} code",
publisher = "Pan Books",
address = "London, UK",
pages = "400",
year = "2015",
ISBN = "1-4472-1034-4 (paperback), 1-4472-4660-8 (ePub
e-book)",
ISBN-13 = "978-1-4472-1034-4 (paperback), 978-1-4472-4660-2 (ePub
ebook)",
LCCN = "????",
bibdate = "Fri Aug 21 10:35:08 MDT 2015",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/einstein.bib",
abstract = "A lost cipher. A race against time to decode it.
Marine archaeologists Kate Wetherall and Lou Bates are
diving off Howland Island in the middle of the Pacific
Ocean, when a torpedo-shaped object hurtles through the
water towards them; the fuselage of Amelia Earhart's
lost plane. In the cockpit, they find a corroded metal
cylinder the size of a baton. Landing back on US soil,
Kate and Lou are arrested and interrogated by special
forces, and the cylinder confiscated. Behind the
arrests is Glena Buckingham, CEO of the powerful energy
conglomerate Eurenergy, as she too has discovered that
the wrecked plane may have held precious secret cargo.
Meanwhile, an extraordinary piece of footage has come
to light - of Einstein talking about a radical new
defence technology he had been working on. Whoever can
decrypt the lost cipher, which holds the key to
Einstein's secret defence technology, could hold the
key to global power.",
acknowledgement = ack-nhfb,
subject = "Marine archaeologists; Fiction; Underwater
archaeology; Technological innovations; Code and cipher
stories",
}
@Article{Wu:2015:TRM,
author = "Guowei Wu and Zuosong Liu and Lin Yao and Jing Deng
and Jie Wang",
title = "A Trust Routing for Multimedia Social Networks",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "688--699",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu091",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/688",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "October 4, 2014",
}
@Article{Xia:2015:SPK,
author = "Q. Xia and J. Ni and A. J. B. A. Kanpogninge and J. C.
Gee",
title = "Searchable Public-Key Encryption with Data Sharing in
Dynamic Groups for Mobile Cloud Storage",
journal = j-J-UCS,
volume = "21",
number = "3",
pages = "440--??",
month = "????",
year = "2015",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Wed Sep 7 16:47:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_21_3/searchable_public_key_encryption",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Xiang:2015:SSB,
author = "Yong Xiang and I. Natgunanathan and Yue Rong and Song
Guo",
title = "Spread Spectrum-Based High Embedding Capacity
Watermarking Method for Audio Signals",
journal = j-IEEE-ACM-TASLP,
volume = "23",
number = "12",
pages = "2228--2237",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/TASLP.2015.2476755",
ISSN = "2329-9290",
ISSN-L = "2329-9290",
bibdate = "Tue Nov 17 07:34:26 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Xiong:2015:SRE,
author = "Lizhi Xiong and Zhengquan Xu and Yanyan Xu",
title = "A secure re-encryption scheme for data services in a
cloud computing environment",
journal = j-CCPE,
volume = "27",
number = "17",
pages = "4573--4585",
day = "10",
month = dec,
year = "2015",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3423",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue Feb 9 06:13:20 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "23 Jan 2015",
}
@Article{Xu:2015:ORA,
author = "Chang Xu and Liehuang Zhu and Zhoujun Li and Feng
Wang",
title = "One-Round Affiliation-Hiding Authenticated Asymmetric
Group Key Agreement with Semi-trusted Group Authority",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2509--2519",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu099",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2509",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "October 6, 2014",
}
@Article{Yang:2015:EPS,
author = "Bin Yang and Xingming Sun and Xianyi Chen and Jianjun
Zhang and Xu Li",
title = "Exposing Photographic Splicing by Detecting the
Inconsistencies in Shadows",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "588--600",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu146",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/588",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "December 15, 2014",
}
@Article{Yang:2015:RCI,
author = "Hong-Ying Yang and Xiang-Yang Wang and Pan-Pan Niu and
Ai-Long Wang",
title = "Robust Color Image Watermarking Using Geometric
Invariant Quaternion Polar Harmonic Transform",
journal = j-TOMCCAP,
volume = "11",
number = "3",
pages = "40:1--40:??",
month = jan,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2700299",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Feb 5 17:03:39 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "It is a challenging work to design a robust color
image watermarking scheme against geometric
distortions. Moments and moment invariants have become
a powerful tool in robust image watermarking owing to
their image description capability and geometric
invariance property. However, the existing moment-based
watermarking schemes were mainly designed for gray
images but not for color images, and detection quality
and robustness will be lowered when watermark is
directly embedded into the luminance component or three
color channels of color images. Furthermore, the
imperceptibility of the embedded watermark is not well
guaranteed. Based on algebra of quaternions and polar
harmonic transform (PHT), we introduced the quaternion
polar harmonic transform (QPHT) for invariant color
image watermarking in this article, which can be seen
as the generalization of PHT for gray-level images. It
is shown that the QPHT can be obtained from the PHT of
each color channel. We derived and analyzed the
rotation, scaling, and translation (RST) invariant
property of QPHT. We also discussed the problem of
color image watermarking using QPHT. Experimental
results are provided to illustrate the efficiency of
the proposed color image watermarking against geometric
distortions and common image processing operations
(including color attacks).",
acknowledgement = ack-nhfb,
articleno = "40",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Yang:2015:SHI,
author = "Zhen Yang and Kaiming Gao and Kefeng Fan and Yingxu
Lai",
title = "Sensational Headline Identification By Normalized
Cross Entropy-Based Metric",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "644--655",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu107",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/644",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "October 14, 2014",
}
@Article{Yao:2015:LAB,
author = "Xuanxia Yao and Zhi Chen and Ye Tian",
title = "A lightweight attribute-based encryption scheme for
the {Internet of Things}",
journal = j-FUT-GEN-COMP-SYS,
volume = "49",
number = "??",
pages = "104--112",
month = aug,
year = "2015",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Apr 29 07:41:59 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X14002039",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Yasuda:2015:MQC,
author = "Takanori Yasuda and Xavier Dahan and Yun-Ju Huang and
Tsuyoshi Takagi and Kouichi Sakurai",
title = "A multivariate quadratic challenge toward post-quantum
generation cryptography",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "105--107",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850462",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Multivariate polynomials over finite fields have found
applications in Public Key Cryptography (PKC) where the
hardness to find solutions provides the ``one-way
function'' indispensable to such cryptosystems. Several
schemes for both encryption and signature have been
proposed, many of which are using quadratic (degree 2)
polynomials. Finding a solution to such systems in
general is called MQ problem, which easiest ``generic''
instances are NP-hard. An important feature of this
Multivariate Pubic Key Cryptography (MPKC) is the
resistance to quantum computers: no faster quantum
algorithm than classical ones to solve MQ problem is
known. Besides being thereby a candidate for
Post-Quantum Cryptography, signatures are much shorter
than to other candidates. We have established an open
public ``MQ Challenge'' (https://www.mqchallenge.org)
to stimulate progress in the design of efficient
algorithms to solve MQ problem, and thus test limit
parameters guaranteeing security of MPKC.",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Yesilyurt:2015:RWM,
author = "Murat Yesilyurt and Yildiray Yalman and A. Turan
Ozcerit",
title = "A Robust Watermarking Method for {MPEG-4} Based on
Kurtosis",
journal = j-COMP-J,
volume = "58",
number = "7",
pages = "1645--1655",
month = jul,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu112",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Jul 28 10:40:55 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/7/1645",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "October 24, 2014",
}
@Article{Young:2015:DWE,
author = "Vinson Young and Prashant J. Nair and Moinuddin K.
Qureshi",
title = "{DEUCE}: Write-Efficient Encryption for Non-Volatile
Memories",
journal = j-SIGPLAN,
volume = "50",
number = "4",
pages = "33--44",
month = apr,
year = "2015",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2775054.2694387",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Tue May 12 17:41:19 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "Phase Change Memory (PCM) is an emerging Non Volatile
Memory (NVM) technology that has the potential to
provide scalable high-density memory systems. While the
non-volatility of PCM is a desirable property in order
to save leakage power, it also has the undesirable
effect of making PCM main memories susceptible to newer
modes of security vulnerabilities, for example,
accessibility to sensitive data if a PCM DIMM gets
stolen. PCM memories can be made secure by encrypting
the data. Unfortunately, such encryption comes with a
significant overhead in terms of bits written to PCM
memory, causing half of the bits in the line to change
on every write, even if the actual number of bits being
written to memory is small. Our studies show that a
typical writeback modifies, on average, only 12\% of
the bits in the cacheline. Thus, encryption causes
almost a 4x increase in the number of bits written to
PCM memories. Such extraneous bit writes cause
significant increase in write power, reduction in write
endurance, and reduction in write bandwidth. To provide
the benefit of secure memory in a write efficient
manner this paper proposes Dual Counter Encryption
(DEUCE). DEUCE is based on the observation that a
typical writeback only changes a few words, so DEUCE
reencrypts only the words that have changed. We show
that DEUCE reduces the number of modified bits per
writeback for a secure memory from 50\% to 24\%, which
improves performance by 27\% and increases lifetime by
2x.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "ASPLOS '15 conference proceedings.",
}
@Article{Yu:2015:SDS,
author = "Yong Yu and Man Ho Au and Yi Mu and Willy Susilo and
Huai Wu",
title = "Secure Delegation of Signing Power from
Factorization",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "867--877",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt144",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/867",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "December 18, 2013",
}
@Article{Yumbul:2015:EEP,
author = "Kazim Yumbul and Erkay Sava{\c{s}}",
title = "Enhancing an Embedded Processor Core for Efficient and
Isolated Execution of Cryptographic Algorithms",
journal = j-COMP-J,
volume = "58",
number = "10",
pages = "2368--2387",
month = oct,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu040",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 28 14:49:06 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/10.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/10/2368",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "May 19, 2014",
}
@Article{Zadeh:2015:ASP,
author = "Abdulah Abdulah Zadeh and Howard M. Heys",
title = "Application of Simple Power Analysis to Stream Ciphers
Constructed Using Feedback Shift Registers",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "961--972",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu021",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/961",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "March 21, 2014",
}
@Article{Zavattoni:2015:SIA,
author = "E. Zavattoni and L. J. Dominguez Perez and S.
Mitsunari and A. H. Sanchez-Ramirez and T. Teruya and
F. Rodriguez-Henriquez",
title = "Software Implementation of an Attribute-Based
Encryption Scheme",
journal = j-IEEE-TRANS-COMPUT,
volume = "64",
number = "5",
pages = "1429--1441",
month = "????",
year = "2015",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2014.2329681",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jun 4 19:46:44 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Zhang:2015:BYO,
author = "Hongwen Zhang",
title = "Bring your own encryption: balancing security with
practicality",
journal = j-NETWORK-SECURITY,
volume = "2015",
number = "1",
pages = "18--20",
month = jan,
year = "2015",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(15)70011-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:15 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485815700115",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Zhang:2015:FAA,
author = "Zhiyong Zhang and Kanliang Wang",
title = "A Formal Analytic Approach to Credible Potential Path
and Mining Algorithms for Multimedia Social Networks",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "668--678",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu035",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/668",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "June 5, 2014",
}
@Article{Zhang:2015:FER,
author = "Mingwu Zhang and Chunzhi Wang and Tsuyoshi Takagi and
Yi Mu",
title = "Functional Encryption Resilient to Hard-to-Invert
Leakage",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "735--749",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt105",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/735",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 26, 2013",
}
@Article{Zhang:2015:IAI,
author = "Zhi-Kai Zhang and Michael Cheng Yi Cho and Zong-Yu Wu
and Shiuhpyng Winston Shieh",
title = "Identifying and Authenticating {IoT} Objects in a
Natural Context",
journal = j-COMPUTER,
volume = "48",
number = "8",
pages = "81--83",
month = aug,
year = "2015",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2015.213",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Nov 3 07:04:37 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://csdl.computer.org/csdl/mags/co/2015/08/mco2015080081-abs.html",
abstract-URL = "http://csdl.computer.org/csdl/mags/co/2015/08/mco2015080081-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Zhang:2015:ITS,
author = "Jie Zhang and Futai Zhang",
title = "Information-theoretical secure verifiable secret
sharing with vector space access structures over
bilinear groups and its applications",
journal = j-FUT-GEN-COMP-SYS,
volume = "52",
number = "??",
pages = "109--115",
month = nov,
year = "2015",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Jul 25 08:56:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X14002477",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Zhang:2015:MAA,
author = "G. Zhang and J. Qin and S. Qazi",
title = "Multi-Authority Attribute-Based Encryption Scheme from
Lattices",
journal = j-J-UCS,
volume = "21",
number = "3",
pages = "483--??",
month = "????",
year = "2015",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Wed Sep 7 16:47:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_21_3/multi_authority_attribute_based",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Zhang:2015:PCL,
author = "Zongyang Zhang and Sherman S. M. Chow and Zhenfu Cao",
title = "Post-challenge leakage in public-key encryption",
journal = j-THEOR-COMP-SCI,
volume = "572",
number = "??",
pages = "25--49",
day = "23",
month = mar,
year = "2015",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Feb 23 08:03:13 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397515000377",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Zhang:2015:RBA,
author = "Jiliang Zhang and Yaping Lin and Gang Qu",
title = "Reconfigurable Binding against {FPGA} Replay Attacks",
journal = j-TODAES,
volume = "20",
number = "2",
pages = "33:1--33:??",
month = feb,
year = "2015",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/2699833",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Tue Mar 3 14:46:37 MST 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "The FPGA replay attack, where an attacker downgrades
an FPGA-based system to the previous version with known
vulnerabilities, has become a serious security and
privacy concern for FPGA design. Current FPGA
intellectual property (IP) protection mechanisms target
the protection of FPGA configuration bitstreams by
watermarking or encryption or binding. However, these
mechanisms fail to prevent replay attacks. In this
article, based on a recently reported PUF-FSM binding
method that protects the usage of configuration
bitstreams, we propose to reconfigure both the physical
unclonable functions (PUFs) and the locking scheme of
the finite state machine (FSM) in order to defeat the
replay attack. We analyze the proposed scheme and
demonstrate how replay attack would fail in attacking
systems protected by the reconfigurable binding method.
We implement two ways to build reconfigurable PUFs and
propose two practical methods to reconfigure the
locking scheme. Experimental results show that the two
reconfigurable PUFs can generate significantly distinct
responses with average reconfigurability of more than
40\%. The reconfigurable locking schemes only incur a
timing overhead less than 1\%.",
acknowledgement = ack-nhfb,
articleno = "33",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Zhang:2015:STR,
author = "Zhiyong Zhang",
title = "Security, Trust and Risk in Multimedia Social
Networks",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "515--517",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu151",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/515",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "December 23, 2014",
}
@Article{Zheng:2015:EPT,
author = "Minghui Zheng and Huihua Zhou and Jing Chen",
title = "An efficient protocol for two-party explicit
authenticated key agreement",
journal = j-CCPE,
volume = "27",
number = "12",
pages = "2954--2963",
day = "25",
month = aug,
year = "2015",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3198",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Jul 25 19:54:09 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "26 Dec 2013",
}
@Article{Zhou:2015:EPP,
author = "Zhibin Zhou and Dijiang Huang and Zhijie Wang",
title = "Efficient Privacy-Preserving Ciphertext-Policy
Attribute Based-Encryption and Broadcast Encryption",
journal = j-IEEE-TRANS-COMPUT,
volume = "64",
number = "1",
pages = "126--138",
month = jan,
year = "2015",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2013.200",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Jan 21 08:56:46 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Access control; access policy; attribute
based-encryption; Attribute-based encryption (ABE);
broadcast encryption; ciphertext-policy; Complexity
theory; constant ciphertext length; CP-ABE encryption;
cryptography; data privacy; Encryption; PP-CP-ABE
scheme; Privacy; privacy-preserving; privacy-preserving
ciphertext-policy; Public key; Receivers",
}
@Article{Zhou:2015:PPS,
author = "Jun Zhou and Xiaodong Lin and Xiaolei Dong and Zhenfu
Cao",
title = "{PSMPA}: Patient Self-Controllable and Multi-Level
Privacy-Preserving Cooperative Authentication in
Distributed-Healthcare Cloud Computing System",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "26",
number = "6",
pages = "1693--1703",
month = jun,
year = "2015",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2014.2314119",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Jun 4 19:34:14 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://csdl.computer.org/csdl/trans/td/2015/06/06779640-abs.html",
abstract-URL = "http://csdl.computer.org/csdl/trans/td/2015/06/06779640-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Zhu:2015:IDM,
author = "Hui Zhu and Cheng Huang and Hui Li",
title = "Information Diffusion Model Based on Privacy Setting
in Online Social Networking Services",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "536--548",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu062",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/536",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "July 20, 2014",
}
@Article{Zhu:2015:PPD,
author = "Hong Zhu and Shengli Tian and Kevin L{\"u}",
title = "Privacy-Preserving Data Publication with Features of
Independent {$ \ell $}-Diversity",
journal = j-COMP-J,
volume = "58",
number = "4",
pages = "549--571",
month = apr,
year = "2015",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxu102",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Mar 26 10:33:30 MDT 2015",
bibsource = "http://comjnl.oxfordjournals.org/content/58/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/58/4/549",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "October 8, 2014",
}
@Article{Abdullaziz:2016:AAI,
author = "Osamah Ibrahiem Abdullaziz and Vik Tor Goh and
Huo-Chong Ling and KokSheik Wong",
title = "{AIPISteg}: an active {IP} identification based
steganographic method",
journal = j-J-NETW-COMPUT-APPL,
volume = "63",
number = "??",
pages = "150--158",
month = mar,
year = "2016",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Jun 20 11:42:20 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S108480451600059X",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Abo-alian:2016:KDB,
author = "Alshaimaa Abo-alian and Nagwa L. Badr and M. F.
Tolba",
title = "Keystroke dynamics-based user authentication service
for cloud computing",
journal = j-CCPE,
volume = "28",
number = "9",
pages = "2567--2585",
day = "25",
month = jun,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3718",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Wed Jun 8 06:47:20 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Akleylek:2016:SPM,
author = "Sedat Akleylek and Erdem Alkim and Zaliha Y{\"u}ce
Tok",
title = "Sparse polynomial multiplication for lattice-based
cryptography with small complexity",
journal = j-J-SUPERCOMPUTING,
volume = "72",
number = "2",
pages = "438--450",
month = feb,
year = "2016",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-015-1570-1",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Apr 7 12:01:24 MDT 2016",
bibsource = "http://link.springer.com/journal/11227/72/2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-015-1570-1",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Alhanahnah:2016:MTI,
author = "Mohannad J. Alhanahnah and Arshad Jhumka and Sahel
Alouneh",
title = "A Multidimension Taxonomy of Insider Threats in Cloud
Computing",
journal = j-COMP-J,
volume = "59",
number = "11",
pages = "1612--1622",
month = nov,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw020",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Nov 4 09:11:48 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/11.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/11/1612",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "June 17, 2016",
}
@Article{Aliberti:2016:RPS,
author = "Giulio Aliberti and Roberto {Di Pietro} and Stefano
Guarino",
title = "Reliable and perfectly secret communication over the
generalized {Ozarow--Wyner}'s wire-tap channel",
journal = j-COMP-NET-AMSTERDAM,
volume = "109 (part 1)",
number = "??",
pages = "21--30",
day = "9",
month = nov,
year = "2016",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Nov 23 16:15:16 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128616302146",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Alizadeh:2016:AMC,
author = "Mojtaba Alizadeh and Saeid Abolfazli and Mazdak Zamani
and Sabariah Baharun and Kouichi Sakurai",
title = "Authentication in mobile cloud computing: a survey",
journal = j-J-NETW-COMPUT-APPL,
volume = "61",
number = "??",
pages = "59--80",
month = feb,
year = "2016",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Jun 20 11:42:19 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804515002258",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Alvarez-Cubero:2016:AVL,
author = "Jos{\'e} Antonio {\'A}lvarez-Cubero and Pedro J.
Zufiria",
title = "{Algorithm 959}: {VBF}: a Library of {C++} Classes for
Vector {Boolean} Functions in Cryptography",
journal = j-TOMS,
volume = "42",
number = "2",
pages = "16:1--16:22",
month = may,
year = "2016",
CODEN = "ACMSCU",
DOI = "https://doi.org/10.1145/2794077",
ISSN = "0098-3500 (print), 1557-7295 (electronic)",
ISSN-L = "0098-3500",
bibdate = "Mon May 23 16:40:02 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toms/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toms.bib",
abstract = "VBF is a collection of C++ classes designed for
analyzing vector Boolean functions (functions that map
a Boolean vector to another Boolean vector) from a
cryptographic perspective. This implementation uses the
NTL library from Victor Shoup, adding new modules that
call NTL functions and complement the existing ones,
making it better suited to cryptography. The class
representing a vector Boolean function can be
initialized by several alternative types of data
structures such as Truth Table, Trace Representation,
and Algebraic Normal Form (ANF), among others. The most
relevant cryptographic criteria for both block and
stream ciphers as well as for hash functions can be
evaluated with VBF: it obtains the nonlinearity,
linearity distance, algebraic degree, linear
structures, and frequency distribution of the absolute
values of the Walsh Spectrum or the Autocorrelation
Spectrum, among others. In addition, operations such as
equality testing, composition, inversion, sum, direct
sum, bricklayering (parallel application of vector
Boolean functions as employed in Rijndael cipher), and
adding coordinate functions of two vector Boolean
functions are presented. Finally, three real
applications of the library are described: the first
one analyzes the KASUMI block cipher, the second one
analyzes the Mini-AES cipher, and the third one finds
Boolean functions with very high nonlinearity, a key
property for robustness against linear attacks.",
acknowledgement = ack-nhfb,
articleno = "16",
fjournal = "ACM Transactions on Mathematical Software (TOMS)",
journal-URL = "http://dl.acm.org/pub.cfm?id=J782",
}
@Article{Alzubi:2016:SCC,
author = "O. A. Alzubi and T. M. Chen and J. A. Alzubi and H.
Rashaideh and N. Al-Najdawi",
title = "Secure Channel Coding Schemes based on
Algebraic--Geometric Codes over {Hermitian} Curves",
journal = j-J-UCS,
volume = "22",
number = "4",
pages = "552--??",
month = "????",
year = "2016",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Wed Sep 7 16:47:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_22_4/secure_channel_coding_schemes",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Ambrosin:2016:FAB,
author = "Moreno Ambrosin and Arman Anzanpour and Mauro Conti
and Tooska Dargahi and Sanaz Rahimi Moosavi and Amir M.
Rahmani and Pasi Liljeberg",
title = "On the Feasibility of Attribute-Based Encryption on
{Internet of Things} Devices",
journal = j-IEEE-MICRO,
volume = "36",
number = "6",
pages = "25--35",
month = nov # "\slash " # dec,
year = "2016",
CODEN = "IEMIDZ",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu Dec 8 06:45:37 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib",
URL = "https://www.computer.org/csdl/mags/mi/2016/06/mmi2016060025-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@Article{Amin:2016:DAP,
author = "Ruhul Amin and SK Hafizul Islam and G. P. Biswas and
Muhammad Khurram Khan and Lu Leng and Neeraj Kumar",
title = "Design of an anonymity-preserving three-factor
authenticated key exchange protocol for wireless sensor
networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "101",
number = "??",
pages = "42--62",
day = "4",
month = jun,
year = "2016",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Thu May 12 08:55:10 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128616000207",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Amoah:2016:FMA,
author = "Raphael Amoah and Seyit Camtepe and Ernest Foo",
title = "Formal modelling and analysis of {DNP3} secure
authentication",
journal = j-J-NETW-COMPUT-APPL,
volume = "59",
number = "??",
pages = "345--360",
month = jan,
year = "2016",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Feb 8 11:55:17 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804515001228",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Andrade:2016:LEP,
author = "Ewerton R. Andrade and Marcos A. Simplicio and Paulo
S. L. M. Barreto and Paulo C. F. dos Santos",
title = "{Lyra2}: Efficient Password Hashing with High Security
against Time-Memory Trade-Offs",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "10",
pages = "3096--3108",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2516011",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Sep 13 06:19:58 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Andrychowicz:2016:SMC,
author = "Marcin Andrychowicz and Stefan Dziembowski and Daniel
Malinowski and Lukasz Mazurek",
title = "Secure multiparty computations on {Bitcoin}",
journal = j-CACM,
volume = "59",
number = "4",
pages = "76--84",
month = apr,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2896386",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Fri Apr 15 14:58:10 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/4/200175/fulltext",
abstract = "Is it possible to design an online protocol for
playing a lottery, in a completely decentralized way,
that is, without relying on a trusted third party? Or
can one construct a fully decentralized protocol for
selling secret information, so that neither the seller
nor the buyer can cheat in it? Until recently, it
seemed that every online protocol that has financial
consequences for the participants needs to rely on some
sort of a trusted server that ensures that the money is
transferred between them. In this work, we propose to
use Bitcoin (a digital currency, introduced in 2008) to
design such fully decentralized protocols that are
secure even if no trusted third party is available. As
an instantiation of this idea, we construct protocols
for secure multiparty lotteries using the Bitcoin
currency, without relying on a trusted authority. Our
protocols guarantee fairness for the honest parties no
matter how the loser behaves. For example, if one party
interrupts the protocol, then her money is transferred
to the honest participants. Our protocols are practical
(to demonstrate it, we performed their transactions in
the actual Bitcoin system) and in principle could be
used in real life as a replacement for the online
gambling sites.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Anghelescu:2016:FIP,
author = "Petre Anghelescu",
title = "{FPGA} implementation of programmable cellular
automata encryption algorithm for network
communications",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "31",
number = "5",
pages = "??--??",
month = sep,
year = "2016",
CODEN = "CSSEEI",
ISSN = "0267-6192",
ISSN-L = "0267-6192",
bibdate = "Sun Apr 2 09:35:33 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
journal-URL = "http://www.crlpublishing.co.uk/csse",
}
@Article{Anonymous:2016:BRBa,
author = "Anonymous",
title = "Book Review: {{\booktitle{Bitcoin and Cryptocurrency
Technologies}}, Arvind Narayanan, Joseph Bonneau,
Edward Felten, Andrew Miller and Steven Goldfeder}",
journal = j-NETWORK-SECURITY,
volume = "2016",
number = "8",
pages = "4--4",
month = aug,
year = "2016",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(16)30074-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:35 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485816300745",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2016:CPSd,
author = "Anonymous",
title = "Call for Papers Special Issue on Postquantum
Cryptography",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "4",
pages = "63",
month = jul # "\slash " # aug,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Nov 17 08:21:28 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/04/msp2016040063.pdf",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Anonymous:2016:CPSe,
author = "Anonymous",
title = "Call for Papers Special Issue on Postquantum
Cryptography",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "5",
pages = "57",
month = sep # "\slash " # oct,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Nov 17 08:21:29 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/05/msp2016050057.pdf",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Anonymous:2016:EMT,
author = "Anonymous",
title = "The {Enigma} Machine Takes a Quantum Leap",
journal = "{R\&D} Magazine",
volume = "??",
number = "??",
pages = "??--??",
day = "7",
month = sep,
year = "2016",
bibdate = "Wed Sep 07 10:19:17 2016",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "News story on quantum data locking research in
\cite{Liu:2016:EQD,Lum:2016:QEM}.",
URL = "http://www.rdmag.com/news/2016/09/enigma-machine-takes-quantum-leap",
acknowledgement = ack-nhfb,
}
@Misc{Anonymous:2016:FVM,
author = "Anonymous",
title = "Facsimile of the {Voynich Manuscript} Now Available to
Citizen Cryptographers",
howpublished = "Web document",
day = "16",
month = nov,
year = "2016",
bibdate = "Thu Dec 15 07:18:21 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://hyperallergic.com/335505/voynich-manuscript-facsimile-published-yale-university/",
abstract = "Yale University released a book that recreates through
photographs the enigmatic medieval Voynich Manuscript
in its full form",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:2016:GUP,
author = "Anonymous",
title = "Generating Unclonable Patterns to Fight
Counterfeiting",
journal = "Scientific Computing",
volume = "??",
number = "??",
pages = "??--??",
day = "13",
month = jun,
year = "2016",
bibdate = "Mon Jun 13 09:27:14 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.scientificcomputing.com/news/2016/06/generating-unclonable-patterns-fight-counterfeiting",
acknowledgement = ack-nhfb,
remark = "This is an application of optical surface design to
the problem of creating unforgeable certificates of
authenticity.",
}
@Article{Anonymous:2016:IICd,
author = "Anonymous",
title = "Introducing {IEEE Collabratec}",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "15",
number = "1",
pages = "66--66",
month = jan # "\slash " # jun,
year = "2016",
DOI = "https://doi.org/10.1109/LCA.2016.2578800",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Fri Jun 21 08:36:31 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "IEEE Collabratec is a new, integrated online community
where IEEE members, researchers, authors, and
technology professionals with similar fields of
interest can network and collaborate, as well as create
and manage content. Featuring a suite of powerful
online networking and collaboration tools, IEEE
Collabratec allows you to connect according to
geographic location, technical interests, or career
pursuits. You can also create and share a professional
identity that showcases key accomplishments and
participate in groups focused around mutual interests,
actively learning from and contributing to
knowledgeable communities. All in one place! Learn
about IEEE Collabratec at ieeecollabratec.org.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Computer Architecture Letters",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "",
}
@Article{Anonymous:2016:MBE,
author = "Anonymous",
title = "More battles over encryption \& surveillance",
journal = j-NETWORK-SECURITY,
volume = "2016",
number = "1",
pages = "2--2",
month = jan,
year = "2016",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(16)30002-2",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:28 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485816300022",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2016:SIR,
author = "Anonymous",
title = "Special Issue on Real-World Cryptography Call for
Papers House Advertisement",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "1",
pages = "62",
month = jan # "\slash " # feb,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Jun 8 08:40:32 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security {\&} Privacy",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Misc{Anonymous:2016:SWT,
author = "Anonymous",
title = "{Smith} wins {Test of Time} award for paper",
howpublished = "Penn State News",
day = "18",
month = jan,
year = "2016",
bibdate = "Tue Jan 19 16:15:55 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://news.psu.edu/story/387916/2016/01/18/academics/smith-wins-test-time-award-paper",
acknowledgement = ack-nhfb,
remark = "From the story: ``A paper co-authored by Adam Smith,
associate professor of computer science and engineering
at Penn State, was recently selected as the winner of
the Theory of Cryptography Conference (TCC) 2016 Test
of Time award.\par
``Calibrating Noise to Sensitivity in Private Data
Analysis,'' by Smith, Cynthia Dwork (Microsoft
Research), Frank McSherry (Microsoft Research) and
Kobbi Nissim (Ben-Gurion University of the Negev), was
published in 2006. It was selected for introducing the
definition of differential privacy and providing a
solid mathematical foundation for a vast body of
subsequent work on private data analysis.",
}
@Article{Archer:2016:MPP,
author = "David W. Archer and Dan Bogdanov and Benny Pinkas and
Pille Pullonen",
title = "Maturity and Performance of Programmable Secure
Computation",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "5",
pages = "48--56",
month = sep # "\slash " # oct,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Nov 17 08:21:29 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/05/msp2016050048-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "https://publications.computer.org/security-and-privacy/",
}
@Article{Asharov:2016:LPI,
author = "Gilad Asharov and Gil Segev",
title = "Limits on the Power of Indistinguishability
Obfuscation and Functional Encryption",
journal = j-SIAM-J-COMPUT,
volume = "45",
number = "6",
pages = "2117--2176",
month = "????",
year = "2016",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/15M1034064",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Mon Mar 13 14:59:47 MDT 2017",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/45/6;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 2016",
}
@Article{Aslan:2016:DEM,
author = "Ilhan Aslan and Andreas Uhl and Alexander
Meschtscherjakov and Manfred Tscheligi",
title = "Design and Exploration of Mid-Air Authentication
Gestures",
journal = j-TIIS,
volume = "6",
number = "3",
pages = "23:1--23:??",
month = oct,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2832919",
ISSN = "2160-6455 (print), 2160-6463 (electronic)",
bibdate = "Tue Oct 18 11:51:14 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tiis.bib",
abstract = "Authentication based on touchless mid-air gestures
would benefit a multitude of ubiquitous computing
applications, especially those that are used in clean
environments (e.g., medical environments or clean
rooms). In order to explore the potential of mid-air
gestures for novel authentication approaches, we
performed a series of studies and design experiments.
First, we collected data from more then 200 users
during a 3-day science event organized within a
shopping mall. These data were used to investigate
capabilities of the Leap Motion sensor, observe
interaction in the wild, and to formulate an initial
design problem. The design problem, as well as the
design of mid-air gestures for authentication purposes,
were iterated in subsequent design activities. In a
final study with 13 participants, we evaluated two
mid-air gestures for authentication purposes in
different situations, including different body
positions. Our results highlight a need for different
mid-air gestures for differing situations and carefully
chosen constraints for mid-air gestures. We conclude by
proposing an exemplary system, which aims to provide
tool-support for designers and engineers, allowing them
to explore authentication gestures in the original
context of use and thus support them with the design of
contextual mid-air authentication gestures.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Interactive Intelligent Systems
(TIIS)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1341",
}
@Article{Avoine:2016:SSP,
author = "Gildas Avoine and Antonin Beaujeant and Julio
Hernandez-Castro and Louis Demay and Philippe Teuwen",
title = "A Survey of Security and Privacy Issues in {ePassport}
Protocols",
journal = j-COMP-SURV,
volume = "48",
number = "3",
pages = "47:1--47:??",
month = feb,
year = "2016",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2825026",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Tue Feb 9 09:29:36 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "This article examines in great detail the most
relevant security and privacy issues affecting the
protocols used by contactless chips integrated in
ePassports, and presents all relevant literature
together with some new attacks and insights that could
help in improving future standards and the next
generations of ePassports.",
acknowledgement = ack-nhfb,
articleno = "47",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Awad:2016:SSZ,
author = "Amro Awad and Pratyusa Manadhata and Stuart Haber and
Yan Solihin and William Horne",
title = "Silent Shredder: Zero-Cost Shredding for Secure
Non-Volatile Main Memory Controllers",
journal = j-SIGPLAN,
volume = "51",
number = "4",
pages = "263--276",
month = apr,
year = "2016",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2954679.2872377",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Thu Jun 9 17:13:59 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "As non-volatile memory (NVM) technologies are expected
to replace DRAM in the near future, new challenges have
emerged. For example, NVMs have slow and
power-consuming writes, and limited write endurance. In
addition, NVMs have a data remanence vulnerability,
i.e., they retain data for a long time after being
powered off. NVM encryption alleviates the
vulnerability, but exacerbates the limited endurance by
increasing the number of writes to memory. We observe
that, in current systems, a large percentage of main
memory writes result from data shredding in operating
systems, a process of zeroing out physical pages before
mapping them to new processes, in order to protect
previous processes' data. In this paper, we propose
Silent Shredder, which repurposes initialization
vectors used in standard counter mode encryption to
completely eliminate the data shredding writes. Silent
Shredder also speeds up reading shredded cache lines,
and hence reduces power consumption and improves
overall performance. To evaluate our design, we run
three PowerGraph applications and 26 multi-programmed
workloads from the SPEC 2006 suite, on a gem5-based
full system simulator. Silent Shredder eliminates an
average of 48.6\% of the writes in the initialization
and graph construction phases. It speeds up main memory
reads by 3.3 times, and improves the number of
instructions per cycle (IPC) by 6.4\% on average.
Finally, we discuss several use cases, including
virtual machines' data isolation and user-level large
data initialization, where Silent Shredder can be used
effectively at no extra cost.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "ASPLOS '16 conference proceedings.",
}
@Article{Baek:2016:EGC,
author = "Joonsang Baek and Duncan S. Wong and Jin Li and Man Ho
Au",
title = "Efficient Generic Construction of {CCA}-Secure
Identity-Based Encryption from Randomness Extraction",
journal = j-COMP-J,
volume = "59",
number = "4",
pages = "508--521",
month = apr,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv070",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Mar 28 10:52:39 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/4/508",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 3, 2015",
}
@Article{Bahri:2016:CCO,
author = "Leila Bahri and Barbara Carminati and Elena Ferrari",
title = "{COIP}-Continuous, Operable, Impartial, and
Privacy-Aware Identity Validity Estimation for {OSN}
Profiles",
journal = j-TWEB,
volume = "10",
number = "4",
pages = "23:1--23:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3014338",
ISSN = "1559-1131 (print), 1559-114X (electronic)",
ISSN-L = "1559-1131",
bibdate = "Mon Apr 3 11:10:10 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tweb.bib",
abstract = "Identity validation of Online Social Networks' (OSNs')
peers is a critical concern to the insurance of safe
and secure online socializing environments. Starting
from the vision of empowering users to determine the
validity of OSN identities, we suggest a framework to
estimate the trustworthiness of online social profiles
based only on the information they contain. Our
framework is based on learning identity correlations
between profile attributes in an OSN community and on
collecting ratings from OSN community members to
evaluate the trustworthiness of target profiles. Our
system guarantees utility, user anonymity, impartiality
in rating, and operability within the dynamics and
continuous evolution of OSNs. In this article, we
detail the system design, and we prove its correctness
against these claimed quality properties. Moreover, we
test its effectiveness, feasibility, and efficiency
through experimentation on real-world datasets from
Facebook and Google+, in addition to using the Adults
UCI dataset.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on the Web (TWEB)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1062",
}
@Article{Bai:2016:ALC,
author = "Kunpeng Bai and Chuankun Wu",
title = "An {AES}-Like Cipher and Its White-Box
Implementation",
journal = j-COMP-J,
volume = "59",
number = "7",
pages = "1054--1065",
month = jul,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv119",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Aug 30 07:10:49 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/7/1054",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "January 6, 2016",
}
@InProceedings{Bajard:2016:MFA,
author = "Jean-Claude Bajard and Julien Eynard and Nabil
Merkiche",
title = "Multi-fault Attack Detection for {RNS} Cryptographic
Architecture",
crossref = "Montuschi:2016:ISC",
pages = "16--23",
year = "2016",
DOI = "https://doi.org/10.1109/ARITH.2016.16",
bibdate = "Fri Dec 16 15:17:20 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = ack-nhfb,
keywords = "ARITH-23",
}
@Article{Bao:2016:LPP,
author = "Haiyong Bao and Le Chen",
title = "A lightweight privacy-preserving scheme with data
integrity for smart grid communications",
journal = j-CCPE,
volume = "28",
number = "4",
pages = "1094--1110",
day = "25",
month = mar,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3527",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sun Apr 3 12:34:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "28 May 2015",
}
@Article{Barenghi:2016:FBS,
author = "Alessandro Barenghi and Guido M. Bertoni and Luca
Breveglieri and Gerardo Pelosi and Stefano Sanfilippo
and Ruggero Susella",
title = "A Fault-Based Secret Key Retrieval Method for {ECDSA}:
Analysis and Countermeasure",
journal = j-JETC,
volume = "13",
number = "1",
pages = "8:1--8:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2767132",
ISSN = "1550-4832",
bibdate = "Sat Apr 8 10:16:07 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/jetc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jetc.bib",
abstract = "Elliptic curve cryptosystems proved to be well suited
for securing systems with constrained resources like
embedded and portable devices. In a fault-based attack,
errors are induced during the computation of a
cryptographic primitive, and the results are collected
to derive information about the secret key safely
stored in the device. We introduce a novel attack
methodology to recover the secret key employed in
implementations of the Elliptic Curve Digital Signature
Algorithm. Our attack exploits the information leakage
induced when altering the execution of the modular
arithmetic operations used in the signature primitive
and does not rely on the underlying elliptic curve
mathematical structure, thus being applicable to all
standardized curves. We provide both a validation of
the feasibility of the attack, even employing common
off-the-shelf hardware to perform the required
computations, and a low-cost countermeasure to
counteract it.",
acknowledgement = ack-nhfb,
articleno = "8",
fjournal = "ACM Journal on Emerging Technologies in Computing
Systems (JETC)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J967",
}
@Article{Barenghi:2016:PPE,
author = "Alessandro Barenghi and Michele Beretta and Alessandro
{Di Federico} and Gerardo Pelosi",
title = "A privacy-preserving encrypted {OSN} with stateless
server interaction: the Snake design",
journal = j-COMPUT-SECUR,
volume = "63",
number = "??",
pages = "67--84",
month = nov,
year = "2016",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:47 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404816301031",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@TechReport{Barker:2016:RKM,
author = "Elaine Barker",
title = "Recommendation for Key Management. {Part 1}: General",
type = "xi + 147",
institution = pub-NIST,
address = pub-NIST:adr,
month = jan,
year = "2016",
bibdate = "Fri Feb 15 10:14:56 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-57pt1r4.pdf",
abstract = "This Recommendation provides cryptographic key
management guidance. It consists of three parts. Part 1
provides general guidance and best practices for the
management of cryptographic keying material. Part 2
provides guidance on policy and security planning
requirements for U.S. government agencies. Finally,
Part 3 provides guidance when using the cryptographic
features of current systems",
acknowledgement = ack-nhfb,
}
@Article{Bartkewitz:2016:LPL,
author = "Timo Bartkewitz",
title = "Leakage Prototype Learning for Profiled Differential
Side-Channel Cryptanalysis",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "6",
pages = "1761--1774",
month = jun,
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2455974",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue May 31 08:56:47 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Bellovin:2016:EEE,
author = "Steven M. Bellovin",
title = "Easy Email Encryption",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "6",
pages = "96--96",
month = nov # "\slash " # dec,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Sat Feb 25 10:03:53 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/06/msp2016060096.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Benamara:2016:ICA,
author = "Oualid Benamara and Fatiha Merazka and Kamel Betina",
title = "An improvement of a cryptanalysis algorithm",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "2",
pages = "192--196",
month = feb,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Nov 28 07:11:23 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015001398",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Benhamouda:2016:NFP,
author = "Fabrice Benhamouda and Marc Joye and Beno{\^\i}T
Libert",
title = "A New Framework for Privacy-Preserving Aggregation of
Time-Series Data",
journal = j-TISSEC,
volume = "18",
number = "3",
pages = "10:1--10:??",
month = apr,
year = "2016",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2873069",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Fri Apr 15 13:02:47 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "Aggregator-oblivious encryption is a useful notion put
forward by Shi et al. in 2011 that allows an untrusted
aggregator to periodically compute an aggregate value
over encrypted data contributed by a set of users. Such
encryption schemes find numerous applications,
particularly in the context of privacy-preserving smart
metering. This article presents a general framework for
constructing privacy-preserving aggregator-oblivious
encryption schemes using a variant of Cramer--Shoup's
paradigm of smooth projective hashing. This abstraction
leads to new schemes based on a variety of complexity
assumptions. It also improves upon existing
constructions, providing schemes with shorter
ciphertexts and better encryption times.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Benzaid:2016:FAW,
author = "Chafika Benzaid and Karim Lounis and Ameer Al-Nemrat
and Nadjib Badache and Mamoun Alazab",
title = "Fast authentication in wireless sensor networks",
journal = j-FUT-GEN-COMP-SYS,
volume = "55",
number = "??",
pages = "362--375",
month = feb,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Dec 4 07:08:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X14001393",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@InCollection{Bernstein:2016:DES,
author = "Daniel J. Bernstein and Tanja Lange and Ruben
Niederhagen",
title = "Dual {EC}: A Standardized Back Door",
crossref = "Ryan:2016:NCE",
pages = "256--281",
year = "2016",
DOI = "https://doi.org/10.1007/978-3-662-49301-4_17",
bibdate = "Fri Jul 29 07:29:53 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Article{Berger:2016:EGF,
author = "Thierry P. Berger and Julien Francq and Marine Minier
and Ga{\"e}l Thomas",
title = "Extended Generalized {Feistel} Networks Using Matrix
Representation to Propose a New Lightweight Block
Cipher: {Lilliput}",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "7",
pages = "2074--2089",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2468218",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Jun 15 06:49:34 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers -",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Berghel:2016:CKF,
author = "Hal Berghel",
title = "Coda in the Key of {F2654hD4}",
journal = j-COMPUTER,
volume = "49",
number = "9",
pages = "104--109",
month = sep,
year = "2016",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Oct 25 06:11:19 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.computer.org/csdl/mags/co/2016/09/mco2016090104.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
keywords = "integrity of electronic voting machines",
}
@Article{Berghel:2016:DJT,
author = "Hal Berghel",
title = "{Douglas Jones} on Today's Voting Machines",
journal = j-COMPUTER,
volume = "49",
number = "10",
pages = "84--89",
month = oct,
year = "2016",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2016.306",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Oct 25 06:11:19 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.computer.org/csdl/mags/co/2016/10/mco2016100084.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
}
@Article{Berghel:2016:S,
author = "Hal Berghel",
title = "Secretocracy",
journal = j-COMPUTER,
volume = "49",
number = "2",
pages = "63--67",
month = feb,
year = "2016",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Feb 16 07:03:03 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://csdl.computer.org/csdl/mags/co/2016/02/mco2016020063.html",
abstract-URL = "http://csdl.computer.org/csdl/mags/co/2016/02/mco2016020063-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Beunardeau:2016:WBC,
author = "Marc Beunardeau and Aisling Connolly and Remi Geraud
and David Naccache",
title = "White-Box Cryptography: Security in an Insecure
Environment",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "5",
pages = "88--92",
month = sep # "\slash " # oct,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Nov 17 08:21:29 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/05/msp2016050088-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Bhargavan:2016:MVP,
author = "Karthikeyan Bhargavan and Cedric Fournet and Markulf
Kohlweiss",
title = "{miTLS}: Verifying Protocol Implementations against
Real-World Attacks",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "6",
pages = "18--25",
month = nov # "\slash " # dec,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Sat Feb 25 10:03:53 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/06/msp2016060018-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Book{Bhattacharjee:2016:SWC,
author = "Yudhijit Bhattacharjee",
title = "The spy who couldn't spell: a dyslexic traitor, an
unbreakable code, and the {FBI}'s hunt for {America}'s
stolen secrets",
publisher = "New American Library",
address = "New York, NY, USA",
pages = "????",
year = "2016",
ISBN = "1-59240-900-8 (hardcover), 0-698-40409-2",
ISBN-13 = "978-1-59240-900-6 (hardcover), 978-0-698-40409-0",
LCCN = "JK468.I6 B48 2016",
bibdate = "Tue Nov 1 16:03:50 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
abstract = "The thrilling, true-life account of the FBI's hunt for
the ingenious traitor Brian Regan --- known as The Spy
Who Couldn't Spell. Before Edward Snowden's infamous
data breach, the largest theft of government secrets
was committed by an ingenious traitor whose intricate
espionage scheme and complex system of coded messages
were made even more baffling by his dyslexia. His name
is Brian Regan, but he came to be known as The Spy Who
Couldn't Spell. In December of 2000, FBI Special Agent
Steven Carr of the bureau's Washington, D.C., office
received a package from FBI New York: a series of coded
letters from an anonymous sender to the Libyan
consulate, offering to sell classified United States
intelligence. The offer, and the threat, were all too
real. A self-proclaimed CIA analyst with top secret
clearance had information about U.S. reconnaissance
satellites, air defense systems, weapons depots,
munitions factories, and underground bunkers throughout
the Middle East. Rooting out the traitor would not be
easy, but certain clues suggested a government agent
with a military background, a family, and a dire need
for money. Leading a diligent team of investigators and
code breakers, Carr spent years hunting down a
dangerous spy and his cache of stolen secrets. In this
fast-paced true-life spy thriller, Yudhijit
Bhattacharjee reveals how the FBI unraveled Regan's
strange web of codes to build a case against a man who
nearly collapsed America's military security.",
acknowledgement = ack-nhfb,
subject = "Regan, Brian; Spies; United States; Biography;
Espionage, American; History; 21st century; Dyslexics;
Intelligence service; TRUE CRIME / Espionage; HISTORY /
Modern / 21st Century; POLITICAL SCIENCE / Political
Freedom and Security / Intelligence.",
subject-dates = "1962",
}
@Article{Bidgoly:2016:MQV,
author = "Amir Jalaly Bidgoly and Behrouz Tork Ladani",
title = "Modeling and Quantitative Verification of Trust
Systems Against Malicious Attackers",
journal = j-COMP-J,
volume = "59",
number = "7",
pages = "1005--1027",
month = jul,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv108",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Aug 30 07:10:49 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/7/1005",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "December 17, 2015",
}
@InProceedings{Biryukov:2016:ANG,
author = "Alex Biryukov and Daniel Dinu and Dmitry
Khovratovich",
editor = "{IEEE}",
booktitle = "{2016 IEEE European Symposium on Security and Privacy
(EURO S\&P 2016). 21--24 March 2016 Saarbruecken,
Germany}",
title = "{Argon2}: new generation of memory-hard functions for
password hashing and other applications",
publisher = pub-IEEE,
address = pub-IEEE:adr,
bookpages = "xix + 488",
pages = "292--302",
year = "2016",
DOI = "https://doi.org/10.1109/EuroSP.2016.31",
ISBN = "1-5090-1751-8",
ISBN-13 = "978-1-5090-1751-5",
LCCN = "????",
bibdate = "Wed Feb 19 09:07:41 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "IEEE Computer Society Order Number P5776. See
\cite{Alwen:2017:TPA}.",
URL = "https://ieeexplore.ieee.org/document/7467361",
acknowledgement = ack-nhfb,
}
@Article{Blasco:2016:SWB,
author = "Jorge Blasco and Thomas M. Chen and Juan Tapiador and
Pedro Peris-Lopez",
title = "A Survey of Wearable Biometric Recognition Systems",
journal = j-COMP-SURV,
volume = "49",
number = "3",
pages = "43:1--43:??",
month = nov,
year = "2016",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2968215",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Tue Nov 8 16:12:56 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "The growing popularity of wearable devices is leading
to new ways to interact with the environment, with
other smart devices, and with other people. Wearables
equipped with an array of sensors are able to capture
the owner's physiological and behavioural traits, thus
are well suited for biometric authentication to control
other devices or access digital services. However,
wearable biometrics have substantial differences from
traditional biometrics for computer systems, such as
fingerprints, eye features, or voice. In this article,
we discuss these differences and analyse how
researchers are approaching the wearable biometrics
field. We review and provide a categorization of
wearable sensors useful for capturing biometric
signals. We analyse the computational cost of the
different signal processing techniques, an important
practical factor in constrained devices such as
wearables. Finally, we review and classify the most
recent proposals in the field of wearable biometrics in
terms of the structure of the biometric system
proposed, their experimental setup, and their results.
We also present a critique of experimental issues such
as evaluation and feasibility aspects, and offer some
final thoughts on research directions that need
attention in future work.",
acknowledgement = ack-nhfb,
articleno = "43",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Misc{Blaze:2016:UHR,
author = "Matt Blaze",
title = "{US House of Representatives, Committee on Energy and
Commerce, Subcommittee on Oversight and Investigations,
Hearing on ``Deciphering the Debate over
Encryption''}",
howpublished = "Web document",
day = "19",
month = apr,
year = "2016",
bibdate = "Tue May 17 07:24:51 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://docs.house.gov/meetings/IF/IF02/20160419/104812/HHRG-114-IF02-Wstate-BlazeM-20160419-U3.pdf",
acknowledgement = ack-nhfb,
remark = "The author argues before the US Government that back
doors to encryption systems for law enforcement
significantly weaken all communications and computer
security.",
}
@Article{Bo:2016:ETK,
author = "Yang Bo and Mingwu Zhang and Jun-Qiang Du",
title = "An error-tolerant keyword search scheme based on
public-key encryption in secure cloud computing",
journal = j-CCPE,
volume = "28",
number = "4",
pages = "1083--1093",
day = "25",
month = mar,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3521",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sun Apr 3 12:34:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "7 Jul 2015",
}
@Article{Boche:2016:DSK,
author = "H. Boche and G. Jan{\ss}en",
title = "Distillation of secret-key from a class of compound
memoryless quantum sources",
journal = j-J-MATH-PHYS,
volume = "57",
number = "8",
pages = "082201",
month = aug,
year = "2016",
CODEN = "JMAPAQ",
DOI = "https://doi.org/10.1063/1.4960217",
ISSN = "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
ISSN-L = "0022-2488",
bibdate = "Mon Sep 19 15:18:17 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jmathphys2015.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Mathematical Physics",
journal-URL = "http://jmp.aip.org/",
}
@InProceedings{Bock:2016:NDA,
author = "Hanno B{\"o}ck and Aaron Zauner and Sean Devlin and
Juraj Somorovsky and Philipp Jovanovic",
booktitle = "10th {Usenix} Workshop on Offensive Technologies",
title = "Nonce-disrespecting adversaries: practical forgery
attacks on {GCM} in {TLS}",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "1--11",
month = aug,
year = "2016",
bibdate = "Fri Jul 29 07:30:59 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "https://www.usenix.org/conference/woot16/workshop-program/presentation/bock",
abstract = "We investigate nonce reuse issues with the GCM block
cipher mode as used in TLS and focus in particular on
AES-GCM, the most widely deployed variant. With an
Internet-wide scan we identified 184 HTTPS servers
repeating nonces, which fully breaks the authenticity
of the connections. Affected servers include large
corporations, financial institutions, and a credit card
company. We present a proof of concept of our attack
allowing to violate the authenticity of affected HTTPS
connections which in turn can be utilized to inject
seemingly valid content into encrypted sessions.
Furthermore, we discovered over 70,000 HTTPS servers
using random nonces, which puts them at risk of nonce
reuse, in the unlikely case that large amounts of data
are sent via the same session.",
acknowledgement = ack-nhfb,
}
@Article{Boneh:2016:BCR,
author = "Dan Boneh and Kenny Paterson and Nigel P. Smart",
title = "Building a Community of Real-World Cryptographers",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "6",
pages = "7--9",
month = nov # "\slash " # dec,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Sat Feb 25 10:03:53 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/06/msp2016060007.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Misc{Boneh:2016:BHP,
author = "Dan Boneh and Henry Corrigan-Gibbs and Stuart
Schechter",
title = "Balloon hashing: Provably space-hard hash functions
with data-independent access patterns",
pages = "36",
day = "14",
month = jan,
year = "2016",
bibdate = "Wed Feb 19 09:28:48 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Cryptology ePrint Archive Report 2016/027 Version:
20160601:225540. See \cite{Alwen:2017:TPA}.",
URL = "https://pdfs.semanticscholar.org/f49f/8e135695937bfe03e467e215177eec79d7dc.pdf",
abstract = "We present the Balloon family of password hashing
functions. These are the first cryptographic hash
functions with proven space-hardness properties that:
(i) use a password-independent access pattern, (ii)
build exclusively upon standard cryptographic
primitives, and (iii) are fast enough for real-world
use. Space-hard functions require a large amount of
working space to evaluate efficiently and, when used
for password hashing, they dramatically increase the
cost of offline dictionary attacks. The central
technical challenge of this work was to devise the
graph-theoretic and linear-algebraic techniques
necessary to prove the space-hardness properties of the
Balloon functions (in the random-oracle model). To
motivate our interest in security proofs, we
demonstrate that it is possible to compute Argon2i, a
recently proposed space-hard function that lacks a
formal analysis, in less than the claimed required
space with no increase in the computation time.",
acknowledgement = ack-nhfb,
}
@Article{Bossuet:2016:EPA,
author = "Lilian Bossuet and Nilanjan Datta and Cuauhtemoc
Mancillas-L{\'o}pez and Mridul Nandi",
title = "{ELmD}: A Pipelineable Authenticated Encryption and
Its Hardware Implementation",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "11",
pages = "3318--3331",
month = nov,
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2529618",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Oct 11 05:14:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Boumerzoug:2016:LKM,
author = "Hayette Boumerzoug and Boucif Amar Bensaber and Ismail
Biskri",
title = "A lightweight key management scheme based on an
{Adelson-Velskii} and {Landis} tree and elliptic curve
cryptography for wireless sensor networks",
journal = j-CCPE,
volume = "28",
number = "6",
pages = "1831--1847",
day = "25",
month = apr,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3153",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Wed Jun 8 06:47:19 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Boyce:2016:BOT,
author = "Griffin Boyce",
title = "Bake in {\tt .onion} for Tear-Free and Stronger
{Website} Authentication",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "2",
pages = "15--21",
month = mar # "\slash " # apr,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2016.33",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Jun 8 08:40:32 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security {\&} Privacy",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Book{Budiansky:2016:CWN,
author = "Stephen Budiansky",
title = "Code warriors: {NSA}'s codebreakers and the secret
intelligence war against the {Soviet Union}",
publisher = pub-KNOPF,
address = pub-KNOPF:adr,
pages = "xxi + 389 + 16",
year = "2016",
ISBN = "0-385-35266-2, 0-385-35267-0",
ISBN-13 = "978-0-385-35266-6, 978-0-385-35267-3",
LCCN = "UB256.U6 B83 2016",
bibdate = "Mon Dec 19 12:22:02 MST 2016",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "A sweeping history of the NSA and its codebreaking
achievements from World War II through the Cold War
shares insights into the challenges faced by
cryptanalysts and their role in some of the most
complicated events of the twentieth century.",
acknowledgement = ack-nhfb,
subject = "Cryptography; United States; History; Cryptography.;
Diplomatic relations.; Foreign relations; Soviet
Union",
tableofcontents = "The Russian problem \\
Unbreakable codes \\
Learning to lie \\
Digital dawn \\
Shooting wars \\
``An old mule skinner'' \\
Brains versus bugs \\
Days of crisis \\
Reinventing the wheel \\
Brute force and legerdemain \\
Epilogue: the collapse of the wall, and a verdict",
}
@Article{Canard:2016:HPP,
author = "S. Canard and J. Devigne",
title = "Highly privacy-protecting data sharing in a tree
structure",
journal = j-FUT-GEN-COMP-SYS,
volume = "62",
number = "??",
pages = "119--127",
month = sep,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue May 31 08:45:28 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16300036",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Cao:2016:OMA,
author = "Xiaolin Cao and Ciara Moore and M{\'a}ire O'Neill and
Elizabeth O'Sullivan and Neil Hanley",
title = "Optimised Multiplication Architectures for
Accelerating Fully Homomorphic Encryption",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "9",
pages = "2794--2806",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2498606",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Aug 10 09:04:52 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Castro:2016:FVB,
author = "Stephan {De Castro} and Jean-Max Dutertre and Bruno
Rouzeyre and Giorgio {Di Natale} and Marie-Lise
Flottes",
title = "Frontside Versus Backside Laser Injection: a
Comparative Study",
journal = j-JETC,
volume = "13",
number = "1",
pages = "7:1--7:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2845999",
ISSN = "1550-4832",
bibdate = "Sat Apr 8 10:16:07 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jetc.bib",
abstract = "The development of cryptographic devices was followed
by the development of so-called implementation attacks,
which are intended to retrieve secret information
exploiting the hardware itself. Among these attacks,
fault attacks can be used to disturb the circuit while
performing a computation to retrieve the secret. Among
possible means of injecting a fault, laser beams have
proven to be accurate and powerful. The laser can be
used to illuminate the circuit either from its
frontside (i.e., where metal interconnections are first
encountered) or from the backside (i.e., through the
substrate). Historically, frontside injection was
preferred because it does not require the die to be
thinned. Nevertheless, due to the increasing
integration of metal layers in modern technologies,
frontside injections do not allow targeting of any
desired location. Indeed, metal lines act as mirrors,
and they reflect and refract most of the energy
provided by the laser beam. Conversely, backside
injections, although more difficult to set up, allow an
increase of the resolution of the target location and
remove the drawbacks of the frontside technique. This
article compares experimental results from frontside
and backside fault injections. The effectiveness of the
two techniques is measured in terms of exploitable
errors on an AES circuit (i.e., errors that can be used
to extract the value of the secret key used during the
encryption process). We will show, conversely to what
is generally assumed, that frontside injection can
provide even better results compared to backside
injection, especially for low-cost beams with a large
laser spot.",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Journal on Emerging Technologies in Computing
Systems (JETC)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J967",
}
@Article{Celesti:2016:ALT,
author = "Antonio Celesti and Maria Fazio and Massimo Villari
and Antonio Puliafito",
title = "Adding long-term availability, obfuscation, and
encryption to multi-cloud storage systems",
journal = j-J-NETW-COMPUT-APPL,
volume = "59",
number = "??",
pages = "208--218",
month = jan,
year = "2016",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Feb 8 11:55:17 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804514002288",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Chadha:2016:AVE,
author = "Rohit Chadha and Vincent Cheval and Stefan Ciob{\^a}ca
and Steve Kremer",
title = "Automated Verification of Equivalence Properties of
Cryptographic Protocols",
journal = j-TOCL,
volume = "17",
number = "4",
pages = "23:1--23:??",
month = nov,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2926715",
ISSN = "1529-3785 (print), 1557-945X (electronic)",
ISSN-L = "1529-3785",
bibdate = "Wed Mar 15 16:49:14 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/tocl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tocl.bib",
abstract = "Indistinguishability properties are essential in
formal verification of cryptographic protocols. They
are needed to model anonymity properties, strong
versions of confidentiality, and resistance against
offline guessing attacks. Indistinguishability
properties can be conveniently modeled as equivalence
properties. We present a novel procedure to verify
equivalence properties for a bounded number of sessions
of cryptographic protocols. As in the applied pi
calculus, our protocol specification language is
parametrized by a first-order sorted term signature and
an equational theory that allows formalization of
algebraic properties of cryptographic primitives. Our
procedure is able to verify trace equivalence for
determinate cryptographic protocols. On determinate
protocols, trace equivalence coincides with
observational equivalence, which can therefore be
automatically verified for such processes. When
protocols are not determinate, our procedure can be
used for both under- and over-approximations of trace
equivalence, which proved successful on examples. The
procedure can handle a large set of cryptographic
primitives, namely those whose equational theory is
generated by an optimally reducing convergent rewrite
system. The procedure is based on a fully abstract
modelling of the traces of a bounded number of sessions
of the protocols into first-order Horn clauses on which
a dedicated resolution procedure is used to decide
equivalence properties. We have shown that our
procedure terminates for the class of subterm
convergent equational theories. Moreover, the procedure
has been implemented in a prototype tool Active
Knowledge in Security Protocols and has been
effectively tested on examples. Some of the examples
were outside the scope of existing tools, including
checking anonymity of an electronic voting protocol due
to Okamoto.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Computational Logic",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J773",
}
@Article{Chande:2016:NSC,
author = "Manoj Kumar Chande and Cheng-Chi Lee and Chun-Ta Li",
title = "A New Self-Certified Convertible Authenticated
Encryption Scheme Based on Discrete Logarithm Problem",
journal = j-PARALLEL-PROCESS-LETT,
volume = "26",
number = "4",
pages = "1650018",
month = dec,
year = "2016",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626416500183",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
ISSN-L = "0129-6264",
bibdate = "Tue May 29 09:05:29 MDT 2018",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
xxnote = "Check downcased author string??",
}
@InProceedings{Chang-Fong:2016:CSC,
author = "N. Chang-Fong and A. Essex",
editor = "{ACM}",
booktitle = "{Proceedings of the 32nd Annual Conference on Computer
Security Applications (ACSAC 16: 5--9 December 2016,
Hilton Los Angeles Universal City, Los Angeles, CA,
USA)}",
title = "The Cloudier Side of Cryptographic End-to-End
Verifiable Voting: A Security Analysis of {Helios}",
publisher = pub-ACM,
address = pub-ACM:adr,
year = "2016",
DOI = "https://doi.org/10.1145/2991079.2991106",
ISBN = "1-4503-4771-1",
ISBN-13 = "978-1-4503-4771-6",
bibdate = "Wed Jul 26 17:53:33 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
abstract = "Helios is an open-audit internet voting system
providing cryptographic protections to voter privacy,
and election integrity. As part of these protections,
Helios produces a cryptographic audit trail that can be
used to verify ballots were correctly counted.
Cryptographic end-to-end (E2E) election verification
schemes of this kind are a promising step toward
developing trustworthy electronic voting
systems.\par
In this paper we approach the discussion from the
flip-side by exploring the practical potential for
threats to be introduced by the presence of a
cryptographic audit trail. We conducted a security
analysis of the Helios implementation and discovered a
range of vulnerabilities and implemented exploits that
would: allow a malicious election official to produce
arbitrary election results with accepting proofs of
correctness; allow a malicious voter to cast a
malformed ballot to prevent the tally from being
computed; and, allow an attacker to surreptitiously
cast a ballot on a voter's behalf. We also examine
privacy issues including a random-number generation
bias affecting the indistinguishably of encrypted
ballots. We reported the issues and worked with the
Helios designers to fix them.",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1145/2991079",
}
@Article{Chatterjee:2016:TAD,
author = "Urbi Chatterjee and Rajat Subhra Chakraborty and
Hitesh Kapoor and Debdeep Mukhopadhyay",
title = "Theory and Application of Delay Constraints in Arbiter
{PUF}",
journal = j-TECS,
volume = "15",
number = "1",
pages = "10:1--10:??",
month = feb,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815621",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Wed Jun 8 09:43:30 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Physically Unclonable Function (PUF) circuits are
often vulnerable to mathematical model-building
attacks. We theoretically quantify the advantage
provided to an adversary by any training dataset
expansion technique along the lines of security
analysis of cryptographic hash functions. We present an
algorithm to enumerate certain sets of delay
constraints for the widely studied Arbiter PUF (APUF)
circuit, then demonstrate how these delay constraints
can be utilized to expand the set of known
Challenge--Response Pairs (CRPs), thus facilitating
model-building attacks. We provide experimental results
for Field Programmable Gate Array (FPGA)--based APUF to
establish the effectiveness of the proposed attack.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Misc{Checkoway:2016:SAJ,
author = "Stephen Checkoway and Shaanan Cohney and Christina
Garman and Matthew Green and Nadia Heninger and Jacob
Maskiewicz and Eric Rescorla and Hovav Shacham and
Ralf-Philipp Weinmann",
title = "A Systematic Analysis of the {Juniper Dual EC}
Incident",
howpublished = "Cryptology ePrint Archive, Report 2016/376.",
day = "14",
month = apr,
year = "2016",
bibdate = "Mon May 16 11:24:17 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://eprint.iacr.org/2016/376",
abstract = "In December 2015, Juniper Networks announced that
unknown attackers had added unauthorized code to
ScreenOS, the operating system for their NetScreen VPN
routers. This code created two vulnerabilities: an
authentication bypass that enabled remote
administrative access, and a second vulnerability that
allowed passive decryption of VPN traffic. Reverse
engineering of ScreenOS binaries revealed that the
first of these vulnerabilities was a conventional back
door in the SSH password checker. The second is far
more intriguing: a change to the Q parameter used by
the Dual EC pseudorandom number generator. It is widely
known that Dual EC has the unfortunate property that an
attacker with the ability to choose Q can, from a small
sample of the generator's output, predict all future
outputs. In a 2013 public statement, Juniper noted the
use of Dual EC but claimed that ScreenOS included
countermeasures that neutralized this form of
attack.
In this work, we report the results of a thorough
independent analysis of the ScreenOS randomness
subsystem, as well as its interaction with the IKE VPN
key establishment protocol. Due to apparent flaws in
the code, Juniper's countermeasures against a Dual EC
attack are never executed. Moreover, by comparing
sequential versions of ScreenOS, we identify a cluster
of additional changes that were introduced concurrently
with the inclusion of Dual EC in a single 2008 release.
Taken as a whole, these changes render the ScreenOS
system vulnerable to passive exploitation by an
attacker who selects Q. We demonstrate this by
installing our own parameters, and showing that it is
possible to passively decrypt a single IKE handshake
and its associated VPN traffic in isolation without
observing any other network traffic.",
acknowledgement = ack-nhfb,
keywords = "applications; implementation / pseudo-randomness",
}
@Article{Chen:2016:EPN,
author = "Yu-Jia Chen and Li-Chun Wang and Chen-Hung Liao",
title = "Eavesdropping Prevention for Network Coding Encrypted
Cloud Storage Systems",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "27",
number = "8",
pages = "2261--2273",
month = aug,
year = "2016",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2015.2486772",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Tue Jul 19 06:55:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://csdl.computer.org/csdl/trans/td/2016/08/07289458-abs.html",
abstract-URL = "http://csdl.computer.org/csdl/trans/td/2016/08/07289458-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Chen:2016:RPR,
author = "Zhenhua Chen and Shundong Li and Qiong Huang and Yilei
Wang and Sufang Zhou",
title = "A restricted proxy re-encryption with keyword search
for fine-grained data access control in cloud storage",
journal = j-CCPE,
volume = "28",
number = "10",
pages = "2858--2876",
month = jul,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3754",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue Sep 13 08:30:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Chen:2016:WPM,
author = "Zhide Chen and Meng Wang and Li Xu and Wei Wu",
title = "Worm propagation model in mobile network",
journal = j-CCPE,
volume = "28",
number = "4",
pages = "1134--1144",
day = "25",
month = mar,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3566",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sun Apr 3 12:34:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "5 Jun 2015",
}
@Article{Cheon:2016:ANP,
author = "Jung Hee Cheon and Jinhyuck Jeong and Changmin Lee",
title = "An algorithm for {NTRU} problems and cryptanalysis of
the {GGH} multilinear map without a low-level encoding
of zero",
journal = j-LMS-J-COMPUT-MATH,
volume = "19",
number = "A",
pages = "255--266",
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1112/S1461157016000371",
ISSN = "1461-1570",
bibdate = "Fri Mar 31 08:49:52 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lms-j-comput-math.bib",
URL = "https://www.cambridge.org/core/product/230ECFEEE6AF4D8027FF3E13998D560C",
acknowledgement = ack-nhfb,
ajournal = "LMS J. Comput. Math.",
fjournal = "LMS Journal of Computation and Mathematics",
journal-URL = "http://journals.cambridge.org/action/displayJournal?jid=JCM",
onlinedate = "26 August 2016",
}
@Article{Chien:2016:GAI,
author = "Hung-Yu Chien",
title = "A Generic Approach to Improving {Diffie--Hellman} Key
Agreement Efficiency for Thin Clients",
journal = j-COMP-J,
volume = "59",
number = "4",
pages = "592--601",
month = apr,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv094",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Mar 28 10:52:39 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/4/592",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 2, 2015",
}
@Article{Cho:2016:MAT,
author = "Haehyun Cho and Jiwoong Bang and Myeongju Ji and Jeong
Hyun Yi",
title = "Mobile application tamper detection scheme using
dynamic code injection against repackaging attacks",
journal = j-J-SUPERCOMPUTING,
volume = "72",
number = "9",
pages = "3629--3645",
month = sep,
year = "2016",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1763-2",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Tue Sep 20 10:45:03 MDT 2016",
bibsource = "http://link.springer.com/journal/11227/72/9;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-016-1763-2",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Choo:2016:CCT,
author = "Kim-Kwang Raymond Choo and Josep Domingo-Ferrer and
Lei Zhang",
title = "Cloud Cryptography: Theory, Practice and Future
Research Directions",
journal = j-FUT-GEN-COMP-SYS,
volume = "62",
number = "??",
pages = "51--53",
month = sep,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue May 31 08:45:28 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16300942",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Chu:2016:BEE,
author = "Jennifer Chu",
title = "The Beginning of the End for Encryption Schemes?",
journal = j-SCI-COMPUT,
volume = "??",
number = "??",
pages = "??",
day = "7",
month = mar,
year = "2016",
CODEN = "SCHRCU",
ISSN = "1930-5753 (print), 1930-6156 (electronic)",
ISSN-L = "1930-5753",
bibdate = "Tue Mar 08 10:59:40 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.scientificcomputing.com/news/2016/03/beginning-end-encryption-schemes",
acknowledgement = ack-nhfb,
fjournal = "Scientific Computing",
journal-URL = "http://digital.scientificcomputing.com/scientificcomputing/",
remark = "This article describes recent research
\cite{Monz:2016:RSS} that successfully constructed a
5-atom quantum computer that correctly factored $ 15
\to 3 \times 5 $, and that has the possibility of
significant scaling up in size to tackle the large
integer factorization using Peter Shor's 1994 quantum
factoring algorithm.",
}
@Article{Chung:2016:NBB,
author = "Kai-Min Chung and Rafael Pass and Karn Seth",
title = "Non-Black-Box Simulation from One-Way Functions and
Applications to Resettable Security",
journal = j-SIAM-J-COMPUT,
volume = "45",
number = "2",
pages = "415--458",
month = "????",
year = "2016",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/130946083",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Mon Jun 20 15:35:28 MDT 2016",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/45/2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 2016",
}
@Article{Ciegis:2016:ADP,
author = "Raimondas Ciegis and Vadimas Starikovicius and
Natalija Tumanova and Minvydas Ragulskis",
title = "Application of distributed parallel computing for
dynamic visual cryptography",
journal = j-J-SUPERCOMPUTING,
volume = "72",
number = "11",
pages = "4204--4220",
month = nov,
year = "2016",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1733-8",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jun 24 10:31:30 MDT 2017",
bibsource = "http://link.springer.com/journal/11227/72/11;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Coles:2016:NAU,
author = "Patrick J. Coles and Eric M. Metodiev and Norbert
L{\"u}tkenhaus",
title = "Numerical approach for unstructured quantum key
distribution",
journal = j-NATURE-COMMUN,
volume = "7",
pages = "11712",
month = may,
year = "2016",
CODEN = "NCAOBW",
DOI = "https://doi.org/10.1038/ncomms11712",
ISSN = "2041-1723 (electronic)",
bibdate = "Thu May 26 07:43:16 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.nature.com/ncomms/2016/160520/ncomms11712/full/ncomms11712.html;
http://www.scientificcomputing.com/news/2016/05/computing-secret-unbreakable-key",
acknowledgement = ack-nhfb,
fjournal = "Nature Communications",
journal-URL = "http://www.nature.com/ncomms",
}
@Article{Colin:2016:CTC,
author = "Alexei Colin and Brandon Lucia",
title = "{Chain}: tasks and channels for reliable intermittent
programs",
journal = j-SIGPLAN,
volume = "51",
number = "10",
pages = "514--530",
month = oct,
year = "2016",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/3022671.2983995",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Sat Sep 16 10:18:13 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "Energy harvesting computers enable general-purpose
computing using energy collected from their
environment. Energy-autonomy of such devices has great
potential, but their intermittent power supply poses a
challenge. Intermittent program execution compromises
progress and leaves state inconsistent. This work
describes Chain: a new model for programming
intermittent devices. A Chain program is a set of
programmer-defined tasks that compute and exchange data
through channels. Chain guarantees forward progress at
task granularity. A task is restartable and never sees
inconsistent state, because its input and output
channels are separated. Our system supports language
features for expressing advanced data exchange patterns
and for encapsulating reusable functionality. Chain
fundamentally differs from state-of-the-art
checkpointing approaches and does not incur the
associated overhead. We implement Chain as C language
extensions and a runtime library. We used Chain to
implement four applications: machine learning,
encryption, compression, and sensing. In experiments,
Chain ensured consistency where prior approaches failed
and improved throughput by 2-7x over the leading
state-of-the-art system.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "OOPSLA '16 conference proceedings.",
}
@Article{Coras:2016:AML,
author = "Florin Coras and Jordi Domingo-Pascual and Darrel
Lewis and Albert Cabellos-Aparicio",
title = "An analytical model for {Loc\slash ID} mappings
caches",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "506--516",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2373398",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Concerns regarding the scalability of the interdomain
routing have encouraged researchers to start
elaborating a more robust Internet architecture. While
consensus on the exact form of the solution is yet to
be found, the need for a semantic decoupling of a
node's location and identity is generally accepted as a
promising way forward. However, this typically requires
the use of caches that store temporal bindings between
the two namespaces, to avoid hampering router packet
forwarding speeds. In this article, we propose a
methodology for an analytical analysis of cache
performance that relies on the working-set theory. We
first identify the conditions that network traffic must
comply with for the theory to be applicable and then
develop a model that predicts average cache miss rates
relying on easily measurable traffic parameters. We
validate the result by emulation, using real packet
traces collected at the egress points of a campus and
an academic network. To prove its versatility, we
extend the model to consider cache polluting user
traffic and observe that simple, low intensity attacks
drastically reduce performance, whereby manufacturers
should either overprovision router memory or implement
more complex cache eviction policies.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Cordeiro:2016:MPG,
author = "Weverton Luis da Costa Cordeiro and Fl{\'a}vio Roberto
Santos and Marinho Pilla Barcelos and Luciano Paschoal
Gaspary and Hanna Kavalionak and Alessio Guerrieri and
Alberto Montresor",
title = "Making puzzles green and useful for adaptive identity
management in large-scale distributed systems",
journal = j-COMP-NET-AMSTERDAM,
volume = "95",
number = "??",
pages = "97--114",
day = "11",
month = feb,
year = "2016",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Jan 25 06:18:20 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128615004818",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Crichlow:2016:RSE,
author = "Ramon Crichlow",
title = "Rock-solid encrypted video streaming using {SSH}
tunnels and the {BeagleBone Black}",
journal = j-LINUX-J,
volume = "2016",
number = "264",
pages = "1:1--1:??",
month = apr,
year = "2016",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Tue Jun 7 18:42:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
URL = "http://dl.acm.org/ft_gateway.cfm?id=2933362",
abstract = "Learn how SSH tunnels work by setting up a remote
viewable Webcam on your BeagleBone Black.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Cui:2016:KAS,
author = "Baojiang Cui and Zheli Liu and Lingyu Wang",
title = "{Key-Aggregate Searchable Encryption (KASE)} for Group
Data Sharing via Cloud Storage",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "8",
pages = "2374--2385",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2389959",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 11 18:58:52 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers -",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Cui:2016:RDA,
author = "Hui Cui and Robert H. Deng",
title = "Revocable and Decentralized Attribute-Based
Encryption",
journal = j-COMP-J,
volume = "59",
number = "8",
pages = "1220--1235",
month = aug,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw007",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Aug 30 07:10:50 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/8.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/8/1220",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "February 12, 2016",
}
@Article{Dai:2016:MLR,
author = "Shuguang Dai and Huige Li and Fangguo Zhang",
title = "Memory leakage-resilient searchable symmetric
encryption",
journal = j-FUT-GEN-COMP-SYS,
volume = "62",
number = "??",
pages = "76--84",
month = sep,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue May 31 08:45:28 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15003404",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Das:2016:CWM,
author = "Aveek K. Das and Parth H. Pathak and Chen-Nee Chuah
and Prasant Mohapatra",
title = "Characterization of Wireless Multidevice Users",
journal = j-TOIT,
volume = "16",
number = "4",
pages = "29:1--29:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2955096",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 22 16:47:17 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The number of wireless-enabled devices owned by a user
has had huge growth over the past few years. Over one
third of adults in the United States currently own
three wireless devices: a smartphone, laptop, and
tablet. This article provides a study of the network
usage behavior of today's multidevice users. Using data
collected from a large university campus, we provide a
detailed multidevice user (MDU) measurement study of
more than 30,000 users. The major objective of this
work is to study how the presence of multiple wireless
devices affects the network usage behavior of users.
Specifically, we characterize the usage pattern of the
different device types in terms of total and
intermittent usage, how the usage of different devices
overlap over time, and uncarried device usage
statistics. We also study user preferences of accessing
sensitive content and device-specific factors that
govern the choice of WiFi encryption type. The study
reveals several interesting findings about MDUs. We see
how the use of tablets and laptops are interchangeable
and how the overall multidevice usage is additive
instead of being shared among the devices. We also
observe how current DHCP configurations are oblivious
to multiple devices, which results in inefficient
utilization of available IP address space. All findings
about multidevice usage patterns have the potential to
be utilized by different entities, such as app
developers, network providers, security researchers,
and analytics and advertisement systems, to provide
more intelligent and informed services to users who
have at least two devices among a smartphone, tablet,
and laptop.",
acknowledgement = ack-nhfb,
articleno = "29",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Das:2016:MPU,
author = "Jayita Das and Kevin Scott and Sanjukta Bhanja",
title = "{MRAM PUF}: Using Geometric and Resistive Variations
in {MRAM} Cells",
journal = j-JETC,
volume = "13",
number = "1",
pages = "2:1--2:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2854154",
ISSN = "1550-4832",
bibdate = "Sat Apr 8 10:16:07 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jetc.bib",
abstract = "In this work, we have studied two novel techniques to
enhance the performance of existing geometry-based
magnetoresistive RAM physically unclonable function
(MRAM PUF). Geometry-based MRAM PUFs rely only on
geometric variations in MRAM cells that generate
preferred ground state in cells and form the basis of
digital signature generation. Here we study two novel
ways to improve the performance of the geometry-based
PUF signature. First, we study how the choice between
specific geometries can enhance the reliability of the
digital signature. Using fabrications and simulations,
we study how the rectangular shape in the PUF cells is
more susceptible to lithography-based geometric
variations than the elliptical shape of the same aspect
ratio. The choice of rectangular over elliptical masks
in the lithography process can therefore improve the
reliability of the digital signature from PUF. Second,
we present a MRAM PUF architecture and study how
resistances in MRAM cells can be used to generate
analog voltage output that are easier to detect if
probed by an adversary. In the new PUF architecture, we
have the choice between selection of rows and columns
to generate unique and hard-to-predict analog voltage
outputs. For a 64-bit response, the analog voltage
output can range between 20 and 500 mV, making it tough
for an adversary to guess over this wide range of
voltages. This work ends with a discussion on the
threat resilience ability of the new improved MRAM PUF
to attacks from probing-, tampering-, reuse-, and
simulation-based models.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Journal on Emerging Technologies in Computing
Systems (JETC)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J967",
}
@Article{Dasgupta:2016:TDA,
author = "Dipankar Dasgupta and Arunava Roy and Abhijit Nag",
title = "Toward the design of adaptive selection strategies for
multi-factor authentication",
journal = j-COMPUT-SECUR,
volume = "63",
number = "??",
pages = "85--116",
month = nov,
year = "2016",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:47 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S016740481630102X",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Degefa:2016:PSE,
author = "Fikadu B. Degefa and Donghoon Lee and Jiye Kim and
Younsung Choi and Dongho Won",
title = "Performance and security enhanced authentication and
key agreement protocol for {SAE\slash LTE} network",
journal = j-COMP-NET-AMSTERDAM,
volume = "94",
number = "??",
pages = "145--163",
day = "15",
month = jan,
year = "2016",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Fri Feb 5 18:54:57 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128615004211",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Delimitrou:2016:SID,
author = "Christina Delimitrou and Christos Kozyrakis",
title = "Security Implications of Data Mining in Cloud
Scheduling",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "15",
number = "2",
pages = "109--112",
month = jul # "\slash " # dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2015.2461215",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Tue Jun 25 07:41:05 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Cloud providers host an increasing number of popular
applications, on the premise of resource flexibility
and cost efficiency. Most of these systems expose
virtualized resources of different types and sizes. As
instances share the same physical host to increase
utilization, they contend on hardware resources, e.g.,
last-level cache, making them vulnerable to
side-channel attacks from co-scheduled applications. In
this work we show that using data mining techniques can
help an adversarial user of the cloud determine the
nature and characteristics of co-scheduled applications
and negatively impact their performance through
targeted contention injections. We design Bolt, a
simple runtime that extracts the sensitivity of
co-scheduled applications to various types of
interference and uses this signal to determine the type
of these applications by applying a set of data mining
techniques. We validate the accuracy of Bolt on a
39-server cluster. Bolt correctly identifies the type
and characteristics of 81 percent out of 108 victim
applications, and constructs specialized contention
signals that degrade their performance. We also use
Bolt to find the most commonly-run applications on EC2.
We hope that underlining such security vulnerabilities
in modern cloud facilities will encourage cloud
providers to introduce stronger resource isolation
primitives in their systems.",
acknowledgement = ack-nhfb,
affiliation = "Delimitrou, C (Reprint Author), Stanford Univ, Dept
Elect Engn, Stanford, CA 94305 USA. Delimitrou,
Christina; Kozyrakis, Christos, Stanford Univ, Dept
Elect Engn, Stanford, CA 94305 USA.",
author-email = "cdel@stanford.edu kozyraki@stanford.edu",
da = "2019-06-20",
doc-delivery-number = "EH9MM",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "39-server cluster; application studies resulting in
better multiple-processor systems; Bolt; Cloud
computing; cloud computing; cloud facilities; cloud
providers; co-scheduled applications; Computer crime;
cost efficiency; cryptography; data mining; Data
mining; Degradation; Interference; resource allocation;
resource flexibility; resource isolation primitives;
scheduling and task partitioning; security and privacy
protection; security vulnerabilities; Servers;
side-channel attacks; specialized contention signals;
Super (very large) computers; virtualized resources",
number-of-cited-references = "21",
research-areas = "Computer Science",
times-cited = "0",
unique-id = "Delimitrou:2016:SID",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Demirhan:2016:CRP,
author = "Haydar Demirhan and Nihan Bitirim",
title = "\pkg{CryptRndTest}: an {R} Package for Testing the
Cryptographic Randomness",
journal = j-R-JOURNAL,
volume = "8",
number = "1",
pages = "233--247",
month = aug,
year = "2016",
DOI = "https://doi.org/10.32614/rj-2016-016",
ISSN = "2073-4859",
ISSN-L = "2073-4859",
bibdate = "Fri May 21 06:58:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/rjournal.bib",
URL = "https://journal.r-project.org/archive/2016/RJ-2016-016",
acknowledgement = ack-nhfb,
fjournal = "The R Journal",
journal-URL = "http://journal.r-project.org/",
}
@Article{Deng:2016:NCS,
author = "Jiang Deng and Chunxiang Xu and Huai Wu and Liju
Dong",
title = "A new certificateless signature with enhanced security
and aggregation version",
journal = j-CCPE,
volume = "28",
number = "4",
pages = "1124--1133",
day = "25",
month = mar,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3551",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sun Apr 3 12:34:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "5 Jun 2015",
}
@Article{Diesburg:2016:TLA,
author = "Sarah Diesburg and Christopher Meyers and Mark
Stanovich and An-I Andy Wang and Geoff Kuenning",
title = "{TrueErase}: Leveraging an Auxiliary Data Path for
Per-File Secure Deletion",
journal = j-TOS,
volume = "12",
number = "4",
pages = "18:1--18:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2854882",
ISSN = "1553-3077 (print), 1553-3093 (electronic)",
ISSN-L = "1553-3077",
bibdate = "Sat Mar 25 07:00:07 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/tos/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tos.bib",
abstract = "One important aspect of privacy is the ability to
securely delete sensitive data from electronic storage
in such a way that it cannot be recovered; we call this
action secure deletion. Short of physically destroying
the entire storage medium, existing software
secure-deletion solutions tend to be piecemeal at best
--- they may only work for one type of storage or file
system, may force the user to delete all files instead
of selected ones, may require the added complexities of
encryption and key storage, may require extensive
changes and additions to the computer's operating
system or storage firmware, and may not handle system
crashes gracefully. We present TrueErase, a holistic
secure-deletion framework for individual systems that
contain sensitive data. Through design, implementation,
verification, and evaluation on both a hard drive and
NAND flash, TrueErase shows that it is possible to
construct a per-file, secure-deletion framework that
can accommodate different storage media and legacy file
systems, require limited changes to legacy systems, and
handle common crash scenarios. TrueErase can serve as a
building block by cryptographic systems that securely
delete information by erasing encryption keys. The
overhead is dependent on spatial locality, number of
sensitive files, and workload (computational- or
I/O-bound).",
acknowledgement = ack-nhfb,
articleno = "18",
fjournal = "ACM Transactions on Storage",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960",
}
@Article{DiPietro:2016:CLD,
author = "Roberto {Di Pietro} and Flavio Lombardi and Antonio
Villani",
title = "{CUDA} Leaks: a Detailed Hack for {CUDA} and a
(Partial) Fix",
journal = j-TECS,
volume = "15",
number = "1",
pages = "15:1--15:??",
month = feb,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2801153",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Wed Jun 8 09:43:30 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Graphics processing units (GPUs) are increasingly
common on desktops, servers, and embedded platforms. In
this article, we report on new security issues related
to CUDA, which is the most widespread platform for GPU
computing. In particular, details and proofs-of-concept
are provided about novel vulnerabilities to which CUDA
architectures are subject. We show how such
vulnerabilities can be exploited to cause severe
information leakage. As a case study, we experimentally
show how to exploit one of these vulnerabilities on a
GPU implementation of the AES encryption algorithm.
Finally, we also suggest software patches and
alternative approaches to tackle the presented
vulnerabilities.",
acknowledgement = ack-nhfb,
articleno = "15",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Dixon:2016:NTO,
author = "Lucas Dixon and Thomas Ristenpart and Thomas
Shrimpton",
title = "Network Traffic Obfuscation and Automated {Internet}
Censorship",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "6",
pages = "43--53",
month = nov # "\slash " # dec,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Sat Feb 25 10:03:53 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/06/msp2016060043-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Dolev:2016:MCG,
author = "Shlomi Dolev and Ephraim Korach and Ximing Li and Yin
Li and Galit Uzan",
title = "Magnifying computing gaps: Establishing encrypted
communication over unidirectional channels",
journal = j-THEOR-COMP-SCI,
volume = "636",
number = "??",
pages = "17--26",
day = "11",
month = jul,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Jun 1 09:20:45 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397516300718",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Dong:2016:EPP,
author = "Xiaolei Dong and Jun Zhou and Zhenfu Cao",
title = "Efficient privacy-preserving temporal and spacial data
aggregation for smart grid communications",
journal = j-CCPE,
volume = "28",
number = "4",
pages = "1145--1160",
day = "25",
month = mar,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3570",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sun Apr 3 12:34:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "31 Jul 2015",
}
@TechReport{Dorre:2016:ELO,
author = "Felix D{\"o}rre and Vladimir Klebanov",
title = "Entropy Loss and Output Predictability in the
{Libgcrypt} {PRNG}",
type = "Report",
number = "CVE-2016-6313",
institution = "Karlsruhe Institute of Technology",
address = "Karlsruhe, Germany",
pages = "2",
day = "18",
month = aug,
year = "2016",
bibdate = "Thu Aug 18 07:56:29 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://formal.iti.kit.edu/~klebanov/pubs/libgcrypt-cve-2016-6313.pdf",
abstract = "In the following we describe a design flaw in the
mixing function of the Libgcrypt PRNG. Due to the flaw,
mixing the full entropy pool reduces the stored entropy
amount by at least 20 bytes. Furthermore, the flaw
makes a part of the PRNG output completely predictable.
This bug exists since 1998 in all GnuPG and Libgcrypt
versions and is tracked as CVE-2016-6313. A release
fixing the problem is available as of 2016-08-17.",
acknowledgement = ack-nhfb,
}
@Article{Draziotis:2016:EDL,
author = "Konstantinos A. Draziotis",
title = "{(EC)DSA} lattice attacks based on {Coppersmith}'s
method",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "8",
pages = "541--545",
month = aug,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu May 19 07:58:41 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019016300436",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Duan:2016:SDC,
author = "Li Duan and Dongxi Liu and Yang Zhang and Shiping Chen
and Ren Ping Liu and Bo Cheng and Junliang Chen",
title = "Secure Data-Centric Access Control for Smart Grid
Services Based on Publish\slash Subscribe Systems",
journal = j-TOIT,
volume = "16",
number = "4",
pages = "23:1--23:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3007190",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 22 16:47:17 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The communication systems in existing smart grids
mainly take the request/reply interaction model, in
which data access is under the direct control of data
producers. This tightly controlled interaction model is
not scalable to support complex interactions among
smart grid services. On the contrary, the
publish/subscribe system features a loose coupling
communication infrastructure and allows indirect,
anonymous and multicast interactions among smart grid
services. The publish/subscribe system can thus support
scalable and flexible collaboration among smart grid
services. However, the access is not under the direct
control of data producers, it might not be easy to
implement an access control scheme for a
publish/subscribe system. In this article, we propose a
Data-Centric Access Control Framework (DCACF) to
support secure access control in a publish/subscribe
model. This framework helps to build scalable smart
grid services, while keeping features of service
interactions and data confidentiality at the same time.
The data published in our DCACF is encrypted with a
fully homomorphic encryption scheme, which allows
in-grid homomorphic aggregation of the encrypted data.
The encrypted data is accompanied by Bloom-filter
encoded control policies and access credentials to
enable indirect access control. We have analyzed the
correctness and security of our DCACF and evaluated its
performance in a distributed environment.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Dubeuf:2016:EPA,
author = "Jeremy Dubeuf and David Hely and Vincent Beroulle",
title = "{ECDSA} Passive Attacks, Leakage Sources, and Common
Design Mistakes",
journal = j-TODAES,
volume = "21",
number = "2",
pages = "31:1--31:??",
month = jan,
year = "2016",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/2820611",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Sat Feb 6 07:43:40 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "Elliptic Curves Cryptography (ECC) tends to replace
RSA for public key cryptographic services. ECC is
involved in many secure schemes such as Elliptic Curve
Diffie--Hellman (ECDH) key agreement, Elliptic Curve
Integrated Encryption Scheme (ECIES), and Elliptic
Curve Digital Signature Algorithm (ECDSA). As for every
cryptosystem, implementation of such schemes may
jeopardize the inherent security provided by the
mathematical properties of the ECC. Unfortunate
implementation or algorithm choices may create serious
vulnerabilities. The elliptic curve scalar operation is
particularly sensitive among these schemes. This
article surveys passive attacks against well-spread
elliptic curve scalar multiplication algorithms
highlighting leakage sources and common mistakes that
can be used to attack the ECDSA scheme. Experimental
results are provided to illustrate and demonstrate the
effectiveness of each vulnerability. Finally, the
article describes the link between partial leakage and
lattice attack in order to understand and demonstrate
the impact of small leakages on the security of ECDSA.
An example of side channel and lattice attack
combination on NIST P-256 is provided in the case where
the elliptic curve scalar multiplication is not
protected against DPA/CPA and a controllable device is
not accessible.",
acknowledgement = ack-nhfb,
articleno = "31",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{DuPont:2016:ECC,
author = "Quinn DuPont and Bradley Fidler",
title = "Edge Cryptography and the Codevelopment of Computer
Networks and Cybersecurity",
journal = j-IEEE-ANN-HIST-COMPUT,
volume = "38",
number = "4",
pages = "55--73",
month = "????",
year = "2016",
CODEN = "IAHCEX",
DOI = "https://doi.org/10.1109/MAHC.2016.49",
ISSN = "1058-6180 (print), 1934-1547 (electronic)",
ISSN-L = "1058-6180",
bibdate = "Thu Dec 8 06:37:03 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeeannhistcomput.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Annals of the History of Computing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85",
}
@Article{Eberz:2016:LLE,
author = "Simon Eberz and Kasper B. Rasmussen and Vincent
Lenders and Ivan Martinovic",
title = "Looks Like {Eve}: Exposing Insider Threats Using Eye
Movement Biometrics",
journal = j-TOPS,
volume = "19",
number = "1",
pages = "1:1--1:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2904018",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
ISSN-L = "2471-2566",
bibdate = "Mon Apr 3 09:09:38 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
abstract = "We introduce a novel biometric based on distinctive
eye movement patterns. The biometric consists of 20
features that allow us to reliably distinguish users
based on differences in these patterns. We leverage
this distinguishing power along with the ability to
gauge the users' task familiarity, that is, level of
knowledge, to address insider threats. In a controlled
experiment, we test how both time and task familiarity
influence eye movements and feature stability, and how
different subsets of features affect the classifier
performance. These feature subsets can be used to
tailor the eye movement biometric to different
authentication methods and threat models. Our results
show that eye movement biometrics support reliable and
stable continuous authentication of users. We
investigate different approaches in which an attacker
could attempt to use inside knowledge to mimic the
legitimate user. Our results show that while this
advance knowledge is measurable, it does not increase
the likelihood of successful impersonation. In order to
determine the time stability of our features, we repeat
the experiment twice within 2 weeks. The results
indicate that we can reliably authenticate users over
the entire period. We show that lower sampling rates
provided by low-cost hardware pose a challenge, but
that reliable authentication is possible even at the
rate of 50Hz commonly available with consumer-level
devices. In a second set of experiments, we evaluate
how our authentication system performs across a variety
of real-world tasks, including reading, writing, and
web browsing. We discuss the advantages and limitations
of our approach in detail and give practical insights
on the use of this biometric in a real-world
environment.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Ehdaie:2016:HCR,
author = "Mohammad Ehdaie and Nikos Alexiou and Mahmoud Ahmadian
and Mohammad Reza Aref and Panos Papadimitratos",
title = "{$2$D} Hash Chain robust Random Key Distribution
scheme",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "5",
pages = "367--372",
month = may,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri Feb 12 06:40:48 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015002239",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Esiner:2016:FFB,
author = "Ertem Esiner and Adilet Kachkeev and Samuel Braunfeld
and Alptekin K{\"u}p{\c{c}}{\"u} and {\"O}znur
{\"O}zkasap",
title = "{FlexDPDP}: Flexlist-Based Optimized Dynamic Provable
Data Possession",
journal = j-TOS,
volume = "12",
number = "4",
pages = "23:1--23:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2943783",
ISSN = "1553-3077 (print), 1553-3093 (electronic)",
ISSN-L = "1553-3077",
bibdate = "Sat Mar 25 07:00:07 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/tos/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tos.bib",
abstract = "With increasing popularity of cloud storage,
efficiently proving the integrity of data stored on an
untrusted server has become significant. Authenticated
skip lists and rank-based authenticated skip lists
(RBASL) have been used to provide support for provable
data update operations in cloud storage. However, in a
dynamic file scenario, an RBASL based on block indices
falls short when updates are not proportional to a
fixed block size; such an update to the file, even if
small, may result in $ O(n) $ updates on the data
structure for a file with n blocks. To overcome this
problem, we introduce FlexList, a flexible length-based
authenticated skip list. FlexList translates
variable-size updates to $ O(\lceil u / B \rceil) $
insertions, removals, or modifications, where u is the
size of the update and B is the (average) block size.
We further present various optimizations on the four
types of skip lists (regular, authenticated, rank-based
authenticated, and FlexList). We build such a structure
in $ O(n) $ time and parallelize this operation for the
first time. We compute one single proof to answer
multiple (non)membership queries and obtain efficiency
gains of 35\%, 35\%, and 40\% in terms of proof time,
energy, and size, respectively. We propose a method of
handling multiple updates at once, achieving efficiency
gains of up to 60\% at the server side and 90\% at the
client side. We also deployed our implementation of
FlexDPDP (dynamic provable data possession (DPDP) with
FlexList instead of RBASL) on PlanetLab, demonstrating
that FlexDPDP performs comparable to the most efficient
static storage scheme (provable data possession (PDP))
while providing dynamic data support.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Storage",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960",
}
@Article{Everett:2016:SES,
author = "Cath Everett",
title = "Should encryption software be banned?",
journal = j-NETWORK-SECURITY,
volume = "2016",
number = "8",
pages = "14--17",
month = aug,
year = "2016",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(16)30078-2",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:35 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485816300782",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Evtyushkin:2016:UMC,
author = "Dmitry Evtyushkin and Dmitry Ponomarev and Nael
Abu-Ghazaleh",
title = "Understanding and Mitigating Covert Channels Through
Branch Predictors",
journal = j-TACO,
volume = "13",
number = "1",
pages = "10:1--10:??",
month = apr,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2870636",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Tue Apr 5 16:27:36 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
abstract = "Covert channels through shared processor resources
provide secret communication between two malicious
processes: the trojan and the spy. In this article, we
classify, analyze, and compare covert channels through
dynamic branch prediction units in modern processors.
Through experiments on a real hardware platform, we
compare contention-based channel and the channel that
is based on exploiting the branch predictor's residual
state. We analyze these channels in SMT and
single-threaded environments under both clean and noisy
conditions. Our results show that the residual
state-based channel provides a cleaner signal and is
effective even in noisy execution environments with
another application sharing the same physical core with
the trojan and the spy. We also estimate the capacity
of the branch predictor covert channels and describe a
software-only mitigation technique that is based on
randomizing the state of the predictor tables on
context switches. We show that this protection
eliminates all covert channels through the branch
prediction unit with minimal impact on performance.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Fathimal:2016:SSS,
author = "P. Mohamed Fathimal and P. Arockia Jansi Rani",
title = "{$K$} out of {$N$} Secret Sharing Scheme for Multiple
Color Images with Steganography and Authentication",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "16",
number = "2",
pages = "1650010",
month = apr,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467816500108",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Thu May 5 06:44:22 MDT 2016",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Fay:2016:ICM,
author = "Robin Fay",
title = "Introducing the counter mode of operation to
{Compressed Sensing} based encryption",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "4",
pages = "279--283",
month = apr,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Jan 5 11:59:16 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015001945",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Fei:2016:PPA,
author = "Xiongwei Fei and Kenli Li and Wangdong Yang and Keqin
Li",
title = "Practical parallel {AES} algorithms on cloud for
massive users and their performance evaluation",
journal = j-CCPE,
volume = "28",
number = "16",
pages = "4246--4263",
month = nov,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3734",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Thu Nov 17 07:11:02 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Fei:2016:SEF,
author = "Xiongwei Fei and Kenli Li and Wangdong Yang and Keqin
Li",
title = "A secure and efficient file protecting system based on
{SHA3} and parallel {AES}",
journal = j-PARALLEL-COMPUTING,
volume = "52",
number = "??",
pages = "106--132",
month = feb,
year = "2016",
CODEN = "PACOEJ",
DOI = "https://doi.org/10.1016/j.parco.2016.01.001",
ISSN = "0167-8191 (print), 1872-7336 (electronic)",
ISSN-L = "0167-8191",
bibdate = "Fri Feb 12 18:56:20 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/parallelcomputing.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167819116000028",
acknowledgement = ack-nhfb,
fjournal = "Parallel Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/01678191/",
}
@Article{Florencio:2016:PSD,
author = "Dinei Flor{\^e}ncio and Cormac Herley and Paul C. {Van
Oorschot}",
title = "Pushing on string: the `don't care' region of password
strength",
journal = j-CACM,
volume = "59",
number = "11",
pages = "66--74",
month = nov,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2934663",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Oct 31 16:06:16 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/11/209115/fulltext",
abstract = "Enterprises that impose stringent password-composition
policies appear to suffer the same fate as those that
do not.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Folger:2016:TQH,
author = "Tim Folger",
title = "Technology: The Quantum Hack",
journal = j-SCI-AMER,
volume = "314",
number = "2",
pages = "48--55",
month = feb,
year = "2016",
CODEN = "SCAMAC",
DOI = "https://doi.org/10.1038/scientificamerican0216-48",
ISSN = "0036-8733 (print), 1946-7087 (electronic)",
ISSN-L = "0036-8733",
bibdate = "Tue Mar 8 06:46:07 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sciam2010.bib;
http://www.nature.com/scientificamerican",
URL = "http://www.nature.com/scientificamerican/journal/v314/n2/full/scientificamerican0216-48.html;
http://www.nature.com/scientificamerican/journal/v314/n2/pdf/scientificamerican0216-48.pdf",
acknowledgement = ack-nhfb,
fjournal = "Scientific American",
journal-URL = "http://www.nature.com/scientificamerican",
keywords = "quantum cryptography",
}
@Article{Frattolillo:2016:BFM,
author = "Franco Frattolillo",
title = "A Buyer-Friendly and Mediated Watermarking Protocol
for {Web} Context",
journal = j-TWEB,
volume = "10",
number = "2",
pages = "9:1--9:??",
month = may,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2856036",
ISSN = "1559-1131 (print), 1559-114X (electronic)",
ISSN-L = "1559-1131",
bibdate = "Wed May 25 17:02:04 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tweb.bib",
abstract = "Watermarking protocols are used in conjunction with
digital watermarking techniques to protect digital
copyright on the Internet. They define the schemes of
the web transactions by which buyers can purchase
protected digital content distributed by content
providers in a secure manner. Over the last few years,
significant examples of watermarking protocols have
been proposed in literature. However, a detailed
examination of such protocols has revealed a number of
problems that have to be addressed in order to make
them suited for current web context. Therefore, based
on the most relevant problems derived from literature,
this article identifies the main challenges posed by
the development of watermarking protocols for web
context and presents a watermarking protocol that
follows a new secure, buyer-centric and mediated design
approach able to meet such challenges.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on the Web (TWEB)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1062",
}
@Article{Fu:2016:EPS,
author = "Zhangjie Fu and Kui Ren and Jiangang Shu and Xingming
Sun and Fengxiao Huang",
title = "Enabling Personalized Search over Encrypted Outsourced
Data with Efficiency Improvement",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "27",
number = "9",
pages = "2546--2559",
month = sep,
year = "2016",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2015.2506573",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Wed Aug 10 09:25:16 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "https://www.computer.org/csdl/trans/td/2016/09/07349214-abs.html",
abstract-URL = "https://www.computer.org/csdl/trans/td/2016/09/07349214-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Garay:2016:MPA,
author = "Juan A. Garay and Vladimir Kolesnikov and Rae
Mclellan",
title = "{MAC} Precomputation with Applications to Secure
Memory",
journal = j-TOPS,
volume = "19",
number = "2",
pages = "6:1--6:??",
month = sep,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2943780",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
ISSN-L = "2471-2566",
bibdate = "Mon Apr 3 09:09:39 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
abstract = "We present Shallow MAC (ShMAC), a fixed-input-length
message authentication code that performs most of the
computation prior to the availability of the message.
Specifically, ShMAC's message-dependent computation is
much faster and smaller in hardware than the evaluation
of a pseudorandom permutation (PRP) and can be
implemented by a small shallow circuit, while its
precomputation consists of one PRP evaluation. A main
building block for ShMAC is the notion of strong
differential uniformity (SDU), which we introduce and
which may be of independent interest. We show an
efficient SDU construction built from previously
considered differentially uniform functions. Our main
motivating application is a system architecture where a
hardware-secured processor uses memory controlled by an
adversary. We also present in technical detail a novel,
efficient approach to encrypting and authenticating
memory and discuss the associated tradeoffs, while
paying special attention to minimizing hardware costs
and the reduction of Dynamic Random Access Memory
latency.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Gardiner:2016:SML,
author = "Joseph Gardiner and Shishir Nagaraja",
title = "On the Security of Machine Learning in Malware {C\&C}
Detection: a Survey",
journal = j-COMP-SURV,
volume = "49",
number = "3",
pages = "59:1--59:??",
month = dec,
year = "2016",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3003816",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Feb 9 09:25:05 MST 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "One of the main challenges in security today is
defending against malware attacks. As trends and
anecdotal evidence show, preventing these attacks,
regardless of their indiscriminate or targeted nature,
has proven difficult: intrusions happen and devices get
compromised, even at security-conscious organizations.
As a consequence, an alternative line of work has
focused on detecting and disrupting the individual
steps that follow an initial compromise and are
essential for the successful progression of the attack.
In particular, several approaches and techniques have
been proposed to identify the command and control (C8C)
channel that a compromised system establishes to
communicate with its controller. A major oversight of
many of these detection techniques is the design's
resilience to evasion attempts by the well-motivated
attacker. C8C detection techniques make widespread use
of a machine learning (ML) component. Therefore, to
analyze the evasion resilience of these detection
techniques, we first systematize works in the field of
C8C detection and then, using existing models from the
literature, go on to systematize attacks against the ML
components used in these approaches.",
acknowledgement = ack-nhfb,
articleno = "59",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Garg:2016:CIO,
author = "Sanjam Garg and Craig Gentry and Shai Halevi and
Mariana Raykova and Amit Sahai and Brent Waters",
title = "Candidate Indistinguishability Obfuscation and
Functional Encryption for All Circuits",
journal = j-SIAM-J-COMPUT,
volume = "45",
number = "3",
pages = "882--929",
month = "????",
year = "2016",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/14095772X",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Fri Sep 23 11:12:14 MDT 2016",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/45/3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 2016",
}
@Article{Garg:2016:HSS,
author = "Sanjam Garg and Craig Gentry and Shai Halevi and
Mariana Raykova and Amit Sahai and Brent Waters",
title = "Hiding secrets in software: a cryptographic approach
to program obfuscation",
journal = j-CACM,
volume = "59",
number = "5",
pages = "113--120",
month = may,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2902313",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed May 25 17:07:29 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/5/201597/fulltext",
abstract = "Can we hide secrets in software? Can we obfuscate
programs---that is, make programs unintelligible while
preserving their functionality? What exactly do we mean
by ``unintelligible''? Why would we even want to do
this? In this article, we describe some rigorous
cryptographic answers to these quasi-philosophical
questions. We also discuss our recent ``candidate
indistinguishability obfuscation'' scheme and its
implications.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Ge:2016:DSR,
author = "Yongyong Ge and Yannan Li and Zhusong Liu",
title = "Delegation of signing rights for emerging {5G}
networks",
journal = j-CCPE,
volume = "28",
number = "4",
pages = "1193--1203",
day = "25",
month = mar,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3581",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sun Apr 3 12:34:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "28 Aug 2015",
}
@Article{Ge:2016:KPA,
author = "Chunpeng Ge and Willy Susilo and Jiandong Wang and
Zhiqiu Huang and Liming Fang and Yongjun Ren",
title = "A Key-Policy Attribute-Based Proxy Re-Encryption
Without Random Oracles",
journal = j-COMP-J,
volume = "59",
number = "7",
pages = "970--982",
month = jul,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv100",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Aug 30 07:10:49 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/7/970",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 12, 2015",
}
@Article{Gebotys:2016:PCP,
author = "Catherine H. Gebotys and Brian A. White and Edgar
Mateos",
title = "Preaveraging and Carry Propagate Approaches to
Side-Channel Analysis of {HMAC-SHA256}",
journal = j-TECS,
volume = "15",
number = "1",
pages = "4:1--4:??",
month = feb,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2794093",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Wed Jun 8 09:43:30 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Although HMAC-SHA has been standardized for over a
decade, few published attacks on the single-cycle round
implementation exist. In this research, new attack
techniques are provided, for the first time, (1) to
help to discriminate between values of secret
intermediate variables within HMAC and (2) to reduce
the large word size complexity. Preaveraging and carry
propagate techniques are proposed using chosen
plaintexts and shown to significantly reduce the
complexity and runtimes for side-channel analysis of an
Altera FPGA platform. This research is important for
advancing side channel analysis of complex embedded
ASICs and ensuring secure implementations in future
embedded ubiquitous devices.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Genkin:2016:PKE,
author = "Daniel Genkin and Lev Pachmanov and Itamar Pipman and
Adi Shamir and Eran Tromer",
title = "Physical key extraction attacks on {PCs}",
journal = j-CACM,
volume = "59",
number = "6",
pages = "70--79",
month = jun,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2851486",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed May 25 17:07:29 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/6/202646/fulltext",
abstract = "Computers broadcast their secrets via inadvertent
physical emanations that are easily measured and
exploited.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Gofman:2016:MBE,
author = "Mikhail I. Gofman and Sinjini Mitra",
title = "Multimodal biometrics for enhanced mobile device
security",
journal = j-CACM,
volume = "59",
number = "4",
pages = "58--65",
month = apr,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2818990",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Fri Apr 15 14:58:10 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/4/200169/fulltext",
abstract = "Fusing information from multiple biometric traits
enhances authentication in mobile devices.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Gong:2016:ATI,
author = "Junqing Gong and Xiaolei Dong and Zhenfu Cao and Jie
Chen",
title = "Almost-Tight Identity Based Encryption Against
Selective Opening Attack",
journal = j-COMP-J,
volume = "59",
number = "11",
pages = "1669--1688",
month = nov,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw030",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Nov 4 09:11:48 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/11.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/11/1669",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 12, 2016",
}
@Article{Gong:2016:FSC,
author = "Wei Gong and Ivan Stojmenovic and Amiya Nayak and
Kebin Liu and Haoxiang Liu",
title = "Fast and scalable counterfeits estimation for
large-scale {RFID} systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "1052--1064",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Many algorithms have been introduced to
deterministically authenticate Radio Frequency
Identification (RFID) tags, while little work has been
done to address scalability issue in batch
authentications. Deterministic approaches verify tags
one by one, and the communication overhead and time
cost grow linearly with increasing size of tags. We
design a fast and scalable counterfeits estimation
scheme, INformative Counting (INC), which achieves
sublinear authentication time and communication cost in
batch verifications. The key novelty of INC builds on
an FM-Sketch variant authentication synopsis that can
capture key counting information using only sublinear
space. With the help of this well-designed data
structure, INC is able to provide authentication
results with accurate estimates of the number of
counterfeiting tags and genuine tags, while previous
batch authentication methods merely provide 0/1 results
indicating the existence of counterfeits. We conduct
detailed theoretical analysis and extensive experiments
to examine this design and the results show that INC
significantly outperforms previous work in terms of
effectiveness and efficiency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Gong:2016:HES,
author = "Linming Gong and Shundong Li and Qing Mao and Daoshun
Wang and Jiawei Dou",
title = "A homomorphic encryption scheme with adaptive chosen
ciphertext security but without random oracle",
journal = j-THEOR-COMP-SCI,
volume = "609 (part 1)",
number = "??",
pages = "253--261",
day = "4",
month = jan,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Dec 4 06:41:42 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397515008725",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Gope:2016:EMA,
author = "Prosanta Gope and Tzonelih Hwang",
title = "An efficient mutual authentication and key agreement
scheme preserving strong anonymity of the mobile user
in global mobility networks",
journal = j-J-NETW-COMPUT-APPL,
volume = "62",
number = "??",
pages = "1--8",
month = feb,
year = "2016",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Jun 20 11:42:19 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804515002969",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Guerin:2016:TDU,
author = "Nilson Donizete {Guerin, Jr.} and Flavio {de Barros
Vidal} and Bruno Macchiavello",
title = "Text-dependent User Verification of Handwritten Words
and Signatures on Mobile Devices",
journal = j-COMP-J,
volume = "59",
number = "9",
pages = "1415--1425",
month = sep,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv113",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 12 11:39:16 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/9.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/9/1415",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "December 9, 2015",
}
@InProceedings{Gueron:2016:HIA,
author = "Shay Gueron and Sanu Mathew",
title = "Hardware Implementation of {AES} Using Area-Optimal
Polynomials for Composite-Field Representation {$
\mathrm {GF}(2^4)^2 $} of {$ \mathrm {GF}(2^8) $}",
crossref = "Montuschi:2016:ISC",
pages = "112--117",
year = "2016",
DOI = "https://doi.org/10.1109/ARITH.2016.32",
bibdate = "Fri Dec 16 15:17:20 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = ack-nhfb,
keywords = "ARITH-23",
}
@Article{Gueron:2016:MEG,
author = "Shay Gueron",
title = "Memory Encryption for General-Purpose Processors",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "6",
pages = "54--62",
month = nov # "\slash " # dec,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Sat Feb 25 10:03:53 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/06/msp2016060054-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Guin:2016:FCS,
author = "Ujjwal Guin and Qihang Shi and Domenic Forte and Mark
M. Tehranipoor",
title = "{FORTIS}: a Comprehensive Solution for Establishing
Forward Trust for Protecting {IPs} and {ICs}",
journal = j-TODAES,
volume = "21",
number = "4",
pages = "63:1--63:??",
month = sep,
year = "2016",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/2893183",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Sep 23 15:16:20 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "With the advent of globalization in the semiconductor
industry, it is necessary to prevent unauthorized usage
of third-party IPs (3PIPs), cloning and unwanted
modification of 3PIPs, and unauthorized production of
ICs. Due to the increasing complexity of ICs,
system-on-chip (SoC) designers use various 3PIPs in
their design to reduce time-to-market and development
costs, which creates a trust issue between the SoC
designer and the IP owners. In addition, as the ICs are
fabricated around the globe, the SoC designers give
fabrication contracts to offshore foundries to
manufacture ICs and have little control over the
fabrication process, including the total number of
chips fabricated. Similarly, the 3PIP owners lack
control over the number of fabricated chips and/or the
usage of their IPs in an SoC. Existing research only
partially addresses the problems of IP piracy and IC
overproduction, and to the best of our knowledge, there
is no work that considers IP overuse. In this article,
we present a comprehensive solution for preventing IP
piracy and IC overproduction by assuring forward trust
between all entities involved in the SoC design and
fabrication process. We propose a novel design flow to
prevent IC overproduction and IP overuse. We use an
existing logic encryption technique to obfuscate the
netlist of an SoC or a 3PIP and propose a modification
to enable manufacturing tests before the activation of
chips which is absolutely necessary to prevent
overproduction. We have used asymmetric and symmetric
key encryption, in a fashion similar to Pretty Good
Privacy (PGP), to transfer keys from the SoC designer
or 3PIP owners to the chips. In addition, we also
propose to attach an IP digest (a cryptographic hash of
the entire IP) to the header of an IP to prevent
modification of the IP by the SoC designers. We have
shown that our approach is resistant to various attacks
with the cost of minimal area overhead.",
acknowledgement = ack-nhfb,
articleno = "63",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Gutierrez:2016:IDO,
author = "Christopher N. Gutierrez and Mohammed H. Almeshekah
and Eugene H. Spafford and Mikhail J. Atallah and Jeff
Avery",
title = "Inhibiting and Detecting Offline Password Cracking
Using {ErsatzPasswords}",
journal = j-TOPS,
volume = "19",
number = "3",
pages = "9:1--9:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2996457",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
ISSN-L = "2471-2566",
bibdate = "Mon Apr 3 09:09:39 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
abstract = "In this work, we present a simple, yet effective and
practical scheme to improve the security of stored
password hashes, increasing the difficulty to crack
passwords and exposing cracking attempts. We utilize a
hardware-dependent function (HDF), such as a physically
unclonable function (PUF) or a hardware security module
(HSM), at the authentication server to inhibit offline
password discovery. Additionally, a deception mechanism
is incorporated to alert administrators of cracking
attempts. Using an HDF to generate password hashes
hinders attackers from recovering the true passwords
without constant access to the HDF. Our scheme can
integrate with legacy systems without needing
additional servers, changing the structure of the
hashed password file, nor modifying client machines.
When using our scheme, the structure of the hashed
passwords file, e.g., etc/shadow or etc/master.passwd,
will appear no different than traditional hashed
password files.$^1$ However, when attackers exfiltrate
the hashed password file and attempt to crack it, the
passwords they will receive are ErsatzPasswords-``fake
passwords.'' The ErsatzPasswords scheme is flexible by
design, enabling it to be integrated into existing
authentication systems without changes to user
experience. The proposed scheme is integrated into the
pam\_unix module as well as two client/server
authentication schemes: Lightweight Directory Access
Protocol (LDAP) authentication and the Pythia
pseudorandom function (PRF) Service [Everspaugh et al.
2015]. The core library to support ErsatzPasswords
written in C and Python consists of 255 and 103 lines
of code, respectively. The integration of
ErsatzPasswords into each explored authentication
system required less than 100 lines of additional code.
Experimental evaluation of ErsatzPasswords shows an
increase in authentication latency on the order of
100ms, which maybe acceptable for real world systems.
We also describe a framework for implementing
ErsatzPasswords using a Trusted Platform Module
(TPM).",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Gutman:2016:EAF,
author = "R. Gutman and C. J. Sammartino and T. C. Green and B.
T. Montague",
title = "Error adjustments for file linking methods using
encrypted unique client identifier {(eUCI)} with
application to recently released prisoners who are
{HIV+}",
journal = j-STAT-MED,
volume = "35",
number = "1",
pages = "115--129",
day = "15",
month = jan,
year = "2016",
CODEN = "SMEDDA",
DOI = "https://doi.org/10.1002/sim.6586",
ISSN = "0277-6715 (print), 1097-0258 (electronic)",
ISSN-L = "0277-6715",
bibdate = "Sat Jun 27 15:48:39 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/statmed2010.bib",
acknowledgement = ack-nhfb,
ajournal = "Stat. Med.",
fjournal = "Statistics in Medicine",
journal-URL = "https://onlinelibrary.wiley.com/journal/10970258",
onlinedate = "21 July 2015",
}
@Article{Han:2016:GGA,
author = "Jinsong Han and Chen Qian and Panlong Yang and Dan Ma
and Zhiping Jiang and Wei Xi and Jizhong Zhao",
title = "{GenePrint}: generic and accurate physical-layer
identification for {UHF RFID} tags",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "846--858",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Physical-layer identification utilizes unique features
of wireless devices as their fingerprints, providing
authenticity and security guarantee. Prior
physical-layer identification techniques on radio
frequency identification (RFID) tags require nongeneric
equipments and are not fully compatible with existing
standards. In this paper, we propose a novel
physical-layer identification system, GenePrint, for
UHF passive tags. The GenePrint prototype system is
implemented by a commercial reader, a USRP-based
monitor, and off-the-shelf UHF passive tags. Our
solution is generic and completely compatible with the
existing standard, EPCglobal C1G2 specification.
GenePrint leverages the internal similarity among
pulses of tags' RN16 preamble signals to extract a
hardware feature as the fingerprint. We conduct
extensive experiments on over 10 000 RN16 preamble
signals from 150 off-the-shelf RFID tags. The results
show that GenePrint achieves a high identification
accuracy of 99.68\%+. The feature extraction of
GenePrint is resilient to various malicious attacks,
such as the feature replay attack.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hardesty:2016:SUC,
author = "Larry Hardesty",
title = "Secure, User-controlled Cryptographic System
Developed",
journal = j-SCI-COMPUT,
volume = "??",
number = "??",
pages = "??--??",
day = "22",
month = mar,
year = "2016",
bibdate = "Fri Mar 25 16:15:34 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.scientificcomputing.com/news/2016/03/secure-user-controlled-cryptographic-system-developed",
acknowledgement = ack-nhfb,
keywords = "attribute-based encryption; key homomorphism; Sieve
cryptographic system",
}
@Book{Hastings:2016:SWS,
author = "Max Hastings",
title = "The Secret War: Spies, Ciphers, and Guerrillas
1939--1945",
publisher = "Harper",
address = "New York, NY",
pages = "xxvii + 610 + 32",
year = "2016",
ISBN = "0-06-225927-X (hardcover), 0-06-225928-8 (paperback),
0-06-244156-6",
ISBN-13 = "978-0-06-225927-1 (hardcover), 978-0-06-225928-8
(paperback), 978-0-06-244156-0",
LCCN = "D810.S7 H365 2017",
bibdate = "Wed Jan 2 07:39:53 MST 2019",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
abstract = "An examination of one of the most important yet
underexplored aspects of World War II --- intelligence
shows how espionage successes and failures by the
United States, Britain, Russia, Germany, and Japan
influenced the course of the war and its final
outcome.",
acknowledgement = ack-nhfb,
remark = "First published in a different form in the United
Kingdom in 2015.",
subject = "World War, 1939--1945; Secret service; Underground
movements; Cryptography; Electronic intelligence;
Intelligence service; History; 20th century; Espionage;
Bletchley Park (Milton Keynes, England)",
tableofcontents = "List of illustrations \\
Introduction \\
1: Before the deluge / 1 \\
Seekers after truth \\
The British: gentlemen and players \\
The Russians: temples of espionage \\
2: The storm breaks / 42 \\
The ``fiction flood'' \\
Shadowing Canaris \\
3: Miracles take a little longer: Bletchley / 68 \\
``Tips'' and ``cillis'' \\
Flirting with America \\
4: The dogs that barked / 103 \\
``Lucy's'' people \\
Sorge's warnings \\
The orchestra plays \\
The deaf man in the Kremlin \\
5: Divine winds / 135 \\
Mrs Ferguson's tea set \\
The Japanese \\
The man who won Midway \\
6: Muddling and groping: the Russians at war / 175 \\
Centre mobilis{\'e}s \\
The end of Sorge \\
The second source \\
Gourevitch takes a train \\
7: Britain's secret war machine / 195 \\
The sharp end \\
The brain \\
At sea \\
8: `Mars': the bloodiest deception / 222 \\
Gehlen \\
``Agent Max'' \\
9: The orchestra's last concert / 238 \\
10: Guerrilla / 252 \\
Registers and raiders \\
SOE \\
11: Hoover's G-men, Donovan's wild men / 281 \\
Adventurers \\
Ivory towers \\
Allen Dulles: talking to Germany \\
12: Russia's partisans: terrorising both sides / 314
\\
13: Islands in the storm / 328 \\
The Abwehr's Irish jig \\
No man's land \\
14: A little help from their friends / 346 \\
``It stinks, but somebody has to do it'' \\
American traitors \\
15: The knowledge factories / 385 \\
Agents \\
The jewel of sources \\
Production lines \\
Infernal machines \\
16: `Blunderhead': the English patient / 428 \\
17: Eclipse of the Abwehr / 444 \\
Hitler's Bletchleys \\
``Cicero'' \\
The fantasists \\
The ``good'' Nazi \\
18: Battlefields / 480 \\
Wielding the Ultra wand \\
Suicide spies \\
Tarnished triumph \\
19: Black widows, few white knights / 501 \\
Fighting Japan \\
Fighting each other \\
The enemy: groping in the dark \\
20: `Enormoz' / 521 \\
21: Decoding victory / 533 \\
Acknowledgements \\
Notes and Sources \\
Bibliography \\
Index",
}
@InProceedings{Hastings:2016:WKR,
author = "Marcella Hastings and Joshua Fried and Nadia
Heninger",
booktitle = "{IMC'16: Proceedings of the 2016 Internet Measurement
Conference, November 2016}",
title = "Weak keys remain widespread in network devices",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "49--63",
year = "2016",
DOI = "https://doi.org/10.1145/2987443.2987486",
bibdate = "Fri Jul 29 07:53:00 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "In 2012, two academic groups reported having computed
the RSA private keys for 0.5\% of HTTPS hosts on the
internet, and traced the underlying issue to widespread
random number generation failures on networked devices.
The vulnerability was reported to dozens of vendors,
several of whom responded with security advisories, and
the Linux kernel was patched to fix a boottime entropy
hole that contributed to the failures.\par
In this paper, we measure the actions taken by vendors
and end users over time in response to the original
disclosure. We analyzed public internet-wide TLS scans
performed between July 2010 and May 2016 and extracted
81 million distinct RSA keys. We then computed the
pairwise common divisors for the entire set in order to
factor over 313,000 keys vulnerable to the flaw, and
fingerprinted implementations to study patching
behavior over time across vendors. We find that many
vendors appear to have never produced a patch, and
observed little to no patching behavior by end users of
affected devices. The number of vulnerable hosts
increased in the years after notification and public
disclosure, and several newly vulnerable
implementations have appeared since 2012. Vendor
notification, positive vendor responses, and even
vendor-produced public security advisories appear to
have little correlation with end-user security.",
acknowledgement = ack-nhfb,
}
@Article{He:2016:STI,
author = "Kai He and Jian Weng and Robert H. Deng and Joseph K.
Liu",
title = "On the security of two identity-based conditional
proxy re-encryption schemes",
journal = j-THEOR-COMP-SCI,
volume = "652",
number = "??",
pages = "18--27",
day = "1",
month = nov,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 23 16:45:18 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397516304443",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Hernandez-Becerril:2016:GIS,
author = "Rogelio Adrian Hernandez-Becerril and Ariana Guadalupe
Bucio-Ramirez and Mariko Nakano-Miyatake and Hector
Perez-Meana and Marco Pedro Ramirez-Tachiquin",
title = "A {GPU} implementation of secret sharing scheme based
on cellular automata",
journal = j-J-SUPERCOMPUTING,
volume = "72",
number = "4",
pages = "1291--1311",
month = apr,
year = "2016",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1646-6",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Mon May 30 09:17:38 MDT 2016",
bibsource = "http://link.springer.com/journal/11227/72/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-016-1646-6",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Hoffmann:2016:LBQb,
author = "Leah Hoffmann",
title = "Last byte: {Q\&A}: Finding new directions in
cryptography: {Whitfield Diffie} and {Martin Hellman}
on their meeting, their research, and the results that
billions use every day",
journal = j-CACM,
volume = "59",
number = "6",
pages = "112--ff",
month = jun,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2911977",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed May 25 17:07:29 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/acm-turing-awards.bib;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/6/202666/fulltext",
abstract = "Whitfield Diffie and Martin Hellman on their meeting,
their research, and the results that billions use every
day.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Hu:2016:EWS,
author = "Changhui Hu and Lidong Han",
title = "Efficient wildcard search over encrypted data",
journal = j-INT-J-INFO-SEC,
volume = "15",
number = "5",
pages = "539--547",
month = oct,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-015-0302-0",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Tue Jan 23 16:01:46 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://link.springer.com/article/10.1007/s10207-015-0302-0",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
keywords = "Cloud computing; Searchable symmetric encryption;
Wildcard search",
}
@Article{Hu:2016:PBR,
author = "Yu-Chen Hu and Chun-Chi Lo and Wu-Lin Chen",
title = "Probability-based reversible image authentication
scheme for image demosaicking",
journal = j-FUT-GEN-COMP-SYS,
volume = "62",
number = "??",
pages = "92--103",
month = sep,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue May 31 08:45:28 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1630070X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Huang:2016:EDP,
author = "Shi-Yuan Huang and Chun-I Fan and Yi-Fan Tseng",
title = "Enabled\slash disabled predicate encryption in
clouds",
journal = j-FUT-GEN-COMP-SYS,
volume = "62",
number = "??",
pages = "148--160",
month = sep,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue May 31 08:45:28 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15003921",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Hulsing:2016:MMT,
author = "Andreas H{\"u}lsing and Joost Rijneveld and Fang
Song",
title = "Mitigating Multi-target Attacks in Hash-Based
Signatures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "9614",
pages = "387--416",
year = "2016",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-662-49384-7_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 31 16:25:12 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "https://link.springer.com/chapter/10.1007/978-3-662-49384-7_15",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
journal-URL = "http://link.springer.com/bookseries/558",
remark = "Proc. 19th IACR Int l Conf. Practice and Theory in
Public-Key Cryptography (PKC 16)",
}
@Article{Hurlburt:2016:MBO,
author = "G. Hurlburt",
title = "Might the Blockchain Outlive {Bitcoin}?",
journal = j-IT-PRO,
volume = "18",
number = "2",
pages = "12--16",
month = mar,
year = "2016",
CODEN = "IPMAFM",
DOI = "https://doi.org/10.1109/MITP.2016.21",
ISSN = "1520-9202 (print), 1941-045x (electronic)",
ISSN-L = "1520-9202",
bibdate = "Thu Nov 30 15:24:52 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "{IT} Professional",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6294",
keywords = "Bitcoin; blockchain; blockchain Outlive {Bitcoin};
crypto-currency; Cryptography; cryptography; Internet
technologies; Market research; mathematical hashing
process; Online banking; open source; public domain
software; Roads; Sensors; World Wide Web",
}
@Article{Imanimehr:2016:HPR,
author = "Fatemeh Imanimehr and Mehran S. Fallah",
title = "How Powerful Are Run-Time Monitors with Static
Information?",
journal = j-COMP-J,
volume = "59",
number = "11",
pages = "1623--1636",
month = nov,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw022",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Nov 4 09:11:48 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/11.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/11/1623",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "July 15, 2016",
}
@InProceedings{Ingram:2016:AMB,
author = "C. Ingram and M. Morisse",
booktitle = "2016 49th Hawaii International Conference on System
Sciences (HICSS)",
title = "Almost an {MNC}: {Bitcoin} Entrepreneurs' Use of
Collective Resources and Decoupling to Build
Legitimacy",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "4083--4092",
month = jan,
year = "2016",
DOI = "https://doi.org/10.1109/HICSS.2016.507",
ISSN = "1530-1605",
ISSN-L = "1530-1605",
bibdate = "Thu Nov 30 15:24:52 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
keywords = "Bitcoin; broader {Bitcoin} community; Context;
cryptocurrencies; Cryptography; digital community;
electronic money; Europe; larger decentralised
community act; legislation; legitimacy; local
entrepreneur seeking mainstream legitimacy; MNC; Online
banking; open source community; organisational aspects;
Protocols; Stakeholders; {Bitcoin} entrepreneur",
}
@Article{Irshad:2016:EAM,
author = "Azeem Irshad and Muhammad Sher and Shehzad Ashraf
Chaudhary and Husnain Naqvi and Mohammad Sabzinejad
Farash",
title = "An efficient and anonymous multi-server authenticated
key agreement based on chaotic map without engaging
{Registration Centre}",
journal = j-J-SUPERCOMPUTING,
volume = "72",
number = "4",
pages = "1623--1644",
month = apr,
year = "2016",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1688-9",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Mon May 30 09:17:38 MDT 2016",
bibsource = "http://link.springer.com/journal/11227/72/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-016-1688-9",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Iyengar:2016:SPS,
author = "Anirudh Iyengar and Swaroop Ghosh and Kenneth Ramclam
and Jae-Won Jang and Cheng-Wei Lin",
title = "Spintronic {PUFs} for Security, Trust, and
Authentication",
journal = j-JETC,
volume = "13",
number = "1",
pages = "4:1--4:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2809781",
ISSN = "1550-4832",
bibdate = "Sat Apr 8 10:16:07 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jetc.bib",
abstract = "We propose spintronic physically unclonable functions
(PUFs) to exploit security-specific properties of
domain wall memory (DWM) for security, trust, and
authentication. We note that the nonlinear dynamics of
domain walls (DWs) in the physical magnetic system is
an untapped source of entropy that can be leveraged for
hardware security. The spatial and temporal randomness
in the physical system is employed in conjunction with
microscopic and macroscopic properties such as
stochastic DW motion, stochastic pinning/depinning, and
serial access to realize novel relay-PUF and memory-PUF
designs. The proposed PUFs show promising results ($
\approx $50\% interdie Hamming distance (HD) and 10\%
to 20\% intradie HD) in terms of randomness, stability,
and resistance to attacks. We have investigated
noninvasive attacks, such as machine learning and
magnetic field attack, and have assessed the PUFs
resilience.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Journal on Emerging Technologies in Computing
Systems (JETC)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J967",
}
@Article{Jacobs:2016:STB,
author = "Todd A. Jacobs",
title = "Secure token-based authentication with {YubiKey 4}",
journal = j-LINUX-J,
volume = "2016",
number = "265",
pages = "1:1--1:??",
month = may,
year = "2016",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Tue Jun 7 18:42:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
URL = "http://dl.acm.org/ft_gateway.cfm?id=2953927",
abstract = "Busy Linux administrators often need to use insecure
terminals, such as a co-worker's desktop, to get their
jobs done. Todd A. Jacobs provides a modern look at
token-based authentication using YubiKey 4.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Jain:2016:APQ,
author = "Nitin Jain and Birgit Stiller and Imran Khan and
Dominique Elser and Christoph Marquardt and Gerd
Leuchs",
title = "Attacks on practical quantum key distribution systems
(and how to prevent them)",
journal = j-CONTEMP-PHYS,
volume = "57",
number = "3",
pages = "366--??",
year = "2016",
CODEN = "CTPHAF",
DOI = "https://doi.org/10.1080/00107514.2016.1148333",
ISSN = "0010-7514 (print), 1366-5812 (electronic)",
ISSN-L = "0010-7514",
bibdate = "Mon Sep 12 08:57:44 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/contempphys.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Contemporary Physics",
journal-URL = "http://www.tandfonline.com/loi/tcph20",
onlinedate = "09 Mar 2016",
}
@Article{Jho:2016:SSE,
author = "Nam-Su Jho and Ku-Young Chang and Dowon Hong and
Changho Seo",
title = "Symmetric searchable encryption with efficient range
query using multi-layered linked chains",
journal = j-J-SUPERCOMPUTING,
volume = "72",
number = "11",
pages = "4233--4246",
month = nov,
year = "2016",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-015-1497-6",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jun 24 10:31:30 MDT 2017",
bibsource = "http://link.springer.com/journal/11227/72/11;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Jiang:2016:CVI,
author = "Yijing Jiang and Shanyu Tang and Liping Zhang and
Muzhou Xiong and Yau Jim Yip",
title = "Covert Voice over {Internet} Protocol Communications
with Packet Loss Based on Fractal Interpolation",
journal = j-TOMCCAP,
volume = "12",
number = "4",
pages = "54:1--54:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2961053",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Aug 25 07:28:05 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "The last few years have witnessed an explosive growth
in the research of information hiding in multimedia
objects, but few studies have taken into account packet
loss in multimedia networks. As one of the most popular
real-time services in the Internet, Voice over Internet
Protocol (VoIP) contributes to a large part of network
traffic for its advantages of real time, high flow, and
low cost. So packet loss is inevitable in multimedia
networks and affects the performance of VoIP
communications. In this study, a fractal-based VoIP
steganographic approach was proposed to realize covert
VoIP communications in the presence of packet loss. In
the proposed scheme, secret data to be hidden were
divided into blocks after being encrypted with the
block cipher, and each block of the secret data was
then embedded into VoIP streaming packets. The VoIP
packets went through a packet-loss system based on
Gilbert model which simulates a real network situation.
And a prediction model based on fractal interpolation
was built to decide whether a VoIP packet was suitable
for data hiding. The experimental results indicated
that the speech quality degradation increased with the
escalating packet-loss level. The average variance of
speech quality metrics (PESQ score) between the
``no-embedding'' speech samples and the
``with-embedding'' stego-speech samples was about
0.717, and the variances narrowed with the increasing
packet-loss level. Both the average PESQ scores and the
SNR values of stego-speech samples and the
data-retrieving rates had almost the same varying
trends when the packet-loss level increased, indicating
that the success rate of the fractal prediction model
played an important role in the performance of covert
VoIP communications.",
acknowledgement = ack-nhfb,
articleno = "54",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Jiang:2016:MAC,
author = "Shaoquan Jiang",
title = "On message authentication with a correlated setup",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "4",
pages = "289--293",
month = apr,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Jan 5 11:59:16 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015001908",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Jiang:2016:OOC,
author = "Peng Jiang and Yi Mu and Fuchun Guo and Xiaofen Wang
and Qiaoyan Wen",
title = "Online\slash Offline Ciphertext Retrieval on Resource
Constrained Devices",
journal = j-COMP-J,
volume = "59",
number = "7",
pages = "955--969",
month = jul,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv099",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Aug 30 07:10:49 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/7/955",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 25, 2015",
}
@Article{Jiang:2016:PPT,
author = "Qi Jiang and Muhammad Khurram Khan and Xiang Lu and
Jianfeng Ma and Debiao He",
title = "A privacy preserving three-factor authentication
protocol for {e-Health} clouds",
journal = j-J-SUPERCOMPUTING,
volume = "72",
number = "10",
pages = "3826--3849",
month = oct,
year = "2016",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-015-1610-x",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jun 24 10:31:29 MDT 2017",
bibsource = "http://link.springer.com/journal/11227/72/10;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
note = "See comments \cite{Irshad:2017:CPP}.",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Jiang:2016:UTC,
author = "Qi Jiang and Jianfeng Ma and Fushan Wei and Youliang
Tian and Jian Shen and Yuanyuan Yang",
title = "An untraceable temporal-credential-based two-factor
authentication scheme using {ECC} for wireless sensor
networks",
journal = j-J-NETW-COMPUT-APPL,
volume = "76",
number = "??",
pages = "37--48",
month = dec,
year = "2016",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Thu Nov 3 11:43:14 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804516302302",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Joldzic:2016:TSA,
author = "Ognjen Joldzic and Zoran Djuric and Pavle Vuletic",
title = "A transparent and scalable anomaly-based {DoS}
detection method",
journal = j-COMP-NET-AMSTERDAM,
volume = "104",
number = "??",
pages = "27--42",
day = "20",
month = jul,
year = "2016",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Fri Jun 3 11:42:22 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128616301347",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@TechReport{Josefsson:2016:ECD,
author = "Simon Josefsson and Ilari Liusvaara",
title = "{Edwards-curve Digital Signature Algorithm (EdDSA)}",
type = "Internet Draft report",
number = "draft-irtf-cfrg-eddsa-05",
institution = "SJD AB",
address = "Stockholm 113 47, Sweden",
day = "21",
month = mar,
year = "2016",
bibdate = "Wed Jul 06 17:37:35 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://tools.ietf.org/html/draft-irtf-cfrg-eddsa-05",
acknowledgement = ack-nhfb,
remark-1 = "This on-line report proposes parameters for, and
supplies a Python implementation of, code for
encrypting and decrypting the EdDSA algorithm, along
with numerous test cases.",
remark-2 = "The authors report ``Unlike many other curves used for
cryptographic applications, these formulas are
`complete': they are valid for all points on the curve,
with no exceptions. In particular, the denominators are
non-zero for all input points.''",
}
@Article{Kamp:2016:MEM,
author = "Poul-Henning Kamp",
title = "More encryption means less privacy",
journal = j-CACM,
volume = "59",
number = "4",
pages = "40--42",
month = apr,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2890774",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Fri Apr 15 14:58:10 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/4/200167/fulltext",
abstract = "Retaining electronic privacy requires more political
engagement.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Kang:2016:DSA,
author = "Jungho Kang and Geunil Park and Jong Hyuk Park",
title = "Design of secure authentication scheme between devices
based on zero-knowledge proofs in home automation
service environments",
journal = j-J-SUPERCOMPUTING,
volume = "72",
number = "11",
pages = "4319--4336",
month = nov,
year = "2016",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1856-y",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jun 24 10:31:30 MDT 2017",
bibsource = "http://link.springer.com/journal/11227/72/11;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Khalid:2016:RHL,
author = "Ayesha Khalid and Goutam Paul and Anupam Chattopadhyay
and Faezeh Abediostad and Syed Imad Ud Din and Muhammad
Hassan and Baishik Biswas and Prasanna Ravi",
title = "{RunStream}: a High-Level Rapid Prototyping Framework
for Stream Ciphers",
journal = j-TECS,
volume = "15",
number = "3",
pages = "61:1--61:??",
month = jul,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2891412",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Jul 21 17:18:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "We present RunStream, a rapid prototyping framework
for realizing stream cipher implementations based on
algorithmic specifications and architectural
customizations desired by the users. In the dynamic
world of cryptography where newer recommendations are
frequently proposed, the need of such tools is
imperative. It carries out design validation and
generates an optimized software implementation and a
synthesizable Register Transfer Level Verilog
description. Our framework enables speedy benchmarking
against critical resources like area, throughput,
power, and latency and allows exploration of
alternatives. Using RunStream, we successfully
implemented various stream ciphers and benchmarked the
quality of results to be at par with published
hand-optimized implementations.",
acknowledgement = ack-nhfb,
articleno = "61",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Khamsemanan:2016:BBU,
author = "Nirattaya Khamsemanan and Rafail Ostrovsky and William
E. Skeith",
title = "On the Black-box Use of Somewhat Homomorphic
Encryption in NonInteractive Two-Party Protocols",
journal = j-SIAM-J-DISCR-MATH,
volume = "30",
number = "1",
pages = "266--295",
month = "????",
year = "2016",
CODEN = "SJDMEC",
DOI = "https://doi.org/10.1137/110858835",
ISSN = "0895-4801 (print), 1095-7146 (electronic)",
ISSN-L = "0895-4801",
bibdate = "Mon Jun 20 12:15:50 MDT 2016",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SIDMA/30/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/siamjdiscrmath.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Discrete Mathematics",
journal-URL = "http://epubs.siam.org/sidma",
onlinedate = "January 2016",
}
@Article{Khan:2016:BSW,
author = "Abid Khan and Farhana Jabeen and Farah Naz and Sabah
Suhail and Mansoor Ahmed and Sarfraz Nawaz",
title = "Buyer seller watermarking protocols issues and
challenges --- a survey",
journal = j-J-NETW-COMPUT-APPL,
volume = "75",
number = "??",
pages = "317--334",
month = nov,
year = "2016",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Thu Nov 3 11:43:14 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804516301941",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Khedr:2016:SSH,
author = "Alhassan Khedr and Glenn Gulak and Vinod
Vaikuntanathan",
title = "{SHIELD}: Scalable Homomorphic Implementation of
Encrypted Data-Classifiers",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "9",
pages = "2848--2858",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2500576",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Aug 10 09:04:52 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Kim:2016:DBM,
author = "Yonggon Kim and Ohmin Kwon and Jinsoo Jang and
Seongwook Jin and Hyeongboo Baek and Brent Byunghoon
Kang and Hyunsoo Yoon",
title = "On-demand bootstrapping mechanism for isolated
cryptographic operations on commodity accelerators",
journal = j-COMPUT-SECUR,
volume = "62",
number = "??",
pages = "33--48",
month = sep,
year = "2016",
CODEN = "CPSEDU",
DOI = "https://doi.org/10.1016/j.cose.2016.06.006",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:46 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404816300712",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Kim:2016:EPE,
author = "Intae Kim and Seong Oun Hwang and Jong Hwan Park and
Chanil Park",
title = "An Efficient Predicate Encryption with Constant
Pairing Computations and Minimum Costs",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "10",
pages = "2947--2958",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2526000",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Sep 13 06:19:58 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Kim:2016:MAS,
author = "Soon Seok Kim",
title = "Mutual authentication scheme between biosensor device
and data manager in healthcare environment",
journal = j-J-SUPERCOMPUTING,
volume = "72",
number = "1",
pages = "177--184",
month = jan,
year = "2016",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-015-1536-3",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Apr 7 12:01:24 MDT 2016",
bibsource = "http://link.springer.com/journal/11227/72/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-015-1536-3",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Kobayashi:2016:ASC,
author = "Kei Kobayashi and Yosuke Totani and Keisuke Utsu and
Hiroshi Ishii",
title = "Achieving secure communication over {MANET} using
secret sharing schemes",
journal = j-J-SUPERCOMPUTING,
volume = "72",
number = "3",
pages = "1215--1225",
month = mar,
year = "2016",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1657-3",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Apr 7 12:01:25 MDT 2016",
bibsource = "http://link.springer.com/journal/11227/72/3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-016-1657-3",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Koblitz:2016:RWE,
author = "Neal Koblitz and Alfred Menezes",
title = "A Riddle Wrapped in an Enigma",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "6",
pages = "34--42",
month = nov # "\slash " # dec,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Sat Feb 25 10:03:53 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/06/msp2016060034-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Kocabas:2016:ESM,
author = "Ovunc Kocabas and Tolga Soyata and Mehmet K. Aktas",
title = "Emerging security mechanisms for medical cyber
physical systems",
journal = j-TCBB,
volume = "13",
number = "3",
pages = "401--416",
month = may,
year = "2016",
CODEN = "ITCBCY",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Mon Aug 29 06:50:39 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "The following decade will witness a surge in remote
health-monitoring systems that are based on body-worn
monitoring devices. These Medical Cyber Physical
Systems (MCPS) will be capable of transmitting the
acquired data to a private or public cloud for storage
and processing. Machine learning algorithms running in
the cloud and processing this data can provide decision
support to healthcare professionals. There is no doubt
that the security and privacy of the medical data is
one of the most important concerns in designing an
MCPS. In this paper, we depict the general architecture
of an MCPS consisting of four layers: data acquisition,
data aggregation, cloud processing, and action. Due to
the differences in hardware and communication
capabilities of each layer, different encryption
schemes must be used to guarantee data privacy within
that layer. We survey conventional and emerging
encryption schemes based on their ability to provide
secure storage, data sharing, and secure computation.
Our detailed experimental evaluation of each scheme
shows that while the emerging encryption schemes enable
exciting new features such as secure sharing and secure
computation, they introduce several orders-of-magnitude
computational and storage overhead. We conclude our
paper by outlining future research directions to
improve the usability of the emerging encryption
schemes in an MCPS.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@Article{Kubota:2016:SAV,
author = "Takahiro Kubota and Yoshihiko Kakutani and Go Kato and
Yasuhito Kawano and Hideki Sakurada",
title = "Semi-automated verification of security proofs of
quantum cryptographic protocols",
journal = j-J-SYMBOLIC-COMP,
volume = "73",
number = "??",
pages = "192--220",
month = mar # "\slash " # apr,
year = "2016",
CODEN = "JSYCEH",
ISSN = "0747-7171 (print), 1095-855X (electronic)",
ISSN-L = "0747-7171",
bibdate = "Fri Aug 28 06:46:33 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0747717115000462",
acknowledgement = ack-nhfb,
fjournal = "Journal of Symbolic Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/07477171/",
}
@Article{Kumari:2016:APW,
author = "Shipra Kumari and Hari Om",
title = "Authentication protocol for wireless sensor networks
applications like safety monitoring in coal mines",
journal = j-COMP-NET-AMSTERDAM,
volume = "104",
number = "??",
pages = "137--154",
day = "20",
month = jul,
year = "2016",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Fri Jun 3 11:42:22 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128616301384",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Kumari:2016:UFM,
author = "Saru Kumari and Xiong Li and Fan Wu and Ashok Kumar
Das and Hamed Arshad and Muhammad Khurram Khan",
title = "A user friendly mutual authentication and key
agreement scheme for wireless sensor networks using
chaotic maps",
journal = j-FUT-GEN-COMP-SYS,
volume = "63",
number = "??",
pages = "56--75",
month = oct,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Aug 24 08:13:41 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16300930",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Kuo:2016:SDD,
author = "Wen-Chung Kuo and Chun-Cheng Wang and Hong-Ching Hou",
title = "Signed digit data hiding scheme",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "2",
pages = "183--191",
month = feb,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Nov 28 07:11:23 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015001404",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Labati:2016:BRA,
author = "Ruggero Donida Labati and Angelo Genovese and Enrique
Mu{\~n}oz and Vincenzo Piuri and Fabio Scotti and
Gianluca Sforza",
title = "Biometric Recognition in Automated Border Control: a
Survey",
journal = j-COMP-SURV,
volume = "49",
number = "2",
pages = "24:1--24:??",
month = sep,
year = "2016",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2933241",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Tue Nov 8 16:12:56 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "The increasing demand for traveler clearance at
international border crossing points (BCPs) has
motivated research for finding more efficient
solutions. Automated border control (ABC) is emerging
as a solution to enhance the convenience of travelers,
the throughput of BCPs, and national security. This is
the first comprehensive survey on the biometric
techniques and systems that enable automatic identity
verification in ABC. We survey the biometric literature
relevant to identity verification and summarize the
best practices and biometric techniques applicable to
ABC, relying on real experience collected in the field.
Furthermore, we select some of the major biometric
issues raised and highlight the open research areas.",
acknowledgement = ack-nhfb,
articleno = "24",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Lai:2016:GGB,
author = "Chengzhe Lai and Rongxing Lu and Dong Zheng and Hui Li
and Xuemin (Sherman) Shen",
title = "{GLARM}: Group-based lightweight authentication scheme
for resource-constrained machine to machine
communications",
journal = j-COMP-NET-AMSTERDAM,
volume = "99",
number = "??",
pages = "66--81",
day = "22",
month = apr,
year = "2016",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Tue Apr 5 07:16:46 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128616300238",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Lao:2016:BFD,
author = "Yingjie Lao and Qianying Tang and Chris H. Kim and
Keshab K. Parhi",
title = "Beat Frequency Detector-Based High-Speed True Random
Number Generators: Statistical Modeling and Analysis",
journal = j-JETC,
volume = "13",
number = "1",
pages = "9:1--9:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2866574",
ISSN = "1550-4832",
bibdate = "Sat Apr 8 10:16:07 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/jetc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jetc.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
abstract = "True random number generators (TRNGs) are crucial
components for the security of cryptographic systems.
In contrast to pseudo--random number generators
(PRNGs), TRNGs provide higher security by extracting
randomness from physical phenomena. To evaluate a TRNG,
statistical properties of the circuit model and raw
bitstream should be studied. In this article, a model
for the beat frequency detector--based high-speed TRNG
(BFD-TRNG) is proposed. The parameters of the model are
extracted from the experimental data of a test chip. A
statistical analysis of the proposed model is carried
out to derive mean and variance of the counter values
of the TRNG. Our statistical analysis results show that
mean of the counter values is inversely proportional to
the frequency difference of the two ring oscillators
(ROSCs), whereas the dynamic range of the counter
values increases linearly with standard deviation of
environmental noise and decreases with increase of the
frequency difference. Without the measurements from the
test data, a model cannot be created; similarly,
without a model, performance of a TRNG cannot be
predicted. The key contribution of the proposed
approach lies in fitting the model to measured data and
the ability to use the model to predict performance of
BFD-TRNGs that have not been fabricated. Several novel
alternate BFD-TRNG architectures are also proposed;
these include parallel BFD, cascade BFD, and
parallel-cascade BFD. These TRNGs are analyzed using
the proposed model, and it is shown that the parallel
BFD structure requires less area per bit, whereas the
cascade BFD structure has a larger dynamic range while
maintaining the same mean of the counter values as the
original BFD-TRNG. It is shown that 3.25 M and 4 M
random bits can be obtained per counter value from
parallel BFD and parallel-cascade BFD, respectively,
where M counter values are computed in parallel.
Furthermore, the statistical analysis results
illustrate that BFD-TRNGs have better randomness and
less cost per bit than other existing ROSC-TRNG
designs. For example, it is shown that BFD-TRNGs
accumulate 150\% more jitter than the original
two-oscillator TRNG and that parallel BFD-TRNGs require
one-third power and one-half area for same number of
random bits for a specified period.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Journal on Emerging Technologies in Computing
Systems (JETC)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J967",
}
@Article{Le:2016:ADS,
author = "Anh Le and Athina Markopoulou and Alexandros G.
Dimakis",
title = "Auditing for Distributed Storage Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2182--2195",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2450761",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Distributed storage codes have recently received a lot
of attention in the community. Independently, another
body of work has proposed integrity-checking schemes
for cloud storage, none of which, however, is
customized for coding-based storage or can efficiently
support repair. In this work, we bridge the gap between
these two currently disconnected bodies of work. We
propose {\sf NC-Audit}, a novel cryptography-based
remote data integrity-checking scheme, designed
specifically for network-coding-based distributed
storage systems. {\sf NC-Audit} combines, for the first
time, the following desired properties: (1) efficient
checking of data integrity; (2) efficient support for
repairing failed nodes; and (3) protection against
information leakage when checking is performed by a
third party. The key ingredient of the design of {\sf
NC-Audit} is a novel combination of {\sf SpaceMac}, a
homomorphic message authentication code MAC scheme for
network coding, and {\sf NCrypt}, a novel
chosen-plaintext attack CPA secure encryption scheme
that preserves the correctness of {\sf SpaceMac}. Our
evaluation of {\sf NC-Audit} based on a real Java
implementation shows that the proposed scheme has
significantly lower overhead compared to the
state-of-the-art schemes for both auditing and
repairing of failed nodes.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Ledin:2016:RME,
author = "George {Ledin, Jr.}",
title = "Review of: {{\booktitle{The Mathematics of Encryption:
An Elementary Introduction}} by Margaret Cozzens and
Steven J. Miller}",
journal = j-SIGACT,
volume = "47",
number = "3",
pages = "19--21",
month = sep,
year = "2016",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2993749.2993755",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
bibdate = "Sat Mar 11 17:49:13 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Lee:2016:AGA,
author = "Hyung Tae Lee and San Ling and Huaxiong Wang",
title = "Analysis of {Gong} et al.'s {CCA2}-secure homomorphic
encryption",
journal = j-THEOR-COMP-SCI,
volume = "640",
number = "??",
pages = "104--114",
day = "9",
month = aug,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Jun 30 08:05:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S030439751630250X",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Lee:2016:CAM,
author = "Hyung Tae Lee and San Ling and Jae Hong Seo and
Huaxiong Wang",
title = "{CCA2} Attack and Modification of {Huang} et al.'s
Public Key Encryption with Authorized Equality Test",
journal = j-COMP-J,
volume = "59",
number = "11",
pages = "1689--1694",
month = nov,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw033",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Nov 4 09:11:48 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/11.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/11/1689",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "July 13, 2016",
}
@Article{Li:2016:BMA,
author = "Fuxiang Li and Fucai Zhou and Heqing Yuan and Zifeng
Xu and Qiang Wang",
title = "Bilinear-map accumulator-based verifiable intersection
operations on encrypted data in cloud",
journal = j-CCPE,
volume = "28",
number = "11",
pages = "3238--3253",
day = "10",
month = aug,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3783",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue Sep 13 08:30:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Li:2016:CBK,
author = "Jiguo Li and Haiting Du and Yichen Zhang",
title = "Certificate-Based Key-Insulated Signature in the
Standard Model",
journal = j-COMP-J,
volume = "59",
number = "7",
pages = "1028--1039",
month = jul,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv115",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Aug 30 07:10:49 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/7/1028",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "January 6, 2016",
}
@Article{Li:2016:DDA,
author = "Xinghua Li and Ermeng Wang and Weidong Yang and
Jianfeng Ma",
title = "{DALP}: a demand-aware location privacy protection
scheme in continuous location-based services",
journal = j-CCPE,
volume = "28",
number = "4",
pages = "1219--1236",
day = "25",
month = mar,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3613",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sun Apr 3 12:34:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "6 Nov 2015",
}
@Article{Li:2016:IRI,
author = "Xinran Li and Chen-Hui Jin and Fang-Wei Fu",
title = "Improved Results of Impossible Differential
Cryptanalysis on Reduced {FOX}",
journal = j-COMP-J,
volume = "59",
number = "4",
pages = "541--548",
month = apr,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv073",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Mar 28 10:52:39 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/4/541",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 4, 2015",
}
@Article{Li:2016:LRC,
author = "Jiguo Li and Meilin Teng and Yichen Zhang and Qihong
Yu",
title = "A Leakage-Resilient {CCA}-Secure Identity-Based
Encryption Scheme",
journal = j-COMP-J,
volume = "59",
number = "7",
pages = "1066--1075",
month = jul,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv128",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Aug 30 07:10:49 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/7/1066",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "January 20, 2016",
}
@Article{Libert:2016:BRD,
author = "Beno{\^\i}t Libert and Marc Joye and Moti Yung",
title = "Born and raised distributively: Fully distributed
non-interactive adaptively-secure threshold signatures
with short shares",
journal = j-THEOR-COMP-SCI,
volume = "645",
number = "??",
pages = "1--24",
day = "13",
month = sep,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Aug 31 08:27:17 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397516001626",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Lim:2016:AKE,
author = "Hoon Wei Lim and Guomin Yang",
title = "Authenticated Key Exchange Protocols for Parallel
Network File Systems",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "27",
number = "1",
pages = "92--105",
month = jan,
year = "2016",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2015.2388447",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Tue Dec 15 09:28:10 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://www.computer.org/csdl/trans/td/2016/01/07004049-abs.html",
abstract-URL = "http://www.computer.org/csdl/trans/td/2016/01/07004049-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Lin:2016:SCU,
author = "Jingqiang Lin and Bo Luo and Le Guan and Jiwu Jing",
title = "Secure Computing Using Registers and Caches: The
Problem, Challenges, and Solutions",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "6",
pages = "63--70",
month = nov # "\slash " # dec,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Sat Feb 25 10:03:53 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/06/msp2016060063-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Liu:2016:EPP,
author = "Joseph K. Liu and Willy Susilo and Tsz Hon Yuen and
Man Ho Au and Junbin Fang and Zoe L. Jiang and Jianying
Zhou",
title = "Efficient Privacy-Preserving Charging Station
Reservation System for Electric Vehicles",
journal = j-COMP-J,
volume = "59",
number = "7",
pages = "1040--1053",
month = jul,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv117",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Aug 30 07:10:49 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/7/1040",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "January 6, 2016",
}
@Article{Liu:2016:EQD,
author = "Yang Liu and Zhu Cao and Cheng Wu and Daiji Fukuda and
Lixing You and Jiaqiang Zhong and Takayuki Numata and
Sijing Chen and Weijun Zhang and Sheng-Cai Shi and
Chao-Yang Lu and Zhen Wang and Xiongfeng Ma and Jingyun
Fan and Qiang Zhang and Jian-Wei Pan",
title = "Experimental quantum data locking",
journal = j-PHYS-REV-A,
volume = "94",
number = "2",
pages = "020301",
month = aug,
year = "2016",
CODEN = "PLRAAN",
DOI = "https://doi.org/10.1103/PhysRevA.94.020301",
ISSN = "1050-2947 (print), 1094-1622, 1538-4446, 1538-4519",
ISSN-L = "1050-2947",
bibdate = "Wed Sep 7 10:13:33 2016",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://link.aps.org/doi/10.1103/PhysRevA.94.020301",
acknowledgement = ack-nhfb,
fjournal = "Physical Review A (Atomic, Molecular, and Optical
Physics)",
journal-URL = "http://pra.aps.org/browse",
pagecount = "5",
remark = "See also \cite{Lum:2016:QEM}.",
}
@Article{Liu:2016:FIT,
author = "Joseph K. Liu and Sze Ling Yeo and Wun-She Yap and
Sherman S. M. Chow and Duncan S. Wong and Willy
Susilo",
title = "Faulty Instantiations of Threshold Ring Signature from
Threshold Proof-of-Knowledge Protocol",
journal = j-COMP-J,
volume = "59",
number = "7",
pages = "945--954",
month = jul,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv098",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Aug 30 07:10:49 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/7/945",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 2, 2015",
}
@Article{Liu:2016:LCP,
author = "Guo-Qiang Liu and Chen-Hui Jin",
title = "Linear Cryptanalysis of {PRESENT}-like Ciphers with
Secret Permutation",
journal = j-COMP-J,
volume = "59",
number = "4",
pages = "549--558",
month = apr,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv074",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Mar 28 10:52:39 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/4/549",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 18, 2015",
}
@Article{Liu:2016:LCR,
author = "Yu Liu and Kai Fu and Wei Wang and Ling Sun and Meiqin
Wang",
title = "Linear cryptanalysis of reduced-round {SPECK}",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "3",
pages = "259--266",
month = mar,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Dec 21 18:30:17 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015001891",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Liu:2016:NOP,
author = "Zheli Liu and Xiaofeng Chen and Jun Yang and Chunfu
Jia and Ilsun You",
title = "New order preserving encryption model for outsourced
databases in cloud environments",
journal = j-J-NETW-COMPUT-APPL,
volume = "59",
number = "??",
pages = "198--207",
month = jan,
year = "2016",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Feb 8 11:55:17 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804514001350",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Liu:2016:NSC,
author = "Fangfei Liu and Hao Wu and Kenneth Mai and Ruby B.
Lee",
title = "Newcache: Secure Cache Architecture Thwarting Cache
Side-Channel Attacks",
journal = j-IEEE-MICRO,
volume = "36",
number = "5",
pages = "8--16",
month = sep # "\slash " # oct,
year = "2016",
CODEN = "IEMIDZ",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Tue Nov 1 14:24:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib",
URL = "https://www.computer.org/csdl/mags/mi/2016/05/mmi2016050008-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@Article{Liu:2016:PAB,
author = "Zhen Liu and Duncan S. Wong",
title = "Practical Attribute-Based Encryption: Traitor Tracing,
Revocation and Large Universe",
journal = j-COMP-J,
volume = "59",
number = "7",
pages = "983--1004",
month = jul,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv101",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Aug 30 07:10:49 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/7/983",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "November 23, 2015",
}
@Article{Liu:2016:PPO,
author = "Ximeng Liu and Baodong Qin and Robert H. Deng and
Rongxing Lu and Jianfeng Ma",
title = "A Privacy-Preserving Outsourced Functional Computation
Framework Across Large-Scale Multiple Encrypted
Domains",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "12",
pages = "3567--3579",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2543220",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Nov 10 05:41:07 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Lu:2016:PFC,
author = "Yang Lu and Jiguo Li",
title = "A pairing-free certificate-based proxy re-encryption
scheme for secure data sharing in public clouds",
journal = j-FUT-GEN-COMP-SYS,
volume = "62",
number = "??",
pages = "140--147",
month = sep,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue May 31 08:45:28 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1500360X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Lu:2016:PSC,
author = "Yang Lu and Jiguo Li",
title = "Provably secure certificateless proxy signature scheme
in the standard model",
journal = j-THEOR-COMP-SCI,
volume = "639",
number = "??",
pages = "42--59",
day = "1",
month = aug,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Jun 23 07:43:06 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397516301554",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Lukasiewycz:2016:SAO,
author = "Martin Lukasiewycz and Philipp Mundhenk and Sebastian
Steinhorst",
title = "Security-Aware Obfuscated Priority Assignment for
Automotive {CAN} Platforms",
journal = j-TODAES,
volume = "21",
number = "2",
pages = "32:1--32:??",
month = jan,
year = "2016",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/2831232",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Sat Feb 6 07:43:40 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "Security in automotive in-vehicle networks is an
increasing problem with the growing connectedness of
road vehicles. This article proposes a security-aware
priority assignment for automotive controller area
network (CAN) platforms with the aim of mitigating
scaling effects of attacks on vehicle fleets. CAN is
the dominating field bus in the automotive domain due
to its simplicity, low cost, and robustness. While
messages might be encrypted to enhance the security of
CAN systems, their priorities are usually identical for
automotive platforms, comprising generally a large
number of vehicle models. As a result, the identifier
uniquely defines which message is sent, allowing
attacks to scale across a fleet of vehicles with the
same platform. As a remedy, we propose a methodology
that is capable of determining obfuscated message
identifiers for each individual vehicle. Since
identifiers directly represent message priorities, the
approach has to take the resulting response time
variations into account while satisfying application
deadlines for each vehicle schedule separately. Our
approach relies on Quadratically Constrained Quadratic
Program (QCQP) solving in two stages, specifying first
a set of feasible fixed priorities and subsequently
bounded priorities for each message. With the obtained
bounds, obfuscated identifiers are determined, using a
very fast randomized sampling. The experimental
results, consisting of a large set of synthetic test
cases and a realistic case study, give evidence of the
efficiency of the proposed approach in terms of
scalability. The results also show that the diversity
of obtained identifiers is effectively optimized with
our approach, resulting in a very good obfuscation of
CAN messages in in-vehicle communication.",
acknowledgement = ack-nhfb,
articleno = "32",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Lum:2016:QEM,
author = "Daniel J. Lum and John C. Howell and M. S. Allman and
Thomas Gerrits and Varun B. Verma and Sae Woo Nam and
Cosmo Lupo and Seth Lloyd",
title = "Quantum enigma machine: Experimentally demonstrating
quantum data locking",
journal = j-PHYS-REV-A,
volume = "94",
number = "2",
pages = "022315",
month = aug,
year = "2016",
CODEN = "PLRAAN",
DOI = "https://doi.org/10.1103/PhysRevA.94.022315",
ISSN = "1050-2947 (print), 1094-1622, 1538-4446, 1538-4519",
ISSN-L = "1050-2947",
bibdate = "Wed Sep 7 09:59:24 2016",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://link.aps.org/doi/10.1103/PhysRevA.94.022315",
abstract = "Shannon proved in 1949 that
information-theoretic-secure encryption is possible if
the encryption key is used only once, is random, and is
at least as long as the message itself.
Notwithstanding, when information is encoded in a
quantum system, the phenomenon of quantum data locking
allows one to encrypt a message with a shorter key and
still provide information-theoretic security. We
present one of the first feasible experimental
demonstrations of quantum data locking for direct
communication and propose a scheme for a quantum enigma
machine that encrypts 6 bits per photon (containing
messages, new encryption keys, and forward error
correction bits) with less than 6 bits per photon of
encryption key while remaining
information-theoretically secure.",
acknowledgement = ack-nhfb,
fjournal = "Physical Review A (Atomic, Molecular, and Optical
Physics)",
journal-URL = "http://pra.aps.org/browse",
pagecount = "10",
}
@Article{Lychev:2016:RSI,
author = "Robert Lychev and Michael Schapira and Sharon
Goldberg",
title = "Rethinking security for {Internet} routing",
journal = j-CACM,
volume = "59",
number = "10",
pages = "48--57",
month = oct,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2896817",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed Sep 28 06:26:12 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/10/207763/fulltext",
abstract = "Combine simple whitelisting technology, notably prefix
filtering, in most BGP-speaking routers with weaker
cryptographic protocols.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Book{Maffeo:2016:UNC,
author = "Steven E. Maffeo",
title = "{U.S. Navy} codebreakers, linguists, and intelligence
officers against {Japan}, 1910--1941: a biographical
dictionary",
publisher = "Rowan and Littlefield",
address = "Lanham, MD, USA",
year = "2016",
ISBN = "1-4422-5563-3, 1-4422-5564-1 (e-book)",
ISBN-13 = "978-1-4422-5563-0, 978-1-4422-5564-7 (e-book)",
LCCN = "D810.S7 M2535 2015eb",
bibdate = "Thu Dec 28 09:55:46 MST 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "This unique reference presents 59 biographies of
people who were key to the sea services being
reasonably prepared to fight the Japanese Empire when
the Second World War broke out, and whose advanced work
proved crucial. These intelligence pioneers invented
techniques, procedures, and equipment from scratch, not
only allowing the United States to hold its own in the
Pacific despite the loss of most of its Fleet at Pearl
Harbor, but also laying the foundation of today's
intelligence methods and agencies.",
acknowledgement = ack-nhfb,
subject = "Cryptographers; United States; Biography;
Dictionaries; Linguists; Intelligence officers; World
War, 1939--1945; Cryptography; Campaigns; Japan;
Biography and Autobiography; General; Technology and
Engineering; Marine and Naval; Military Science;
Cryptographers; Cryptography; Intelligence officers;
Linguists; Military campaigns",
tableofcontents = "Acronyms and Abbreviations \\
Foreword \\
Author's Foreword \\
Acknowledgments \\
Introduction \\
Illustrations \\
The Scanners. Radio Direction Finders and Radio Traffic
Analysts \\
The Book Breakers. Cryptographers, Cryptanalysts, and
Codebreakers \\
The Blue Sky Merchants. Linguists, Translators, and
Intelligence Officers \\
The ``Hybrids''. Multiskilled and Multiproficient \\
Appendix A. What's a Code, and What's a Cipher? \\
Appendix B. Chronology of Select Highlights, U.S. Navy
Radio Intelligence, Pacific Area of Operations
1916--1941 \\
Appendix C. Directors of U.S. Naval Intelligence,
1909--1942 \\
Appendix D. Directors of U.S. Naval Communications
1912--1942 \\
Appendix E. U.S. Naval Attach{\'e}s in Tokyo,
1914--1941 \\
Appendix F. U.S. Navy, Office of the Chief of Naval
Operations, Section ``OP-20-G'' and Its Antecedents \\
Appendix G. Officers in Charge, Office of Naval
Communications, Code and Signal Section, ``Research
Desk'' (OP-20-GX) \\
Appendix H. Officers in Charge, Office of Naval
Communications, Code and Signal Section, Translation
Section (OP-20-GZ) \\
Appendix I. Growth of U.S. Navy Radio Intelligence \\
Appendix J. U.S. Naval Radio Intelligence, Primarily
Focused upon Japan, as of December 1941 \\
Appendix K. Station HYPO, Territory of Hawaii \\
Appendix L. U.S. Navy and U.S. Marine Corps Japanese
Language\slash Culture Officers Immersed in Japan,
1910--1941 \\
Appendix M. The ``On-the-Roof Gang'' \\
Appendix N. Operation VENGEANCE \\
Suggested Reading \\
Glossary \\
Index \\
About the Author",
}
@Article{Mailloux:2016:PSS,
author = "Logan O. Mailloux and Michael A. McEvilley and Stephen
Khou and John M. Pecarina",
title = "Putting the {`Systems'} in Security Engineering: An
Examination of {NIST Special Publication 800-160}",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "4",
pages = "76--80",
month = jul # "\slash " # aug,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Nov 17 08:21:28 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/04/msp2016040076-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "https://publications.computer.org/security-and-privacy/",
keywords = "National Institute of Standards and Technology (NIST)
Special Publication 800-160 Systems Security
Engineering: Considerations for a Multidisciplinary
Approach in the Engineering of Trustworthy Secure
Systems",
}
@Article{Mandal:2016:DIW,
author = "Kalikinkar Mandal and Xinxin Fan and Guang Gong",
title = "Design and Implementation of {Warbler} Family of
Lightweight Pseudorandom Number Generators for Smart
Devices",
journal = j-TECS,
volume = "15",
number = "1",
pages = "1:1--1:??",
month = feb,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2808230",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Wed Jun 8 09:43:30 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "With the advent of ubiquitous computing and the
Internet of Things (IoT), the security and privacy
issues for various smart devices such as
radio-frequency identification (RFID) tags and wireless
sensor nodes are receiving increased attention from
academia and industry. A number of lightweight
cryptographic primitives have been proposed to provide
security services for resource-constrained smart
devices. As one of the core primitives, a
cryptographically secure pseudorandom number generator
(PRNG) plays an important role for lightweight embedded
applications. The most existing PRNGs proposed for
smart devices employ true random number generators as a
component, which generally incur significant power
consumption and gate count in hardware. In this
article, we present Warbler family, a new pseudorandom
number generator family based on nonlinear feedback
shift registers (NLFSRs) with desirable randomness
properties. The design of the Warbler family is based
on the combination of modified de Bruijn blocks
together with a nonlinear feedback Welch-Gong (WG)
sequence generator, which enables us to precisely
characterize the randomness properties and to flexibly
adjust the security level of the resulting PRNG. Some
criteria for selecting parameters of the Warbler family
are proposed to offer the maximum level of security.
Two instances of the Warbler family are also described,
which feature two different security levels and are
dedicated to EPC C1 Gen2 RFID tags and wireless sensor
nodes, respectively. The security analysis shows that
the proposed instances not only can pass the
cryptographic statistical tests recommended by the EPC
C1 Gen2 standard and NIST but also are resistant to the
cryptanalytic attacks such as algebraic attacks, cube
attacks, time-memory-data tradeoff attacks,
Mihaljevi{\'c} et al.'s attacks, and weak internal
state and fault injection attacks. Our ASIC
implementations using a 65nm CMOS process demonstrate
that the proposed two lightweight instances of the
Warbler family can achieve good performance in terms of
speed and area and provide ideal solutions for securing
low-cost smart devices.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Manimehalai:2016:NRR,
author = "P. Manimehalai and P. Arockia Jansi Rani",
title = "A New Robust Reversible Blind Watermarking in
Wavelet-Domain for Color Images",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "16",
number = "2",
pages = "1650006",
month = apr,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467816500066",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Thu May 5 06:44:22 MDT 2016",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Mazumdar:2016:CIS,
author = "Bodhisatwa Mazumdar and Sk. Subidh Ali and Ozgur
Sinanoglu",
title = "A Compact Implementation of {Salsa20} and Its Power
Analysis Vulnerabilities",
journal = j-TODAES,
volume = "22",
number = "1",
pages = "11:1--11:??",
month = dec,
year = "2016",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/2934677",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Jul 21 10:49:29 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "In this article, we present a compact implementation
of the Salsa20 stream cipher that is targeted towards
lightweight cryptographic devices such as
radio-frequency identification (RFID) tags. The Salsa20
stream cipher, ann addition-rotation-XOR (ARX) cipher,
is used for high-security cryptography in NEON
instruction sets embedded in ARM Cortex A8 CPU
core-based tablets and smartphones. The existing
literature shows that although classical cryptanalysis
has been effective on reduced rounds of Salsa20, the
stream cipher is immune to software side-channel
attacks such as branch timing and cache timing attacks.
To the best of our knowledge, this work is the first to
perform hardware power analysis attacks, where we
evaluate the resistance of all eight keywords in the
proposed compact implementation of Salsa20. Our
technique targets the three subrounds of the first
round of the implemented Salsa20. The correlation power
analysis (CPA) attack has an attack complexity of
2$^{19}$. Based on extensive experiments on a compact
implementation of Salsa20, we demonstrate that all
these keywords can be recovered within 20,000 queries
on Salsa20. The attacks show a varying resilience of
the key words against CPA that has not yet been
observed in any stream or block cipher in the present
literature. This makes the architecture of this stream
cipher interesting from the side-channel analysis
perspective. Also, we propose a lightweight
countermeasure that mitigates the leakage in the power
traces as shown in the results of Welch's t -test
statistics. The hardware area overhead of the proposed
countermeasure is only 14\% and is designed with
compact implementation in mind.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{McGraw:2016:SBTd,
author = "Gary McGraw",
title = "{Silver Bullet} Talks with {Martin Hellman}",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "4",
pages = "7--11",
month = jul # "\slash " # aug,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Nov 17 08:21:28 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/04/msp2016040007.html",
acknowledgement = ack-nhfb,
journal-URL = "https://publications.computer.org/security-and-privacy/",
}
@Article{McGrew:2016:SMH,
author = "Daniel McGrew and Panos Kampanakis and Scott Fluhrer
and Stefan-Lukas Gazdag and Denis Butin and Johannes
Buchmann",
title = "State Management for Hash-Based Signatures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "10074",
pages = "244--260",
year = "2016",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-319-49100-4_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 31 16:21:47 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "https://link.springer.com/chapter/10.1007/978-3-319-49100-4_11",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
journal-URL = "http://link.springer.com/bookseries/558",
remark = "Proceedings of the 3rd International Conference on
Security Standardization Research (SSR 16).",
}
@Article{Meiklejohn:2016:FBC,
author = "Sarah Meiklejohn and Marjori Pomarole and Grant Jordan
and Kirill Levchenko and Damon McCoy and Geoffrey M.
Voelker and Stefan Savage",
title = "A fistful of {Bitcoins}: characterizing payments among
men with no names",
journal = j-CACM,
volume = "59",
number = "4",
pages = "86--93",
month = apr,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2896384",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Fri Apr 15 14:58:10 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/4/200174/fulltext",
abstract = "Bitcoin is a purely online virtual currency, unbacked
by either physical commodities or sovereign obligation;
instead, it relies on a combination of cryptographic
protection and a peer-to-peer protocol for witnessing
settlements. Consequently, Bitcoin has the unintuitive
property that while the ownership of money is
implicitly anonymous, its flow is globally visible. In
this paper we explore this unique characteristic
further, using heuristic clustering to group Bitcoin
wallets based on evidence of shared authority, and then
using re-identification attacks (i.e., empirical
purchasing of goods and services) to classify the
operators of those clusters. From this analysis, we
consider the challenges for those seeking to use
Bitcoin for criminal or fraudulent purposes at scale.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@InProceedings{Meloni:2016:RDR,
author = "Nicolas M{\'e}loni and M. Anwar Hasan",
title = "Random Digit Representation of Integers",
crossref = "Montuschi:2016:ISC",
pages = "118--125",
year = "2016",
DOI = "https://doi.org/10.1109/ARITH.2016.11",
bibdate = "Fri Dec 16 15:17:20 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = ack-nhfb,
keywords = "ARITH-23; modular exponentiation",
}
@Article{Mendez:2016:PES,
author = "Alejandro P{\'e}rez M{\'e}ndez and Rafael Mar{\'\i}n
L{\'o}pez and Gabriel L{\'o}pez Mill{\'a}n",
title = "Providing efficient {SSO} to cloud service access in
{AAA}-based identity federations",
journal = j-FUT-GEN-COMP-SYS,
volume = "58",
number = "??",
pages = "13--28",
month = may,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Feb 6 07:32:03 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15003854",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Miao:2016:RAS,
author = "Yinbin Miao and Jianfeng Ma and Zhiquan Liu",
title = "Revocable and anonymous searchable encryption in
multi-user setting",
journal = j-CCPE,
volume = "28",
number = "4",
pages = "1204--1218",
day = "25",
month = mar,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3608",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sun Apr 3 12:34:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "7 Oct 2015",
}
@Article{Michael:2016:RNI,
author = "K. Michael",
title = "{RFID\slash NFC} Implants for {Bitcoin} Transactions",
journal = "IEEE Consumer Electronics Magazine",
volume = "5",
number = "3",
pages = "103--106",
month = jul,
year = "2016",
DOI = "https://doi.org/10.1109/MCE.2016.2556900",
ISSN = "2162-2248 (print), 2162-2256 (electronic)",
ISSN-L = "2162-2248",
bibdate = "Thu Nov 30 15:24:52 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
keywords = "biological identity; biomedical communication;
Biometrics; Cryptography; embedded implant; Implants;
Interviews; Near field communication; near-field
communication; near-field communication platform; NFC
implants; Privacy; radiofrequency identification;
Radiofrequency identification; RFID implants; {Bitcoin}
transactions",
}
@Article{Miller:2016:RPS,
author = "Carl A. Miller and Yaoyun Shi",
title = "Robust Protocols for Securely Expanding Randomness and
Distributing Keys Using Untrusted Quantum Devices",
journal = j-J-ACM,
volume = "63",
number = "4",
pages = "33:1--33:??",
month = nov,
year = "2016",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/2885493",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
bibdate = "Mon Apr 3 09:29:48 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "Randomness is a vital resource for modern-day
information processing, especially for cryptography. A
wide range of applications critically rely on abundant,
high-quality random numbers generated securely. Here,
we show how to expand a random seed at an exponential
rate without trusting the underlying quantum devices.
Our approach is secure against the most general
adversaries, and has the following new features:
cryptographic level of security, tolerating a constant
level of imprecision in devices, requiring only unit
size quantum memory (for each device component) in an
honest implementation, and allowing a large natural
class of constructions for the protocol. In conjunction
with a recent work by Chung et al. [2014], it also
leads to robust unbounded expansion using just 2
multipart devices. When adapted for distributing
cryptographic keys, our method achieves, for the first
time, exponential expansion combined with cryptographic
security and noise tolerance. The proof proceeds by
showing that the R{\'e}nyi divergence of the outputs of
the protocol (for a specific bounding operator)
decreases linearly as the protocol iterates. At the
heart of the proof are a new uncertainty principle on
quantum measurements and a method for simulating
trusted measurements with untrusted devices.",
acknowledgement = ack-nhfb,
articleno = "33",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Min:2016:RSC,
author = "Byungho Min and Vijay Varadharajan",
title = "Rethinking Software Component Security: Software
Component Level Integrity and Cross Verification",
journal = j-COMP-J,
volume = "59",
number = "11",
pages = "1735--1748",
month = nov,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw047",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Nov 4 09:11:48 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/11.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/11/1735",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 10, 2016",
}
@Article{Mishra:2016:AFP,
author = "Abhishek Mishra and Parv Venkitasubramaniam",
title = "Anonymity and fairness in packet scheduling: a
quantitative tradeoff",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "2",
pages = "688--702",
month = apr,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 18 12:04:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Fairness among multiple users sharing a common
resource is an important criterion in the design and
evaluation of scheduling algorithms in networks.
Anonymous networking, where sources of transmitted
packets are undecipherable to an eavesdropper, requires
packets arriving at routers from multiple sources to be
randomly reordered prior to transmission, which works
against the notion of temporal fairness in packet
scheduling. Consequently, it is important to understand
the relationship between temporal fairness and
achievable anonymity. In this paper, this relationship
is investigated for three fair scheduling paradigms:
First-Come--First-Serve (FCFS), Fair Queuing, and the
Proportional Method. Using an information-theoretic
metric for anonymity and a common temporal fairness
index that measures the degree of out-of-order
transmissions, the anonymity achievable under these
scheduling paradigms is characterized and their
anonymity-fairness tradeoffs are compared. The FCFS and
Fair Queuing algorithms have little inherent anonymity,
and a significant improvement in anonymity is achieved
by relaxing their respective fairness paradigms. The
analysis of the relaxed FCFS criterion, in particular,
is accomplished by modeling the problem as a stochastic
control system that is solved using dynamic
programming. The proportional method of scheduling,
while unpopular in networks today, is shown to
outperform the other fair scheduling algorithms when
trading temporal fairness for anonymity, and is also
proven to be asymptotically optimal as the buffer size
of the scheduler is increased.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Monz:2016:RSS,
author = "Thomas Monz and Daniel Nigg and Esteban A. Martinez
and Matthias F. Brandl and Philipp Schindler and
Richard Rines and Shannon X. Wang and Isaac L. Chuang
and Rainer Blatt",
title = "Realization of a scalable {Shor} algorithm",
journal = "Science",
volume = "351",
number = "6277",
pages = "1068--1070",
day = "4",
month = mar,
year = "2016",
DOI = "https://doi.org/10.1126/science.aad9480",
ISSN = "0036-8075",
bibdate = "Tue Mar 8 11:07:15 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://science.sciencemag.org/content/351/6277/1068",
acknowledgement = ack-nhfb,
eprint = "http://science.sciencemag.org/content/351/6277/1068.full.pdf",
keywords = "large integer factorization; quantum cryptography;
Schor's algorithm",
}
@Article{Muftic:2016:BCC,
author = "Sead Muftic",
title = "{BIX} Certificates: Cryptographic Tokens for Anonymous
Transactions Based on Certificates Public Ledger",
journal = "Ledger",
volume = "1",
number = "??",
pages = "19--37",
month = "????",
year = "2016",
DOI = "https://doi.org/10.5195/ledger.2016.27",
ISSN = "2379-5980",
bibdate = "Fri Jan 19 06:12:08 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.ledgerjournal.org/ojs/index.php/ledger/article/view/27",
acknowledgement = ack-nhfb,
fjournal = "Ledger",
journal-URL = "http://www.ledgerjournal.org/ojs/index.php/ledger",
}
@Article{Munoz-Hernandez:2016:EES,
author = "Mario Diego Munoz-Hernandez and Miguel
Morales-Sandoval and Jose Juan Garcia-Hernandez",
title = "An End-to-End Security Approach for Digital Document
Management",
journal = j-COMP-J,
volume = "59",
number = "7",
pages = "1076--1090",
month = jul,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw002",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Aug 30 07:10:49 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/7/1076",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "January 31, 2016",
}
@Article{Murdoch:2016:IDP,
author = "Steven J. Murdoch",
title = "Insecure by Design: Protocols for Encrypted Phone
Calls",
journal = j-COMPUTER,
volume = "49",
number = "3",
pages = "25--33",
month = mar,
year = "2016",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2016.70",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Mar 22 07:09:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.computer.org/csdl/mags/co/2016/03/mco2016030025-abs.html",
abstract-URL = "http://www.computer.org/csdl/mags/co/2016/03/mco2016030025-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Naccache:2016:FHE,
author = "David Naccache",
title = "Fully Homomorphic Encryption: Computations with a
Blindfold",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "1",
pages = "63--67",
month = jan # "\slash " # feb,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2016.8",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Jun 8 08:40:32 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security {\&} Privacy",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Nafea:2016:HMB,
author = "Ohoud Nafea and Sanaa Ghouzali and Wadood Abdul and
Emad-ul-Haq Qazi",
title = "Hybrid Multi-Biometric Template Protection Using
Watermarking",
journal = j-COMP-J,
volume = "59",
number = "9",
pages = "1392--1407",
month = sep,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv107",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 12 11:39:16 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/9.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/9/1392",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "December 10, 2015",
}
@Article{Nedjah:2016:PYP,
author = "Nadia Nedjah and Luiza de Macedo Mourelle and Chao
Wang",
title = "A Parallel Yet Pipelined Architecture for Efficient
Implementation of the {Advanced Encryption Standard}
Algorithm on Reconfigurable Hardware",
journal = j-INT-J-PARALLEL-PROG,
volume = "44",
number = "6",
pages = "1102--1117",
month = dec,
year = "2016",
CODEN = "IJPPE5",
DOI = "https://doi.org/10.1007/s10766-016-0408-7",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
ISSN-L = "0885-7458",
bibdate = "Tue Sep 20 10:50:01 MDT 2016",
bibsource = "http://link.springer.com/journal/10766/44/6;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib",
URL = "http://link.springer.com/article/10.1007/s10766-016-0408-7",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Parallel Programming",
journal-URL = "http://link.springer.com/journal/10766",
}
@Article{Obert:2016:PAE,
author = "James Obert and Inna Pivkina and Hong Huang and
Huiping Cao",
title = "Proactively applied encryption in multipath networks",
journal = j-COMPUT-SECUR,
volume = "58",
number = "??",
pages = "106--124",
month = may,
year = "2016",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:45 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404815001960",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Olson:2016:SIT,
author = "Lena E. Olson and Simha Sethumadhavan and Mark D.
Hill",
title = "Security Implications of Third-Party Accelerators",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "15",
number = "1",
pages = "50--53",
month = jan # "\slash " # jun,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2015.2445337",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Third-party accelerators offer system designers high
performance and low energy without the market delay of
in-house development. However, complex third-party
accelerators may include vulnerabilities due to design
flaws or malicious intent that are hard to expose
during verification. Rather than react to each new
vulnerability, it is better to proactively build
defenses for classes of attacks. To inspire future work
on defenses, this paper develops a taxonomy of
accelerator vulnerabilities. We consider the cross
product of threat types (confidentiality, integrity,
and availability) with risk categories (configuration,
computation, termination, accelerator memory accesses,
system memory accesses, microarchitecture/coherence,
exceptions/interrupts, and power), as well as whether
processes can be vulnerable only if they use the
offending accelerator (accelerator-scope threat) or
even when running in the same system (system-scope
threat). Our taxonomy draws attention to a grave
problem that needs immediate attention from computer
architects.",
acknowledgement = ack-nhfb,
affiliation = "Olson, LE (Reprint Author), Univ Wisconsin, Dept Comp
Sci, 1210 W Dayton St, Madison, WI 53706 USA. Olson,
Lena E.; Hill, Mark D., Univ Wisconsin, Dept Comp Sci,
1210 W Dayton St, Madison, WI 53706 USA. Sethumadhavan,
Simha, Columbia Univ, Dept Comp Sci, New York, NY 10026
USA.",
author-email = "lena@cs.wisc.edu simha@cs.columbia.edu
markhill@cs.wisc.edu",
da = "2019-06-20",
doc-delivery-number = "DY1XQ",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "NSF [1054844]; Alfred P. Sloan Foundation;
[FA8750-10-2-0253]; [FA8650-11-C-7190]",
funding-text = "This work is supported through grants
FA8750-10-2-0253, FA8650-11-C-7190, NSF 1054844 and the
Alfred P. Sloan Foundation. Opinions, findings,
conclusions and recommendations expressed in this
material are those of the authors and may not reflect
the views of the funding entities. The authors thank
Eric Sedlar, Dan Gibson, Multifacet, and UW-Madison
Computer Architecture Affiliates for valuable
feedback.",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "accelerator architectures; accelerator
vulnerabilities; accelerator-scope threat; Coherence;
computer architecture; Computer bugs; Computer
security; Cryptography; Hardware; malicious intent;
market delay; Registers; risk categories; risk
management; system-scope threat; Taxonomy; third-party
accelerators",
number-of-cited-references = "20",
oa = "Bronze",
research-areas = "Computer Science",
times-cited = "5",
unique-id = "Olson:2016:SIT",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Onica:2016:CPP,
author = "Emanuel Onica and Pascal Felber and Hugues Mercier and
Etienne Rivi{\`e}re",
title = "Confidentiality-Preserving Publish\slash Subscribe: a
Survey",
journal = j-COMP-SURV,
volume = "49",
number = "2",
pages = "27:1--27:??",
month = sep,
year = "2016",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2940296",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Tue Nov 8 16:12:56 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Publish/subscribe (pub/sub) is an attractive
communication paradigm for large-scale distributed
applications running across multiple administrative
domains. Pub/sub allows event-based information
dissemination based on constraints on the nature of the
data rather than on pre-established communication
channels. It is a natural fit for deployment in
untrusted environments such as public clouds linking
applications across multiple sites. However, pub/sub in
untrusted environments leads to major confidentiality
concerns stemming from the content-centric nature of
the communications. This survey classifies and analyzes
different approaches to confidentiality preservation
for pub/sub, from applications of trust and access
control models to novel encryption techniques. It
provides an overview of the current challenges posed by
confidentiality concerns and points to future research
directions in this promising field.",
acknowledgement = ack-nhfb,
articleno = "27",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Orencik:2016:MKS,
author = "Cengiz Orencik and Ayse Selcuk and Erkay Savas and
Murat Kantarcio{\u{g}}lu",
title = "Multi-keyword search over encrypted data with scoring
and search pattern obfuscation",
journal = j-INT-J-INFO-SEC,
volume = "15",
number = "3",
pages = "251--269",
month = jun,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-015-0294-9",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Tue Jan 23 16:01:45 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://link.springer.com/article/10.1007/s10207-015-0294-9",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
keywords = "Efficiency Scoring; Encrypted cloud data; Privacy
preservation; Secure search",
}
@Misc{Ormond:2016:CPR,
author = "Jim Ormond",
title = "Cryptography Pioneers Receive {ACM A. M. Turing
Award}: {Diffie} and {Hellman}'s Invention of
Public-Key Cryptography and Digital Signatures
Revolutionized Computer Security and Made {Internet}
Commerce Possible",
howpublished = "Web document",
day = "1",
month = mar,
year = "2016",
bibdate = "Tue Mar 01 11:55:25 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/acm-turing-awards.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.acm.org/media-center/2016/march/turing-award-2015",
acknowledgement = ack-nhfb,
}
@Article{Osborn:2016:SSR,
author = "Emma Osborn and Andrew Simpson",
title = "On Safety and Security Requirements in Emerging
Ubiquitous Computing Models",
journal = j-COMP-J,
volume = "59",
number = "4",
pages = "570--591",
month = apr,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv085",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Mar 28 10:52:39 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/4/570",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "October 14, 2015",
}
@Article{Pal:2016:ACC,
author = "Jiban K. Pal",
title = "Administering a cryptology centre by means of
scientometric indicators",
journal = j-COLLNET-J-SCIENTOMETRICS-INF-MANAGE,
volume = "10",
number = "1",
pages = "97--123",
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1080/09737766.2016.1177947",
ISSN = "0973-7766 (print), 2168-930X (electronic)",
ISSN-L = "0973-7766",
bibdate = "Mon Jun 20 14:27:32 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/collnet-j-scientometrics-inf-manage.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Collnet Journal of Scientometrics and Information
Management",
}
@Article{Papamanthou:2016:AHT,
author = "Charalampos Papamanthou and Roberto Tamassia and Nikos
Triandopoulos",
title = "Authenticated Hash Tables Based on Cryptographic
Accumulators",
journal = j-ALGORITHMICA,
volume = "74",
number = "2",
pages = "664--712",
month = feb,
year = "2016",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-014-9968-3",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Thu Apr 7 10:40:27 MDT 2016",
bibsource = "http://link.springer.com/journal/453/74/2;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://link.springer.com/article/10.1007/s00453-014-9968-3",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Parno:2016:PNP,
author = "Bryan Parno and Jon Howell and Craig Gentry and
Mariana Raykova",
title = "{Pinocchio}: nearly practical verifiable computation",
journal = j-CACM,
volume = "59",
number = "2",
pages = "103--112",
month = feb,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2856449",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Feb 16 15:45:15 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/2/197429/fulltext",
abstract = "To instill greater confidence in computations
outsourced to the cloud, clients should be able to
verify the correctness of the results returned. To this
end, we introduce Pinocchio, a built system for
efficiently verifying general computations while
relying only on cryptographic assumptions. With
Pinocchio, the client creates a public evaluation key
to describe her computation; this setup is proportional
to evaluating the computation once. The worker then
evaluates the computation on a particular input and
uses the evaluation key to produce a proof of
correctness. The proof is only 288 bytes, regardless of
the computation performed or the size of the IO. Anyone
can check the proof using a public verification key.
Crucially, our evaluation on seven applications
demonstrates that Pinocchio is efficient in practice
too. Pinocchio's verification time is a fixed 10 ms
plus 0.4--15 $ \mu $ s per IO element: 5--7 orders of
magnitude less than previous work; indeed Pinocchio is
the first general-purpose system to demonstrate
verification cheaper than native execution (for some
apps). The worker's proof effort is still expensive,
but Pinocchio reduces it by 19 $ \times $ --60 $ \times
$ relative to prior work. As an additional feature,
Pinocchio allows the worker to include private inputs
in the computation and prove that she performed the
computation correctly without revealing any information
about the private inputs to the client. Finally, to aid
development, Pinocchio provides an end-to-end toolchain
that compiles a subset of C into programs that
implement the verifiable computation {protocol.$<$}!--
END_PAGE_1 --{$>$}",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Paul:2016:TSO,
author = "G. Paul and A. Chattopadhyay",
title = "Three Snakes in One Hole: The First Systematic
Hardware Accelerator Design for {SOSEMANUK} with
Optional Serpent and {SNOW 2.0} Modes",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "2",
pages = "640--653",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2435775",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jan 19 07:06:51 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "cryptography; hardware acceleration; Serpent stream
cipher; SNOW 2.0 stream cipher; SOSEMANUK eSTREAM
stream cipher",
}
@Article{Pereira:2016:SHB,
author = "Geovandro C. C. F. Pereira and Cassius Puodzius and
Paulo S. L. M. Barreto",
title = "Shorter hash-based signatures",
journal = j-J-SYST-SOFTW,
volume = "116",
number = "??",
pages = "95--100",
month = jun,
year = "2016",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Thu May 19 08:19:12 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121215001466",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Phuc:2016:SAS,
author = "Tran Song Dat Phuc and Changhoon Lee",
title = "Security analysis of {SDDO}-based block cipher for
wireless sensor network",
journal = j-J-SUPERCOMPUTING,
volume = "72",
number = "9",
pages = "3619--3628",
month = sep,
year = "2016",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-015-1589-3",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Tue Sep 20 10:45:03 MDT 2016",
bibsource = "http://link.springer.com/journal/11227/72/9;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-015-1589-3",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Premnath:2016:SPC,
author = "Sriram Nandha Premnath and Zygmunt J. Haas",
title = "Supporting Privacy of Computations in Mobile Big Data
Systems",
journal = j-FUTURE-INTERNET,
volume = "8",
number = "2",
pages = "17",
day = "10",
month = may,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi8020017",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/8/2/17",
abstract = "Cloud computing systems enable clients to rent and
share computing resources of third party platforms, and
have gained widespread use in recent years. Numerous
varieties of mobile, small-scale devices such as
smartphones, red e-health devices, etc., across users,
are connected to one another through the massive
internetwork of vastly powerful servers on the cloud.
While mobile devices store ``private information'' of
users such as location, payment, health data, etc.,
they may also contribute ``semi-public information''
(which may include crowdsourced data such as transit,
traffic, nearby points of interests, etc.) for data
analytics. In such a scenario, a mobile device may seek
to obtain the result of a computation, which may depend
on its private inputs, crowdsourced data from other
mobile devices, and/or any ``public inputs'' from other
servers on the Internet. We demonstrate a new method of
delegating real-world computations of
resource-constrained mobile clients using an encrypted
program known as the garbled circuit. Using the garbled
version of a mobile client's inputs, a server in the
cloud executes the garbled circuit and returns the
resulting garbled outputs. Our system assures privacy
of the mobile client's input data and output of the
computation, and also enables the client to verify that
the evaluator actually performed the computation. We
analyze the complexity of our system. We measure the
time taken to construct the garbled circuit as well as
evaluate it for varying number of servers. Using
real-world data, we evaluate our system for a
practical, privacy preserving search application that
locates the nearest point of interest for the mobile
client to demonstrate feasibility.",
acknowledgement = ack-nhfb,
remark = "Special Issue Security in Cloud Computing and Big
Data.",
}
@Article{Qi:2016:SID,
author = "Saiyu Qi and Yuanqing Zheng and Mo Li and Yunhao Liu
and Jinli Qiu",
title = "Scalable Industry Data Access Control in
{RFID}-Enabled Supply Chain",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3551--3564",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2536626",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "By attaching RFID tags to products, supply chain
participants can identify products and create product
data to record the product particulars in transit.
Participants along the supply chain share their product
data to enable information exchange and support
critical decisions in production operations. Such an
information sharing essentially requires a data access
control mechanism when the product data relate to
sensitive business issues. However, existing access
control solutions are ill-suited to the RFID-enabled
supply chain, as they are not scalable in handling a
huge number of tags, introduce vulnerability to the
product data, and perform poorly to support privilege
revocation of product data. We present a new scalable
industry data access control system that addresses
these limitations. Our system provides an item-level
data access control mechanism that defines and enforces
access policies based on both the participants' role
attributes and the products' RFID tag attributes. Our
system further provides an item-level privilege
revocation mechanism by allowing the participants to
delegate encryption updates in revocation operation
without disclosing the underlying data contents. We
design a new updatable encryption scheme and integrate
it with ciphertext policy-attribute-based encryption to
implement the key components of our system.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Qi:2016:SPR,
author = "Saiyu Qi and Yuanqing Zheng and Mo Li and Li Lu and
Yunhao Liu",
title = "Secure and Private {RFID}-Enabled Third-Party Supply
Chain Systems",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "11",
pages = "3413--3426",
month = nov,
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2538260",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Oct 11 05:14:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Qiang:2016:SCF,
author = "Weizhong Qiang and Kang Zhang and Weiqi Dai and Hai
Jin",
title = "Secure cryptographic functions via
virtualization-based outsourced computing",
journal = j-CCPE,
volume = "28",
number = "11",
pages = "3149--3163",
day = "10",
month = aug,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3706",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue Sep 13 08:30:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Qin:2016:STI,
author = "Zhen Qin and Chen Yuan and Yilei Wang and Hu Xiong",
title = "On the security of two identity-based signature
schemes based on pairings",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "6",
pages = "416--418",
month = jun,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Mar 5 10:14:41 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019016300096",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Qin:2016:VTQ,
author = "Huawang Qin and Yuewei Dai",
title = "Verifiable $ (t, n) $ threshold quantum secret sharing
using $d$-dimensional {Bell} state",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "5",
pages = "351--355",
month = may,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri Feb 12 06:40:48 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019016000077",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Rahulamathavan:2016:UCA,
author = "Yogachandran Rahulamathavan and Suresh Veluru and
Jinguang Han and Fei Li and Muttukrishnan Rajarajan and
Rongxing Lu",
title = "User Collusion Avoidance Scheme for Privacy-Preserving
Decentralized Key-Policy Attribute-Based Encryption",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "9",
pages = "2939--2946",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2510646",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Aug 10 09:04:52 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Rana:2016:DBV,
author = "Shuvendu Rana and Arijit Sur",
title = "Depth-Based View-Invariant Blind {$3$D} Image
Watermarking",
journal = j-TOMCCAP,
volume = "12",
number = "4",
pages = "48:1--48:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2957751",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Aug 25 07:28:05 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "With the huge advance in Internet technology as well
as the availability of low-cost 3D display devices, 3D
image transmission has become popular in recent times.
Since watermarking has become regarded as a potential
Digital Rights Management (DRM) tools in the past
decade, 3D image watermarking is an emerging research
topic. With the introduction of the Depth Image-Based
Rendering (DIBR) technique, 3D image watermarking is a
more challenging task, especially for synthetic view
generation. In this article, synthetic view generation
is regarded as a potential attack, and a blind
watermarking scheme is proposed that can resist it. In
the proposed scheme, the watermark is embedded into the
low-pass filtered dependent view region of 3D images.
Block Discrete Cosine Transformation (DCT) is used for
spatial-filtration of the dependent view region to find
the DC coefficient with horizontally shifted coherent
regions from the left and right view to make the scheme
robust against synthesis view attack. A comprehensive
set of experiments have been carried out to justify the
robustness of the proposed scheme over related existing
schemes with respect to Stereo JPEG compression and
different noise addition attacks.",
acknowledgement = ack-nhfb,
articleno = "48",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Rankin:2016:HSP,
author = "Kyle Rankin",
title = "Hack and \slash: Preseeding full disk encryption",
journal = j-LINUX-J,
volume = "2016",
number = "261",
pages = "5:1--5:??",
month = jan,
year = "2016",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Tue Jun 7 18:42:42 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
URL = "http://dl.acm.org/ft_gateway.cfm?id=2903198",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Razaque:2016:TDP,
author = "Abdul Razaque and Syed S. Rizvi",
title = "Triangular data privacy-preserving model for
authenticating all key stakeholders in a cloud
environment",
journal = j-COMPUT-SECUR,
volume = "62",
number = "??",
pages = "328--347",
month = sep,
year = "2016",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:46 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404816300979",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Book{Reardon:2016:SDD,
author = "Joel Reardon",
title = "Secure Data Deletion",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvii + 203 + 32",
year = "2016",
DOI = "https://doi.org/10.1007/978-3-319-28778-2",
ISBN = "3-319-28778-8 (e-book), 3-319-28777-X",
ISBN-13 = "978-3-319-28778-2 (e-book), 978-3-319-28777-5",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.D3 R4223 2016",
bibdate = "Sat Jun 10 08:34:36 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Information security and cryptography",
URL = "http://www.springerlink.com/content/978-3-319-28778-2",
abstract = "This book is the first to develop a systematized
approach for the comparison and evaluation of secure
deletion solutions. The book focuses on novel secure
deletion solutions targeting specific real-world
environments where secure deletion is problematic:
mobile storage and remote storage. The author surveys
related work, organizes existing solutions in terms of
their interfaces, presents a taxonomy of adversaries
differing in their capabilities, and then builds a
system and adversarial model based on the survey of
related work. The book is useful for both academics,
researchers and graduate students, and for
practitioners who may integrate its results into
deployed systems.",
acknowledgement = ack-nhfb,
author-dates = "1983--",
shorttableofcontents = "Part I. Introduction and background \\
Introduction \\
Related work on secure deletion \\
System model and security goal \\
Part II. Secure deletion for mobile storage \\
Flash memory: background and related work \\
User-level secure deletion on log-structured file
systems \\
Data node encrypted file system \\
UBIFSec: adding DNEFS to UBIFS \\
Part III. Secure deletion for remote storage \\
Cloud storage: background and related work \\
Secure data deletion from persistent media \\
B-tree-based secure deletion \\
Robust key management for secure data deletion \\
Part IV. Conclusions \\
Conclusion and future work",
subject = "Database management; Database security; Computer
security; Data encryption (Computer science); Computer
Hardware; Computer Science; Data Structures, Cryptology
and Information Theory; Electronics and
Microelectronics, Instrumentation; Security Science and
Technology; COMPUTERS; Desktop Applications; Databases;
General; System Administration; Storage and Retrieval;
Computer security; Data encryption (Computer science);
Database management; Database security.",
tableofcontents = "Acknowledgments \\
Contents \\
Acronyms \\
Part I \\
Introduction and Background \\
1 Introduction \\
1.1 Organization and Structure \\
2 RelatedWork on Secure Deletion \\
2.1 Introduction \\
2.2 RelatedWork \\
2.2.1 Layers and Interfaces \\
2.2.2 Physical-Layer and Controller-Layer Sanitization
\\
2.2.3 User-Level Solutions \\
2.2.4 File-System-Level Solutions with In-Place Updates
\\
2.2.5 Cross-layer Solutions \\
2.2.6 Summary \\
2.3 Adversarial Model \\
2.3.1 Classes of Adversarial Capabilities \\
2.3.2 Summary \\
2.4 Analysis of Solutions \\
2.4.1 Classes of Environmental Assumptions \\
2.4.2 Classes of Behavioural Properties 2.4.3 Summary 3
System Model and Security Goal \\
3.1 Introduction \\
3.2 System Model \\
3.3 Storage Medium Models \\
3.4 Adversarial Model \\
3.5 Security Goal \\
Part II Secure Deletion for Mobile Storage \\
4 Flash Memory: Background and Related Work \\
4.1 Overview \\
4.2 Flash Memory \\
4.2.1 In-Place Updates and Log-Structured File Systems
\\
4.2.2 Flash Translation Layer \\
4.2.3 Flash File Systems \\
4.2.4 Generalizations to Other Media \\
4.3 RelatedWork for Flash Secure Deletion \\
4.4 Summary \\
5 User-Level Secure Deletion on Log-Structured File
Systems \\
5.1 Introduction \\
5.2 System and Adversarial Model 5.3 YAFFS 5.4 Data
Deletion in Existing Log-Structured File Systems \\
5.4.1 Instrumented YAFFS \\
5.4.2 Simulating Larger Storage Media \\
5.5 User-Space Secure Deletion \\
5.5.1 Purging \\
5.5.2 Ballooning \\
5.5.3 Hybrid Solution: Ballooning with Purging \\
5.6 Experimental Evaluation \\
5.6.1 Experimental Results \\
5.7 Summary \\
5.8 Research Questions \\
6 Data Node Encrypted File System \\
6.1 Introduction \\
6.2 System and Adversarial Model \\
6.3 DNEFS's Design \\
6.3.1 Key Storage Area \\
6.3.2 Keystore \\
6.3.3 Clocked Keystore Implementation \\
6.3.4 Clock Operation: KSA Update \\
6.3.5 Key-State Map \\
6.3.6 Summary 6.4 Extensions and Optimizations 6.4.1
Granularity Trade-off \\
6.4.2 KSA Update Policies \\
6.4.3 KSA Organization \\
6.4.4 Improving Reliability \\
6.4.5 Encrypted File System \\
6.5 Summary \\
6.6 Research Questions \\
7 UBIFSec: Adding DNEFS to UBIFS \\
7.1 Introduction \\
7.2 System and Adversarial Model \\
7.3 Background \\
7.3.1 MTD and UBI Layers \\
7.3.2 UBIFS \\
7.4 UBIFSec Design \\
7.4.1 Key Storage Area \\
7.4.2 Key-State Map \\
7.4.3 Summary \\
7.5 Experimental Validation \\
7.5.1 Android Implementation \\
7.5.2 Wear Analysis \\
7.5.3 Power Consumption \\
7.5.4 Throughput Analysis \\
7.5.5 Timing Analysis \\
7.6 Conclusions 7.7 Practitioner's Notes Part III
Secure Deletion for Remote Storage \\
8 Cloud Storage: Background and Related Work \\
8.1 Introduction \\
8.2 Persistent Storage \\
8.2.1 Securely Deleting and Persistent Combination \\
8.2.2 Cloud Storage \\
8.3 Related Work \\
8.4 Summary \\
9 Secure Data Deletion from Persistent Media \\
9.1 Introduction \\
9.2 System and Adversarial Model \\
9.3 Graph Theory Background \\
9.4 Graph-Theoretic Model of Key Disclosure \\
9.4.1 Key Disclosure Graph \\
9.4.2 Secure Deletion \\
9.5 Shadowing Graph Mutations \\
9.5.1 Mangrove Preservation \\
9.5.2 Shadowing Graph Mutation Chains",
xxISSN = "2197-845X",
}
@Article{Ren:2016:IBE,
author = "Yanli Ren and Ning Ding and Xinpeng Zhang and Haining
Lu and Dawu Gu",
title = "Identity-Based Encryption with Verifiable Outsourced
Revocation",
journal = j-COMP-J,
volume = "59",
number = "11",
pages = "1659--1668",
month = nov,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw029",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Nov 4 09:11:48 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/11.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/11/1659",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "July 13, 2016",
}
@Article{Rogaway:2016:POP,
author = "Phillip Rogaway",
title = "Practice-Oriented Provable Security and the Social
Construction of Cryptography",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "6",
pages = "10--17",
month = nov # "\slash " # dec,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Sat Feb 25 10:03:53 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/06/msp2016060010-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Saeed:2016:IID,
author = "Ahmed Saeed and Ali Ahmadinia and Abbas Javed and Hadi
Larijani",
title = "Intelligent Intrusion Detection in Low-Power {IoTs}",
journal = j-TOIT,
volume = "16",
number = "4",
pages = "27:1--27:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2990499",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 22 16:47:17 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Security and privacy of data are one of the prime
concerns in today's Internet of Things (IoT).
Conventional security techniques like signature-based
detection of malware and regular updates of a signature
database are not feasible solutions as they cannot
secure such systems effectively, having limited
resources. Programming languages permitting immediate
memory accesses through pointers often result in
applications having memory-related errors, which may
lead to unpredictable failures and security
vulnerabilities. Furthermore, energy efficient IoT
devices running on batteries cannot afford the
implementation of cryptography algorithms as such
techniques have significant impact on the system power
consumption. Therefore, in order to operate IoT in a
secure manner, the system must be able to detect and
prevent any kind of intrusions before the network
(i.e., sensor nodes and base station) is destabilised
by the attackers. In this article, we have presented an
intrusion detection and prevention mechanism by
implementing an intelligent security architecture using
random neural networks (RNNs). The application's source
code is also instrumented at compile time in order to
detect out-of-bound memory accesses. It is based on
creating tags, to be coupled with each memory
allocation and then placing additional tag checking
instructions for each access made to the memory. To
validate the feasibility of the proposed security
solution, it is implemented for an existing IoT system
and its functionality is practically demonstrated by
successfully detecting the presence of any suspicious
sensor node within the system operating range and
anomalous activity in the base station with an accuracy
of 97.23\%. Overall, the proposed security solution has
presented a minimal performance overhead.",
acknowledgement = ack-nhfb,
articleno = "27",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Sakai:2016:CDN,
author = "Yusuke Sakai and Keita Emura and Jacob C. N. Schuldt
and Goichiro Hanaoka and Kazuo Ohta",
title = "Constructions of dynamic and non-dynamic threshold
public-key encryption schemes with decryption
consistency",
journal = j-THEOR-COMP-SCI,
volume = "630",
number = "??",
pages = "95--116",
day = "30",
month = may,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Apr 30 08:01:06 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397516300317",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Sakai:2016:NCS,
author = "K. Sakai and M. Sun and W. Ku and T. H. Lai",
title = "A Novel Coding Scheme for Secure Communications in
Distributed {RFID} Systems",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "2",
pages = "409--421",
month = feb,
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2423671",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jan 19 07:06:51 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Saleh:2016:PED,
author = "Eyad Saleh and Ahmad Alsa'deh and Ahmad Kayed and
Christoph Meinel",
title = "Processing Over Encrypted Data: Between Theory and
Practice",
journal = j-SIGMOD,
volume = "45",
number = "3",
pages = "5--16",
month = sep,
year = "2016",
CODEN = "SRECD8",
DOI = "https://doi.org/10.1145/3022860.3022862",
ISSN = "0163-5808 (print), 1943-5835 (electronic)",
ISSN-L = "0163-5808",
bibdate = "Wed Dec 7 07:09:19 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigmod.bib",
abstract = "Data encryption is a common approach to protect the
confidentiality of users' data. However, when
computation is required, the data must be decrypted
before processing. The decryption-for-processing
approach causes critical threats. For instance, a
compromised server may lead to the leakage of data or
cryptographic keys. On the other hand, data owners are
concerned since the data is beyond their control. Thus,
they look for mechanisms to achieve strong data
protection. Accordingly, alternatives for protecting
data become essential. Consequently, the trend of
processing over encrypted data starts to arise along
with a rapidly growing literature. This paper surveys
applications, tools, building blocks, and approaches
that can be used to directly process encrypted data
(i.e., without decrypting it). The purpose of this
survey is to provide an overview of existing systems
and approaches that can be used to process encrypted
data, discuss commercial usage of such systems, and to
analyze the current developments in this area",
acknowledgement = ack-nhfb,
fjournal = "SIGMOD Record (ACM Special Interest Group on
Management of Data)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J689",
}
@Article{Sanchez-Garcia:2016:SSA,
author = "J. S{\'a}nchez-Garc{\'\i}a and J. M.
Garc{\'\i}a-Campos and D. G. Reina and S. L. Toral and
F. Barrero",
title = "{On-siteDriverID}: a secure authentication scheme
based on {Spanish} {eID} cards for vehicular ad hoc
networks",
journal = j-FUT-GEN-COMP-SYS,
volume = "64",
number = "??",
pages = "50--60",
month = nov,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Aug 24 08:13:41 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16301121",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Savage:2016:NKP,
author = "Neil Savage",
title = "News: The key to privacy",
journal = j-CACM,
volume = "59",
number = "6",
pages = "12--14",
month = jun,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2911979",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed May 25 17:07:29 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/6/202654/fulltext",
abstract = "40 years ago, Whitfield Diffie and Martin E. Hellman
introduced the public key cryptography used to secure
today's online transactions.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Saxena:2016:API,
author = "Neetesh Saxena and Santiago Grijalva and Narendra S.
Chaudhari",
title = "Authentication Protocol for an {IoT}-Enabled {LTE}
Network",
journal = j-TOIT,
volume = "16",
number = "4",
pages = "25:1--25:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2981547",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 22 16:47:17 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The Evolved Packet System-based Authentication and Key
Agreement (EPS-AKA) protocol of the long-term evolution
(LTE) network does not support Internet of Things (IoT)
objects and has several security limitations, including
transmission of the object's (user/device) identity and
key set identifier in plaintext over the network,
synchronization, large overhead, limited identity
privacy, and security attack vulnerabilities. In this
article, we propose a new secure and efficient AKA
protocol for the LTE network that supports secure and
efficient communications among various IoT devices as
well as among the users. Analysis shows that our
protocol is secure, efficient, and privacy preserved,
and reduces bandwidth consumption during
authentication.",
acknowledgement = ack-nhfb,
articleno = "25",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Schneider:2016:DEE,
author = "D. Schneider",
title = "Don't expect encrypted e-mail in 2016",
journal = j-IEEE-SPECTRUM,
volume = "53",
number = "1",
pages = "42--43",
month = jan,
year = "2016",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2016.7367464",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Companies; cryptography; e-mail message; Electronic
mail; electronic mail; Encryption; end-to-end
encryption; Google; information security; prototype
software; social networking (online); software
prototyping; Yahoo",
}
@Article{Schneider:2016:MSI,
author = "D. Schneider",
title = "\$100 million {SETI} initiative starts listening for
{E.T.}",
journal = j-IEEE-SPECTRUM,
volume = "53",
number = "1",
pages = "41--42",
month = jan,
year = "2016",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2016.7367463",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Breakthrough Listen; Encryption; extraterrestrial
life; Extraterrestrial phenomena; Google; Investments;
Observatories; radio observations; radiosources
(astronomical); search for extraterrestrial
intelligence; SETI initiative; star system;
Telescopes",
}
@Article{Schneier:2016:CHT,
author = "Bruce Schneier",
title = "Cryptography Is Harder than It Looks",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "1",
pages = "87--88",
month = jan # "\slash " # feb,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Jun 8 08:40:32 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security {\&} Privacy",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Seo:2016:RHI,
author = "Jae Hong Seo and Keita Emura",
title = "Revocable hierarchical identity-based encryption via
history-free approach",
journal = j-THEOR-COMP-SCI,
volume = "615",
number = "??",
pages = "45--60",
day = "15",
month = feb,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Jan 9 12:26:44 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397515011354",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Serwadda:2016:TRR,
author = "Abdul Serwadda and Vir V. Phoha and Zibo Wang and
Rajesh Kumar and Diksha Shukla",
title = "Toward Robotic Robbery on the Touch Screen",
journal = j-TISSEC,
volume = "18",
number = "4",
pages = "14:1--14:??",
month = may,
year = "2016",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2898353",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Sat May 21 08:19:26 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "Despite the tremendous amount of research fronting the
use of touch gestures as a mechanism of continuous
authentication on smart phones, very little research
has been conducted to evaluate how these systems could
behave if attacked by sophisticated adversaries. In
this article, we present two Lego-driven robotic
attacks on touch-based authentication: a population
statistics-driven attack and a user-tailored attack.
The population statistics-driven attack is based on
patterns gleaned from a large population of users,
whereas the user-tailored attack is launched based on
samples stolen from the victim. Both attacks are
launched by a Lego robot that is trained on how to
swipe on the touch screen. Using seven verification
algorithms and a large dataset of users, we show that
the attacks cause the system's mean false acceptance
rate (FAR) to increase by up to fivefold relative to
the mean FAR seen under the standard zero-effort
impostor attack. The article demonstrates the threat
that robots pose to touch-based authentication and
provides compelling evidence as to why the zero-effort
attack should cease to be used as the benchmark for
touch-based authentication systems.",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Sethumadhavan:2016:HEP,
author = "Simha Sethumadhavan",
title = "Hardware-Enforced Privacy",
journal = j-COMPUTER,
volume = "49",
number = "10",
pages = "10",
month = oct,
year = "2016",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2016.318",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Oct 25 06:11:19 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.computer.org/csdl/mags/co/2016/10/mco2016100010.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
}
@Article{Severance:2016:BSB,
author = "Charles Severance",
title = "{Bruce Schneier}: Building Cryptographic Systems",
journal = j-COMPUTER,
volume = "49",
number = "4",
pages = "13--15",
month = apr,
year = "2016",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Apr 19 06:21:54 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.computer.org/csdl/mags/co/2016/04/mco2016040013.html",
abstract-URL = "http://www.computer.org/csdl/mags/co/2016/04/mco2016040013-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Shen:2016:RMM,
author = "Wuqiang Shen and Shaohua Tang",
title = "{RGB}, a Mixed Multivariate Signature Scheme",
journal = j-COMP-J,
volume = "59",
number = "4",
pages = "439--451",
month = apr,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv056",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Mar 28 10:52:39 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/4/439",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 7, 2015",
}
@Article{Shivani:2016:PVC,
author = "Shivendra Shivani and Suneeta Agarwal",
title = "Progressive Visual Cryptography with Unexpanded
Meaningful Shares",
journal = j-TOMCCAP,
volume = "12",
number = "4",
pages = "50:1--50:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2935618",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Aug 25 07:28:05 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "The traditional $k$-out-of-$n$ Visual Cryptography
(VC) scheme is the conception of ``all or nothing'' for
$n$ participants to share a secret image. The original
secret image can be visually revealed only when a
subset of $k$ or more shares are superimposed together,
but if the number of stacked shares are less than $k$,
nothing will be revealed. On the other hand, a
Progressive Visual Cryptography (PVC) scheme differs
from the traditional VC with respect to decoding. In
PVC, clarity and contrast of the decoded secret image
will be increased progressively with the number of
stacked shares. Much of the existing state-of-the-art
research on PVC has problems with pixel expansion and
random pattern of the shares. In this article, a novel
scheme of progressive visual cryptography with four or
more number of unexpanded as well as meaningful shares
has been proposed. For this, a novel and efficient
Candidate Block Replacement preprocessing approach and
a basis matrix creation algorithm have also been
introduced. The proposed method also eliminates many
unnecessary encryption constraints like a predefined
codebook for encoding and decoding the secret image,
restriction on the number of participants, and so on.
From the experiments, it is observed that the
reconstruction probability of black pixels in the
decoded image corresponding to the black pixel in the
secret image is always 1, whereas that of white pixels
is 0.5 irrespective of the meaningful contents visible
in the shares, thus ensuring the value of contrast to
always be 50\%. Therefore, a reconstructed image can be
easily identified by a human visual system without any
computation.",
acknowledgement = ack-nhfb,
articleno = "50",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Siad:2016:NFI,
author = "A. Siad and M. Amara",
title = "A new framework for implementing identity-based
cryptosystems",
journal = j-J-SYST-SOFTW,
volume = "118",
number = "??",
pages = "36--48",
month = aug,
year = "2016",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Thu Jun 9 06:36:58 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121216300346",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Sirer:2016:TPS,
author = "Emin G{\"u}n Sirer",
title = "Technical Perspective: The state (and security) of the
{Bitcoin} economy",
journal = j-CACM,
volume = "59",
number = "4",
pages = "85--85",
month = apr,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2896382",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Fri Apr 15 14:58:10 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/4/200172/fulltext",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Book{Smart:2016:CMS,
author = "Nigel P. (Nigel Paul) Smart",
title = "Cryptography Made Simple",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 481 + 119",
year = "2016",
DOI = "https://doi.org/10.1007/978-3-319-21936-3",
ISBN = "3-319-21935-9 (hardcover), 3-319-21936-7 (e-book)",
ISBN-13 = "978-3-319-21935-6 (hardcover), 978-3-319-21936-3
(e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.A25; QA76.9.D35 S63 2016",
bibdate = "Sat Jun 10 08:34:34 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Information Security and Cryptography",
URL = "http://link.springer.com/10.1007/978-3-319-21936-3",
abstract = "In this introductory textbook the author explains the
key topics in cryptography. He takes a modern approach,
where defining what is meant by ``secure'' is as
important as creating something that achieves that
goal, and security definitions are central to the
discussion throughout. The chapters in Part 1 offer a
brief introduction to the mathematical foundations:
modular arithmetic, groups, finite fields, and
probability; primality testing and factoring; discrete
logarithms; elliptic curves; and lattices. Part 2 of
the book shows how historical ciphers were broken, thus
motivating the design of modern cryptosystems since the
1960s; this part also includes a chapter on
information-theoretic security. Part 3 covers the core
aspects of modern cryptography: the definition of
security; modern stream ciphers; block ciphers and
modes of operation; hash functions, message
authentication codes, and key derivation functions; the
``naive'' RSA algorithm; public key encryption and
signature algorithms; cryptography based on
computational complexity; and certificates, key
transport and key agreement. Finally, Part 4 addresses
advanced protocols, where the parties may have
different or even conflicting security goals: secret
sharing schemes; commitments and oblivious transfer;
zero-knowledge proofs; and secure multi-party
computation. The author balances a largely non-rigorous
style -- many proofs are sketched only -- with
appropriate formality and depth. For example, he uses
the terminology of groups and finite fields so that the
reader can understand both the latest academic research
and ``real-world'' documents such as application
programming interface descriptions and cryptographic
standards. The text employs colour to distinguish
between public and private information, and all
chapters include summaries and suggestions for further
reading. This is a suitable textbook for advanced
undergraduate and graduate students in computer
science, mathematics and engineering, and for
self-study by professionals in information security.
While the appendix summarizes most of the basic algebra
and notation required, it is assumed that the reader
has a basic knowledge of discrete mathematics,
probability, and elementary calculus..",
acknowledgement = ack-nhfb,
author-dates = "1967--",
subject = "Computer science; Data structures (Computer science);
Mathematics; System safety; Data Structures, Cryptology
and Information Theory; Mathematics of Computing;
Security Science and Technology; Discrete Mathematics;
Computer science; Mathematics; Data structures
(Computer science); System safety.",
tableofcontents = "Modular Arithmetic, Groups, Finite Fields and
Probability \\
Elliptic Curves \\
Historical Ciphers \\
The Enigma Machine \\
Information Theoretic Security \\
Historical Stream Ciphers \\
Modern Stream Ciphers \\
Block Ciphers \\
Symmetric Key Distribution \\
Hash Functions and Message Authentication Codes \\
Basic Public Key Encryption Algorithms \\
Primality Testing and Factoring \\
Discrete Logarithms \\
Key Exchange and Signature Schemes \\
Implementation Issues \\
Obtaining Authentic Public Keys \\
Attacks on Public Key Schemes \\
Definitions of Security \\
Complexity Theoretic Approaches \\
Provable Security: With Random Oracles \\
Hybrid Encryption \\
Provable Security: Without Random Oracles \\
Secret Sharing Schemes \\
Commitments and Oblivious Transfer \\
Zero-Knowledge Proofs \\
Secure Multiparty Computation",
}
@Article{Sodsong:2016:DPB,
author = "Wasuwee Sodsong and Jingun Hong and Seongwook Chung
and Yeongkyu Lim and Shin-Dug Kim and Bernd
Burgstaller",
title = "Dynamic partitioning-based {JPEG} decompression on
heterogeneous multicore architectures",
journal = j-CCPE,
volume = "28",
number = "2",
pages = "517--536",
month = feb,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3620",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue Feb 9 06:13:21 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "14 Aug 2015",
}
@Article{Song:2016:IAR,
author = "Yang Song and Arun Venkataramani and Lixin Gao",
title = "Identifying and Addressing Reachability and Policy
Attacks in {``Secure'' BGP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "5",
pages = "2969--2982",
month = oct,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2503642",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:39 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "BGP is known to have many security vulnerabilities due
to the very nature of its underlying assumptions of
trust among independently operated networks. Most prior
efforts have focused on attacks that can be addressed
using traditional cryptographic techniques to ensure
authentication or integrity, e.g., BGPSec and related
works. Although augmenting BGP with authentication and
integrity mechanisms is critical, they are, by design,
far from sufficient to prevent attacks based on
manipulating the complex BGP protocol itself. In this
paper, we identify two serious attacks on two of the
most fundamental goals of BGP --- to ensure
reachability and to enable ASes to pick routes
available to them according to their routing policies
--- even in the presence of BGPSec-like mechanisms. Our
key contributions are to 1 formalize a series of
critical security properties, 2 experimentally validate
using commodity router implementations that BGP fails
to achieve those properties, 3 quantify the extent of
these vulnerabilities in the Internet's AS topology,
and 4 propose simple modifications to provably ensure
that those properties are satisfied. Our experiments
show that, using our attacks, a single malicious AS can
cause thousands of other ASes to become disconnected
from thousands of other ASes for arbitrarily long,
while our suggested modifications almost completely
eliminate such attacks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Song:2016:IBS,
author = "Lingwei Song and Jinxia Wei and Licheng Wang and
Chenlei Cao and Xinxin Niu",
title = "Identity-based storage management and integrity verify
protocol for secure outsourcing in multi-cloud",
journal = j-CCPE,
volume = "28",
number = "6",
pages = "1930--1945",
day = "25",
month = apr,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3662",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Wed Jun 8 06:47:19 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Spafford:2016:SE,
author = "Eugene H. Spafford",
title = "The strength of encryption",
journal = j-CACM,
volume = "59",
number = "3",
pages = "5--5",
month = mar,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2889284",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Feb 29 14:09:08 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/3/198867/fulltext",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Strizhov:2016:SPS,
author = "Mikhail Strizhov and Zachary Osman and Indrajit Ray",
title = "Substring Position Search over Encrypted Cloud Data
Supporting Efficient Multi-User Setup",
journal = j-FUTURE-INTERNET,
volume = "8",
number = "3",
pages = "28",
day = "04",
month = jul,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi8030028",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/8/3/28",
abstract = "Existing Searchable Encryption (SE) solutions are able
to handle simple Boolean search queries, such as single
or multi-keyword queries, but cannot handle substring
search queries over encrypted data that also involve
identifying the position of the substring within the
document. These types of queries are relevant in areas
such as searching DNA data. In this paper, we propose a
tree-based Substring Position Searchable Symmetric
Encryption (SSP-SSE) to overcome the existing gap. Our
solution efficiently finds occurrences of a given
substring over encrypted cloud data. Specifically, our
construction uses the position heap tree data structure
and achieves asymptotic efficiency comparable to that
of an unencrypted position heap tree. Our encryption
takes O (k n) time, and the resulting ciphertext is of
size O (k n), where k is a security parameter and n is
the size of stored data. The search takes O (m 2 + o c
c) time and three rounds of communication, where m is
the length of the queried substring and o c c is the
number of occurrences of the substring in the document
collection. We prove that the proposed scheme is secure
against chosen-query attacks that involve an adaptive
adversary. Finally, we extend SSP-SSE to the multi-user
setting where an arbitrary group of cloud users can
submit substring queries to search the encrypted
data.",
acknowledgement = ack-nhfb,
remark = "Special Issue Security in Cloud Computing and Big
Data.",
}
@Article{Su:2016:PSN,
author = "Shenghui Su and Tao Xie and Shuwang L{\"u}",
title = "A provably secure non-iterative hash function
resisting birthday attack",
journal = j-THEOR-COMP-SCI,
volume = "654",
number = "??",
pages = "128--142",
day = "22",
month = nov,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 23 16:45:19 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397516001547",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Su:2016:SSP,
author = "Shenghui Su and Shuwang L{\"u} and Maozhi Xu and Tao
Xie",
title = "A semantically secure public key cryptoscheme using
bit-pair shadows",
journal = j-THEOR-COMP-SCI,
volume = "654",
number = "??",
pages = "113--127",
day = "22",
month = nov,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 23 16:45:19 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397516300561",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Sucasas:2016:APP,
author = "Victor Sucasas and Georgios Mantas and Firooz B.
Saghezchi and Ayman Radwan and Jonathan Rodriguez",
title = "An autonomous privacy-preserving authentication scheme
for intelligent transportation systems",
journal = j-COMPUT-SECUR,
volume = "60",
number = "??",
pages = "193--205",
month = jul,
year = "2016",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:46 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404816300463",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Sun:2016:NEB,
author = "Shuliang Sun",
title = "A novel edge based image steganography with $ 2^k $
correction and {Huffman} encoding",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "2",
pages = "93--99",
month = feb,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Nov 28 07:11:23 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015001738",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Sun:2016:RSP,
author = "Shi-Feng Sun and Joseph K. Liu and Yu Yu and Baodong
Qin and Dawu Gu",
title = "{RKA}-Secure Public Key Encryptions Against
Efficiently Invertible Functions",
journal = j-COMP-J,
volume = "59",
number = "11",
pages = "1637--1658",
month = nov,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw025",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Nov 4 09:11:48 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/11.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/11/1637",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 18, 2016",
}
@Article{Sun:2016:TCA,
author = "Yanming Sun and Min Chen and Abel Bacchus and Xiaodong
Lin",
title = "Towards collusion-attack-resilient group key
management using one-way function tree",
journal = j-COMP-NET-AMSTERDAM,
volume = "104",
number = "??",
pages = "16--26",
day = "20",
month = jul,
year = "2016",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Fri Jun 3 11:42:22 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128616301128",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Susilo:2016:EDT,
author = "Willy Susilo and Fuchun Guo and Yi Mu",
title = "Efficient dynamic threshold identity-based encryption
with constant-size ciphertext",
journal = j-THEOR-COMP-SCI,
volume = "609 (part 1)",
number = "??",
pages = "49--59",
day = "4",
month = jan,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Dec 4 06:41:42 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397515008087",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Tan:2016:BIB,
author = "Chik How Tan and Theo Fanuela Prabowo and Duc-Phong
Le",
title = "Breaking an {ID}-based encryption based on discrete
logarithm and factorization problems",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "2",
pages = "116--119",
month = feb,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Nov 28 07:11:23 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015001696",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Tan:2016:CCA,
author = "Syh-Yuan Tan and Wun-She Yap",
title = "Cryptanalysis of a {CP--ABE} scheme with policy in
normal forms",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "7",
pages = "492--495",
month = jul,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Apr 5 08:01:06 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019016300126",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Tan:2016:ESE,
author = "Jingweijia Tan and Zhi Li and Mingsong Chen and Xin
Fu",
title = "Exploring Soft-Error Robust and Energy-Efficient
Register File in {GPGPUs} using Resistive Memory",
journal = j-TODAES,
volume = "21",
number = "2",
pages = "34:1--34:??",
month = jan,
year = "2016",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/2827697",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Sat Feb 6 07:43:40 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "The increasing adoption of graphics processing units
(GPUs) for high-performance computing raises the
reliability challenge, which is generally ignored in
traditional GPUs. GPUs usually support thousands of
parallel threads and require a sizable register file.
Such large register file is highly susceptible to soft
errors and power-hungry. Although ECC has been adopted
to register file in modern GPUs, it causes considerable
power overhead, which further increases the power
stress. Thus, an energy-efficient soft-error protection
mechanism is more desirable. Besides its extremely low
leakage power consumption, resistive memory (e.g.,
spin-transfer torque RAM) is also immune to the
radiation induced soft errors due to its magnetic field
based storage. In this article, we propose to LEverage
reSistive memory to enhance the Soft-error robustness
and reduce the power consumption (LESS) of registers in
the General-Purpose computing on GPUs (GPGPUs). Since
resistive memory experiences longer write latency
compared to SRAM, we explore the unique characteristics
of GPGPU applications to obtain the win-win gains:
achieving the near-full soft-error protection for the
register file, and meanwhile substantially reducing the
energy consumption with negligible performance
degradation. Our experimental results show that LESS is
able to mitigate the registers soft-error vulnerability
by 86\% and achieve 61\% energy savings with negligible
(e.g., 1\%) performance degradation.",
acknowledgement = ack-nhfb,
articleno = "34",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Teh:2016:STD,
author = "Pin Shen Teh and Ning Zhang and Andrew Beng Jin Teoh
and Ke Chen",
title = "A survey on touch dynamics authentication in mobile
devices",
journal = j-COMPUT-SECUR,
volume = "59",
number = "??",
pages = "210--235",
month = jun,
year = "2016",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:45 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404816300256",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Tezcan:2016:IID,
author = "Cihangir Tezcan and Ali Aydin Sel{\c{c}}uk",
title = "Improved improbable differential attacks on {ISO}
standard {CLEFIA}: Expansion technique revisited",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "2",
pages = "136--143",
month = feb,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Nov 28 07:11:23 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015001659",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Theofanos:2016:SUE,
author = "Mary Theofanos and Simson Garfinkel and Yee-Yin
Choong",
title = "Secure and Usable Enterprise Authentication: Lessons
from the Field",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "5",
pages = "14--21",
month = sep # "\slash " # oct,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Nov 17 08:21:29 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/05/msp2016050014-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Tian:2016:IBS,
author = "Miaomiao Tian and Liusheng Huang",
title = "Identity-based Signatures from Lattices: Simpler,
Faster, Shorter",
journal = j-FUND-INFO,
volume = "145",
number = "2",
pages = "171--187",
month = "????",
year = "2016",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2016-1353",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Thu Sep 29 07:10:36 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Tolba:2016:GMA,
author = "Mohamed Tolba and Amr M. Youssef",
title = "Generalized {MitM} attacks on full {TWINE}",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "2",
pages = "128--135",
month = feb,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Nov 28 07:11:23 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015001660",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Tomb:2016:AVR,
author = "Aaron Tomb",
title = "Automated Verification of Real-World Cryptographic
Implementations",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "6",
pages = "26--33",
month = nov # "\slash " # dec,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Sat Feb 25 10:03:53 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/06/msp2016060026-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Trost:2016:OPC,
author = "William R. Trost and Guangwu Xu",
title = "On the Optimal Pre-Computation of Window {NAF} for
{Koblitz} Curves",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "9",
pages = "2918--2924",
month = sep,
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2493517",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Aug 10 09:04:52 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Tschorsch:2016:BBT,
author = "F. Tschorsch and B. Scheuermann",
title = "{Bitcoin} and Beyond: A Technical Survey on
Decentralized Digital Currencies",
journal = "IEEE Communications Surveys Tutorials",
volume = "18",
number = "3",
pages = "2084--2123",
month = "Third Quarter",
year = "2016",
DOI = "https://doi.org/10.1109/COMST.2016.2535718",
ISSN = "1553-877X",
ISSN-L = "1553-877X",
bibdate = "Thu Nov 30 15:24:52 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
keywords = "Altcoins; billion dollar economy; blockchain;
Contracts; cryptocurrencies; Cryptography;
decentralized digital currency; design space
exploration; digital currencies; distributed consensus;
electronic money; Internet; Online banking; Protocols;
Space exploration; survey; tutorial; Tutorials;
{Bitcoin}; {Bitcoin} protocol",
}
@Article{vanVredendaal:2016:RMM,
author = "Christine van Vredendaal",
title = "Reduced memory meet-in-the-middle attack against the
{NTRU} private key",
journal = j-LMS-J-COMPUT-MATH,
volume = "19",
number = "A",
pages = "43--57",
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1112/S1461157016000206",
ISSN = "1461-1570",
bibdate = "Fri Mar 31 08:49:52 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lms-j-comput-math.bib",
URL = "https://www.cambridge.org/core/product/2FD6898DA25DD88B007F12A56421BA73",
acknowledgement = ack-nhfb,
ajournal = "LMS J. Comput. Math.",
fjournal = "LMS Journal of Computation and Mathematics",
journal-URL = "http://journals.cambridge.org/action/displayJournal?jid=JCM",
onlinedate = "26 August 2016",
}
@Article{Vassilev:2016:ESU,
author = "Apostol Vassilev and Robert Staples",
title = "Entropy as a Service: Unlocking Cryptography's Full
Potential",
journal = j-COMPUTER,
volume = "49",
number = "9",
pages = "98--102",
month = sep,
year = "2016",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Oct 25 06:11:19 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.computer.org/csdl/mags/co/2016/09/mco2016090098-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
}
@Article{Vatajelu:2016:SMB,
author = "Elena Ioana Vatajelu and Giorgio {Di Natale} and Mario
Barbareschi and Lionel Torres and Marco Indaco and
Paolo Prinetto",
title = "{STT--MRAM}-Based {PUF} Architecture Exploiting
Magnetic Tunnel Junction Fabrication-Induced
Variability",
journal = j-JETC,
volume = "13",
number = "1",
pages = "5:1--5:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2790302",
ISSN = "1550-4832",
bibdate = "Sat Apr 8 10:16:07 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jetc.bib",
abstract = "Physically Unclonable Functions (PUFs) are emerging
cryptographic primitives used to implement low-cost
device authentication and secure secret key generation.
Weak PUF's (i.e., devices able to generate a single
signature or to deal with a limited number of
challenges) are widely discussed in literature. One of
the most investigated solutions today is based on
SRAMs. However, the rapid development of low-power,
high-density, high-performance SoCs has pushed the
embedded memories to their limits and opened the field
to the development of emerging memory technologies. The
Spin-Transfer-Torque Magnetic Random Access Memory
(STT-MRAM) has emerged as a promising choice for
embedded memories due to its reduced read/write latency
and high CMOS integration capability. In this article,
we propose an innovative PUF design based on STT-MRAM
memory. We exploit the high variability affecting the
electrical resistance of the Magnetic Tunnel Junction
(MTJ) device in anti-parallel magnetization. We will
demonstrate that the proposed solution is robust,
unclonable, and unpredictable.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Journal on Emerging Technologies in Computing
Systems (JETC)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J967",
}
@Article{Veloudis:2016:NPH,
author = "Simeon Veloudis and Nimal Nissanke",
title = "A Novel Permission Hierarchy for {RBAC} for Dealing
with {SoD} in {MAC} Models",
journal = j-COMP-J,
volume = "59",
number = "4",
pages = "462--492",
month = apr,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv060",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Mar 28 10:52:39 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/4/462",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 25, 2015",
}
@Article{Venkataramani:2016:DHC,
author = "Guru Venkataramani and Jie Chen and Milos
Doroslovacki",
title = "Detecting Hardware Covert Timing Channels",
journal = j-IEEE-MICRO,
volume = "36",
number = "5",
pages = "17--27",
month = sep # "\slash " # oct,
year = "2016",
CODEN = "IEMIDZ",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Tue Nov 1 14:24:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib",
URL = "https://www.computer.org/csdl/mags/mi/2016/05/mmi2016050017-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@Article{Wagner:2016:TPF,
author = "David Wagner",
title = "Technical Perspective: Fairness and the coin flip",
journal = j-CACM,
volume = "59",
number = "4",
pages = "75--75",
month = apr,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2898429",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Fri Apr 15 14:58:10 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/4/200173/fulltext",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Wang:2016:DRS,
author = "Zhen Wang and Mark Karpovsky and Lake Bu",
title = "Design of Reliable and Secure Devices Realizing
{Shamir}'s Secret Sharing",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "8",
pages = "2443--2455",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2485220",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 11 18:58:52 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers -",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Wang:2016:LLE,
author = "Mingzhong Wang and Dan Liu and Liehuang Zhu and
Yongjun Xu and Fei Wang",
title = "{LESPP}: lightweight and efficient strong privacy
preserving authentication scheme for secure {VANET}
communication",
journal = j-COMPUTING,
volume = "98",
number = "7",
pages = "685--708",
month = jul,
year = "2016",
CODEN = "CMPTA2",
DOI = "https://doi.org/10.1007/s00607-014-0393-x",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
bibdate = "Fri Feb 9 14:54:05 MST 2018",
bibsource = "http://link.springer.com/journal/607/98/7;
https://www.math.utah.edu/pub/tex/bib/computing.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computing",
journal-URL = "http://link.springer.com/journal/607",
}
@Article{Wang:2016:SAP,
author = "Minqian Wang and Zhenfeng Zhang and Cheng Chen",
title = "Security analysis of a privacy-preserving
decentralized ciphertext-policy attribute-based
encryption scheme",
journal = j-CCPE,
volume = "28",
number = "4",
pages = "1237--1245",
day = "25",
month = mar,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3623",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sun Apr 3 12:34:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "18 Aug 2015",
}
@Article{Wang:2016:SEP,
author = "Xinlei Wang and Amit Pande and Jindan Zhu and Prasant
Mohapatra",
title = "{STAMP}: Enabling Privacy-Preserving Location Proofs
for Mobile Users",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3276--3289",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2515119",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Location-based services are quickly becoming immensely
popular. In addition to services based on users'
current location, many potential services rely on
users' location history, or their spatial-temporal
provenance. Malicious users may lie about their
spatial-temporal provenance without a carefully
designed security system for users to prove their past
locations. In this paper, we present the
Spatial-Temporal provenance Assurance with Mutual
Proofs STAMP scheme. STAMP is designed for ad-hoc
mobile users generating location proofs for each other
in a distributed setting. However, it can easily
accommodate trusted mobile users and wireless access
points. STAMP ensures the integrity and
non-transferability of the location proofs and protects
users' privacy. A semi-trusted Certification Authority
is used to distribute cryptographic keys as well as
guard users against collusion by a light-weight
entropy-based trust evaluation approach. Our prototype
implementation on the Android platform shows that STAMP
is low-cost in terms of computational and storage
resources. Extensive simulation experiments show that
our entropy-based trust model is able to achieve high $
> 0.9 $ collusion detection accuracy.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wang:2016:SHI,
author = "Wei Wang and Peng Xu and Hui Li and Laurence Tianruo
Yang",
title = "Secure hybrid-indexed search for high efficiency over
keyword searchable ciphertexts",
journal = j-FUT-GEN-COMP-SYS,
volume = "55",
number = "??",
pages = "353--361",
month = feb,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Dec 4 07:08:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X14001484",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Wang:2016:SSS,
author = "Xianfang Wang and Jian Gao and Fang-Wei Fu",
title = "Secret Sharing Schemes from Linear Codes over {$ F_p +
\nu F_p $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "5",
pages = "595--??",
month = aug,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500180",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 3 08:23:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wei:2016:APS,
author = "Jiannan Wei and Guomin Yang and Yi Mu and Kaitai
Liang",
title = "Anonymous Proxy Signature with Hierarchical
Traceability",
journal = j-COMP-J,
volume = "59",
number = "4",
pages = "559--569",
month = apr,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv080",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Mar 28 10:52:39 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/4/559",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 28, 2015",
}
@Article{Wei:2016:PAB,
author = "Jianghong Wei and Xinyi Huang and Wenfen Liu and
Xuexian Hu",
title = "Practical Attribute-based Signature: Traceability and
Revocability",
journal = j-COMP-J,
volume = "59",
number = "11",
pages = "1714--1734",
month = nov,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw045",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Nov 4 09:11:48 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/11.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/11/1714",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "July 29, 2016",
}
@Article{Wess:2016:JWM,
author = "Jane Wess",
title = "{John Wallis} (1616--1703). {Mathematics}, Music
Theory, and Cryptography in 17th Century {Oxford}.
{Oxford University Mathematical Institute, 9 June
2016}",
journal = j-BSHM-BULL,
volume = "31",
number = "3",
pages = "252--253",
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1080/17498430.2016.1215868",
ISSN = "1749-8430 (print), 1749-8341 (electronic)",
ISSN-L = "1749-8341",
bibdate = "Tue Jun 20 11:40:34 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bshm.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.tandfonline.com/doi/full/10.1080/17498430.2016.1215868",
acknowledgement = ack-nhfb,
ajournal = "BSHM Bull.",
fjournal = "BSHM Bulletin: Journal of the British Society for the
History of Mathematics",
journal-URL = "http://www.tandfonline.com/loi/tbsh20",
onlinedate = "31 Oct 2016",
}
@Article{Won:2016:PAA,
author = "Jongho Won and Chris Y. T. Ma and David K. Y. Yau and
Nageswara S. V. Rao",
title = "Privacy-assured aggregation protocol for smart
metering: a proactive fault-tolerant approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1661--1674",
month = jun,
year = "2016",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Smart meters are integral to demand response in
emerging smart grids, by reporting the electricity
consumption of users to serve application needs. But
reporting real-time usage information for individual
households raises privacy concerns. Existing techniques
to guarantee differential privacy (DP) of smart meter
users either are not fault tolerant or achieve
(possibly partial) fault tolerance at high
communication overheads. In this paper, we propose a
fault-tolerant protocol for smart metering that can
handle general communication failures while ensuring DP
with significantly improved efficiency and lower errors
compared with the state of the art. Our protocol
handles fail-stop faults proactively by using a novel
design of future ciphertexts, and distributes trust
among the smart meters by sharing secret keys among
them. We prove the DP properties of our protocol and
analyze its advantages in fault tolerance, accuracy,
and communication efficiency relative to competing
techniques. We illustrate our analysis by simulations
driven by real-world traces of electricity
consumption.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Wu:2016:BPK,
author = "Qianhong Wu and Yang Sun and Bo Qin and Jiankun Hu and
Weiran Liu and Jianwei Liu and Yong Ding",
title = "Batch Public Key Cryptosystem with batch
multi-exponentiation",
journal = j-FUT-GEN-COMP-SYS,
volume = "62",
number = "??",
pages = "196--204",
month = sep,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue May 31 08:45:28 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15003933",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Wu:2016:CBE,
author = "Q. Wu and B. Qin and L. Zhang and J. Domingo-Ferrer
and O. Farras and J. A. Manjon",
title = "Contributory Broadcast Encryption with Efficient
Encryption and Short Ciphertexts",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "2",
pages = "466--479",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2419662",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jan 19 07:06:51 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Wu:2016:LTN,
author = "Felix Wu",
title = "Law and Technology: No easy answers in the fight over
{iPhone} decryption",
journal = j-CACM,
volume = "59",
number = "9",
pages = "20--22",
month = sep,
year = "2016",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/2971325",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Aug 25 18:05:32 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2016/9/206250/fulltext",
abstract = "A look at the legal background and future
possibilities for an issue that is likely to reoccur.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Xia:2016:SDM,
author = "Zhihua Xia and Xinhui Wang and Xingming Sun and Qian
Wang",
title = "A Secure and Dynamic Multi-Keyword Ranked Search
Scheme over Encrypted Cloud Data",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "27",
number = "2",
pages = "340--352",
month = feb,
year = "2016",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2015.2401003",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Tue Jan 19 07:28:23 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://www.computer.org/csdl/trans/td/2016/02/07039216-abs.html",
abstract-URL = "http://www.computer.org/csdl/trans/td/2016/02/07039216-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Xiang:2016:EMP,
author = "Xinyin Xiang and Hui Li and Mingyu Wang and Xingwen
Zhao",
title = "Efficient multi-party concurrent signature from
lattices",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "8",
pages = "497--502",
month = aug,
year = "2016",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu May 19 07:58:41 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019016300138",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Xiao:2016:REM,
author = "Chen Xiao and Lifeng Wang and Mengjiao Zhu and Wendong
Wang",
title = "A resource-efficient multimedia encryption scheme for
embedded video sensing system based on unmanned
aircraft",
journal = j-J-NETW-COMPUT-APPL,
volume = "59",
number = "??",
pages = "117--125",
month = jan,
year = "2016",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Feb 8 11:55:17 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804515001654",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Xu:2016:CCP,
author = "Jie Xu and Qiaoyan Wen and Wenmin Li and Zhengping
Jin",
title = "Circuit Ciphertext-Policy Attribute-Based Hybrid
Encryption with Verifiable Delegation in Cloud
Computing",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "27",
number = "1",
pages = "119--129",
month = jan,
year = "2016",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2015.2392752",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Tue Dec 15 09:28:10 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
note = "See comments \cite{Xiong:2017:CCC}.",
URL = "http://www.computer.org/csdl/trans/td/2016/01/07010954-abs.html",
abstract-URL = "http://www.computer.org/csdl/trans/td/2016/01/07010954-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Xu:2016:CIB,
author = "P. Xu and T. Jiao and Q. Wu and W. Wang and H. Jin",
title = "Conditional Identity-Based Broadcast Proxy
Re-Encryption and Its Application to Cloud Email",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "1",
pages = "66--79",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2417544",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Dec 15 09:36:24 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Yagan:2016:WSN,
author = "Osman Yagan and Armand M. Makowski",
title = "Wireless Sensor Networks Under the Random Pairwise Key
Predistribution Scheme: Can Resiliency Be Achieved With
Small Key Rings?",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "6",
pages = "3383--3396",
month = dec,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2527742",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Jan 21 07:15:40 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We investigate the resiliency of wireless sensor
networks against sensor capture attacks when the
network uses the random pairwise key distribution
scheme of Chan et al. We present conditions on the
model parameters so that the network is: 1 unassailable
and 2 unsplittable, both with high probability, as the
number $n$ of sensor nodes becomes large. Both notions
are defined against an adversary who has unlimited
computing resources and full knowledge of the network
topology, but can only capture a negligible fraction $
o n$ of sensors. We also show that the number of
cryptographic keys needed to ensure unassailability and
unsplittability under the pairwise key predistribution
scheme is an order of magnitude smaller than it is
under the key predistribution scheme of Eschenauer and
Gligor.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yan:2016:DEB,
author = "Zheng Yan and Wenxiu Ding and Xixun Yu and Haiqi Zhu
and Robert H. Deng",
title = "Deduplication on Encrypted Big Data in Cloud",
journal = j-IEEE-TRANS-BIG-DATA,
volume = "2",
number = "2",
pages = "138--150",
month = "????",
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1109/TBDATA.2016.2587659",
ISSN = "2332-7790",
ISSN-L = "2332-7790",
bibdate = "Tue Oct 25 08:33:01 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Yang:2016:EBB,
author = "Ching-Nung Yang and Cheng-Hua Chen and Song-Ruei Cai",
title = "Enhanced {Boolean}-based multi secret image sharing
scheme",
journal = j-J-SYST-SOFTW,
volume = "116",
number = "??",
pages = "22--34",
month = jun,
year = "2016",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Thu May 19 08:19:12 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121215000205",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Yang:2016:ECV,
author = "Ching-Nung Yang and Li-Zhe Sun and Song-Ruei Cai",
title = "Extended color visual cryptography for black and white
secret image",
journal = j-THEOR-COMP-SCI,
volume = "609 (part 1)",
number = "??",
pages = "143--161",
day = "4",
month = jan,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Dec 4 06:41:42 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397515008452",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Yang:2016:EHA,
author = "Xu Yang and Xinyi Huang and Joseph K. Liu",
title = "Efficient handover authentication with user anonymity
and untraceability for Mobile Cloud Computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "62",
number = "??",
pages = "190--195",
month = sep,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue May 31 08:45:28 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15003088",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Yang:2016:EPA,
author = "Guangyang Yang and Jia Yu and Wenting Shen and
Qianqian Su and Zhangjie Fu and Rong Hao",
title = "Enabling public auditing for shared data in cloud
storage supporting identity privacy and traceability",
journal = j-J-SYST-SOFTW,
volume = "113",
number = "??",
pages = "130--139",
month = mar,
year = "2016",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Thu Jan 21 14:55:20 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S016412121500268X",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Yang:2016:IHA,
author = "Xu Yang and Xinyi Huang and Jinguang Han and Chunhua
Su",
title = "Improved handover authentication and key
pre-distribution for wireless mesh networks",
journal = j-CCPE,
volume = "28",
number = "10",
pages = "2978--2990",
month = jul,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3544",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue Sep 13 08:30:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Yang:2016:TCP,
author = "Baijian Justin Yang and Brian Kirk",
title = "{Try-CybSI}: A Platform for Trying Out Cybersecurity",
journal = j-IEEE-SEC-PRIV,
volume = "14",
number = "4",
pages = "74--75",
month = jul # "\slash " # aug,
year = "2016",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Nov 17 08:21:28 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2016/04/msp2016040074-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "https://publications.computer.org/security-and-privacy/",
}
@Article{Yassein:2016:FSB,
author = "M. B. Yassein and Y. Khamayseh and M. AbuJazoh",
title = "Feature Selection for Black Hole Attacks",
journal = j-J-UCS,
volume = "22",
number = "4",
pages = "521--??",
month = "????",
year = "2016",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Wed Sep 7 16:47:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_22_4/feature_selection_for_black",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Ye:2016:IEA,
author = "Guodong Ye and Xiaoling Huang",
title = "An Image Encryption Algorithm Based on Autoblocking
and Electrocardiography",
journal = j-IEEE-MULTIMEDIA,
volume = "23",
number = "2",
pages = "64--71",
month = apr # "\slash " # jun,
year = "2016",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2015.72",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Wed Jun 8 08:28:55 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
URL = "https://www.computer.org/csdl/mags/mu/2016/02/mmu2016020064-abs.html",
abstract-URL = "https://www.computer.org/csdl/mags/mu/2016/02/mmu2016020064-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/multimedia/",
}
@Article{Yi:2016:IPA,
author = "Xun Yi and Fang-Yu Rao and Zahir Tari and Feng Hao and
Elisa Bertino and Ibrahim Khalil and Albert Y. Zomaya",
title = "{ID2S} Password-Authenticated Key Exchange Protocols",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "12",
pages = "3687--3701",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2553031",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Nov 10 05:41:07 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Yi:2016:VSF,
author = "Haibo Yi and Shaohua Tang",
title = "Very Small {FPGA} Processor for Multivariate
Signatures",
journal = j-COMP-J,
volume = "59",
number = "7",
pages = "1091--1101",
month = jul,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw008",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Aug 30 07:10:49 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/7/1091",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "February 17, 2016",
}
@Article{Yu:2016:CBE,
author = "Qihong Yu and Jiguo Li and Yichen Zhang and Wei Wu and
Xinyi Huang and Yang Xiang",
title = "Certificate-based encryption resilient to key
leakage",
journal = j-J-SYST-SOFTW,
volume = "116",
number = "??",
pages = "101--112",
month = jun,
year = "2016",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Thu May 19 08:19:12 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121215001326",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Yu:2016:CDI,
author = "Yong Yu and Liang Xue and Man Ho Au and Willy Susilo
and Jianbing Ni and Yafang Zhang and Athanasios V.
Vasilakos and Jian Shen",
title = "Cloud data integrity checking with an identity-based
auditing mechanism from {RSA}",
journal = j-FUT-GEN-COMP-SYS,
volume = "62",
number = "??",
pages = "85--91",
month = sep,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue May 31 08:45:28 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16300164",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Yu:2016:DNF,
author = "Jiangshan Yu and Vincent Cheval and Mark Ryan",
title = "{DTKI}: a New Formalized {PKI} with Verifiable Trusted
Parties",
journal = j-COMP-J,
volume = "59",
number = "11",
pages = "1695--1713",
month = nov,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw039",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Nov 4 09:11:48 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/11.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/11/1695",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "July 20, 2016",
}
@Article{Yu:2016:SSD,
author = "Yong Yu and Jianbing Ni and Qi Xia and Xiaofen Wang
and Haomiao Yang and Xiaosong Zhang",
title = "{SDIVIP$^2$}: shared data integrity verification with
identity privacy preserving in mobile clouds",
journal = j-CCPE,
volume = "28",
number = "10",
pages = "2877--2888",
month = jul,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3484",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue Sep 13 08:30:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Zenger:2016:AKE,
author = "Christian T. Zenger and Mario Pietersz and Jan Zimmer
and Jan-Felix Posielek and Thorben Lenze and Christof
Paar",
title = "Authenticated key establishment for low-resource
devices exploiting correlated random channels",
journal = j-COMP-NET-AMSTERDAM,
volume = "109 (part 1)",
number = "??",
pages = "105--123",
day = "9",
month = nov,
year = "2016",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Nov 23 16:15:16 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128616301943",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Zhang:2016:CAH,
author = "Leyou Zhang and Yi Mu and Qing Wu",
title = "Compact Anonymous Hierarchical Identity-Based
Encryption with Constant Size Private Keys",
journal = j-COMP-J,
volume = "59",
number = "4",
pages = "452--461",
month = apr,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv059",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Mar 28 10:52:39 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/4/452",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 13, 2015",
}
@Article{Zhang:2016:DEP,
author = "Rui Zhang and Rui Xue and Ting Yu and Ling Liu",
title = "Dynamic and Efficient Private Keyword Search over
Inverted Index-Based Encrypted Data",
journal = j-TOIT,
volume = "16",
number = "3",
pages = "21:1--21:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2940328",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Nov 17 08:48:51 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Querying over encrypted data is gaining increasing
popularity in cloud-based data hosting services.
Security and efficiency are recognized as two important
and yet conflicting requirements for querying over
encrypted data. In this article, we propose an
efficient private keyword search (EPKS) scheme that
supports binary search and extend it to dynamic
settings (called DEPKS ) for inverted index--based
encrypted data. First, we describe our approaches of
constructing a searchable symmetric encryption (SSE)
scheme that supports binary search. Second, we present
a novel framework for EPKS and provide its formal
security definitions in terms of plaintext privacy and
predicate privacy by modifying Shen et al.'s security
notions [Shen et al. 2009]. Third, built on the
proposed framework, we design an EPKS scheme whose
complexity is logarithmic in the number of keywords.
The scheme is based on the groups of prime order and
enjoys strong notions of security, namely statistical
plaintext privacy and statistical predicate privacy.
Fourth, we extend the EPKS scheme to support dynamic
keyword and document updates. The extended scheme not
only maintains the properties of logarithmic-time
search efficiency and plaintext privacy and predicate
privacy but also has fewer rounds of communications for
updates compared to existing dynamic search encryption
schemes. We experimentally evaluate the proposed EPKS
and DEPKS schemes and show that they are significantly
more efficient in terms of both keyword search
complexity and communication complexity than existing
randomized SSE schemes.",
acknowledgement = ack-nhfb,
articleno = "21",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zhang:2016:EEA,
author = "Liping Zhang and Shanyu Tang and Shaohui Zhu",
title = "An energy efficient authenticated key agreement
protocol for {SIP}-based green {VoIP} networks",
journal = j-J-NETW-COMPUT-APPL,
volume = "59",
number = "??",
pages = "126--133",
month = jan,
year = "2016",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Feb 8 11:55:17 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804515001666",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Zhang:2016:PAG,
author = "Yuexin Zhang and Yang Xiang and Xinyi Huang",
title = "Password-Authenticated Group Key Exchange: a
Cross-Layer Design",
journal = j-TOIT,
volume = "16",
number = "4",
pages = "24:1--24:??",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2955095",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Thu Dec 22 16:47:17 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Two-party password-authenticated key exchange (2PAKE)
protocols provide a natural mechanism for secret key
establishment in distributed applications, and they
have been extensively studied in past decades. However,
only a few efforts have been made so far to design
password-authenticated group key exchange (GPAKE)
protocols. In a 2PAKE or GPAKE protocol, it is assumed
that short passwords are preshared among users. This
assumption, however, would be impractical in certain
applications. Motivated by this observation, this
article presents a GPAKE protocol without the password
sharing assumption. To obtain the passwords, wireless
devices, such as smart phones, tablets, and laptops,
are used to extract short secrets at the physical
layer. Using the extracted secrets, users in our
protocol can establish a group key at higher layers
with light computation consumptions. Thus, our GPAKE
protocol is a cross-layer design. Additionally, our
protocol is a compiler, that is, our protocol can
transform any provably secure 2PAKE protocol into a
GPAKE protocol with only one more round of
communications. Besides, the proposed protocol is
proved secure in the standard model.",
acknowledgement = ack-nhfb,
articleno = "24",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Zhang:2016:PPV,
author = "Lei Zhang and Chuanyan Hu and Qianhong Wu and Josep
Domingo-Ferrer and Bo Qin",
title = "Privacy-Preserving Vehicular Communication
Authentication with Hierarchical Aggregation and Fast
Response",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "8",
pages = "2562--2574",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2485225",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 11 18:58:52 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers -",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Zhang:2016:SBA,
author = "Yue Zhang and Jing Qin and Lihua Du",
title = "A secure biometric authentication based on {PEKS}",
journal = j-CCPE,
volume = "28",
number = "4",
pages = "1111--1123",
day = "25",
month = mar,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3539",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sun Apr 3 12:34:13 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "5 Jun 2015",
}
@Article{Zhang:2016:TLT,
author = "Mingwu Zhang and Yi Mu",
title = "Token-Leakage Tolerant and Vector Obfuscated {IPE} and
Application in Privacy-Preserving Two-Party Point\slash
Polynomial Evaluations",
journal = j-COMP-J,
volume = "59",
number = "4",
pages = "493--507",
month = apr,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv065",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Mar 28 10:52:39 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/4/493",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "August 26, 2015",
}
@Article{Zheng:2016:EUV,
author = "Nan Zheng and Aaron Paloski and Haining Wang",
title = "An Efficient User Verification System Using
Angle-Based Mouse Movement Biometrics",
journal = j-TISSEC,
volume = "18",
number = "3",
pages = "11:1--11:??",
month = apr,
year = "2016",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/2893185",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Fri Apr 15 13:02:47 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "Biometric authentication verifies a user based on its
inherent, unique characteristics-who you are. In
addition to physiological biometrics, behavioral
biometrics has proven very useful in authenticating a
user. Mouse dynamics, with their unique patterns of
mouse movements, is one such behavioral biometric. In
this article, we present a user verification system
using mouse dynamics, which is transparent to users and
can be naturally applied for continuous
reauthentication. The key feature of our system lies in
using much more fine-grained (point-by-point)
angle-based metrics of mouse movements for user
verification. These new metrics are relatively unique
from person to person and independent of a computing
platform. Moreover, we utilize support vector machines
(SVMs) for quick and accurate classification. Our
technique is robust across different operating
platforms, and no specialized hardware is required. The
efficacy of our approach is validated through a series
of experiments, which are based on three sets of user
mouse movement data collected in controllable
environments and in the field. Our experimental results
show that the proposed system can verify a user in an
accurate and timely manner, with minor induced system
overhead.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Zhou:2016:HFD,
author = "Peng Zhou and Xiaojing Gu and Rocky K. C. Chang",
title = "Harvesting File Download Exploits in the {Web}: a
Hacker's View",
journal = j-COMP-J,
volume = "59",
number = "4",
pages = "522--540",
month = apr,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxv072",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Mar 28 10:52:39 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/4/522",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "September 6, 2015",
}
@Article{Zhou:2016:IBP,
author = "Yunya Zhou and Hua Deng and Qianhong Wu and Bo Qin and
Jianwei Liu and Yong Ding",
title = "Identity-based proxy re-encryption version 2: Making
mobile access easy in cloud",
journal = j-FUT-GEN-COMP-SYS,
volume = "62",
number = "??",
pages = "128--139",
month = sep,
year = "2016",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue May 31 08:45:28 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15003076",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Zhou:2016:SRB,
author = "Lan Zhou and Vijay Varadharajan and K. Gopinath",
title = "A Secure Role-Based Cloud Storage System For Encrypted
Patient-Centric Health Records",
journal = j-COMP-J,
volume = "59",
number = "11",
pages = "1593--1611",
month = nov,
year = "2016",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw019",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Nov 4 09:11:48 MDT 2016",
bibsource = "http://comjnl.oxfordjournals.org/content/59/11.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/59/11/1593",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "July 13, 2016",
}
@Article{Zhu:2016:SCI,
author = "Youwen Zhu and Zhiqiu Huang and Tsuyoshi Takagi",
title = "Secure and controllable {$k$-NN} query over encrypted
cloud data with key confidentiality",
journal = j-J-PAR-DIST-COMP,
volume = "89",
number = "??",
pages = "1--12",
month = mar,
year = "2016",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Thu Feb 11 09:00:16 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731515002105",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315/",
}
@Article{Aga:2017:ISM,
author = "Shaizeen Aga and Satish Narayanasamy",
title = "{InvisiMem}: Smart Memory Defenses for Memory Bus Side
Channel",
journal = j-COMP-ARCH-NEWS,
volume = "45",
number = "2",
pages = "94--106",
month = may,
year = "2017",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/3140659.3080232",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri Sep 15 11:09:14 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "A practically feasible low-overhead hardware design
that provides strong defenses against memory bus side
channel remains elusive. This paper observes that smart
memory, memory with compute capability and a packetized
interface, can dramatically simplify this problem.
InvisiMem expands the trust base to include the logic
layer in the smart memory to implement cryptographic
primitives, which aid in addressing several memory bus
side channel vulnerabilities efficiently. This allows
the secure host processor to send encrypted addresses
over the untrusted memory bus, and thereby eliminates
the need for expensive address obfuscation techniques
based on Oblivious RAM (ORAM). In addition, smart
memory enables efficient solutions for ensuring
freshness without using expensive Merkle trees, and
mitigates memory bus timing channel using constant
heart-beat packets. We demonstrate that InvisiMem
designs have one to two orders of magnitude of lower
overheads for performance, space, energy, and memory
bandwidth, compared to prior solutions.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Ahir:2017:LAR,
author = "Prashant Ahir and Mehran Mozaffari-Kermani and Reza
Azarderakhsh",
title = "Lightweight Architectures for Reliable and Fault
Detection {Simon} and {Speck} Cryptographic Algorithms
on {FPGA}",
journal = j-TECS,
volume = "16",
number = "4",
pages = "109:1--109:??",
month = aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055514",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Aug 14 18:53:33 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "The widespread use of sensitive and constrained
applications necessitates lightweight (low-power and
low-area) algorithms developed for constrained
nano-devices. However, nearly all of such algorithms
are optimized for platform-based performance and may
not be useful for diverse and flexible applications.
The National Security Agency (NSA) has proposed two
relatively recent families of lightweight ciphers, that
is, Simon and Speck, designed as efficient ciphers on
both hardware and software platforms. This article
proposes concurrent error detection schemes to provide
reliable architectures for these two families of
lightweight block ciphers. The research work on
analyzing the reliability of these algorithms and
providing fault diagnosis approaches has not been
undertaken to date to the best of our knowledge. The
main aim of the proposed reliable architectures is to
provide high error coverage while maintaining
acceptable area and power consumption overheads. To
achieve this, we propose a variant of recomputing with
encoded operands. These low-complexity schemes are
suited for low-resource applications such as sensitive,
constrained implantable and wearable medical devices.
We perform fault simulations for the proposed
architectures by developing a fault model framework.
The architectures are simulated and analyzed on recent
field-programmable grate array (FPGA) platforms, and it
is shown that the proposed schemes provide high error
coverage. The proposed low-complexity concurrent error
detection schemes are a step forward toward more
reliable architectures for Simon and Speck algorithms
in lightweight, secure applications.",
acknowledgement = ack-nhfb,
articleno = "109",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Ahmed:2017:IRD,
author = "Kareem Ahmed and Ibrahim El-Henawy",
title = "Increasing robustness of {Data Encryption Standard} by
integrating {DNA} cryptography",
journal = j-INT-J-COMPUT-APPL,
volume = "39",
number = "2",
pages = "91--105",
year = "2017",
DOI = "https://doi.org/10.1080/1206212X.2017.1289690",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:31:06 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2017.1289690",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "22 Feb 2017",
}
@Article{Al-Tariq:2017:SFP,
author = "Abdullah Al-Tariq and Abu Raihan Mostofa Kamal and Md.
Abdul Hamid and M. Abdullah-Al-Wadud and Mohammad
Mehedi Hassan and Sk Md. Mizanur Rahman",
title = "A scalable framework for protecting user identity and
access pattern in untrusted {Web} server using forward
secrecy, public key encryption and {Bloom} filter",
journal = j-CCPE,
volume = "29",
number = "23",
pages = "??--??",
day = "10",
month = dec,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3863",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Dec 30 09:11:59 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Alabdulatif:2017:PPA,
author = "Abdulatif Alabdulatif and Heshan Kumarage and Ibrahim
Khalil and Xun Yi",
title = "Privacy-preserving anomaly detection in cloud with
lightweight homomorphic encryption",
journal = j-J-COMP-SYS-SCI,
volume = "90",
number = "??",
pages = "28--45",
month = dec,
year = "2017",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2017.03.001",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:38 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000017300284",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Altaf:2017:LHL,
author = "Muhammad Shoaib Bin Altaf and David A. Wood",
title = "{LogCA}: a High-Level Performance Model for Hardware
Accelerators",
journal = j-COMP-ARCH-NEWS,
volume = "45",
number = "2",
pages = "375--388",
month = may,
year = "2017",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/3140659.3080216",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri Sep 15 11:09:14 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "With the end of Dennard scaling, architects have
increasingly turned to special-purpose hardware
accelerators to improve the performance and energy
efficiency for some applications. Unfortunately,
accelerators don't always live up to their expectations
and may under-perform in some situations. Understanding
the factors which effect the performance of an
accelerator is crucial for both architects and
programmers early in the design stage. Detailed models
can be highly accurate, but often require low-level
details which are not available until late in the
design cycle. In contrast, simple analytical models can
provide useful insights by abstracting away low-level
system details. In this paper, we propose LogCA---a
high-level performance model for hardware accelerators.
LogCA helps both programmers and architects identify
performance bounds and design bottlenecks early in the
design cycle, and provide insight into which
optimizations may alleviate these bottlenecks. We
validate our model across a variety of kernels, ranging
from sub-linear to super-linear complexities on both
on-chip and off-chip accelerators. We also describe the
utility of LogCA using two retrospective case studies.
First, we discuss the evolution of interface design in
SUN/Oracle's encryption accelerators. Second, we
discuss the evolution of memory interface design in
three different GPU architectures. In both cases, we
show that the adopted design optimizations for these
machines are similar to LogCA's suggested
optimizations. We argue that architects and programmers
can use insights from these retrospective studies for
improving future designs.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@InProceedings{Alwen:2017:TPA,
author = "Jo{\"e}l Alwen and Jeremiah Blocki",
editor = "{IEEE}",
booktitle = "{Proceedings 2nd IEEE European Symposium on Security
and Privacy, 26--28 April 2017, Paris, France}",
title = "Towards Practical Attacks on {Argon2i} and Balloon
Hashing",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "142--157",
year = "2017",
DOI = "https://doi.org/10.1109/EuroSP.2017.47",
ISBN = "1-5090-5761-7",
ISBN-13 = "978-1-5090-5761-0",
LCCN = "????",
bibdate = "Wed Feb 19 09:17:05 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "IEEE Computer Society Order Number E6100. See
\cite{Biryukov:2016:ANG,Boneh:2016:BHP}.",
URL = "https://ieeexplore.ieee.org/document/7961977",
acknowledgement = ack-nhfb,
remark = "From the abstract: ``The algorithm Argon2i-B of
Biryukov, Dinu and Khovratovich is currently being
considered by the IRTF (Internet Research Task Force)
as a new de-facto standard for password hashing. An
older version (Argon2i-A) of the same algorithm was
chosen as the winner of the recent Password Hashing
Competition. An important competitor to Argon2i-B is
the recently introduced Balloon Hashing (BH) algorithm
of Corrigan-Gibs, Boneh and Schechter.'' NetBSD 9.0
includes a package for Argon2.",
}
@Article{Ambrosin:2017:OBB,
author = "Moreno Ambrosin and Paolo Braca and Mauro Conti and
Riccardo Lazzeretti",
title = "{ODIN}: Obfuscation-Based Privacy-Preserving Consensus
Algorithm for Decentralized Information Fusion in Smart
Device Networks",
journal = j-TOIT,
volume = "18",
number = "1",
pages = "6:1--6:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3137573",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Fri Dec 22 18:09:06 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The large spread of sensors and smart devices in urban
infrastructures are motivating research in the area of
the Internet of Things (IoT) to develop new services
and improve citizens' quality of life. Sensors and
smart devices generate large amounts of measurement
data from sensing the environment, which is used to
enable services such as control of power consumption or
traffic density. To deal with such a large amount of
information and provide accurate measurements, service
providers can adopt information fusion, which given the
decentralized nature of urban deployments can be
performed by means of consensus algorithms. These
algorithms allow distributed agents to (iteratively)
compute linear functions on the exchanged data, and
take decisions based on the outcome, without the need
for the support of a central entity. However, the use
of consensus algorithms raises several security
concerns, especially when private or security critical
information is involved in the computation. In this
article we propose ODIN, a novel algorithm allowing
information fusion over encrypted data. ODIN is a
privacy-preserving extension of the popular consensus
gossip algorithm, which prevents distributed agents
from having direct access to the data while they
iteratively reach consensus; agents cannot access even
the final consensus value but can only retrieve partial
information (e.g., a binary decision). ODIN uses
efficient additive obfuscation and proxy re-encryption
during the update steps and garbled circuits to make
final decisions on the obfuscated consensus. We discuss
the security of our proposal and show its
practicability and efficiency on real-world
resource-constrained devices, developing a prototype
implementation for Raspberry Pi devices.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Anada:2017:CGS,
author = "Hiroaki Anada and Junpei Kawamoto and Chenyutao Ke and
Kirill Morozov and Kouichi Sakurai",
title = "Cross-group secret sharing scheme for secure usage of
cloud storage over different providers and regions",
journal = j-J-SUPERCOMPUTING,
volume = "73",
number = "10",
pages = "4275--4301",
month = oct,
year = "2017",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-017-2009-7",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Mon Oct 2 11:08:36 MDT 2017",
bibsource = "http://link.springer.com/journal/11227/73/10;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
}
@Misc{Anonymous:2017:BA,
author = "Anonymous",
title = "{BitErrant} attack",
howpublished = "Web site",
day = "6",
month = mar,
year = "2017",
bibdate = "Wed Mar 08 08:41:50 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "The story describes how SHA-1 collision attacks could
lead to bogus, and malware, file downloads via
BitTorrent: the obvious solution, which should have
been adopted long ago, is to use multiple checksum
algorithms, and require all to match before concluding
that two files are in fact identical.",
URL = "http://biterrant.io/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:2017:BRM,
author = "Anonymous",
title = "Book Review: {{\booktitle{The Mathematics of
Secrets}}, by Joshua Holden. Princeton University
Press. ISBN 978-0-691-14175-6}",
journal = j-NETWORK-SECURITY,
volume = "2017",
number = "3",
pages = "4--4",
month = mar,
year = "2017",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(17)30024-7",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:43 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485817300247",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Misc{Anonymous:2017:CCS,
author = "Anonymous",
title = "Cybernetica Case Study: Solving the {Estonian}
{ID}-card Case",
howpublished = "Web news story.",
day = "13",
month = dec,
year = "2017",
bibdate = "Tue Jan 16 06:58:04 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "The story describes a poor choice of generating large
(about 1024 bits) primes $p$ and $q$ that led to
crackable RSA cryptography. The solution for Estonia
was to switch to elliptic-curve cryptography that was
also supported by the cards.",
URL = "https://cyber.ee/en/news/cybernetica-case-study-solving-the-estonian-id-card-case/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:2017:HDQ,
author = "Anonymous",
title = "High-Dimensional Quantum Encryption Performed in
Real-World City Conditions for First Time",
journal = j-SCI-COMPUT,
volume = "??",
number = "??",
pages = "??--??",
day = "24",
month = aug,
year = "2017",
CODEN = "SCHRCU",
ISSN = "1930-5753 (print), 1930-6156 (electronic)",
ISSN-L = "1930-5753",
bibdate = "Mon Aug 28 12:23:34 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.scientificcomputing.com/news/2017/08/high-dimensional-quantum-encryption-performed-real-world-city-conditions-first-time",
acknowledgement = ack-nhfb,
fjournal = "Scientific Computing",
journal-URL = "http://digital.scientificcomputing.com/scientificcomputing/",
}
@Article{Anonymous:2017:MBH,
author = "Anonymous",
title = "Mathematician Breaks Down How to Defend Against
Quantum Computing Attacks",
journal = j-RES-DEV,
volume = "??",
number = "??",
pages = "??--??",
day = "2",
month = feb,
year = "2017",
CODEN = "REDEEA",
ISSN = "0746-9179",
bibdate = "Tue Feb 28 15:53:14 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.rdmag.com/news/2017/02/mathematician-breaks-down-how-defend-against-quantum-computing-attacks",
acknowledgement = ack-nhfb,
fjournal = "Research \& Development",
}
@Misc{Anonymous:2017:RV,
author = "Anonymous",
title = "{ROCA} vulnerability",
howpublished = "Wikipedia article.",
month = oct,
year = "2017",
bibdate = "Wed Oct 25 18:07:09 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "The ROCA vulnerability affects millions of smartcards,
and devices using TPM (Trusted Platform Modules). It
allows recovery of the private key from knowledge of
the RSA public key, and thus, facilitates malicious
cloning of the cards, and decrypting of some encrypted
filesystems.",
URL = "https://en.wikipedia.org/wiki/ROCA_vulnerability",
acknowledgement = ack-nhfb,
keywords = "Return of the Coppersmith Attack (ROCA)",
}
@Article{Antonopoulos:2017:DIS,
author = "Timos Antonopoulos and Paul Gazzillo and Michael Hicks
and Eric Koskinen and Tachio Terauchi and Shiyi Wei",
title = "Decomposition instead of self-composition for proving
the absence of timing channels",
journal = j-SIGPLAN,
volume = "52",
number = "6",
pages = "362--375",
month = jun,
year = "2017",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/3140587.3062378",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Sat Sep 16 10:18:17 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "We present a novel approach to proving the absence of
timing channels. The idea is to partition the program's
execution traces in such a way that each partition
component is checked for timing attack resilience by a
time complexity analysis and that per-component
resilience implies the resilience of the whole program.
We construct a partition by splitting the program
traces at secret-independent branches. This ensures
that any pair of traces with the same public input has
a component containing both traces. Crucially, the
per-component checks can be normal safety properties
expressed in terms of a single execution. Our approach
is thus in contrast to prior approaches, such as
self-composition, that aim to reason about multiple $
(k \geq 2) $ executions at once. We formalize the above
as an approach called quotient partitioning,
generalized to any k -safety property, and prove it to
be sound. A key feature of our approach is a
demand-driven partitioning strategy that uses a
regex-like notion called trails to identify sets of
execution traces, particularly those influenced by
tainted (or secret) data. We have applied our technique
in a prototype implementation tool called Blazer, based
on WALA, PPL, and the brics automaton library. We have
proved timing-channel freedom of (or synthesized an
attack specification for) 24 programs written in Java
bytecode, including 6 classic examples from the
literature and 6 examples extracted from the DARPA STAC
challenge problems.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "PLDI '17 conference proceedings.",
}
@Article{Applebaum:2017:AC,
author = "Benny Applebaum and Jonathan Avron and Chris Brzuska",
title = "Arithmetic Cryptography",
journal = j-J-ACM,
volume = "64",
number = "2",
pages = "10:1--10:??",
month = jun,
year = "2017",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/3046675",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
bibdate = "Fri Sep 8 08:45:18 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "We study the possibility of computing cryptographic
primitives in a fully black-box arithmetic model over a
finite field $F$. In this model, the input to a
cryptographic primitive (e.g., encryption scheme) is
given as a sequence of field elements, the honest
parties are implemented by arithmetic circuits that
make only a black-box use of the underlying field, and
the adversary has a full (non-black-box) access to the
field. This model captures many standard
information-theoretic constructions. We prove several
positive and negative results in this model for various
cryptographic tasks. On the positive side, we show
that, under coding-related intractability assumptions,
computational primitives like commitment schemes,
public-key encryption, oblivious transfer, and general
secure two-party computation can be implemented in this
model. On the negative side, we prove that garbled
circuits, additively homomorphic encryption, and secure
computation with low online complexity cannot be
achieved in this model. Our results reveal a
qualitative difference between the standard Boolean
model and the arithmetic model, and explain, in
retrospect, some of the limitations of previous
constructions.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Artemenko:2017:PGO,
author = "Sergei Artemenko and Ronen Shaltiel",
title = "Pseudorandom Generators with Optimal Seed Length for
Non-{Boolean} Poly-Size Circuits",
journal = j-TOCT,
volume = "9",
number = "2",
pages = "6:1--6:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3018057",
ISSN = "1942-3454 (print), 1942-3462 (electronic)",
ISSN-L = "1942-3454",
bibdate = "Mon Jul 24 17:35:50 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toct/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/toct.bib",
abstract = "A sampling procedure for a distribution $P$ over $ \{
0, 1 \}^l$ is a function $ C : \{ 0, 1 \}^n \to \{ 0, 1
\}^l$ such that the distribution $ C(U_n)$ (obtained by
applying $C$ on the uniform distribution $ U_n$) is the
``desired distribution'' $P$. Let $ n > r \geq l =
n^{\Omega (1)}$. An $ \epsilon - n b$-PRG (defined by
Dubrov and Ishai [2006]) is a function $ G : \{ 0, 1
\}^r \to \{ 0, 1 \}^n$ such that for every $ C : \{ 0,
1 \}^n \to \{ 0, 1 \}^l$ in some class of ``interesting
sampling procedures,'' '$ C(U_r) = C(G (U_r))$ is $
\epsilon $-close to $ C(U_n)$ in statistical distance.
We construct poly-time computable nb-PRGs with $ r = O
(l)$ for poly-size circuits relying on the assumption
that there exists $ \beta > 0$ and a problem $L$ in $ E
= {\rm DTIME}(2^{O(n)})$ such that for every large
enough n, nondeterministic circuits of size $ 2^{ \beta
n}$ that have NP-gates cannot solve $L$ on inputs of
length $n$. This assumption is a scaled nonuniform
analog of (the widely believed) EXP /= $ \Sigma_2^P$,
and similar assumptions appear in various contexts in
derandomization. Previous nb-PRGs of Dubrov and Ishai
have $ r = \Omega (l^2)$ and are based on very strong
cryptographic assumptions or, alternatively, on
nonstandard assumptions regarding incompressibility of
functions on random inputs. When restricting to
poly-size circuits $ C : \{ 0, 1 \}^n \to \{ 0, 1 \}^l$
with Shannon entropy $ H(C(U_n)) \leq k$, for $ l > k =
n^{\Omega (1)}$, our nb-PRGs have $ r = O (k)$. The
nb-PRGs of Dubrov and Ishai use seed length $ r =
\Omega (k^2)$ and require that the probability
distribution of $ C(U_n)$ is efficiently computable.
Our nb-PRGs follow from a notion of ``conditional
PRGs,'' which may be of independent interest. These are
PRGs where $ G(U_r)$ remains pseudorandom even when
conditioned on a ``large'' event $ \{ A(G(U_r)) = 1 \}
$, for an arbitrary poly-size circuit $A$. A related
notion was considered by Shaltiel and Umans [2005] in a
different setting, and our proofs use ideas from that
paper, as well as ideas of Dubrov and Ishai. We also
give an unconditional construction of poly-time
computable nb-PRGs for $ \poly (n)$-size, depth $d$
circuits $ C : \{ 0, 1 \}^n \to \{ 0, 1 \}^l$ with $ r
= O(l \cdot \log^{d + O (1)} n)$. This improves upon
the previous work of Dubrov and Ishai that has $ r \geq
l^2$. This result follows by adapting a recent PRG
construction of Trevisan and Xue [2013] to the case of
nb-PRGs. We also show that this PRG can be implemented
by a uniform family of constant-depth circuits with
slightly increased seed length.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Transactions on Computation Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1190",
}
@Article{Aste:2017:BTF,
author = "Tomaso Aste and Paolo Tasca and Tiziana {Di Matteo}",
title = "Blockchain Technologies: The Foreseeable Impact on
Society and Industry",
journal = j-COMPUTER,
volume = "50",
number = "9",
pages = "18--28",
month = sep,
year = "2017",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2017.3571064",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Mon Oct 2 08:46:55 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.computer.org/csdl/mags/co/2017/09/mco2017090018-abs.html",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{At:2017:LAU,
author = "Nuray At and Jean-Luc Beuchat and Eiji Okamoto and
Ismail San and Teppei Yamazaki",
title = "A low-area unified hardware architecture for the {AES}
and the cryptographic hash function {Gr{\o}stl}",
journal = j-J-PAR-DIST-COMP,
volume = "106",
number = "??",
pages = "106--120",
month = aug,
year = "2017",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Sat Aug 19 13:10:31 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731517300485",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Ateniese:2017:LCS,
author = "Giuseppe Ateniese and Giuseppe Bianchi and Angelo T.
Capossele and Chiara Petrioli and Dora Spenza",
title = "Low-Cost Standard Signatures for Energy-Harvesting
Wireless Sensor Networks",
journal = j-TECS,
volume = "16",
number = "3",
pages = "64:1--64:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2994603",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Jul 24 09:51:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "This work is motivated by a general question: can
micro-scale energy-harvesting techniques be exploited
to support low-cost standard security solutions on
resource-constrained devices? We focus on guaranteeing
integrity and authentication in Internet of Things
(IoT) and Wireless Sensor Network (WSN) applications.
In this article, we propose techniques to make ECDSA
signatures low cost and implementable on
resource-constrained devices. By combining
precomputation techniques and energy-harvesting
capabilities of modern sensor nodes, we achieve
significant improvement over prior works. In addition,
we show that the cost of ECDSA signatures can be
reduced by up to a factor 10 by using harvesting-aware
optimizations.",
acknowledgement = ack-nhfb,
articleno = "64",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Attasena:2017:SSC,
author = "Varunya Attasena and J{\'e}r{\^o}me Darmont and Nouria
Harbi",
title = "Secret sharing for cloud data security: a survey",
journal = j-VLDB-J,
volume = "26",
number = "5",
pages = "657--681",
month = oct,
year = "2017",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-017-0470-9",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Mon Oct 2 16:14:05 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbj.bib",
abstract = "Cloud computing helps reduce costs, increase business
agility and deploy solutions with a high return on
investment for many types of applications. However,
data security is of premium importance to many users
and often restrains their adoption of cloud
technologies. Various approaches, i.e., data
encryption, anonymization, replication and
verification, help enforce different facets of data
security. Secret sharing is a particularly interesting
cryptographic technique. Its most advanced variants
indeed simultaneously enforce data privacy,
availability and integrity, while allowing computation
on encrypted data. The aim of this paper is thus to
wholly survey secret sharing schemes with respect to
data security, data access and costs in the
pay-as-you-go paradigm.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
}
@Book{Aumasson:2017:SCP,
author = "Jean-Philippe Aumasson and Matthew D. Green",
title = "Serious Cryptography: a Practical Introduction to
Modern Encryption",
publisher = pub-NO-STARCH,
address = pub-NO-STARCH:adr,
pages = "xxii + 282",
year = "2018",
ISBN = "1-59327-826-8 paperback",
ISBN-13 = "978-1-59327-826-7 paperback",
LCCN = "QA76.9.A25 A96 2018",
bibdate = "Wed Mar 25 08:47:40 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
z3950.loc.gov:7090/Voyager",
URL = "https://nostarch.com/seriouscrypto",
acknowledgement = ack-nhfb,
remark = "Foreword by Matthew D. Green",
subject = "Data encryption (Computer science)",
tableofcontents = "Foreword by Matthew D. Green / xv \\
Preface / xvii \\
Abbreviations / xxi \\
1: Encryption / 1 \\
2: Randomness / 21 \\
3: Cryptographic Security / 39 \\
4: Block Ciphers / 53 \\
5: Stream Ciphers / 77 \\
6: Hash Functions / 105 \\
7: Keyed Hashing / 127 \\
8: Authenticated Encryption / 145 \\
9: Hard Problems / 163 \\
10: RSA / 181 \\
11: Diffie--Hellman / 201 \\
12: Elliptic Curves / 217 \\
13: TLS / 235 \\
14: Quantum and Post-Quantum / 251 \\
Index / 271",
}
@Article{Austrin:2017:ICT,
author = "Per Austrin and Kai-Min Chung and Mohammad Mahmoody
and Rafael Pass and Karn Seth",
title = "On the Impossibility of Cryptography with Tamperable
Randomness",
journal = j-ALGORITHMICA,
volume = "79",
number = "4",
pages = "1052--1101",
month = dec,
year = "2017",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-016-0219-7",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Mon Oct 2 10:42:20 MDT 2017",
bibsource = "http://link.springer.com/journal/453/79/4;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Awad:2017:OLO,
author = "Amro Awad and Yipeng Wang and Deborah Shands and Yan
Solihin",
title = "{ObfusMem}: a Low-Overhead Access Obfuscation for
Trusted Memories",
journal = j-COMP-ARCH-NEWS,
volume = "45",
number = "2",
pages = "107--119",
month = may,
year = "2017",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/3140659.3080230",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri Sep 15 11:09:14 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "Trustworthy software requires strong privacy and
security guarantees from a secure trust base in
hardware. While chipmakers provide hardware support for
basic security and privacy primitives such as enclaves
and memory encryption. these primitives do not address
hiding of the memory access pattern, information about
which may enable attacks on the system or reveal
characteristics of sensitive user data.
State-of-the-art approaches to protecting the access
pattern are largely based on Oblivious RAM (ORAM).
Unfortunately, current ORAM implementations suffer from
very significant practicality and overhead concerns,
including roughly an order of magnitude slowdown, more
than 100\% memory capacity overheads, and the potential
for system deadlock. Memory technology trends are
moving towards 3D and 2.5D integration, enabling
significant logic capabilities and sophisticated memory
interfaces. Leveraging the trends, we propose a new
approach to access pattern obfuscation, called
ObfusMem. ObfusMem adds the memory to the trusted
computing base and incorporates cryptographic engines
within the memory. ObfusMem encrypts commands and
addresses on the memory bus, hence the access pattern
is cryptographically obfuscated from external
observers. Our evaluation shows that ObfusMem incurs an
overhead of 10.9\% on average, which is about an order
of magnitude faster than ORAM implementations.
Furthermore, ObfusMem does not incur capacity overheads
and does not amplify writes. We analyze and compare the
security protections provided by ObfusMem and ORAM, and
highlight their differences.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Azimpourkivi:2017:CBT,
author = "Mozhgan Azimpourkivi and Umut Topkara and Bogdan
Carbunar",
title = "Camera Based Two Factor Authentication Through Mobile
and Wearable Devices",
journal = j-IMWUT,
volume = "1",
number = "3",
pages = "1--37",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3131904",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:36:57 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3131904",
abstract = "We introduce Pixie, a novel, camera based two factor
authentication solution for mobile and wearable
devices. A quick and familiar user action of snapping a
photo is sufficient for Pixie to simultaneously perform
a graphical password authentication and \ldots{}",
acknowledgement = ack-nhfb,
articleno = "35",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Bag:2017:BBW,
author = "S. Bag and S. Ruj and K. Sakurai",
title = "{Bitcoin} Block Withholding Attack: Analysis and
Mitigation",
journal = "IEEE Transactions on Information Forensics and
Security",
volume = "12",
number = "8",
pages = "1967--1978",
month = aug,
year = "2017",
DOI = "https://doi.org/10.1109/TIFS.2016.2623588",
ISSN = "1556-6013 (print), 1556-6021 (electronic)",
ISSN-L = "1556-6013",
bibdate = "Thu Nov 30 15:24:52 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
keywords = "Bitcoin block withholding attack; block withholding
attack; BWH attack; commitment schemes; Computational
modeling; cryptographic commitment schemes;
Cryptography; cryptography; Electronic mail; electronic
money; Games; hash function; mining pool; Online
banking; pool attacks; Protocols; rogue miners; rogue
pool administrators; selfish miner; selfish {Bitcoin}
miner; sponsored block withholding attack; Statistical
analysis; {Bitcoin} mining; {Bitcoin} protocol",
}
@Article{Bailis:2017:RPC,
author = "Peter Bailis and Arvind Narayanan and Andrew Miller
and Song Han",
title = "Research for Practice: Cryptocurrencies, Blockchains,
and Smart Contracts; Hardware for Deep Learning",
journal = j-CACM,
volume = "60",
number = "5",
pages = "48--51",
month = may,
year = "2017",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3024928",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat May 27 15:08:46 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2017/5/216321/fulltext",
abstract = "Expert-curated guides to the best of CS research.",
acknowledgement = ack-nhfb,
acmid = "3024928",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
pagecount = "4",
}
@Article{Balsa:2017:TIC,
author = "Ero Balsa and Cristina P{\'e}rez-Sol{\`a} and Claudia
Diaz",
title = "Towards Inferring Communication Patterns in Online
Social Networks",
journal = j-TOIT,
volume = "17",
number = "3",
pages = "32:1--32:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3093897",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:26 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "The separation between the public and private spheres
on online social networks is known to be, at best,
blurred. On the one hand, previous studies have shown
how it is possible to infer private attributes from
publicly available data. On the other hand, no
distinction exists between public and private data when
we consider the ability of the online social network
(OSN) provider to access them. Even when OSN users go
to great lengths to protect their privacy, such as by
using encryption or communication obfuscation,
correlations between data may render these solutions
useless. In this article, we study the relationship
between private communication patterns and publicly
available OSN data. Such a relationship informs both
privacy-invasive inferences as well as OSN
communication modelling, the latter being key toward
developing effective obfuscation tools. We propose an
inference model based on Bayesian analysis and
evaluate, using a real social network dataset, how
archetypal social graph features can lead to inferences
about private communication. Our results indicate that
both friendship graph and public traffic data may not
be informative enough to enable these inferences, with
time analysis having a non-negligible impact on their
precision.",
acknowledgement = ack-nhfb,
articleno = "32",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Book{Beebe:2017:MFC,
author = "Nelson H. F. Beebe",
title = "The Mathematical-Function Computation Handbook:
Programming Using the {MathCW} Portable Software
Library",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xxxvi + 1114",
year = "2017",
DOI = "https://doi.org/10.1007/978-3-319-64110-2",
ISBN = "3-319-64109-3 (hardcover), 3-319-64110-7 (e-book)",
ISBN-13 = "978-3-319-64109-6 (hardcover), 978-3-319-64110-2
(e-book)",
LCCN = "QA75.5-76.95",
bibdate = "Sat Jul 15 19:34:43 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
https://www.math.utah.edu/pub/tex/bib/axiom.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/mathematica.bib;
https://www.math.utah.edu/pub/tex/bib/matlab.bib;
https://www.math.utah.edu/pub/tex/bib/mupad.bib;
https://www.math.utah.edu/pub/tex/bib/numana2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/redbooks.bib;
https://www.math.utah.edu/pub/tex/bib/utah-math-dept-books.bib",
URL = "http://www.springer.com/us/book/9783319641096",
acknowledgement = ack-nhfb,
ORCID-numbers = "Beebe, Nelson H. F./0000-0001-7281-4263",
tableofcontents = "List of figures / xxv \\
List of tables / xxxi \\
Quick start / xxxv \\
1: Introduction / 1 \\
1.1: Programming conventions / 2 \\
1.2: Naming conventions / 4 \\
1.3: Library contributions and coverage / 5 \\
1.4: Summary / 6 \\
2: Iterative solutions and other tools / 7 \\
2.1: Polynomials and Taylor series / 7 \\
2.2: First-order Taylor series approximation / 8 \\
2.3: Second-order Taylor series approximation / 9 \\
2.4: Another second-order Taylor series approximation /
9 \\
2.5: Convergence of second-order methods / 10 \\
2.6: Taylor series for elementary functions / 10 \\
2.7: Continued fractions / 12 \\
2.8: Summation of continued fractions / 17 \\
2.9: Asymptotic expansions / 19 \\
2.10: Series inversion / 20 \\
2.11: Summary / 22 \\
3: Polynomial approximations / 23 \\
3.1: Computation of odd series / 23 \\
3.2: Computation of even series / 25 \\
3.3: Computation of general series / 25 \\
3.4: Limitations of Cody\slash Waite polynomials / 28
\\
3.5: Polynomial fits with Maple / 32 \\
3.6: Polynomial fits with Mathematica / 33 \\
3.7: Exact polynomial coefficients / 42 \\
3.8: Cody\slash Waite rational polynomials / 43 \\
3.9: Chebyshev polynomial economization / 43 \\
3.10: Evaluating Chebyshev polynomials / 48 \\
3.11: Error compensation in Chebyshev fits / 50 \\
3.12: Improving Chebyshev fits / 51 \\
3.13: Chebyshev fits in rational form / 52 \\
3.14: Chebyshev fits with Mathematica / 56 \\
3.15: Chebyshev fits for function representation / 57
\\
3.16: Extending the library / 57 \\
3.17: Summary and further reading / 58 \\
4: Implementation issues / 61 \\
4.1: Error magnification / 61 \\
4.2: Machine representation and machine epsilon / 62
\\
4.3: IEEE 754 arithmetic / 63 \\
4.4: Evaluation order in C / 64 \\
4.5: The {\tt volatile} type qualifier / 65 \\
4.6: Rounding in floating-point arithmetic / 66 \\
4.7: Signed zero / 69 \\
4.8: Floating-point zero divide / 70 \\
4.9: Floating-point overflow / 71 \\
4.10: Integer overflow / 72 \\
4.11: Floating-point underflow / 77 \\
4.12: Subnormal numbers / 78 \\
4.13: Floating-point inexact operation / 79 \\
4.14: Floating-point invalid operation / 79 \\
4.15: Remarks on NaN tests / 80 \\
4.16: Ulps --- units in the last place / 81 \\
4.17: Fused multiply-add / 85 \\
4.18: Fused multiply-add and polynomials / 88 \\
4.19: Significance loss / 89 \\
4.20: Error handling and reporting / 89 \\
4.21: Interpreting error codes / 93 \\
4.22: C99 changes to error reporting / 94 \\
4.23: Error reporting with threads / 95 \\
4.24: Comments on error reporting / 95 \\
4.25: Testing function implementations / 96 \\
4.26: Extended data types on Hewlett--Packard HP-UX
IA-64 / 100 \\
4.27: Extensions for decimal arithmetic / 101 \\
4.28: Further reading / 103 \\
4.29: Summary / 104 \\
5: The floating-point environment / 105 \\
5.1: IEEE 754 and programming languages / 105 \\
5.2: IEEE 754 and the mathcw library / 106 \\
5.3: Exceptions and traps / 106 \\
5.4: Access to exception flags and rounding control /
107 \\
5.5: The environment access pragma / 110 \\
5.6: Implementation of exception-flag and
rounding-control access / 110 \\
5.7: Using exception flags: simple cases / 112 \\
5.8: Using rounding control / 115 \\
5.9: Additional exception flag access / 116 \\
5.10: Using exception flags: complex case / 120 \\
5.11: Access to precision control / 123 \\
5.12: Using precision control / 126 \\
5.13: Summary / 127 \\
6: Converting floating-point values to integers / 129
\\
6.1: Integer conversion in programming languages / 129
\\
6.2: Programming issues for conversions to integers /
130 \\
6.3: Hardware out-of-range conversions / 131 \\
6.4: Rounding modes and integer conversions / 132 \\
6.5: Extracting integral and fractional parts / 132 \\
6.6: Truncation functions / 135 \\
6.7: Ceiling and floor functions / 136 \\
6.8: Floating-point rounding functions with fixed
rounding / 137 \\
6.9: Floating-point rounding functions: current
rounding / 138 \\
6.10: Floating-point rounding functions without {\em
inexact\/} exception / 139 \\
6.11: Integer rounding functions with fixed rounding /
140 \\
6.12: Integer rounding functions with current rounding
/ 142 \\
6.13: Remainder / 143 \\
6.14: Why the remainder functions are hard / 144 \\
6.15: Computing {\tt fmod} / 146 \\
6.16: Computing {\tt remainder} / 148 \\
6.17: Computing {\tt remquo} / 150 \\
6.18: Computing one remainder from the other / 152 \\
6.19: Computing the remainder in nonbinary bases / 155
\\
6.20: Summary / 156 \\
7: Random numbers / 157 \\
7.1: Guidelines for random-number software / 157 \\
7.2: Creating generator seeds / 158 \\
7.3: Random floating-point values / 160 \\
7.4: Random integers from floating-point generator /
165 \\
7.5: Random integers from an integer generator / 166
\\
7.6: Random integers in ascending order / 168 \\
7.7: How random numbers are generated / 169 \\
7.8: Removing generator bias / 178 \\
7.9: Improving a poor random number generator / 178 \\
7.10: Why long periods matter / 179 \\
7.11: Inversive congruential generators / 180 \\
7.12: Inversive congruential generators, revisited /
189 \\
7.13: Distributions of random numbers / 189 \\
7.14: Other distributions / 195 \\
7.15: Testing random-number generators / 196 \\
7.16: Applications of random numbers / 202 \\
7.17: The \textsf {mathcw} random number routines / 208
\\
7.18: Summary, advice, and further reading / 214 \\
8: Roots / 215 \\
8.1: Square root / 215 \\
8.2: Hypotenuse and vector norms / 222 \\
8.3: Hypotenuse by iteration / 227 \\
8.4: Reciprocal square root / 233 \\
8.5: Cube root / 237 \\
8.6: Roots in hardware / 240 \\
8.7: Summary / 242 \\
9: Argument reduction / 243 \\
9.1: Simple argument reduction / 243 \\
9.2: Exact argument reduction / 250 \\
9.3: Implementing exact argument reduction / 253 \\
9.4: Testing argument reduction / 265 \\
9.5: Retrospective on argument reduction / 265 \\
10: Exponential and logarithm / 267 \\
10.1: Exponential functions / 267 \\
10.2: Exponential near zero / 273 \\
10.3: Logarithm functions / 282 \\
10.4: Logarithm near one / 290 \\
10.5: Exponential and logarithm in hardware / 292 \\
10.6: Compound interest and annuities / 294 \\
10.7: Summary / 298 \\
11: Trigonometric functions / 299 \\
11.1: Sine and cosine properties / 299 \\
11.2: Tangent properties / 302 \\
11.3: Argument conventions and units / 304 \\
11.4: Computing the cosine and sine / 306 \\
11.5: Computing the tangent / 310 \\
11.6: Trigonometric functions in degrees / 313 \\
11.7: Trigonometric functions in units of $ \pi $ / 315
\\
11.8: Computing the cosine and sine together / 320 \\
11.9: Inverse sine and cosine / 323 \\
11.10: Inverse tangent / 331 \\
11.11: Inverse tangent, take two / 336 \\
11.12: Trigonometric functions in hardware / 338 \\
11.13: Testing trigonometric functions / 339 \\
11.14: Retrospective on trigonometric functions / 340
\\
12: Hyperbolic functions / 341 \\
12.1: Hyperbolic functions / 341 \\
12.2: Improving the hyperbolic functions / 345 \\
12.3: Computing the hyperbolic functions together / 348
\\
12.4: Inverse hyperbolic functions / 348 \\
12.5: Hyperbolic functions in hardware / 350 \\
12.6: Summary / 352 \\
13: Pair-precision arithmetic / 353 \\
13.1: Limitations of pair-precision arithmetic / 354
\\
13.2: Design of the pair-precision software interface /
355 \\
13.3: Pair-precision initialization / 356 \\
13.4: Pair-precision evaluation / 357 \\
13.5: Pair-precision high part / 357 \\
13.6: Pair-precision low part / 357 \\
13.7: Pair-precision copy / 357 \\
13.8: Pair-precision negation / 358 \\
13.9: Pair-precision absolute value / 358 \\
13.10: Pair-precision sum / 358 \\
13.11: Splitting numbers into pair sums / 359 \\
13.12: Premature overflow in splitting / 362 \\
13.13: Pair-precision addition / 365 \\
13.14: Pair-precision subtraction / 367 \\
13.15: Pair-precision comparison / 368 \\
13.16: Pair-precision multiplication / 368 \\
13.17: Pair-precision division / 371 \\
13.18: Pair-precision square root / 373 \\
13.19: Pair-precision cube root / 377 \\
13.20: Accuracy of pair-precision arithmetic / 379 \\
13.21: Pair-precision vector sum / 384 \\
13.22: Exact vector sums / 385 \\
13.23: Pair-precision dot product / 385 \\
13.24: Pair-precision product sum / 386 \\
13.25: Pair-precision decimal arithmetic / 387 \\
13.26: Fused multiply-add with pair precision / 388 \\
13.27: Higher intermediate precision and the FMA / 393
\\
13.28: Fused multiply-add without pair precision / 395
\\
13.29: Fused multiply-add with multiple precision / 401
\\
13.30: Fused multiply-add, Boldo/\penalty
\exhyphenpenalty Melquiond style / 403 \\
13.31: Error correction in fused multiply-add / 406 \\
13.32: Retrospective on pair-precision arithmetic / 407
\\
14: Power function / 411 \\
14.1: Why the power function is hard to compute / 411
\\
14.2: Special cases for the power function / 412 \\
14.3: Integer powers / 414 \\
14.4: Integer powers, revisited / 420 \\
14.5: Outline of the power-function algorithm / 421 \\
14.6: Finding $a$ and $p$ / 423 \\
14.7: Table searching / 424 \\
14.8: Computing $\log_n(g/a)$ / 426 \\
14.9: Accuracy required for $\log_n(g/a)$ / 429 \\
14.10: Exact products / 430 \\
14.11: Computing $w$, $w_1$ and $w_2$ / 433 \\
14.12: Computing $n^{w_2}$ / 437 \\
14.13: The choice of $q$ / 438 \\
14.14: Testing the power function / 438 \\
14.15: Retrospective on the power function / 440 \\
15: Complex arithmetic primitives / 441 \\
15.1: Support macros and type definitions / 442 \\
15.2: Complex absolute value / 443 \\
15.3: Complex addition / 445 \\
15.4: Complex argument / 445 \\
15.5: Complex conjugate / 446 \\
15.6: Complex conjugation symmetry / 446 \\
15.7: Complex conversion / 448 \\
15.8: Complex copy / 448 \\
15.9: Complex division: C99 style / 449 \\
15.10: Complex division: Smith style / 451 \\
15.11: Complex division: Stewart style / 452 \\
15.12: Complex division: Priest style / 453 \\
15.13: Complex division: avoiding subtraction loss /
455 \\
15.14: Complex imaginary part / 456 \\
15.15: Complex multiplication / 456 \\
15.16: Complex multiplication: error analysis / 458 \\
15.17: Complex negation / 459 \\
15.18: Complex projection / 460 \\
15.19: Complex real part / 460 \\
15.20: Complex subtraction / 461 \\
15.21: Complex infinity test / 462 \\
15.22: Complex NaN test / 462 \\
15.23: Summary / 463 \\
16: Quadratic equations / 465 \\
16.1: Solving quadratic equations / 465 \\
16.2: Root sensitivity / 471 \\
16.3: Testing a quadratic-equation solver / 472 \\
16.4: Summary / 474 \\
17: Elementary functions in complex arithmetic / 475
\\
17.1: Research on complex elementary functions / 475
\\
17.2: Principal values / 476 \\
17.3: Branch cuts / 476 \\
17.4: Software problems with negative zeros / 478 \\
17.5: Complex elementary function tree / 479 \\
17.6: Series for complex functions / 479 \\
17.7: Complex square root / 480 \\
17.8: Complex cube root / 485 \\
17.9: Complex exponential / 487 \\
17.10: Complex exponential near zero / 492 \\
17.11: Complex logarithm / 495 \\
17.12: Complex logarithm near one / 497 \\
17.13: Complex power / 500 \\
17.14: Complex trigonometric functions / 502 \\
17.15: Complex inverse trigonometric functions / 504
\\
17.16: Complex hyperbolic functions / 509 \\
17.17: Complex inverse hyperbolic functions / 514 \\
17.18: Summary / 520 \\
18: The Greek functions: gamma, psi, and zeta / 521 \\
18.1: Gamma and log-gamma functions / 521 \\
18.2: The {\tt psi} and {\tt psiln} functions / 536 \\
18.3: Polygamma functions / 547 \\
18.4: Incomplete gamma functions / 560 \\
18.5: A Swiss diversion: Bernoulli and Euler / 568 \\
18.6: An Italian excursion: Fibonacci numbers / 575 \\
18.7: A German gem: the Riemann zeta function / 579 \\
18.8: Further reading / 590 \\
18.9: Summary / 591 \\
19: Error and probability functions / 593 \\
19.1: Error functions / 593 \\
19.2: Scaled complementary error function / 598 \\
19.3: Inverse error functions / 600 \\
19.4: Normal distribution functions and inverses / 610
\\
19.5: Summary / 617 \\
20: Elliptic integral functions / 619 \\
20.1: The arithmetic-geometric mean / 619 \\
20.2: Elliptic integral functions of the first kind /
624 \\
20.3: Elliptic integral functions of the second kind /
627 \\
20.4: Elliptic integral functions of the third kind /
630 \\
20.5: Computing $K(m)$ and $K'(m)$ / 631 \\
20.6: Computing $E(m)$ and $E'(m)$ / 637 \\
20.7: Historical algorithms for elliptic integrals /
643 \\
20.8: Auxiliary functions for elliptic integrals / 645
\\
20.9: Computing the elliptic auxiliary functions / 648
\\
20.10: Historical elliptic functions / 650 \\
20.11: Elliptic functions in software / 652 \\
20.12: Applications of elliptic auxiliary functions /
653 \\
20.13: Elementary functions from elliptic auxiliary
functions / 654 \\
20.14: Computing elementary functions via $R_C(x,y)$ /
655 \\
20.15: Jacobian elliptic functions / 657 \\
20.16: Inverses of Jacobian elliptic functions / 664
\\
20.17: The modulus and the nome / 668 \\
20.18: Jacobian theta functions / 673 \\
20.19: Logarithmic derivatives of the Jacobian theta
functions / 675 \\
20.20: Neville theta functions / 678 \\
20.21: Jacobian Eta, Theta, and Zeta functions / 679
\\
20.22: Weierstrass elliptic functions / 682 \\
20.23: Weierstrass functions by duplication / 689 \\
20.24: Complete elliptic functions, revisited / 690 \\
20.25: Summary / 691 \\
21: Bessel functions / 693 \\
21.1: Cylindrical Bessel functions / 694 \\
21.2: Behavior of $J_n(x)$ and $Y_n(x)$ / 695 \\
21.3: Properties of $J_n(z)$ and $Y_n(z)$ / 697 \\
21.4: Experiments with recurrences for $J_0(x)$ / 705
\\
21.5: Computing $J_0(x)$ and $J_1(x)$ / 707 \\
21.6: Computing $J_n(x)$ / 710 \\
21.7: Computing $Y_0(x)$ and $Y_1(x)$ / 713 \\
21.8: Computing $Y_n(x)$ / 715 \\
21.9: Improving Bessel code near zeros / 716 \\
21.10: Properties of $I_n(z)$ and $K_n(z)$ / 718 \\
21.11: Computing $I_0(x)$ and $I_1(x)$ / 724 \\
21.12: Computing $K_0(x)$ and $K_1(x)$ / 726 \\
21.13: Computing $I_n(x)$ and $K_n(x)$ / 728 \\
21.14: Properties of spherical Bessel functions / 731
\\
21.15: Computing $j_n(x)$ and $y_n(x)$ / 735 \\
21.16: Improving $j_1(x)$ and $y_1(x)$ / 740 \\
21.17: Modified spherical Bessel functions / 743 \\
21.18: Software for Bessel-function sequences / 755 \\
21.19: Retrospective on Bessel functions / 761 \\
22: Testing the library / 763 \\
22.1: Testing {\tt tgamma} and {\tt lgamma} / 765 \\
22.2: Testing {\tt psi} and {\tt psiln} / 768 \\
22.3: Testing {\tt erf} and {\tt erfc} / 768 \\
22.4: Testing cylindrical Bessel functions / 769 \\
22.5: Testing exponent/\penalty \exhyphenpenalty
significand manipulation / 769 \\
22.6: Testing inline assembly code / 769 \\
22.7: Testing with Maple / 770 \\
22.8: Testing floating-point arithmetic / 773 \\
22.9: The Berkeley Elementary Functions Test Suite /
774 \\
22.10: The AT\&T floating-point test package / 775 \\
22.11: The Antwerp test suite / 776 \\
22.12: Summary / 776 \\
23: Pair-precision elementary functions / 777 \\
23.1: Pair-precision integer power / 777 \\
23.2: Pair-precision machine epsilon / 779 \\
23.3: Pair-precision exponential / 780 \\
23.4: Pair-precision logarithm / 787 \\
23.5: Pair-precision logarithm near one / 793 \\
23.6: Pair-precision exponential near zero / 793 \\
23.7: Pair-precision base-$n$ exponentials / 795 \\
23.8: Pair-precision trigonometric functions / 796 \\
23.9: Pair-precision inverse trigonometric functions /
801 \\
23.10: Pair-precision hyperbolic functions / 804 \\
23.11: Pair-precision inverse hyperbolic functions /
808 \\
23.12: Summary / 808 \\
24: Accuracy of the Cody\slash Waite algorithms / 811
\\
25: Improving upon the Cody\slash Waite algorithms /
823 \\
25.1: The Bell Labs libraries / 823 \\
25.2: The {Cephes} library / 823 \\
25.3: The {Sun} libraries / 824 \\
25.4: Mathematical functions on EPIC / 824 \\
25.5: The GNU libraries / 825 \\
25.6: The French libraries / 825 \\
25.7: The NIST effort / 826 \\
25.8: Commercial mathematical libraries / 826 \\
25.9: Mathematical libraries for decimal arithmetic /
826 \\
25.10: Mathematical library research publications / 826
\\
25.11: Books on computing mathematical functions / 827
\\
25.12: Summary / 828 \\
26: Floating-point output / 829 \\
26.1: Output character string design issues / 830 \\
26.2: Exact output conversion / 831 \\
26.3: Hexadecimal floating-point output / 832 \\
26.4: Octal floating-point output / 850 \\
26.5: Binary floating-point output / 851 \\
26.6: Decimal floating-point output / 851 \\
26.7: Accuracy of output conversion / 865 \\
26.8: Output conversion to a general base / 865 \\
26.9: Output conversion of Infinity / 866 \\
26.10: Output conversion of NaN / 866 \\
26.11: Number-to-string conversion / 867 \\
26.12: The {\tt printf} family / 867 \\
26.13: Summary / 878 \\
27: Floating-point input / 879 \\
27.1: Binary floating-point input / 879 \\
27.2: Octal floating-point input / 894 \\
27.3: Hexadecimal floating-point input / 895 \\
27.4: Decimal floating-point input / 895 \\
27.5: Based-number input / 899 \\
27.6: General floating-point input / 900 \\
27.7: The {\tt scanf} family / 901 \\
27.8: Summary / 910 \\
A: Ada interface / 911 \\
A.1: Building the Ada interface / 911 \\
A.2: Programming the Ada interface / 912 \\
A.3: Using the Ada interface / 915 \\
B: C\# interface / 917 \\
B.1: C\# on the CLI virtual machine / 917 \\
B.2: Building the C\# interface / 918 \\
B.3: Programming the C\# interface / 920 \\
B.4: Using the C\# interface / 922 \\
C: C++ interface / 923 \\
C.1: Building the C++ interface / 923 \\
C.2: Programming the C++ interface / 924 \\
C.3: Using the C++ interface / 925 \\
D: Decimal arithmetic / 927 \\
D.1: Why we need decimal floating-point arithmetic /
927 \\
D.2: Decimal floating-point arithmetic design issues /
928 \\
D.3: How decimal and binary arithmetic differ / 931 \\
D.4: Initialization of decimal floating-point storage /
935 \\
D.5: The {\tt <decfloat.h>} header file / 936 \\
D.6: Rounding in decimal arithmetic / 936 \\
D.7: Exact scaling in decimal arithmetic / 937 \\
E: Errata in the Cody\slash Waite book / 939 \\
F: Fortran interface / 941 \\
F.1: Building the Fortran interface / 943 \\
F.2: Programming the Fortran interface / 944 \\
F.3: Using the Fortran interface / 945 \\
H: Historical floating-point architectures / 947 \\
H.1: CDC family / 949 \\
H.2: Cray family / 952 \\
H.3: DEC PDP-10 / 953 \\
H.4: DEC PDP-11 and VAX / 956 \\
H.5: General Electric 600 series / 958 \\
H.6: IBM family / 959 \\
H.7: Lawrence Livermore S-1 Mark IIA / 965 \\
H.8: Unusual floating-point systems / 966 \\
H.9: Historical retrospective / 967 \\
I: Integer arithmetic / 969 \\
I.1: Memory addressing and integers / 971 \\
I.2: Representations of signed integers / 971 \\
I.3: Parity testing / 975 \\
I.4: Sign testing / 975 \\
I.5: Arithmetic exceptions / 975 \\
I.6: Notations for binary numbers / 977 \\
I.7: Summary / 978 \\
J: Java interface / 979 \\
J.1: Building the Java interface / 979 \\
J.2: Programming the Java MathCW class / 980 \\
J.3: Programming the Java C interface / 982 \\
J.4: Using the Java interface / 985 \\
L: Letter notation / 987 \\
P: Pascal interface / 989 \\
P.1: Building the Pascal interface / 989 \\
P.2: Programming the Pascal MathCW module / 990 \\
P.3: Using the Pascal module interface / 993 \\
P.4: Pascal and numeric programming / 994 \\
Bibliography / 995 \\
Author/editor index / 1039 \\
Function and macro index / 1049 \\
Subject index / 1065 \\
Colophon / 1115",
}
@Article{Ben-Sasson:2017:SZK,
author = "Eli Ben-Sasson and Alessandro Chiesa and Eran Tromer
and Madars Virza",
title = "Scalable Zero Knowledge Via Cycles of Elliptic
Curves",
journal = j-ALGORITHMICA,
volume = "79",
number = "4",
pages = "1102--1160",
month = dec,
year = "2017",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-016-0221-0",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Mon Oct 2 10:42:20 MDT 2017",
bibsource = "http://link.springer.com/journal/453/79/4;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Berghel:2017:ELR,
author = "Hal Berghel",
title = "{Equifax} and the Latest Round of Identity Theft
Roulette",
journal = j-COMPUTER,
volume = "50",
number = "12",
pages = "72--76",
month = dec,
year = "2017",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Sat Dec 23 07:58:37 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.computer.org/csdl/mags/co/2017/12/mco2017120072.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Misc{Bernstein:2017:SCS,
author = "Daniel J. Bernstein and Tanja Lange",
title = "{SafeCurves}: choosing safe curves for elliptic-curve
cryptography",
howpublished = "Web site.",
day = "22",
month = jan,
year = "2017",
bibdate = "Fri Feb 15 10:19:25 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://safecurves.cr.yp.to/",
acknowledgement = ack-nhfb,
keywords = "ANSI X9.62 (1999); ANSI X9.63 (2001); ANSSI FRP256V1
(2011); Brainpool (2005); IEEE P1363 (2000); NIST FIPS
186-2 (2000); NSA Suite B (2005); SEC 2 (2000)",
}
@Misc{Bernstein:2017:SRD,
author = "Daniel J. Bernstein and Joachim Breitner and Daniel
Genkin and Leon Groot Bruinderink and Nadia Heninger
and Tanja Lange and Christine van Vredendaal and Yuval
Yarom",
title = "Sliding right into disaster: Left-to-right sliding
windows leak",
pages = "21",
day = "28",
month = jun,
year = "2017",
bibdate = "Tue Jul 11 16:54:57 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://eprint.iacr.org/2017/627.pdf",
abstract = "It is well known that constant-time implementations of
modular exponentiation cannot use sliding windows.
However, software libraries such as Libgcrypt, used by
GnuPG, continue to use sliding windows. It is widely
believed that, even if the complete pattern of
squarings and multiplications is observed through a
side-channel attack, the number of exponent bits leaked
is not sufficient to carry out a full key-recovery
attack against RSA. Specifically, 4-bit sliding windows
leak only 40\% of the bits, and 5-bit sliding windows
leak only 33\% of the bits.\par
In this paper we demonstrate a complete break of
RSA-1024 as implemented in Libgcrypt. Our attack makes
essential use of the fact that Libgcrypt uses the
left-to-right method for computing the sliding-window
expansion. We show for the first time that the
direction of the encoding matters: the pattern of
squarings and multiplications in left-to-right sliding
windows leaks significantly more information about the
exponent than right-to-left. We show how to extend the
Heninger--Shacham algorithm for partial key
reconstruction to make use of this information and
obtain a very efficient full key recovery for RSA-1024.
For RSA-2048 our attack is efficient for 13\% of
keys.",
acknowledgement = ack-nhfb,
keywords = "cache attack; collision entropy; Flush+Reload;
left-to-right sliding windows; RSA-CRT",
remark = "Security hole was fixed in libgcrypt-1.7.8, released
29 June 2017.",
}
@Article{Bestavros:2017:PSU,
author = "Azer Bestavros and Andrei Lapets and Mayank Varia",
title = "Privacy and security: User-centric distributed
solutions for privacy-preserving analytics",
journal = j-CACM,
volume = "60",
number = "2",
pages = "37--39",
month = feb,
year = "2017",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3029603",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Fri Feb 17 17:20:17 MST 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2017/2/212427/fulltext",
abstract = "How can cryptography empower users with sensitive data
to access large-scale computing platforms in a
privacy-preserving manner?",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Beurdouche:2017:MSU,
author = "Benjamin Beurdouche and Karthikeyan Bhargavan and
Antoine Delignat-Lavaud and C{\'e}dric Fournet and
Markulf Kohlweiss and Alfredo Pironti and Pierre-Yves
Strub and Jean Karim Zinzindohoue",
title = "A messy state of the union: taming the composite state
machines of {TLS}",
journal = j-CACM,
volume = "60",
number = "2",
pages = "99--107",
month = feb,
year = "2017",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3023357",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Fri Feb 17 17:20:17 MST 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2017/2/212438/fulltext",
abstract = "The Transport Layer Security (TLS) protocol supports
various authentication modes, key exchange methods, and
protocol extensions. Confusingly, each combination may
prescribe a different message sequence between the
client and the server, and thus a key challenge for TLS
implementations is to define a composite state machine
that correctly handles these combinations. If the state
machine is too restrictive, the implementation may fail
to interoperate with others; if it is too liberal, it
may allow unexpected message sequences that break the
security of the protocol. We systematically test
popular TLS implementations and find unexpected
transitions in many of their state machines that have
stayed hidden for years. We show how some of these
flaws lead to critical security vulnerabilities, such
as FREAK. While testing can help find such bugs, formal
verification can prevent them entirely. To this end, we
implement and formally verify a new composite state
machine for OpenSSL, a popular TLS library.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Biswas:2017:SAT,
author = "Arnab Kumar Biswas",
title = "Source Authentication Techniques for Network-on-Chip
Router Configuration Packets",
journal = j-JETC,
volume = "13",
number = "2",
pages = "28:1--28:??",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2996194",
ISSN = "1550-4832",
bibdate = "Sat Apr 8 10:16:07 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jetc.bib",
abstract = "It is known that maliciously configured
Network-on-Chip routers can enable an attacker to
launch different attacks inside a Multiprocessor
System-on-Chip. A source authentication mechanism for
router configuration packets can prevent such
vulnerability. This ensures that a router is configured
by the configuration packets sent only by a trusted
configuration source. Conventional method like Secure
Hash Algorithm-3 (SHA-3) can provide required source
authentication in a router but with a router area
overhead of 1355.25\% compared to a normal router area.
We propose eight source authentication mechanisms that
can achieve similar level of security as SHA-3 for a
router configuration perspective without causing
significant area and power increase. Moreover, the
processing time of our proposed techniques is 1/100th
of SHA-3 implementation. Most of our proposed
techniques use different timing channel watermarking
methods to transfer source authentication data to the
receiver router. We also propose the Individual
packet-based stream authentication technique and
combinations of this technique with timing channel
watermarking techniques. It is shown that, among all of
our proposed techniques, maximum router area increment
required is 28.32\% compared to a normal router.",
acknowledgement = ack-nhfb,
articleno = "28",
fjournal = "ACM Journal on Emerging Technologies in Computing
Systems (JETC)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J967",
}
@Article{Biswas:2017:STC,
author = "Arnab Kumar Biswas and Dipak Ghosal and Shishir
Nagaraja",
title = "A Survey of Timing Channels and Countermeasures",
journal = j-COMP-SURV,
volume = "50",
number = "1",
pages = "6:1--6:??",
month = apr,
year = "2017",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3023872",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Mon Jul 24 18:12:19 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "A timing channel is a communication channel that can
transfer information to a receiver/decoder by
modulating the timing behavior of an entity. Examples
of this entity include the interpacket delays of a
packet stream, the reordering packets in a packet
stream, or the resource access time of a cryptographic
module. Advances in the information and coding theory
and the availability of high-performance computing
systems interconnected by high-speed networks have
spurred interest in and development of various types of
timing channels. With the emergence of complex timing
channels, novel detection and prevention techniques are
also being developed to counter them. In this article,
we provide a detailed survey of timing channels broadly
categorized into network timing channel, in which
communicating entities are connected by a network, and
in-system timing channel, in which the communicating
entities are within a computing system. This survey
builds on the last comprehensive survey by Zander et
al. [2007] and considers all three canonical
applications of timing channels, namely, covert
communication, timing side channel, and network flow
watermarking. We survey the theoretical foundations,
the implementation, and the various detection and
prevention techniques that have been reported in
literature. Based on the analysis of the current
literature, we discuss potential future research
directions both in the design and application of timing
channels and their detection and prevention
techniques.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Bitansky:2017:VGB,
author = "Nir Bitansky and Ran Canetti and Yael Tauman Kalai and
Omer Paneth",
title = "On Virtual Grey Box Obfuscation for General Circuits",
journal = j-ALGORITHMICA,
volume = "79",
number = "4",
pages = "1014--1051",
month = dec,
year = "2017",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-016-0218-8",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Mon Oct 2 10:42:20 MDT 2017",
bibsource = "http://link.springer.com/journal/453/79/4;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Boche:2017:CQA,
author = "Holger Boche and Minglai Cai and Christian Deppe and
Janis N{\"o}tzel",
title = "Classical-quantum arbitrarily varying wiretap channel:
Secret message transmission under jamming attacks",
journal = j-J-MATH-PHYS,
volume = "58",
number = "10",
pages = "102203",
month = oct,
year = "2017",
CODEN = "JMAPAQ",
DOI = "https://doi.org/10.1063/1.5005947",
ISSN = "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
ISSN-L = "0022-2488",
bibdate = "Mon Mar 4 07:27:42 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jmathphys2015.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Mathematical Physics",
journal-URL = "http://jmp.aip.org/",
}
@Article{Borcea:2017:PEE,
author = "Cristian Borcea and Arnab `Bobby'' Deb Gupta and Yuriy
Polyakov and Kurt Rohloff and Gerard Ryan",
title = "{PICADOR}: End-to-end encrypted Publish--Subscribe
information distribution with proxy re-encryption",
journal = j-FUT-GEN-COMP-SYS,
volume = "71",
number = "??",
pages = "177--191",
month = jun,
year = "2017",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Thu Mar 9 14:20:18 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16303983",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Bouraoui:2017:HAE,
author = "Hasna Bouraoui and Chadlia Jerad and Anupam
Chattopadhyay and Nejib Ben Hadj-Alouane",
title = "Hardware Architectures for Embedded Speaker
Recognition Applications: a Survey",
journal = j-TECS,
volume = "16",
number = "3",
pages = "78:1--78:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2975161",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Jul 24 09:51:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Authentication technologies based on biometrics, such
as speaker recognition, are attracting more and more
interest thanks to the elevated level of security
offered by these technologies. Despite offering many
advantages, such as remote use and low vulnerability,
speaker recognition applications are constrained by the
heavy computational effort and the hard real-time
constraints. When such applications are run on an
embedded platform, the problem becomes more
challenging, as additional constraints inherent to this
specific domain are added. In the literature, different
hardware architectures were used/designed for
implementing a process with a focus on a given
particular metric. In this article, we give a survey of
the state-of-the-art works on implementations of
embedded speaker recognition applications. Our aim is
to provide an overview of the different approaches
dealing with acceleration techniques oriented towards
speaker and speech recognition applications and attempt
to identify the past, current, and future research
trends in the area. Indeed, on the one hand, many
flexible solutions were implemented, using either
General Purpose Processors or Digital Signal
Processors. In general, these types of solutions suffer
from low area and energy efficiency. On the other hand,
high-performance solutions were implemented on
Application Specific Integrated Circuits or Field
Programmable Gate Arrays but at the expense of
flexibility. Based on the available results, we compare
the application requirements vis-{\`a}-vis the
performance achieved by the systems. This leads to the
projection of new research trends that can be
undertaken in the future.",
acknowledgement = ack-nhfb,
articleno = "78",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Brandenburger:2017:DTC,
author = "Marcus Brandenburger and Christian Cachin and Nikola
Knezevi{\'c}",
title = "Don't Trust the Cloud, Verify: Integrity and
Consistency for Cloud Object Stores",
journal = j-TOPS,
volume = "20",
number = "3",
pages = "8:1--8:??",
month = aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3079762",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
ISSN-L = "2471-2566",
bibdate = "Sat Dec 23 09:59:06 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
abstract = "Cloud services have turned remote computation into a
commodity and enable convenient online collaboration.
However, they require that clients fully trust the
service provider in terms of confidentiality,
integrity, and availability. Toward reducing this
dependency, this article introduces VICOS, a protocol
for verification of integrity and consistency for cloud
object storage that enables a group of mutually
trusting clients to detect data integrity and
consistency violations for a cloud object storage
service. It aims at services where multiple clients
cooperate on data stored remotely on a potentially
misbehaving service. VICOS enforces the consistency
notion of fork-linearizability, supports wait-free
client semantics for most operations, and reduces the
computation and communication overhead compared to
previous protocols. VICOS is based on a generic
authenticated data structure. Moreover, its operations
cover the hierarchical name space of a cloud object
store, supporting a real-world interface and not only a
simplistic abstraction. A prototype of VICOS that works
with the key-value store interface of commodity cloud
storage services has been implemented, and an
evaluation demonstrates its advantage compared to
existing systems.",
acknowledgement = ack-nhfb,
articleno = "8",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Misc{Brook:2017:LSR,
author = "Chris Brook",
title = "{\tt libgcrypt} `Sliding Right' Attack Allows Recovery
of {RSA-1024} Keys",
howpublished = "Web blog.",
day = "5",
month = jul,
year = "2017",
bibdate = "Tue Jul 11 17:00:32 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "See \cite{Bernstein:2017:SRD}.",
URL = "https://threatpost.com/libgcrypt-sliding-right-attack-allows-recovery-of-rsa-1024-keys/126675/",
abstract = "The cryptographic library Libgcrypt is vulnerable to a
local side-channel attack; something researchers warn
could allow full key recovery for RSA-1024.",
acknowledgement = ack-nhfb,
remark = "Security hole was fixed in libgcrypt-1.7.8, released
29 June 2017.",
}
@Article{Buchmann:2017:PCS,
author = "Johannes Buchmann and Kristin Lauter and Michele
Mosca",
title = "Postquantum Cryptography --- State of the Art",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "4",
pages = "12--13",
month = jul # "\slash " # aug,
year = "2017",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Aug 29 06:15:10 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/04/msp2017040012.html",
acknowledgement = ack-nhfb,
journal-URL = "https://publications.computer.org/security-and-privacy/",
}
@Article{Buchmann:2017:PCU,
author = "Johannes Buchmann and Kristin Lauter and Michele
Mosca",
title = "Postquantum Cryptography --- State of the Art",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "4",
pages = "12--13",
month = jul # "\slash " # aug,
year = "2017",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Aug 29 06:15:10 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/04/msp2017040012.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Bunder:2017:GAR,
author = "Martin Bunder and Abderrahmane Nitaj and Willy Susilo
and Joseph Tonien",
title = "A generalized attack on {RSA} type cryptosystems",
journal = j-THEOR-COMP-SCI,
volume = "704",
number = "??",
pages = "74--81",
day = "15",
month = dec,
year = "2017",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2017.09.009",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 15 12:07:50 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397517306643",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Butin:2017:HBS,
author = "Denis Butin",
title = "Hash-Based Signatures: State of Play",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "4",
pages = "37--43",
month = jul # "\slash " # aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2017.3151334",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Aug 29 06:15:10 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/04/msp2017040037-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "https://publications.computer.org/security-and-privacy/",
}
@Article{Calzavara:2017:SWJ,
author = "Stefano Calzavara and Riccardo Focardi and Marco
Squarcina and Mauro Tempesta",
title = "Surviving the {Web}: a Journey into {Web} Session
Security",
journal = j-COMP-SURV,
volume = "50",
number = "1",
pages = "13:1--13:??",
month = apr,
year = "2017",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3038923",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Mon Jul 24 18:12:19 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "In this article, we survey the most common attacks
against web sessions, that is, attacks that target
honest web browser users establishing an authenticated
session with a trusted web application. We then review
existing security solutions that prevent or mitigate
the different attacks by evaluating them along four
different axes: protection, usability, compatibility,
and ease of deployment. We also assess several
defensive solutions that aim at providing robust
safeguards against multiple attacks. Based on this
survey, we identify five guidelines that, to different
extents, have been taken into account by the designers
of the different proposals we reviewed. We believe that
these guidelines can be helpful for the development of
innovative solutions approaching web security in a more
systematic and comprehensive way.",
acknowledgement = ack-nhfb,
articleno = "13",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Chailloux:2017:PLQ,
author = "Andr{\'e} Chailloux and Iordanis Kerenidis",
title = "Physical Limitations of Quantum Cryptographic
Primitives or Optimal Bounds for Quantum Coin Flipping
and Bit Commitment",
journal = j-SIAM-J-COMPUT,
volume = "46",
number = "5",
pages = "1647--1677",
month = "????",
year = "2017",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/15M1010853",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Wed Oct 9 17:50:39 MDT 2019",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/46/5;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 2017",
}
@Article{Chatterjee:2017:IPB,
author = "Sanjit Chatterjee and Alfred Menezes and Francisco
Rodr{\'\i}guez-Henr{\'\i}quez",
title = "On Instantiating Pairing-Based Protocols with Elliptic
Curves of Embedding Degree One",
journal = j-IEEE-TRANS-COMPUT,
volume = "66",
number = "6",
pages = "1061--1070",
month = jun,
year = "2017",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2633340",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jun 8 10:37:11 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/document/7762073/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Chatterjee:2017:PBS,
author = "Urbi Chatterjee and Rajat Subhra Chakraborty and
Debdeep Mukhopadhyay",
title = "A {PUF}-Based Secure Communication Protocol for
{IoT}",
journal = j-TECS,
volume = "16",
number = "3",
pages = "67:1--67:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3005715",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Jul 24 09:51:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Security features are of paramount importance for the
Internet of Things (IoT), and implementations are
challenging given the resource-constrained IoT setup.
We have developed a lightweight identity-based
cryptosystem suitable for IoT to enable secure
authentication and message exchange among the devices.
Our scheme employs a Physically Unclonable Function
(PUF) to generate the public identity of each device,
which is used as the public key for each device for
message encryption. We have provided formal proofs of
security in the Session Key Security and Universally
Composable Framework of the proposed protocol, which
demonstrates the resilience of the scheme against
passive and active attacks. We have demonstrated the
setup required for the protocol implementation and
shown that the proposed protocol implementation incurs
low hardware and software overhead.",
acknowledgement = ack-nhfb,
articleno = "67",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Chen:2017:CSQ,
author = "Lidong Chen",
title = "Cryptography Standards in Quantum Time: New Wine in an
Old Wineskin?",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "4",
pages = "51--57",
month = jul # "\slash " # aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2017.3151339",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Aug 29 06:15:10 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/04/msp2017040051-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Chen:2017:LAA,
author = "Min Chen and Shigang Chen and Yuguang Fang",
title = "Lightweight Anonymous Authentication Protocols for
{RFID} Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "3",
pages = "1475--1488",
month = jun,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2631517",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:32 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Radio-frequency identification RFID technologies are
making their way into retail products, library books,
debit cards, passports, driver licenses, car plates,
medical devices, and so on. The widespread use of tags
in traditional ways of deployment raises a privacy
concern: they make their carriers trackable. To protect
the privacy of the tag carriers, we need to invent new
mechanisms that keep the usefulness of tags while doing
so anonymously. Many tag applications, such as toll
payment, require authentication. This paper studies the
problem of anonymous authentication. Since low-cost
tags have extremely limited hardware resource, we
propose an asymmetric design principle that pushes most
complexity to more powerful RFID readers. With this
principle, we develop a lightweight technique that
generates dynamic tokens for anonymous authentication.
Instead of implementing complicated and
hardware-intensive cryptographic hash functions, our
authentication protocol only requires tags to perform
several simple and hardware-efficient operations such
as bitwise XOR, one-bit left circular shift, and bit
flip. The theoretical analysis and randomness tests
demonstrate that our protocol can ensure the privacy of
the tags. Moreover, our protocol reduces the
communication overhead and online computation overhead
to $ O1 $ per authentication for both tags and readers,
which compares favorably with the prior art.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chen:2017:PGF,
author = "Yajing Chen and Shengshuo Lu and Cheng Fu and David
Blaauw and Ronald {Dreslinski, Jr.} and Trevor Mudge
and Hun-Seok Kim",
title = "A Programmable {Galois} Field Processor for the
{Internet of Things}",
journal = j-COMP-ARCH-NEWS,
volume = "45",
number = "2",
pages = "55--68",
month = may,
year = "2017",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/3140659.3080227",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri Sep 15 11:09:14 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "This paper investigates the feasibility of a unified
processor architecture to enable error coding
flexibility and secure communication in low power
Internet of Things (IoT) wireless networks. Error
coding flexibility for wireless communication allows
IoT applications to exploit the large tradeoff space in
data rate, link distance and energy-efficiency. As a
solution, we present a light-weight Galois Field (GF)
processor to enable energy-efficient block coding and
symmetric/asymmetric cryptography kernel processing for
a wide range of GF sizes (2m, m = 2, 3, ..., 233) and
arbitrary irreducible polynomials. Program directed
connections among primitive GF arithmetic units enable
dynamically configured parallelism to efficiently
perform either four-way SIMD 5- to 8-bit GF operations,
including multiplicative inverse, or a wide bit-width
(e.g., 32-bit) GF product in a single cycle. To
illustrate our ideas, we synthesized our GF processor
in a 28nm technology. Compared to a baseline software
implementation optimized for a general purpose ARM M0+
processor, our processor exhibits a 5-20 x speedup for
a range of error correction codes and
symmetric/asymmetric cryptography applications.
Additionally, our proposed GF processor consumes 431 $
\mu $W at 0.9V and 100MHz, and achieves 35.5pJ/b energy
efficiency while executing AES operations at 12.2Mbps.
We achieve this within an area of 0.01mm2.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Chen:2017:SIE,
author = "Chin-Ling Chen and Jungpil Shin and Yu-Ting Tsai and
Aniello Castiglione and Francesco Palmieri",
title = "Securing Information Exchange in {VANETs} by Using
Pairing-Based Cryptography",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "781--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400184",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chen:2017:VME,
author = "Jiageng Chen and Rashed Mazumder and Atsuko Miyaji and
Chunhua Su",
title = "Variable message encryption through blockcipher
compression function",
journal = j-CCPE,
volume = "29",
number = "7",
pages = "??--??",
day = "10",
month = apr,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3956",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Fri Mar 31 19:12:52 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Cheng:2017:ISK,
author = "Longwang Cheng and Wei Li and Li Zhou and Chunsheng
Zhu and Jibo Wei and Yantao Guo",
title = "Increasing secret key capacity of {OFDM} systems: a
geometric program approach",
journal = j-CCPE,
volume = "29",
number = "16",
pages = "",
day = "25",
month = aug,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3966",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Jul 24 08:22:39 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Choo:2017:EDF,
author = "Kim-Kwang Raymond Choo and Yunsi Fei and Yang Xiang
and Yu Yu",
title = "Embedded Device Forensics and Security",
journal = j-TECS,
volume = "16",
number = "2",
pages = "50:1--50:??",
month = apr,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3015662",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Jul 24 09:51:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "While the increasing digitalization of our society and
amalgamation of embedded devices into the
ever-increasing facets of our daily life (e.g., in
smart and intelligent vehicles, smart cities and smart
nations, and critical infrastructure sectors) have
resulted in improved productivity and quality of life,
the trend has also resulted in a trend of increasing
frequency and sophistication of cyber exploitation and
cyber threats. Hence, there is a need for coordinated
efforts from the research community to address
resulting concerns using both cryptographic and
non-cryptographic solutions, such as those presented in
this special section.",
acknowledgement = ack-nhfb,
articleno = "50",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@TechReport{Cohney:2017:PSR,
author = "Shaanan Cohney and Matthew D. Green and Nadia
Heninger",
title = "Practical state recovery attacks against legacy {RNG}
implementations",
type = "Report",
institution = "University of Pennsylvania and The Johns Hopkins
University",
address = "College Park, PA and Baltimore, MD",
pages = "15",
day = "23",
month = oct,
year = "2017",
bibdate = "Thu Oct 26 07:52:23 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "https://duhkattack.com/paper.pdf",
abstract = "The ANSI X9.17/X9.31 random number generator is a
pseudorandom number generator design based on a block
cipher and updated using the current time. First
standardized in 1985, variants of this PRNG design were
incorporated into numerous cryptographic standards over
the next three decades. It remained on the list of FIPS
140-1 and 140-2 approved random number generation
algorithms until January 2016. The design uses a static
key with the specified block cipher to produce
pseudo-random output. It has been known since at least
1998 that the key must remain secret in order for the
random number generator to be secure. However, neither
the FIPS 140-2 standardization process in 2001 or
NIST's update of the algorithm in 2005 appear to have
specified any process for key generation.\par
We performed a systematic study of publicly available
FIPS 140-2 certifications for hundreds of products that
implemented the ANSI X9.31 random number generator, and
found twelve whose certification documents use of
static hard-coded keys in source code, leaving them
vulnerable to an attacker who can learn this key from
the source code or binary. In order to demonstrate the
practicality of this attack, we develop a full passive
decryption attack against FortiGate VPN gateway
products using FortiOS version 4. Private key recovery
requires a few seconds of computation. We measured the
prevalence of this vulnerability on the visible
Internet using active scans and find that we are able
to recover the random number generator state for 21\%
of HTTPS hosts serving a default Fortinet product
certificate, and 97\% of hosts with metadata
identifying FortiOSv4. We successfully demonstrate full
private key recovery in the wild against a subset of
these hosts that accept IPsec connections.",
acknowledgement = ack-nhfb,
}
@Book{Collie:2017:CBI,
author = "Craig Collie",
title = "Code Breakers: Inside the Shadow World of Signals
Intelligence in {Australia}'s Two {Bletchley Parks}",
publisher = "Allen and Unwin",
address = "Sydney, NSW, Australia",
pages = "ix + 389 + 16",
year = "2017",
ISBN = "1-74269-977-4 (e-book), 1-74331-210-5 (paperback)",
ISBN-13 = "978-1-74269-977-6 (e-book), 978-1-74331-210-0
(paperback)",
LCCN = "D810.C88",
bibdate = "Tue Apr 9 06:28:27 MDT 2024",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "The extraordinary untold story of the brilliant men
and women who cracked the Japanese codes from Australia
during World War II. At the height of World War II in
the Pacific, two secret organisations existed in
Australia to break the Japanese military codes. They
were peopled by brilliant and idiosyncratic
cryptographers with achievements in mathematics and the
classics. These men patiently and carefully deciphered
the Japanese signals, ultimately making a significant
contribution to the victories at Midway, Coral Sea and
Milne Bay. But this is more than a story of codes. It
is an extraordinary exploration of a unique group of
men and their intense personal rivalries. It is also
the story of a fierce inter-national and inter-service
political battle for control of war-changing
intelligence between a group of Australian
cryptographers based at the Monterey apartment block in
Melbourne's Albert Park with strong connections to
British Naval Intelligence and General MacArthur's
counter group allied to the US military that eventually
established its headquarters in suburban Brisbane. What
happened between these two groups would have
consequences for intelligence services in the years to
follow. Code Breakers brings this surprising and very
secret world and the men who operated in it to rich
life for the first time.",
acknowledgement = ack-nhfb,
subject = "World War, 1939--1945; Cryptography; Secret service;
Australia; Electronic intelligence; Guerre mondiale,
1939-1945; Cryptographie; Service secret; Australie;
Renseignement {\'e}lectronique; History; Cryptography;
Electronic intelligence; Secret service; Australia",
tableofcontents = "List of maps \\
Abbreviations \\
Relationship of Allied code-breaking units diagram \\
1: Burn the codes and ciphers \\
2: Pioneer of the code breaker's craft \\
3: Special Intelligence Bureau \\
4: The road to Corregidor \\
5: Scramble to safety \\
6: The turning of the tide \\
7: Midway \\
8: Central Bureau \\
9: The Water TransportCode broken \\
10: The admiral's itinerary \\
11: Buried treasure \\
12: The front line and the back room \\
13: A new world, a new enemy \\
Pic section \\
Coding and Decoding Japan's Military Messages \\
Glossary of technical terms \\
Cast of characters \\
Acknowledgements \\
Notes \\
Bibliography \\
Index",
}
@Article{Constantin:2017:SHF,
author = "Lucian Constantin",
title = "The {SHA1} hash function is now completely unsafe:
Researchers have achieved the first practical {SHA-1}
collision, generating two {PDF} files with the same
signature",
journal = j-COMPUTERWORLD,
volume = "??",
number = "??",
pages = "??--??",
day = "23",
month = feb,
year = "2017",
CODEN = "CMPWAB",
ISSN = "0010-4841",
bibdate = "Thu Sep 03 14:26:31 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "https://www.computerworld.com/article/3173616/the-sha1-hash-function-is-now-completely-unsafe.html",
abstract = "Security researchers have achieved the first
real-world collision attack against the SHA-1 hash
function, producing two different PDF files with the
same SHA-1 signature. This shows that the algorithm's
use for security-sensitive functions should be
discontinued as soon as possible.",
acknowledgement = ack-nhfb,
fjournal = "ComputerWorld",
remark = "From the article: ``it was one of the largest
computations ever completed: the equivalent processing
power of 6,500 years of single-CPU computations and 110
years of single-GPU computations.''",
}
@Article{Crampton:2017:CEI,
author = "Jason Crampton and Naomi Farley and Gregory Gutin and
Mark Jones and Bertram Poettering",
title = "Cryptographic enforcement of information flow policies
without public information via tree partitions",
journal = j-J-COMP-SECUR,
volume = "25",
number = "6",
pages = "511--535",
month = "????",
year = "2017",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-16863",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Mon Sep 23 05:47:13 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Datta:2017:SFH,
author = "Pratish Datta and Ratna Dutta and Sourav
Mukhopadhyay",
title = "Strongly full-hiding inner product encryption",
journal = j-THEOR-COMP-SCI,
volume = "667",
number = "??",
pages = "16--50",
day = "8",
month = mar,
year = "2017",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Feb 15 08:03:13 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397516307526",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{DeCapitanidiVimercati:2017:AMM,
author = "Sabrina {De Capitani di Vimercati} and Sara Foresti
and Sushil Jajodia and Giovanni Livraga and Stefano
Paraboschi and Pierangela Samarati",
title = "An authorization model for multi provider queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "11",
number = "3",
pages = "256--268",
month = nov,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.14778/3157794.3157796",
ISSN = "2150-8097",
bibdate = "Mon Dec 11 16:07:56 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "We present a novel approach for the specification and
enforcement of authorizations that enables controlled
data sharing for collaborative queries in the cloud.
Data authorities can establish authorizations
regulating access to their data distinguishing three
visibility levels (no visibility, encrypted visibility,
and plaintext visibility). Authorizations are enforced
in the query execution by possibly restricting
operation assignments to other parties and by adjusting
visibility of data on-the-fly. Our approach enables
users and data authorities to fully enjoy the benefits
and economic savings of the competitive open cloud
market, while maintaining control over data.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Deng:2017:LLH,
author = "Zhaoxia Deng and Ariel Feldman and Stuart A. Kurtz and
Frederic T. Chong",
title = "Lemonade from Lemons: Harnessing Device Wearout to
Create Limited-Use Security Architectures",
journal = j-COMP-ARCH-NEWS,
volume = "45",
number = "2",
pages = "361--374",
month = may,
year = "2017",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/3140659.3080226",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri Sep 15 11:09:14 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "Most architectures are designed to mitigate the
usually undesirable phenomenon of device wearout. We
take a contrarian view and harness this phenomenon to
create hardware security mechanisms that resist attacks
by statistically enforcing an upper bound on hardware
uses, and consequently attacks. For example, let us
assume that a user may log into a smartphone a maximum
of 50 times a day for 5 years, resulting in
approximately 91,250 legitimate uses. If we assume at
least 8-character passwords and we require login (and
retrieval of the storage decryption key) to traverse
hardware that wears out in 91,250 uses, then an
adversary has a negligible chance of successful
brute-force attack before the hardware wears out, even
assuming real-world password cracking by professionals.
M-way replication of our hardware and periodic
re-encryption of storage can increase the daily usage
bound by a factor of M. The key challenge is to achieve
practical statistical bounds on both minimum and
maximum uses for an architecture, given that individual
devices can vary widely in wearout characteristics. We
introduce techniques for architecturally controlling
these bounds and perform a design space exploration for
three use cases: a limited-use connection, a
limited-use targeting system and one-time pads. These
techniques include decision trees, parallel structures,
Shamir's secret-sharing mechanism, Reed--Solomon codes,
and module replication. We explore the cost in area,
energy and latency of using these techniques to achieve
system-level usage targets given device-level wearout
distributions. With redundant encoding, for example, we
can improve exponential sensitivity to device lifetime
variation to linear sensitivity, reducing the total
number of NEMS devices by 4 orders of magnitude to
about 0.8 million for limited-use connections (compared
with 4 billion if without redundant encoding).",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Ding:2017:CSM,
author = "Jintai Ding and Albrecht Petzoldt",
title = "Current State of Multivariate Cryptography",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "4",
pages = "28--36",
month = jul # "\slash " # aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2017.3151328",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Aug 29 06:15:10 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/04/msp2017040028-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Dinur:2017:IGA,
author = "Itai Dinur and Ga{\"e}tan Leurent",
title = "Improved Generic Attacks Against Hash-Based {MACs} and
{HAIFA}",
journal = j-ALGORITHMICA,
volume = "79",
number = "4",
pages = "1161--1195",
month = dec,
year = "2017",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-016-0236-6",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Mon Oct 2 10:42:20 MDT 2017",
bibsource = "http://link.springer.com/journal/453/79/4;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Dodis:2017:HEY,
author = "Yevgeniy Dodis and Adi Shamir and Noah
Stephens-Davidowitz and Daniel Wichs",
title = "How to Eat Your Entropy and Have it Too: Optimal
Recovery Strategies for Compromised {RNGs}",
journal = j-ALGORITHMICA,
volume = "79",
number = "4",
pages = "1196--1232",
month = dec,
year = "2017",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-016-0239-3",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Mon Oct 2 10:42:20 MDT 2017",
bibsource = "http://link.springer.com/journal/453/79/4;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
keywords = "Fortuna RNG algorithm; Random number generator; RNG;
State compromise",
}
@Article{Doychev:2017:RAS,
author = "Goran Doychev and Boris K{\"o}pf",
title = "Rigorous analysis of software countermeasures against
cache attacks",
journal = j-SIGPLAN,
volume = "52",
number = "6",
pages = "406--421",
month = jun,
year = "2017",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/3140587.3062388",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Sat Sep 16 10:18:17 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "CPU caches introduce variations into the execution
time of programs that can be exploited by adversaries
to recover private information about users or
cryptographic keys. Establishing the security of
countermeasures against this threat often requires
intricate reasoning about the interactions of program
code, memory layout, and hardware architecture and has
so far only been done for restricted cases. In this
paper we devise novel techniques that provide support
for bit-level and arithmetic reasoning about memory
accesses in the presence of dynamic memory allocation.
These techniques enable us to perform the first
rigorous analysis of widely deployed software
countermeasures against cache attacks on modular
exponentiation, based on executable code.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "PLDI '17 conference proceedings.",
}
@Article{Drosatos:2017:PET,
author = "George Drosatos and Aimilia Tasidou and Pavlos S.
Efraimidis",
title = "Privacy-Enhanced Television Audience Measurements",
journal = j-TOIT,
volume = "17",
number = "1",
pages = "10:1--10:??",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3009969",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jul 24 17:19:25 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Internet-enabled television systems (SmartTVs) are a
development that introduces these devices into the
interconnected environment of the Internet of Things.
We propose a privacy-preserving application for
computing Television Audience Measurement (TAM)
ratings. SmartTVs communicate over the Internet to
calculate aggregate measurements. Contemporary
cryptographic building blocks are utilized to ensure
the privacy of the participating individuals and the
validity of the computed TAM ratings. Additionally,
user compensation capabilities are introduced to bring
some of the company profits back to the data owners. A
prototype implementation is developed on an
Android-based SmartTV platform and experimental results
illustrate the feasibility of the approach.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Dutta:2017:EFC,
author = "Tanima Dutta and Hari Prabhat Gupta",
title = "An Efficient Framework for Compressed Domain
Watermarking in {$P$} Frames of High-Efficiency Video
Coding ({HEVC})-Encoded Video",
journal = j-TOMCCAP,
volume = "13",
number = "1",
pages = "12:1--12:??",
month = jan,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3002178",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Wed Jan 18 17:18:28 MST 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Digital watermarking has received much attention in
recent years as a promising solution to copyright
protection. Video watermarking in compressed domain has
gained importance since videos are stored and
transmitted in a compressed format. This decreases the
overhead to fully decode and re-encode the video for
embedding and extraction of the watermark. High
Efficiency Video Coding (HEVC/H.265) is the latest and
most efficient video compression standard and a
successor to H.264 Advanced Video Coding. In this
article, we propose a robust watermarking framework for
HEVC-encoded video using informed detector. A readable
watermark is embedded invisibly in P frames for better
perceptual quality. Our framework imposes security and
robustness by selecting appropriate blocks using a
random key and the spatio-temporal characteristics of
the compressed video. A detail analysis of the
strengths of different compressed domain features is
performed for implementing the watermarking framework.
We experimentally demonstrate the utility of the
proposed work. The results show that the proposed work
effectively limits the increase in video bitrate and
degradation in perceptual quality. The proposed
framework is robust against re-encoding and image
processing attacks.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Edwards:2017:NSQ,
author = "Chris Edwards",
title = "News: Secure quantum communications",
journal = j-CACM,
volume = "60",
number = "2",
pages = "15--17",
month = feb,
year = "2017",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3022179",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Fri Feb 17 17:20:17 MST 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2017/2/212424/fulltext",
abstract = "Data locking experiments provide stepping stones to a
possible future in quantum cryptography.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Ermis:2017:KAP,
author = "Orhan Ermis and Serif Bahtiyar and Emin Anarim and M.
Ufuk {\c{C}}aglayan",
title = "A key agreement protocol with partial backward
confidentiality",
journal = j-COMP-NET-AMSTERDAM,
volume = "129 (part 1)",
number = "??",
pages = "159--177",
day = "24",
month = dec,
year = "2017",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Nov 22 06:05:46 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128617303596",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Esiner:2017:QRI,
author = "Ertem Esiner and Anwitaman Datta",
title = "On query result integrity over encrypted data",
journal = j-INFO-PROC-LETT,
volume = "122",
number = "??",
pages = "34--39",
month = jun,
year = "2017",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Mar 27 21:15:48 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019017300327",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Essex:2017:DDU,
author = "Aleksander Essex",
title = "Detecting the Detectable: Unintended Consequences of
Cryptographic Election Verification",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "3",
pages = "30--38",
month = may # "\slash " # jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2017.69",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Jul 25 21:35:08 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/03/msp2017030030-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Eyal:2017:BTT,
author = "Ittay Eyal",
title = "Blockchain Technology: Transforming Libertarian
Cryptocurrency Dreams to Finance and Banking
Realities",
journal = j-COMPUTER,
volume = "50",
number = "9",
pages = "38--49",
month = sep,
year = "2017",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2017.3571042",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Mon Oct 2 08:46:55 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.computer.org/csdl/mags/co/2017/09/mco2017090038-abs.html",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Book{Fagone:2017:WWS,
author = "Jason Fagone",
title = "The woman who smashed codes: a true story of love,
spies, and the unlikely heroine who outwitted
{America}'s enemies",
publisher = "Dey Street Books",
address = "New York, New York",
pages = "xvi + 444",
year = "2017",
ISBN = "0-06-243048-3 (hardcover)",
ISBN-13 = "978-0-06-243048-9 (hardcover)",
LCCN = "Z103.4.U6",
bibdate = "Fri Dec 22 09:19:43 MST 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
abstract = "In 1916, at the height of World War I, brilliant
Shakespeare expert Elizebeth Smith went to work for an
eccentric tycoon on his estate outside Chicago. The
tycoon had close ties to the U.S. government, and he
soon asked Elizebeth to apply her language skills to an
exciting new venture: code-breaking. There she met the
man who would become her husband, groundbreaking
cryptologist William Friedman. Though she and Friedman
are in many ways the ``Adam and Eve'' of the NSA,
Elizebeth's story, incredibly, has never been told. In
\booktitle{The Woman Who Smashed Codes}, Jason Fagone
chronicles the life of this extraordinary woman, who
played an integral role in our nation's history for
forty years. After World War I, Smith used her talents
to catch gangsters and smugglers during Prohibition,
then accepted a covert mission to discover and expose
Nazi spy rings that were spreading like wildfire across
South America, advancing ever closer to the United
States. As World War II raged, Elizebeth fought a
highly classified battle of wits against Hitler's
Reich, cracking multiple versions of the Enigma machine
used by German spies. Meanwhile, inside an Army vault
in Washington, William worked furiously to break
Purple, the Japanese version of Enigma --- and
eventually succeeded, at a terrible cost to his
personal life. Fagone unveils America's code-breaking
history through the prism of Smith's life, bringing
into focus the unforgettable events and colorful
personalities that would help shape modern
intelligence.",
acknowledgement = ack-nhfb,
subject = "Friedman, Elizebeth; Friedman, Elizebeth,;
Cryptographers; United States; Biography; Cryptography;
History; Cryptographers; Cryptography; Riverbank
Laboratories",
subject-dates = "Elizebeth Smith Friedman (1892--1980); William
Frederick Friedman (1891--1969)",
tableofcontents = "Author's note: Prying eyes \\
Fabyan \\
Unbelievable, yet it was there \\
Bacon's ghost \\
He who fears is half dead \\
The escape plot \\
Target practice \\
Grandmother died \\
Magic \\
The Hauptsturmf{\"u}hrer and the Funkmeister \\
Circuit 3-N \\
The doll lady \\
Hitler's lair \\
Epilogue: Girl cryptanalyst and all that",
}
@Article{Fan:2017:SSP,
author = "Jingyuan Fan and Chaowen Guan and Kui Ren and Yong Cui
and Chunming Qiao",
title = "{SPABox}: Safeguarding Privacy During Deep Packet
Inspection at a {MiddleBox}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "6",
pages = "3753--3766",
month = dec,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2753044",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jan 18 06:52:57 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Widely used over the Internet to encrypt traffic,
HTTPS provides secure and private data communication
between clients and servers. However, to cope with
rapidly changing and sophisticated security attacks,
network operators often deploy middleboxes to perform
deep packet inspection DPI to detect attacks and
potential security breaches, using techniques ranging
from simple keyword matching to more advanced machine
learning and data mining analysis. But this creates a
problem: how can middleboxes, which employ DPI, work
over HTTPS connections with encrypted traffic while
preserving privacy? In this paper, we present SPABox, a
middlebox-based system that supports both keyword-based
and data analysis-based DPI functions over encrypted
traffic. SPABox preserves privacy by using a novel
protocol with a limited connection setup overhead. We
implement SPABox on a standard server and show that
SPABox is practical for both long-lived and short-lived
connection. Compared with the state-of-the-art Blindbox
system, SPABox is more than five orders of magnitude
faster and requires seven orders of magnitude less
bandwidth for connection setup while SPABox can achieve
a higher security level.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Farras:2017:IRN,
author = "Oriol Farr{\`a}s and Torben Brandt Hansen and Tarik
Kaced and Carles Padr{\'o}",
title = "On the Information Ratio of Non-perfect Secret Sharing
Schemes",
journal = j-ALGORITHMICA,
volume = "79",
number = "4",
pages = "987--1013",
month = dec,
year = "2017",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-016-0217-9",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Mon Oct 2 10:42:20 MDT 2017",
bibsource = "http://link.springer.com/journal/453/79/4;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Fathi-Vajargah:2017:IMC,
author = "Behrouz Fathi-Vajargah and Mohadeseh Kanafchian",
title = "Improved {Markov} Chain {Monte Carlo} method for
cryptanalysis substitution-transposition cipher",
journal = j-MONTE-CARLO-METHODS-APPL,
volume = "23",
number = "2",
pages = "147--??",
month = jun,
year = "2017",
CODEN = "MCMAC6",
DOI = "https://doi.org/10.1515/mcma-2017-0108",
ISSN = "0929-9629 (print), 1569-3961 (electronic)",
ISSN-L = "0929-9629",
bibdate = "Fri Mar 8 15:35:32 MST 2019",
bibsource = "http://www.degruyter.com/view/j/mcma.2017.23.issue-2/issue-files/mcma.2017.23.issue-2.xml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/mcma.bib",
URL = "https://www.degruyter.com/view/j/mcma.2017.23.issue-2/mcma-2017-0108/mcma-2017-0108.xml",
acknowledgement = ack-nhfb,
fjournal = "Monte Carlo Methods and Applications",
journal-URL = "http://www.degruyter.com/view/j/mcma",
}
@Article{Fernandes:2017:ITS,
author = "Earlence Fernandes and Amir Rahmati and Kevin Eykholt
and Atul Prakash",
title = "{Internet of Things} Security Research: A Rehash of
Old Ideas or New Intellectual Challenges?",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "4",
pages = "79--84",
month = jul # "\slash " # aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2017.3151346",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Aug 29 06:15:10 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/04/msp2017040079-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "https://publications.computer.org/security-and-privacy/",
}
@Article{Fiore:2017:PGP,
author = "Dario Fiore and Mar{\'\i}a Isabel Gonz{\'a}lez Vasco
and Claudio Soriente",
title = "Partitioned Group Password-Based Authenticated Key
Exchange",
journal = j-COMP-J,
volume = "60",
number = "12",
pages = "1912--1922",
day = "1",
month = dec,
year = "2017",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxx078",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Jan 8 08:15:52 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/12/1912/4210211",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Fu:2017:DFA,
author = "Shan Fu and Guoai Xu and Juan Pan and Zongyue Wang and
An Wang",
title = "Differential Fault Attack on {ITUbee} Block Cipher",
journal = j-TECS,
volume = "16",
number = "2",
pages = "54:1--54:??",
month = apr,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2967610",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Jul 24 09:51:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Differential Fault Attack (DFA) is a powerful
cryptanalytic technique to retrieve secret keys by
exploiting the faulty ciphertexts generated during
encryption procedure. This article proposes a novel DFA
attack that is effective on ITUbee, a software-oriented
block cipher for resource-constrained devices.
Different from other DFA, our attack makes use of not
only faulty values, but also differences between
fault-free intermediate values corresponding to 2
plaintexts, which combine traditional differential
analysis with DFA. The possible injection positions
with different number of faults are discussed. The most
efficient attack takes 2$^{25}$ round function
operations with 4 faults, which is achieved in a few
seconds on a PC.",
acknowledgement = ack-nhfb,
articleno = "54",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Gai:2017:SCI,
author = "Keke Gai and Meikang Qiu and Houcine Hassan",
title = "Secure cyber incident analytics framework using {Monte
Carlo} simulations for financial cybersecurity
insurance in cloud computing",
journal = j-CCPE,
volume = "29",
number = "7",
pages = "??--??",
day = "10",
month = apr,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3856",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Fri Mar 31 19:12:52 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Gaj:2017:DCR,
author = "Sibaji Gaj and Aditya Kanetkar and Arijit Sur and
Prabin Kumar Bora",
title = "Drift-Compensated Robust Watermarking Algorithm for
{H.265\slash HEVC} Video Stream",
journal = j-TOMCCAP,
volume = "13",
number = "1",
pages = "11:1--11:??",
month = jan,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3009910",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Wed Jan 18 17:18:28 MST 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "It has been observed in the recent literature that the
drift error due to watermarking degrades the visual
quality of the embedded video. The existing drift error
handling strategies for recent video standards such as
H.264 may not be directly applicable for upcoming
high-definition video standards (such as High
Efficiency Video Coding (HEVC)) due to different
compression architecture. In this article, a compressed
domain watermarking scheme is proposed for H.265/HEVC
bit stream that can handle drift error propagation both
for intra- and interprediction process. Additionally,
the proposed scheme shows adequate robustness against
recompression attack as well as common image processing
attacks while maintaining decent visual quality. A
comprehensive set of experiments has been carried out
to justify the efficacy of the proposed scheme over the
existing literature.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Garay:2017:SIA,
author = "Juan A. Garay and Rafail Ostrovsky",
title = "Special Issue: Algorithmic Tools in Cryptography",
journal = j-ALGORITHMICA,
volume = "79",
number = "4",
pages = "985--986",
month = dec,
year = "2017",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-017-0368-3",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Mon Oct 2 10:42:20 MDT 2017",
bibsource = "http://link.springer.com/journal/453/79/4;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://link.springer.com/content/pdf/10.1007/s00453-017-0368-3.pdf",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Garg:2017:IDI,
author = "Sanjam Garg and Craig Gentry and Shai Halevi and
Daniel Wichs",
title = "On the Implausibility of Differing-Inputs Obfuscation
and Extractable Witness Encryption with Auxiliary
Input",
journal = j-ALGORITHMICA,
volume = "79",
number = "4",
pages = "1353--1373",
month = dec,
year = "2017",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-017-0276-6",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Mon Oct 2 10:42:20 MDT 2017",
bibsource = "http://link.springer.com/journal/453/79/4;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Glowacz:2017:IDW,
author = "Andrzej Glowacz and Marcin Pietro{\'n}",
title = "Implementation of Digital Watermarking Algorithms in
Parallel Hardware Accelerators",
journal = j-INT-J-PARALLEL-PROG,
volume = "45",
number = "5",
pages = "1108--1127",
month = oct,
year = "2017",
CODEN = "IJPPE5",
DOI = "https://doi.org/10.1007/s10766-016-0459-9",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
ISSN-L = "0885-7458",
bibdate = "Sat Nov 18 09:27:28 MST 2017",
bibsource = "http://link.springer.com/journal/10766/45/5;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Gonzalez-Manzano:2017:EHE,
author = "L. Gonz{\'a}lez-Manzano and Jos{\'e} M. de Fuentes and
P. Peris-Lopez and C. Camara",
title = "{Encryption by Heart (EbH)} --- Using {ECG} for
time-invariant symmetric key generation",
journal = j-FUT-GEN-COMP-SYS,
volume = "77",
number = "??",
pages = "136--148",
month = dec,
year = "2017",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Sep 23 09:33:17 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16307798",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Granado-Criado:2017:HCH,
author = "Jos{\'e} M. Granado-Criado and Miguel A.
Vega-Rodr{\'\i}guez",
title = "Hardware coprocessors for high-performance symmetric
cryptography",
journal = j-J-SUPERCOMPUTING,
volume = "73",
number = "6",
pages = "2456--2482",
month = jun,
year = "2017",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1929-y",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jun 24 10:31:33 MDT 2017",
bibsource = "http://link.springer.com/journal/11227/73/6;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
}
@Misc{Green:2017:SSE,
author = "Matthew Green",
title = "The strange story of ``Extended Random''",
howpublished = "Web news story",
day = "19",
month = dec,
year = "2017",
bibdate = "Tue Jan 16 07:02:05 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "Discussion of suspected NSA-supported back door in the
2007 NIST standard for the Dual Elliptic-Curve default
random number generator, and the associated RSA
cryptographic library BSAFE. There is evidence that the
back door exists in some older Canon laser printers.",
URL = "https://blog.cryptographyengineering.com/2017/12/19/the-strange-story-of-extended-random/",
acknowledgement = ack-nhfb,
}
@Article{Grigoriev:2017:YMP,
author = "Dima Grigoriev and Laszlo B. Kish and Vladimir
Shpilrain",
title = "{Yao}'s Millionaires' Problem and Public-Key
Encryption Without Computational Assumptions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "4",
pages = "379--??",
month = jun,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411750023X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:07 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Groza:2017:LCL,
author = "Bogdan Groza and Stefan Murvay and Anthony {Van
Herrewege} and Ingrid Verbauwhede",
title = "{LiBrA--CAN}: Lightweight Broadcast Authentication for
Controller Area Networks",
journal = j-TECS,
volume = "16",
number = "3",
pages = "90:1--90:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3056506",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Jul 24 09:51:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Despite realistic concerns, security is still absent
from vehicular buses such as the widely used Controller
Area Network (CAN). We design an efficient protocol
based on efficient symmetric primitives, taking
advantage of two innovative procedures: splitting keys
between nodes and mixing authentication tags. This
results in a higher security level when compromised
nodes are in the minority, a realistic assumption for
automotive networks. Experiments are performed on
state-of-the-art Infineon TriCore controllers,
contrasted with low-end Freescale S12X cores, while
simulations are provided for the recently released
CAN-FD standard. To gain compatibility with existent
networks, we also discuss a solution based on CAN+.",
acknowledgement = ack-nhfb,
articleno = "90",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Gu:2017:IBM,
author = "Ke Gu and Weijia Jia and Jianming Zhang",
title = "Identity-Based Multi-Proxy Signature Scheme in the
Standard Model",
journal = j-FUND-INFO,
volume = "150",
number = "2",
pages = "179--210",
month = "????",
year = "2017",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2017-1464",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 11 09:46:17 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Guha:2017:RTS,
author = "Krishnendu Guha and Debasri Saha and Amlan
Chakrabarti",
title = "Real-Time {SoC} Security against Passive Threats Using
Crypsis Behavior of Geckos",
journal = j-JETC,
volume = "13",
number = "3",
pages = "41:1--41:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3014166",
ISSN = "1550-4832 (print), 1550-4840 (electronic)",
ISSN-L = "1550-4832",
bibdate = "Tue Jul 11 17:10:31 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/jetc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jetc.bib",
abstract = "The rapid evolution of the embedded era has witnessed
globalization for the design of SoC architectures in
the semiconductor design industry. Though issues of
cost and stringent marketing deadlines have been
resolved in such a methodology, yet the root of
hardware trust has been evicted. Malicious circuitry,
a.k.a. Hardware Trojan Horse (HTH), is inserted by
adversaries in the less trusted phases of design. A HTH
remains dormant during testing but gets triggered at
runtime to cause sudden active and passive attacks. In
this work, we focus on the runtime passive threats
based on the parameter delay. Nature-inspired
algorithms offer an alternative to the conventional
techniques for solving complex problems in the domain
of computer science. However, most are optimization
techniques and none is dedicated to security. We seek
refuge to the crypsis behavior exhibited by geckos in
nature to generate a runtime security technique for SoC
architectures, which can bypass runtime passive threats
of a HTH. An adaptive security intellectual property
(IP) that works on the proposed security principles is
designed. Embedded timing analysis is used for
experimental validation. Low area and power overhead of
our proposed security IP over standard benchmarks and
practical crypto SoC architectures as obtained in
experimental results supports its applicability for
practical implementations.",
acknowledgement = ack-nhfb,
articleno = "41",
fjournal = "ACM Journal on Emerging Technologies in Computing
Systems (JETC)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J967",
}
@Article{Guo:2017:EMD,
author = "Jianting Guo and Peijia Zheng and Jiwu Huang",
title = "An Efficient Motion Detection and Tracking Scheme for
Encrypted Surveillance Videos",
journal = j-TOMM,
volume = "13",
number = "4",
pages = "61:1--61:??",
month = oct,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3131342",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Sat Dec 23 10:49:23 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Performing detection on surveillance videos
contributes significantly to the goals of safety and
security. However, performing detection on unprotected
surveillance video may reveal the privacy of innocent
people in the video. Therefore, striking a proper
balance between maintaining personal privacy while
enhancing the feasibility of detection is an important
issue. One promising solution to this problem is to
encrypt the surveillance videos and perform detection
on the encrypted videos. Most existing encrypted signal
processing methods focus on still images or small data
volumes; however, because videos are typically much
larger, investigating how to process encrypted videos
is a significant challenge. In this article, we propose
an efficient motion detection and tracking scheme for
encrypted H.264/AVC video bitstreams, which does not
require the previous decryption on the encrypted video.
The main idea is to first estimate motion information
from the bitstream structure and codeword length and,
then, propose a region update (RU) algorithm to deal
with the loss and error drifting of motion caused by
the video encryption. The RU algorithm is designed
based on the prior knowledge that the object motion in
the video is continuous in space and time. Compared to
the existing scheme, which is based on video encryption
that occurs at the pixel level, the proposed scheme has
the advantages of requiring only a small storage of the
encrypted video and has a low computational cost for
both encryption and detection. Experimental results
show that our scheme performs better regarding
detection accuracy and execution speed. Moreover, the
proposed scheme can work with more than one
format-compliant video encryption method, provided that
the positions of the macroblocks can be extracted from
the encrypted video bitstream. Due to the coupling of
video stream encryption and detection algorithms, our
scheme can be directly connected to the video stream
output (e.g., surveillance cameras) without requiring
any camera modifications.",
acknowledgement = ack-nhfb,
articleno = "61",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Haigh:2017:HRC,
author = "Thomas Haigh",
title = "Historical reflections: Colossal genius: {Tutte},
{Flowers}, and a bad imitation of {Turing}",
journal = j-CACM,
volume = "60",
number = "1",
pages = "29--35",
month = jan,
year = "2017",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3018994",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed Dec 21 11:53:09 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2017/1/211102/fulltext",
abstract = "Reflections on pioneering code-breaking efforts.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Hamlin:2017:NMC,
author = "Nathan Hamlin",
title = "Number in Mathematical Cryptography",
journal = j-OPEN-J-DISCRETE-MATH,
volume = "7",
number = "1",
pages = "13--31",
month = jan,
year = "2017",
DOI = "https://doi.org/10.4236/ojdm.2017.71003",
ISSN = "2161-7635 (print), 2161-7643 (electronic)",
ISSN-L = "2161-7635",
bibdate = "Tue Feb 28 15:45:03 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.scirp.org/Journal/PaperInformation.aspx?PaperID=73743",
abstract = "With the challenge of quantum computing ahead, an
analysis of number and representation adequate to the
task is needed. Some clarifications on the
combinatorial nature of representation are presented
here; this is related to the foundations of digital
representations of integers, and is thus also of
interest in clarifying what numbers are and how they
are used in pure and applied mathematics. The author
hopes this work will help mathematicians and computer
scientists better understand the nature of the
Generalized Knapsack Code, a lattice-based code which
the author believes to be particularly promising, and
the use of number in computing in general.",
acknowledgement = ack-nhfb,
fjournal = "Open Journal of Discrete Mathematics",
journal-URL = "http://www.scirp.org/journal/OJDM/",
remark = "See press report \cite{Anonymous:2017:MBH}",
}
@Article{Harvey:2017:FPM,
author = "David Harvey and Joris {Van Der Hoeven} and
Gr{\'e}goire Lecerf",
title = "Faster Polynomial Multiplication over Finite Fields",
journal = j-J-ACM,
volume = "63",
number = "6",
pages = "52:1--52:??",
month = feb,
year = "2017",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/3005344",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
bibdate = "Mon Apr 3 09:29:49 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "Polynomials over finite fields play a central role in
algorithms for cryptography, error correcting codes,
and computer algebra. The complexity of multiplying
such polynomials is still a major open problem. Let $p$
be a prime, and let $ M_p(n)$ denote the bit complexity
of multiplying two polynomials in $ F_p[X]$ of degree
less than $n$. For $n$ large compared to $p$, we
establish the bound $ M_p(n) = O(n \log n {8^{\log
*}}^n \log p)$, where $ \log^* n = \{ \min k \epsilon N
: \log \ldots {}^k \times \ldots \log n \leq 1 \} $
stands for the iterated logarithm. This improves on the
previously best known bound $ M_p(n) = O(n \log n \log
\log n \log p)$, which essentially goes back to the
1970s.",
acknowledgement = ack-nhfb,
articleno = "52",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Hasan:2017:UAF,
author = "Ragib Hasan and Rasib Khan",
title = "Unified authentication factors and fuzzy service
access using interaction provenance",
journal = j-COMPUT-SECUR,
volume = "67",
number = "??",
pages = "211--231",
month = jun,
year = "2017",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404817300408",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{He:2017:AHA,
author = "Debiao He and Sherali Zeadally and Libing Wu and
Huaqun Wang",
title = "Analysis of handover authentication protocols for
mobile wireless networks using identity-based public
key cryptography",
journal = j-COMP-NET-AMSTERDAM,
volume = "128",
number = "??",
pages = "154--163",
day = "9",
month = dec,
year = "2017",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Oct 30 06:00:14 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128616304285",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{He:2017:APP,
author = "Jingsha He and Qi Xiao and Peng He and Muhammad Salman
Pathan",
title = "An Adaptive Privacy Protection Method for Smart Home
Environments Using Supervised Learning",
journal = j-FUTURE-INTERNET,
volume = "9",
number = "1",
pages = "7",
day = "05",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi9010007",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:56 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/9/1/7",
abstract = "In recent years, smart home technologies have started
to be widely used, bringing a great deal of convenience
to people's daily lives. At the same time, privacy
issues have become particularly prominent. Traditional
encryption methods can no longer meet the needs of
privacy protection in smart home applications, since
attacks can be launched even without the need for
access to the cipher. Rather, attacks can be
successfully realized through analyzing the frequency
of radio signals, as well as the timestamp series, so
that the daily activities of the residents in the smart
home can be learnt. Such types of attacks can achieve a
very high success rate, making them a great threat to
users' privacy. In this paper, we propose an adaptive
method based on sample data analysis and supervised
learning (SDASL), to hide the patterns of daily
routines of residents that would adapt to dynamically
changing network loads. Compared to some existing
solutions, our proposed method exhibits advantages such
as low energy consumption, low latency, strong
adaptability, and effective privacy protection.",
acknowledgement = ack-nhfb,
remark = "Special Issue Security and Privacy in Wireless and
Mobile Networks.",
}
@Article{Hellegren:2017:HCD,
author = "Z. Isadora Hellegren",
title = "A history of crypto-discourse: encryption as a site of
struggles to define {Internet} freedom",
journal = j-INTERNET-HIST,
volume = "1",
number = "4",
pages = "285--311",
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1080/24701475.2017.1387466",
ISSN = "2470-1483",
ISSN-L = "2470-1483",
bibdate = "Tue Aug 29 08:11:01 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/internet-hist.bib",
URL = "http://www.tandfonline.com/doi/full/10.1080/24701475.2017.1387466",
acknowledgement = ack-nhfb,
ajournal = "Internet Hist.",
fjournal = "Internet Histories",
journal-URL = "https://www.tandfonline.com/loi/rint20",
}
@Article{Hellman:2017:TLC,
author = "Martin E. Hellman",
title = "{Turing Lecture}: Cybersecurity, Nuclear Security,
{Alan Turing}, and Illogical Logic",
journal = j-CACM,
volume = "60",
number = "12",
pages = "52--59",
month = dec,
year = "2017",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed Nov 29 18:47:03 MST 2017",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://cacm.acm.org/magazines/2017/12/223042-cybersecurity-nuclear-security-alan-turing-and-illogical-logic",
abstract = "Cyber deterrence, like nuclear deterrence, depends on
our adversaries being rational enough to be deterred by
our threats but us not by theirs.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Hetzelt:2017:SAE,
author = "Felicitas Hetzelt and Robert Buhren",
title = "Security Analysis of Encrypted Virtual Machines",
journal = j-SIGPLAN,
volume = "52",
number = "7",
pages = "129--142",
month = jul,
year = "2017",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/3140607.3050763",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Sat Sep 16 10:18:17 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Cloud computing has become indispensable in today's
computer landscape. The flexibility it offers for
customers as well as for providers has become a crucial
factor for large parts of the computer industry.
Virtualization is the key technology that allows for
sharing of hardware resources among different
customers. The controlling software component, called
hypervisor, provides a virtualized view of the computer
resources and ensures separation of different guest
virtual machines. However, this important cornerstone
of cloud computing is not necessarily trustworthy or
bug-free. To mitigate this threat AMD introduced Secure
Encrypted Virtualization, short SEV, which
transparently encrypts a virtual machines memory. In
this paper we analyse to what extend the proposed
features can resist a malicious hypervisor and discuss
the tradeoffs imposed by additional protection
mechanisms. To do so, we developed a model of SEV's
security capabilities based on the available
documentation as actual silicon implementations are not
yet on the market. We found that the first proposed
version of SEV is not up to the task owing to three
design shortcomings. First the virtual machine control
block is not encrypted and handled directly by the
hypervisor, allowing it to bypass VM memory encryption
by executing conveniently chosen gadgets. Secondly, the
general purpose registers are not encrypted upon
vmexit, leaking potentially sensitive data. Finally,
the control over the nested pagetables allows a
malicious hypervisor to closely monitor the execution
state of a VM and attack it with memory replay
attacks.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "VEE '17 conference proceedings.",
}
@Article{Heys:2017:SCF,
author = "Howard M. Heys",
title = "Statistical Cipher Feedback of Stream Ciphers",
journal = j-COMP-J,
volume = "60",
number = "12",
pages = "1839--1851",
day = "1",
month = dec,
year = "2017",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxx068",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Jan 8 08:15:52 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/12/1839/3959607",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Homer:2017:RCS,
author = "Steve Homer",
title = "Review of {{\booktitle{Crypto School}} by Joachim von
zur Gathen}",
journal = j-SIGACT,
volume = "48",
number = "3",
pages = "10--13",
month = sep,
year = "2017",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/3138860.3138864",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Sat Sep 16 11:34:08 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Hu:2017:ATE,
author = "Jingwei Hu and Ray C. C. Cheung",
title = "Area-Time Efficient Computation of {Niederreiter}
Encryption on {QC-MDPC} Codes for Embedded Hardware",
journal = j-IEEE-TRANS-COMPUT,
volume = "66",
number = "8",
pages = "1313--1325",
month = "????",
year = "2017",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2017.2672984",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 13 14:57:15 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/document/7862221/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Huang:2017:BBC,
author = "Jianye Huang and Qiong Huang and Chunhua Pan",
title = "A Black-Box Construction of Strongly Unforgeable
Signature Scheme in the Leakage Setting",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "761--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400172",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Huang:2017:SSS,
author = "Kaibin Huang and Raylin Tso and Yu-Chi Chen",
title = "Somewhat semantic secure public key encryption with
filtered-equality-test in the standard model and its
extension to searchable encryption",
journal = j-J-COMP-SYS-SCI,
volume = "89",
number = "??",
pages = "400--409",
month = nov,
year = "2017",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2017.06.001",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:37 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000017300831",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Misc{Hulsing:2017:XEH,
author = "A. H{\"u}lsing and D. Butin and S. Gazdag and J.
Rijneveld and A. Mohaisen",
title = "{XMSS}: Extended Hash-Based Signatures",
howpublished = "Web document",
day = "24",
month = jul,
year = "2017",
bibdate = "Thu Aug 31 16:12:38 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://datatracker.ietf.org/doc/draft-irtf-cfrg-xmss-hash-based-signature",
acknowledgement = ack-nhfb,
}
@Article{Hyla:2017:HLS,
author = "Tomasz Hyla and Jerzy Peja{\'s}",
title = "A {Hess}-Like Signature Scheme Based on Implicit and
Explicit Certificates",
journal = j-COMP-J,
volume = "60",
number = "4",
pages = "457--475",
day = "23",
month = mar,
year = "2017",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/4/457/2608054",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{I:2017:ETB,
author = "Indu I. and Rubesh Anand P. M. and Vidhyacharan
Bhaskar",
title = "Encrypted token based authentication with adapted
{SAML} technology for cloud web services",
journal = j-J-NETW-COMPUT-APPL,
volume = "99",
number = "??",
pages = "131--145",
day = "1",
month = dec,
year = "2017",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Fri Jan 12 10:10:23 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517303156",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Irshad:2017:CPP,
author = "Azeem Irshad and Shehzad Ashraf Chaudhry",
title = "Comments on {``A privacy preserving three-factor
authentication protocol for e-health clouds''}",
journal = j-J-SUPERCOMPUTING,
volume = "73",
number = "4",
pages = "1504--1508",
month = apr,
year = "2017",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1837-1",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jun 24 10:31:33 MDT 2017",
bibsource = "http://link.springer.com/journal/11227/73/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
note = "See \cite{Jiang:2016:PPT}.",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Jalili:2017:EAS,
author = "Majid Jalili and Hamid Sarbazi-Azad",
title = "Endurance-Aware Security Enhancement in Non-Volatile
Memories Using Compression and Selective Encryption",
journal = j-IEEE-TRANS-COMPUT,
volume = "66",
number = "7",
pages = "1132--1144",
month = jul,
year = "2017",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2642180",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jun 8 10:22:00 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://www.computer.org/csdl/trans/tc/2017/07/07792116-abs.html",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Jan:2017:PPB,
author = "Mian Jan and Priyadarsi Nanda and Muhammad Usman and
Xiangjian He",
title = "{PAWN}: a payload-based mutual authentication scheme
for wireless sensor networks",
journal = j-CCPE,
volume = "29",
number = "17",
pages = "",
day = "10",
month = sep,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3986",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Sep 4 17:02:00 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Jevdjic:2017:ASC,
author = "Djordje Jevdjic and Karin Strauss and Luis Ceze and
Henrique S. Malvar",
title = "Approximate Storage of Compressed and Encrypted
Videos",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "361--373",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037718",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The popularization of video capture devices has
created strong storage demand for encoded videos.
Approximate storage can ease this demand by enabling
denser storage at the expense of occasional errors.
Unfortunately, even minor storage errors, such as bit
flips, can result in major visual damage in encoded
videos. Similarly, video encryption, widely employed
for privacy and digital rights management, may create
long dependencies between bits that show little or no
tolerance to storage errors. In this paper we propose
VideoApp, a novel and efficient methodology to compute
bit-level reliability requirements for encoded videos
by tracking visual and metadata dependencies within
encoded bitstreams. We further show how VideoApp can be
used to trade video quality for storage density in an
optimal way. We integrate our methodology into a
popular H.264 encoder to partition an encoded video
stream into multiple streams that can receive different
levels of error correction according to their
reliability needs. When applied to a dense and highly
error-prone multi-level cell storage substrate, our
variable error correction mechanism reduces the error
correction overhead by half under the most
error-intolerant encoder settings, achieving
quality/density points that neither compression nor
approximation can achieve alone. Finally, we define the
basic invariants needed to support encrypted
approximate video storage. We present an analysis of
block cipher modes of operation, showing that some are
fully compatible with approximation, enabling
approximate and secure video storage systems.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jiang:2017:BMA,
author = "Shaoquan Jiang",
title = "Bounds for Message Authentication with Distortion",
journal = j-COMP-J,
volume = "60",
number = "4",
pages = "497--506",
day = "23",
month = mar,
year = "2017",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/4/497/2608061",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Jiang:2017:SLD,
author = "Wei Jiang and Liang Wen and Ke Jiang and Xia Zhang and
Xiong Pan and Keran Zhou",
title = "System-Level Design to Detect Fault Injection Attacks
on Embedded Real-Time Applications",
journal = j-JETC,
volume = "13",
number = "2",
pages = "22:1--22:??",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2967611",
ISSN = "1550-4832",
bibdate = "Sat Apr 8 10:16:07 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jetc.bib",
abstract = "Fault injection attack has been a serious threat to
security-critical embedded systems for a long time, yet
existing research ignores addressing of the problem
from a system-level perspective. This article presents
an approach to the synthesis of secure real-time
applications mapped on distributed embedded systems,
which focuses on preventing fault injection attacks of
the security protection on processing units. We utilize
symmetric cryptographic service to protect
confidentiality and deploy fault detection within a
confidential algorithm to resist fault injection
attacks. Several fault detection schemes are
identified, and their fault coverage rates and time
overheads are derived and measured. Our synthesis
approach makes efforts to determine the best fault
detection schemes for the encryption/decryption of
messages such that the overall security strength of
detecting a fault injection attack is maximized and the
deadline constraint of the real-time applications is
guaranteed. Due to the complexity of the problem, we
propose an efficient algorithm based on the fruit fly
optimization algorithm, and we compare it to the
simulated annealing approach. Extensive experiments and
a real-life application evaluation demonstrate the
superiority of our approach.",
acknowledgement = ack-nhfb,
articleno = "22",
fjournal = "ACM Journal on Emerging Technologies in Computing
Systems (JETC)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J967",
}
@Article{Judmayer:2017:BCI,
author = "Aljosha Judmayer and Nicholas Stifter and Katharina
Krombholz and Edgar Weippl and Elisa Bertino and Ravi
Sandhu",
title = "Blocks and Chains: Introduction to {Bitcoin},
Cryptocurrencies, and Their Consensus Mechanisms",
journal = "Synthesis Lectures on Information Security, Privacy,
and Trust",
volume = "9",
number = "1",
pages = "1--123",
month = jun,
year = "2017",
DOI = "https://doi.org/10.2200/S00773ED1V01Y201704SPT020",
ISBN = "1-62705-713-7",
ISBN-13 = "978-1-62705-713-4",
ISSN = "1945-9742 (print), 1945-9750 (electronic)",
ISSN-L = "1945-9742",
bibdate = "Thu Nov 30 15:24:52 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7987472",
acknowledgement = ack-nhfb,
keywords = "Bitcoin; block; blockchain; chain; consensus ledger;
cryptographic currency; Nakamoto consensus;
Proof-of-Work",
}
@Article{Kandi:2017:ELC,
author = "Haribabu Kandi and Deepak Mishra and Subrahmanyam R.
K. Sai Gorthi",
title = "Exploring the learning capabilities of convolutional
neural networks for robust image watermarking",
journal = j-COMPUT-SECUR,
volume = "65",
number = "??",
pages = "247--268",
month = mar,
year = "2017",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:48 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404816301699",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Kawachi:2017:GCR,
author = "Akinori Kawachi and Yoshio Okamoto and Keisuke Tanaka
and Kenji Yasunaga",
title = "General Constructions of Rational Secret Sharing with
Expected Constant-Round Reconstruction",
journal = j-COMP-J,
volume = "60",
number = "5",
pages = "711--728",
day = "1",
month = apr,
year = "2017",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:43 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/5/711/2715224",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Khan:2017:TPK,
author = "Suleman Khan and Muhammad Shiraz and Laleh Boroumand
and Abdullah Gani and Muhammad Khurram Khan",
title = "Towards port-knocking authentication methods for
mobile cloud computing",
journal = j-J-NETW-COMPUT-APPL,
volume = "97",
number = "??",
pages = "66--78",
day = "1",
month = nov,
year = "2017",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sun Oct 1 12:23:21 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517302813",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Khazaei:2017:COA,
author = "Shahram Khazaei and Siavash Ahmadi",
title = "Ciphertext-only attack on $ d \times d $ {Hill} in {$
O(d 13^d) $}",
journal = j-INFO-PROC-LETT,
volume = "118",
number = "??",
pages = "25--29",
month = feb,
year = "2017",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Nov 22 15:19:12 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019016301338",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Kiayias:2017:EEV,
author = "Aggelos Kiayias and Thomas Zacharias and Bingsheng
Zhang",
title = "An Efficient {E2E} Verifiable {E}-voting System
without Setup Assumptions",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "3",
pages = "14--23",
month = may # "\slash " # jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2017.71",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Jul 25 21:35:08 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/03/msp2017030014-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "https://publications.computer.org/security-and-privacy/",
}
@Article{Kiljan:2017:SAC,
author = "Sven Kiljan and Koen Simoens and Danny {De Cock} and
Marko {Van Eekelen} and Harald Vranken",
title = "A Survey of Authentication and Communications Security
in Online Banking",
journal = j-COMP-SURV,
volume = "49",
number = "4",
pages = "61:1--61:??",
month = feb,
year = "2017",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3002170",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Feb 9 09:18:20 MST 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "A survey was conducted to provide a state of the art
of online banking authentication and communications
security implementations. Between global regions the
applied (single or multifactor) authentication schemes
differ greatly, as well as the security of SSL/TLS
implementations. Three phases for online banking
development are identified. It is predicted that mobile
banking will enter a third phase, characterized by the
use of standard web technologies to develop mobile
banking applications for different platforms. This has
the potential to make mobile banking a target for
attacks in a similar manner that home banking currently
is.",
acknowledgement = ack-nhfb,
articleno = "61",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Kleinrouweler:2017:SAP,
author = "Jan Willem Kleinrouweler and Sergio Cabrero and Pablo
Cesar",
title = "An {SDN} Architecture for Privacy-Friendly
Network-Assisted {DASH}",
journal = j-TOMM,
volume = "13",
number = "3s",
pages = "44:1--44:??",
month = aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3092838",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Sat Dec 23 10:49:22 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Dynamic Adaptive Streaming over HTTP (DASH) is the
premier technology for Internet video streaming. DASH
efficiently uses existing HTTP-based delivery
infrastructures implementing adaptive streaming.
However, DASH traffic is bursty in nature. This causes
performance problems when DASH players share a network
connection or in networks with heavy background
traffic. The result is unstable and lower quality
video. In this article, we present the design and
implementation of a so-called DASH Assisting Network
Element (DANE). Our system provides target bitrate
signaling and dynamic traffic control. These two
mechanisms realize proper bandwidth sharing among
clients. Our system is privacy friendly and fully
supports encrypted video streams. Trying to improve the
streaming experience for users who share a network
connection, our system increases the video bitrate and
reduces the number of quality switches. We show this
through evaluations in our Wi-Fi testbed.",
acknowledgement = ack-nhfb,
articleno = "44",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Knijnenburg:2017:PCE,
author = "Bart P. Knijnenburg",
title = "Privacy? {I} Can't Even! {Making} a Case for
User-Tailored Privacy",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "4",
pages = "62--67",
month = jul # "\slash " # aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2017.3151331",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Aug 29 06:15:10 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/04/msp2017040062-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "https://publications.computer.org/security-and-privacy/",
}
@Article{Kolman:2017:SCG,
author = "Eyal Kolman and Benny Pinkas",
title = "Securely Computing a Ground Speed Model",
journal = j-TIST,
volume = "8",
number = "4",
pages = "54:1--54:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2998550",
ISSN = "2157-6904 (print), 2157-6912 (electronic)",
ISSN-L = "2157-6904",
bibdate = "Sat Dec 23 10:12:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tist.bib",
abstract = "Consider a server offering risk assessment services
and potential clients of these services. The risk
assessment model that is run by the server is based on
current and historical data of the clients. However,
the clients might prefer not sharing such sensitive
data with external parties such as the server, and the
server might consider the possession of this data as a
liability rather than an asset. Secure multi-party
computation (MPC) enables one, in principle, to compute
any function while hiding the inputs to the function,
and would thus enable the computation of the risk
assessment model while hiding the client's data from
the server. However, a direct application of a generic
MPC solution to this problem is rather inefficient due
to the large scale of the data and the complexity of
the function. We examine a specific case of risk
assessment-the ground speed model. In this model, the
geographical locations of successive
user-authentication attempts are compared, and a
warning flag is raised if the physical speed required
to move between these locations is greater than some
threshold, and some other conditions, such as
authentication from two related networks, do not hold.
We describe a very efficient secure computation
solution that is tailored for this problem. This
solution demonstrates that a risk model can be applied
over encrypted data with sufficient efficiency to fit
the requirements of commercial systems.",
acknowledgement = ack-nhfb,
articleno = "54",
fjournal = "ACM Transactions on Intelligent Systems and Technology
(TIST)",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1318",
}
@Article{Kornycky:2017:RFT,
author = "Joe Kornycky and Omar Abdul-Hameed and Ahmet Kondoz
and Brian C. Barber",
title = "Radio Frequency Traffic Classification Over {WLAN}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "56--68",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2562259",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network traffic classification is the process of
analyzing traffic flows and associating them to
different categories of network applications. Network
traffic classification represents an essential task in
the whole chain of network security. Some of the most
important and widely spread applications of traffic
classification are the ability to classify encrypted
traffic, the identification of malicious traffic flows,
and the enforcement of security policies on the use of
different applications. Passively monitoring a network
utilizing low-cost and low-complexity wireless local
area network WLAN devices is desirable. Mobile devices
can be used or existing office desktops can be
temporarily utilized when their computational load is
low. This reduces the burden on existing network
hardware. The aim of this paper is to investigate
traffic classification techniques for wireless
communications. To aid with intrusion detection, the
key goal is to passively monitor and classify different
traffic types over WLAN to ensure that network security
policies are adhered to. The classification of
encrypted WLAN data poses some unique challenges not
normally encountered in wired traffic. WLAN traffic is
analyzed for features that are then used as an input to
six different machine learning ML algorithms for
traffic classification. One of these algorithms a
Gaussian mixture model incorporating a universal
background model has not been applied to wired or
wireless network classification before. The authors
also propose a ML algorithm that makes use of the
well-known vector quantization algorithm in conjunction
with a decision tree --- referred to as a TRee Adaptive
Parallel Vector Quantiser. This algorithm has a number
of advantages over the other ML algorithms tested and
is suited to wireless traffic classification. An
average F-score harmonic mean of precision and recall $
> 0.84 $ was achieved when training and testing on the
same day across six distinct traffic types.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Kumar:2017:TAU,
author = "Vireshwar Kumar and Jung-Min (Jerry) Park and Kaigui
Bian",
title = "Transmitter authentication using hierarchical
modulation in dynamic spectrum sharing",
journal = j-J-NETW-COMPUT-APPL,
volume = "91",
number = "??",
pages = "52--60",
day = "1",
month = aug,
year = "2017",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sat Jul 29 15:40:55 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517301935",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Kumari:2017:DPS,
author = "Saru Kumari and Xiong Li and Fan Wu and Ashok Kumar
Das and Kim-Kwang Raymond Choo and Jian Shen",
title = "Design of a provably secure biometrics-based
multi-cloud-server authentication scheme",
journal = j-FUT-GEN-COMP-SYS,
volume = "68",
number = "??",
pages = "320--330",
month = mar,
year = "2017",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Dec 10 08:32:13 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16303776",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Kumari:2017:DSU,
author = "Saru Kumari and Ashok Kumar Das and Mohammad Wazid and
Xiong Li and Fan Wu and Kim-Kwang Raymond Choo and
Muhammad Khurram Khan",
title = "On the design of a secure user authentication and key
agreement scheme for wireless sensor networks",
journal = j-CCPE,
volume = "29",
number = "23",
pages = "??--??",
day = "10",
month = dec,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3930",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Dec 30 09:11:59 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Lai:2017:FPP,
author = "Jianchang Lai and Yi Mu and Fuchun Guo and Rongmao
Chen",
title = "Fully Privacy-Preserving {ID}-Based Broadcast
Encryption with Authorization",
journal = j-COMP-J,
volume = "60",
number = "12",
pages = "1809--1821",
day = "1",
month = dec,
year = "2017",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxx060",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Jan 8 08:15:52 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/12/1809/3861972",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Book{Landau:2017:LCI,
author = "Susan Landau",
title = "Listening in: Cybersecurity in an insecure age",
publisher = pub-YALE,
address = pub-YALE:adr,
pages = "xiv + 221",
year = "2017",
ISBN = "0-300-22744-2 (hardcover)",
ISBN-13 = "978-0-300-22744-4 (hardcover)",
LCCN = "K3264.C65 L38 2017?",
bibdate = "Tue Jan 16 06:51:51 MST 2018",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
subject = "Data encryption (Computer science); Law and
legislation; Computer networks; Security measures;
Government policy; Computer security; Government
policy; Computer security; Law and legislation",
tableofcontents = "Racing into the digital revolution \\
We're all connected now \\
How do we protect ourselves? \\
Investigation in the age of encryption \\
There's no turning back",
}
@Article{Lauter:2017:POL,
author = "Kristin Lauter",
title = "Postquantum Opportunities: Lattices, Homomorphic
Encryption, and Supersingular Isogeny Graphs",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "4",
pages = "22--27",
month = jul # "\slash " # aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2017.3151338",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Aug 29 06:15:10 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/04/msp2017040022-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Laxmi:2017:GGS,
author = "B. Prathusha Laxmi and A. Chilambuchelvan",
title = "{GSR}: {Geographic Secured Routing} using {SHA-3}
algorithm for node and message authentication in
wireless sensor networks",
journal = j-FUT-GEN-COMP-SYS,
volume = "76",
number = "??",
pages = "98--105",
month = nov,
year = "2017",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Jul 28 15:45:46 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1730986X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Lee:2017:FFE,
author = "Junghee Lee and Kalidas Ganesh and Hyuk-Jun Lee and
Youngjae Kim",
title = "{FESSD}: A Fast Encrypted {SSD} Employing On-Chip
Access-Control Memory",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "16",
number = "2",
pages = "115--118",
month = jul # "\slash " # dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2017.2667639",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Cryptography is one of the most popular methods for
protecting data stored in storage devices such as
solid-state drives (SSDs). To maintain integrity of
data, one of the popular techniques is that all
incoming data are encrypted before they are stored,
however, in this technique, the encryption overhead is
non-negligible and it can increase I/O service time. In
order to mitigate the negative performance impact
caused by the data encryption, a write buffer can be
used to hide the long latency by encryption. Using the
write buffer, incoming unencrypted data can be
immediately returned as soon as they are written in the
buffer. They will get encrypted and synchronized with
flash memory. However, if the write buffer itself is
not encrypted, unencrypted secret data might leak
through this insecure write buffer. On the other hand,
if the entire write buffer is fully encrypted, it
incurs significant performance overhead. To address
this problem, we propose an on-chip access control
memory (ACM) and presents a fast encrypted SSD, called
FESSD that implements a secure write buffering
mechanism using the ACM. The ACM does not require a
memory-level full encryption mechanism, thus not only
solving the unencrypted data leaking problem, but also
offering relatively fast I/O service. Our simulation
results show that the I/O response time of FESSD can be
improved by up to 56 percent over a baseline where
encrypted data are stored in the normal write buffer.",
acknowledgement = ack-nhfb,
affiliation = "Lee, J (Reprint Author), Univ Texas San Antonio, San
Antonio, TX 78249 USA. Lee, Junghee; Ganesh, Kalidas,
Univ Texas San Antonio, San Antonio, TX 78249 USA. Lee,
Hyuk-Jun; Kim, Youngjae, Sogang Univ, Seoul 121742,
South Korea.",
author-email = "junghee.lee@my.utsa.edu dyk567@my.utsa.edu
hyukjunl@sogang.ac.kr youkim@sogang.ac.kr",
da = "2019-06-20",
doc-delivery-number = "FR2AX",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "National Research Foundation of Korea (NRF)
--- Korea Government (MISP) [2015R1C1A1A0152105]",
funding-text = "This work was supported by the National Research
Foundation of Korea (NRF) grant funded by the Korea
Government (MISP) (No. 2015R1C1A1A0152105). This
research also used resources of The University of Texas
at San Antonio, San Antonio, TX. Youngjae Kim is the
corresponding author.",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "encryption; on-chip memory; security; Solid-state
drive (SSD)",
keywords-plus = "SECURITY",
number-of-cited-references = "11",
research-areas = "Computer Science",
times-cited = "0",
unique-id = "Lee:2017:FFE",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Lee:2017:SUE,
author = "Kwangsu Lee and Seung Geol Choi and Dong Hoon Lee and
Jong Hwan Park and Moti Yung",
title = "Self-updatable encryption: Time constrained access
control with hidden attributes and better efficiency",
journal = j-THEOR-COMP-SCI,
volume = "667",
number = "??",
pages = "51--92",
day = "8",
month = mar,
year = "2017",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Feb 15 08:03:13 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397516307551",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Lesi:2017:SAS,
author = "Vuk Lesi and Ilija Jovanov and Miroslav Pajic",
title = "Security-Aware Scheduling of Embedded Control Tasks",
journal = j-TECS,
volume = "16",
number = "5s",
pages = "188:1--188:??",
month = oct,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3126518",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:33 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "In this work, we focus on securing cyber-physical
systems (CPS) in the presence of network-based attacks,
such as Man-in-the-Middle (MitM) attacks, where a
stealthy attacker is able to compromise communication
between system sensors and controllers. Standard
methods for this type of attacks rely on the use of
cryptographic mechanisms, such as Message
Authentication Codes (MACs) to ensure data integrity.
However, this approach incurs significant computation
overhead, limiting its use in resource constrained
systems. Consequently, we consider the problem of
scheduling multiple control tasks on a shared processor
while providing a suitable level of security
guarantees. Specifically, by security guarantees we
refer to control performance, i.e., Quality-of-Control
(QoC), in the presence of attacks. We start by mapping
requirements for QoC under attack into constraints for
security-aware control tasks that, besides standard
control operations, intermittently perform data
authentication. This allows for the analysis of the
impact that security-related computation overhead has
on both schedulability of control tasks and QoC.
Building on this analysis, we introduce a mixed-integer
linear programming-based technique to obtain a
schedulable task set with predefined QoC requirements.
Also, to facilitate optimal resource allocation, we
provide a method to analyze interplay between available
computational resources and the overall QoC under
attack, and show how to obtain a schedulable task set
that maximizes the overall QoC guarantees. Finally, we
prove usability of our approach on a case study with
multiple automotive control components.",
acknowledgement = ack-nhfb,
articleno = "188",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Li:2017:AMA,
author = "Xiong Li and Maged Hamada Ibrahim and Saru Kumari and
Arun Kumar Sangaiah and Vidushi Gupta and Kim-Kwang
Raymond Choo",
title = "Anonymous mutual authentication and key agreement
scheme for wearable sensors in wireless body area
networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "129 (part 2)",
number = "??",
pages = "429--443",
day = "24",
month = dec,
year = "2017",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Dec 2 06:34:55 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128617301044",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Li:2017:CBS,
author = "Qi Li and Patrick P. C. Lee and Peng Zhang and Purui
Su and Liang He and Kui Ren and Qi Li and Patrick P. C.
Lee and Peng Zhang and Purui Su and Liang He and Kui
Ren",
title = "Capability-Based Security Enforcement in Named Data
Networking",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "5",
pages = "2719--2730",
month = oct,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2715822",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jan 12 17:57:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Named data networking NDN enhances traditional IP
networking by supporting in-network content caching for
better bandwidth usage and location-independent data
accesses for multi-path forwarding. However, NDN also
brings new security challenges. For example, an
adversary can arbitrarily inject packets to NDN to
poison content cache, or access content packets without
any restrictions. We propose capability-based security
enforcement architecture CSEA, a capability-based
security enforcement architecture that enables data
authenticity in NDN in a distributed manner. CSEA
leverages capabilities to specify the access rights of
forwarded packets. It allows NDN routers to verify the
authenticity of forwarded packets, and throttles
flooding-based DoS attacks from unsolicited packets. We
further develop a lightweight one-time signature scheme
for CSEA to ensure the timeliness of packets and
support efficient verification. We prototype CSEA on
the open-source CCNx platform, and evaluate CSEA via
testbed and Planetlab experiments. Our experimental
results show that CSEA only incurs around 4\% of
additional delays in retrieving data packets.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Li:2017:CCD,
author = "Tong Li and Zheli Liu and Jin Li and Chunfu Jia and
Kuan-Ching Li",
title = "{CDPS}: A cryptographic data publishing system",
journal = j-J-COMP-SYS-SCI,
volume = "89",
number = "??",
pages = "80--91",
month = nov,
year = "2017",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2016.12.004",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:37 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000016301313",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Li:2017:CCF,
author = "Jenny S. Li and Li-Chiou Chen and John V. Monaco and
Pranjal Singh and Charles C. Tappert",
title = "A comparison of classifiers and features for
authorship authentication of social networking
messages",
journal = j-CCPE,
volume = "29",
number = "14",
pages = "",
day = "25",
month = jul,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3918",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Jul 24 08:22:38 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Li:2017:CIS,
author = "Chengqing Li and Dongdong Lin and Jinhu Lu",
title = "Cryptanalyzing an Image-Scrambling Encryption
Algorithm of Pixel Bits",
journal = j-IEEE-MULTIMEDIA,
volume = "24",
number = "3",
pages = "64--71",
month = jul # "\slash " # sep,
year = "2017",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2017.3051512",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Mon Jan 15 08:09:13 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
URL = "https://www.computer.org/csdl/mags/mu/2017/03/mmu2017030064-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/multimedia/",
}
@Article{Li:2017:ESD,
author = "Fagen Li and Bo Liu and Jiaojiao Hong",
title = "An efficient signcryption for data access control in
cloud computing",
journal = j-COMPUTING,
volume = "99",
number = "5",
pages = "465--479",
month = may,
year = "2017",
CODEN = "CMPTA2",
DOI = "https://doi.org/10.1007/s00607-017-0548-7",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
bibdate = "Fri Feb 9 14:54:08 MST 2018",
bibsource = "http://link.springer.com/journal/607/99/5;
https://www.math.utah.edu/pub/tex/bib/computing.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computing",
journal-URL = "http://link.springer.com/journal/607",
}
@Article{Li:2017:MMA,
author = "Rongjia Li and Chenhui Jin",
title = "Meet-in-the-Middle Attack on $ 11$-Round {$3$D} Block
Cipher",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "1",
pages = "",
month = jan,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500022",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 4 14:39:43 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2017:PCL,
author = "Cong Li and Yuejian Fang and Xing Zhang and Cancan Jin
and Qingni Shen and Zhonghai Wu",
title = "A practical construction for large universe
hierarchical attribute-based encryption",
journal = j-CCPE,
volume = "29",
number = "17",
pages = "",
day = "10",
month = sep,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3957",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Sep 4 17:02:00 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Li:2017:RNF,
author = "Yang Li and Mengting Chen and Zhe Liu and Jian Wang",
title = "Reduction in the Number of Fault Injections for Blind
Fault Attack on {SPN} Block Ciphers",
journal = j-TECS,
volume = "16",
number = "2",
pages = "55:1--55:??",
month = apr,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3014583",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Jul 24 09:51:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "In 2014, a new fault analysis called blind fault
attack (BFA) was proposed, in which attackers can only
obtain the number of different faulty outputs without
knowing the public data. The original BFA requires
480,000 fault injections to recover a 128-bit AES key.
This work attempts to reduce the number of fault
injections under the same attack assumptions. We
analyze BFA from an information theoretical perspective
and introduce a new probability-based distinguisher.
Three approaches are proposed for different attack
scenarios. The best one realized a 66.8\% reduction of
the number of fault injections on AES.",
acknowledgement = ack-nhfb,
articleno = "55",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Li:2017:SQS,
author = "Songbin Li and Yizhen Jia and C.-C. Jay Kuo",
title = "Steganalysis of {QIM} Steganography in Low-Bit-Rate
Speech Signals",
journal = j-IEEE-ACM-TASLP,
volume = "25",
number = "5",
pages = "1011--1022",
month = "????",
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/TASLP.2017.2676356",
ISSN = "2329-9290",
ISSN-L = "2329-9290",
bibdate = "Sat Jan 20 08:35:30 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeeacmtaslp.bib",
URL = "http://ieeexplore.ieee.org/document/7867798/",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6570655",
}
@Article{Lin:2017:ESF,
author = "Xi-Jun Lin and Lin Sun and Haipeng Qu and Xiaoshuai
Zhang",
title = "Editorial: On the Security of the First Leakage-Free
Certificateless Signcryption Scheme",
journal = j-COMP-J,
volume = "60",
number = "4",
pages = "491--496",
day = "23",
month = mar,
year = "2017",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/4/491/2608059",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Liskiewicz:2017:SLS,
author = "Maciej Li{\'s}kiewicz and R{\"u}diger Reischuk and
Ulrich W{\"o}lfel",
title = "Security levels in steganography --- Insecurity does
not imply detectability",
journal = j-THEOR-COMP-SCI,
volume = "692",
number = "??",
pages = "25--45",
day = "5",
month = sep,
year = "2017",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Aug 25 14:03:28 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397517305194",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Liu:2017:ECC,
author = "Z. Liu and J. Gro{\ss}sch{\"a}dl and Z. Hu and K.
J{\"a}rvinen and H. Wang and I. Verbauwhede",
title = "Elliptic Curve Cryptography with Efficiently
Computable Endomorphisms and Its Hardware
Implementations for the {Internet of Things}",
journal = j-IEEE-TRANS-COMPUT,
volume = "66",
number = "5",
pages = "773--785",
month = may,
year = "2017",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2623609",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Apr 6 07:46:06 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "elliptic curve cryptography; Internet-of-Things;
multiple-precision arithmetic; signature verification;
VLSI designs",
}
@Article{Liu:2017:EEC,
author = "Zhe Liu and Jian Weng and Zhi Hu and Hwajeong Seo",
title = "Efficient Elliptic Curve Cryptography for Embedded
Devices",
journal = j-TECS,
volume = "16",
number = "2",
pages = "53:1--53:??",
month = apr,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2967103",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Jul 24 09:51:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Many resource-constrained embedded devices, such as
wireless sensor nodes, require public key encryption or
a digital signature, which has induced plenty of
research on efficient and secure implementation of
elliptic curve cryptography (ECC) on 8-bit processors.
In this work, we study the suitability of a special
class of finite fields, called optimal prime fields
(OPFs), for a ``lightweight'' ECC implementation with a
view toward high performance and security. First, we
introduce a highly optimized arithmetic library for
OPFs that includes two implementations for each finite
field arithmetic operation, namely a
performance-optimized version and a security-optimized
variant. The latter is resistant against simple power
analysis attacks in the sense that it always executes
the same sequence of instructions, independent of the
operands. Based on this OPF library, we then describe a
performance-optimized and a security-optimized
implementation of scalar multiplication on the elliptic
curve over OPFs at several security levels. The former
uses the Gallant-Lambert-Vanstone method on twisted
Edwards curves and reaches an execution time of 3.14M
cycles (over a 160-bit OPF) on an 8-bit ATmega128
processor, whereas the latter is based on a Montgomery
curve and executes in 5.53M cycles.",
acknowledgement = ack-nhfb,
articleno = "53",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Liu:2017:ESS,
author = "Chang Liu and Liehuang Zhu and Jinjun Chen",
title = "Efficient searchable symmetric encryption for storing
multiple source dynamic social data on cloud",
journal = j-J-NETW-COMPUT-APPL,
volume = "86",
number = "??",
pages = "3--14",
day = "15",
month = may,
year = "2017",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sat Jul 29 15:40:53 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S108480451630217X",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Liu:2017:GAU,
author = "Can Liu and Gradeigh D. Clark and Janne Lindqvist",
title = "Guessing Attacks on User-Generated Gesture Passwords",
journal = j-IMWUT,
volume = "1",
number = "1",
pages = "3:1--3:24",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3053331",
ISSN = "2474-9567",
ISSN-L = "2474-9567",
bibdate = "Fri Jun 16 10:24:00 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://dl.acm.org/citation.cfm?id=3053331",
abstract = "Touchscreens, the dominant input type for mobile
phones, require unique authentication solutions.
Gesture passwords have been proposed as an alternative
ubiquitous authentication technique. Prior security
analysis has relied on inconsistent measurements such
as mutual information or shoulder surfing attacks.We
present the first approach for measuring the security
of gestures with guessing attacks that model real-world
attacker behavior. Our major contributions are: (1) a
comprehensive analysis of the weak subspace for gesture
passwords, (2) a method for enumerating the size of the
full theoretical gesture password space, (3) a design
of a novel guessing attack against user-chosen gestures
using a dictionary, and (4) a brute-force attack used
for benchmarking the performance of the guessing
attack. Our dictionary attack, tested on newly
collected user data, achieves a cracking rate of
47.71\% after two weeks of computation using 109
guesses. This is a difference of 35.78 percentage
points compared to the 11.93\% cracking rate of the
brute-force attack. In conclusion, users are not taking
full advantage of the large theoretical password space
and instead choose their gesture passwords from weak
subspaces. We urge for further work on addressing this
challenge.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1566",
}
@Article{Liu:2017:HPI,
author = "Zhe Liu and Thomas P{\"o}ppelmann and Tobias Oder and
Hwajeong Seo and Sujoy Sinha Roy and Tim G{\"u}neysu
and Johann Gro{\ss}sch{\"a}dl and Howon Kim and Ingrid
Verbauwhede",
title = "High-Performance Ideal Lattice-Based Cryptography on
$8$-Bit {AVR} Microcontrollers",
journal = j-TECS,
volume = "16",
number = "4",
pages = "117:1--117:??",
month = aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3092951",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Aug 14 18:53:33 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Over recent years lattice-based cryptography has
received much attention due to versatile average-case
problems like Ring-LWE or Ring-SIS that appear to be
intractable by quantum computers. In this work, we
evaluate and compare implementations of Ring-LWE
encryption and the bimodal lattice signature scheme
(BLISS) on an 8-bit Atmel ATxmega128 microcontroller.
Our implementation of Ring-LWE encryption provides
comprehensive protection against timing side-channels
and takes 24.9ms for encryption and 6.7ms for
decryption. To compute a BLISS signature, our software
takes 317ms and 86ms for verification. These results
underline the feasibility of lattice-based cryptography
on constrained devices.",
acknowledgement = ack-nhfb,
articleno = "117",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Liu:2017:OOA,
author = "Zechao Liu and Zoe L. Jiang and Xuan Wang and Xinyi
Huang and S. M. Yiu and Kunihiko Sadakane",
title = "Offline\slash online attribute-based encryption with
verifiable outsourced decryption",
journal = j-CCPE,
volume = "29",
number = "7",
pages = "??--??",
day = "10",
month = apr,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3915",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Fri Mar 31 19:12:52 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Liu:2017:SRG,
author = "Jing Liu and Yunyun Wu and Xuezheng Liu and Yunchun
Zhang and Gang Xue and Wei Zhou and Shaowen Yao",
title = "On the (In)Security of Recent Group Key Distribution
Protocols",
journal = j-COMP-J,
volume = "60",
number = "4",
pages = "507--526",
day = "23",
month = mar,
year = "2017",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw061",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/4/507/2608062",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Lopez-Alt:2017:MFH,
author = "Adriana L{\'o}pez-Alt and Eran Tromer and Vinod
Vaikuntanathan",
title = "Multikey Fully Homomorphic Encryption and
Applications",
journal = j-SIAM-J-COMPUT,
volume = "46",
number = "6",
pages = "1827--1892",
month = "????",
year = "2017",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/14100124X",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Wed Oct 9 17:50:42 MDT 2019",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/46/6;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 2017",
}
@Article{Ma:2017:AEJ,
author = "Sha Ma",
title = "Authorized Equi-join for Multiple Data Contributors in
the {PKC}-Based Setting",
journal = j-COMP-J,
volume = "60",
number = "12",
pages = "1822--1838",
day = "1",
month = dec,
year = "2017",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxx061",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Jan 8 08:15:52 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/12/1822/3861973",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Ma:2017:LBI,
author = "Chunguang Ma and Juyan Li and Weiping Ouyang",
title = "Lattice-Based Identity-Based Homomorphic Conditional
Proxy Re-Encryption for Secure Big Data Computing in
Cloud Environment",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "645--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400111",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Macedo:2017:SSP,
author = "Ricardo Macedo and Leonardo Melniski and Aldri Santos
and Yacine Ghamri-Doudane and Michele Nogueira",
title = "{SPARTA}: a survival performance degradation framework
for identity federations",
journal = j-COMP-NET-AMSTERDAM,
volume = "121",
number = "??",
pages = "37--52",
day = "5",
month = jul,
year = "2017",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Thu Jul 20 08:30:08 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128617301524",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Maitin-Shepard:2017:ECM,
author = "Jeremy Maitin-Shepard and Mehdi Tibouchi and Diego F.
Aranha",
title = "Elliptic Curve Multiset Hash",
journal = j-COMP-J,
volume = "60",
number = "4",
pages = "476--490",
day = "23",
month = mar,
year = "2017",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "https://academic.oup.com/comjnl/article/60/4/476/2608055",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Maitra:2017:DFA,
author = "Subhamoy Maitra and Akhilesh Siddhanti and Santanu
Sarkar",
title = "A Differential Fault Attack on {Plantlet}",
journal = j-IEEE-TRANS-COMPUT,
volume = "66",
number = "10",
pages = "1804--1808",
month = oct,
year = "2017",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2017.2700469",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Sep 7 07:00:50 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/document/7917296/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Maity:2017:ODC,
author = "Santi P. Maity and Hirak Kumar Maity",
title = "Optimality in Distortion Control in Reversible
Watermarking Using Genetic Algorithms",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "17",
number = "3",
pages = "1750013",
month = jul,
year = "2017",
CODEN = "????",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Tue Oct 24 06:24:13 MDT 2017",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Mamais:2017:BVP,
author = "Stylianos S. Mamais and George Theodorakopoulos",
title = "Behavioural Verification: Preventing Report Fraud in
Decentralized Advert Distribution Systems",
journal = j-FUTURE-INTERNET,
volume = "9",
number = "4",
pages = "88",
day = "20",
month = nov,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi9040088",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:58 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/9/4/88",
abstract = "Service commissions, which are claimed by Ad-Networks
and Publishers, are susceptible to forgery as non-human
operators are able to artificially create fictitious
traffic on digital platforms for the purpose of
committing financial fraud. This places a significant
strain on Advertisers who have no effective means of
differentiating fabricated Ad-Reports from those which
correspond to real consumer activity. To address this
problem, we contribute an advert reporting system which
utilizes opportunistic networking and a
blockchain-inspired construction in order to identify
authentic Ad-Reports by determining whether they were
composed by honest or dishonest users. What constitutes
a user's honesty for our system is the manner in which
they access adverts on their mobile device. Dishonest
users submit multiple reports over a short period of
time while honest users behave as consumers who view
adverts at a balanced pace while engaging in typical
social activities such as purchasing goods online,
moving through space and interacting with other users.
We argue that it is hard for dishonest users to fake
honest behaviour and we exploit the behavioural
patterns of users in order to classify Ad-Reports as
real or fabricated. By determining the honesty of the
user who submitted a particular report, our system
offers a more secure reward-claiming model which
protects against fraud while still preserving the
user's anonymity.",
acknowledgement = ack-nhfb,
remark = "Special Issue Security and Privacy in Wireless and
Mobile Networks.",
}
@Article{Marko:2017:MDI,
author = "Frantisek Marko and Alexandr N. Zubkov",
title = "Minimal degrees of invariants of (super)groups --- a
connection to cryptology",
journal = j-LIN-MULT-ALGEBRA,
volume = "65",
number = "11",
pages = "2340--2355",
year = "2017",
CODEN = "LNMLAZ",
DOI = "https://doi.org/10.1080/03081087.2016.1273876",
ISSN = "0308-1087 (print), 1563-5139 (electronic)",
ISSN-L = "0308-1087",
bibdate = "Thu Nov 30 08:05:11 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linmultalgebra.bib",
acknowledgement = ack-nhfb,
fjournal = "Linear and Multilinear Algebra",
journal-URL = "http://www.tandfonline.com/loi/glma20",
onlinedate = "29 Dec 2016",
}
@Article{Martinovic:2017:AUP,
author = "Ivan Martinovic and Kasper Rasmussen and Marc
Roeschlin and Gene Tsudik",
title = "Authentication using pulse-response biometrics",
journal = j-CACM,
volume = "60",
number = "2",
pages = "108--115",
month = feb,
year = "2017",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3023359",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Fri Feb 17 17:20:17 MST 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2017/2/212440/fulltext",
abstract = "We propose a new biometric based on the human body's
response to an electric square pulse signal, called
pulse-response. We explore how this biometric can be
used to enhance security in the context of two example
applications: (1) an additional authentication
mechanism in PIN entry systems, and (2) a means of
continuous authentication on a secure terminal. The
pulse-response biometric is effective because each
human body exhibits a unique response to a signal pulse
applied at the palm of one hand, and measured at the
palm of the other. Using a prototype setup, we show
that users can be correctly identified, with high
probability, in a matter of seconds. This
identification mechanism integrates well with other
established methods and offers a reliable additional
layer of security, either on a continuous basis or at
login time. We build a proof-of-concept prototype and
perform experiments to assess the feasibility of
pulse-response as a practical biometric. The results
are very encouraging, achieving accuracies of 100\%
over a static data set, and 88\% over a data set with
samples taken over several weeks.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Masdari:2017:STA,
author = "Mohammad Masdari and Safiyyeh Ahmadzadeh",
title = "A survey and taxonomy of the authentication schemes in
{Telecare Medicine Information Systems}",
journal = j-J-NETW-COMPUT-APPL,
volume = "87",
number = "??",
pages = "1--19",
day = "1",
month = jun,
year = "2017",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sat Jul 29 15:40:53 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517300978",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Mashhadi:2017:NMS,
author = "Samaneh Mashhadi",
title = "New multi-stage secret sharing in the standard model",
journal = j-INFO-PROC-LETT,
volume = "127",
number = "??",
pages = "43--48",
month = nov,
year = "2017",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri Aug 25 11:11:26 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019017301242",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Mastroeni:2017:APS,
author = "Isabella Mastroeni and Damiano Zanardini",
title = "Abstract Program Slicing: an Abstract
Interpretation-Based Approach to Program Slicing",
journal = j-TOCL,
volume = "18",
number = "1",
pages = "7:1--7:??",
month = apr,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3029052",
ISSN = "1529-3785 (print), 1557-945X (electronic)",
ISSN-L = "1529-3785",
bibdate = "Thu Apr 13 17:53:54 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/tocl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tocl.bib",
abstract = "In the present article, we formally define the notion
of abstract program slicing, a general form of program
slicing where properties of data are considered instead
of their exact value. This approach is applied to a
language with numeric and reference values and relies
on the notion of abstract dependencies between program
statements. The different forms of (backward) abstract
slicing are added to an existing formal framework where
traditional, nonabstract forms of slicing could be
compared. The extended framework allows us to
appreciate that abstract slicing is a generalization of
traditional slicing, since each form of traditional
slicing (dealing with syntactic dependencies) is
generalized by a semantic (nonabstract) form of
slicing, which is actually equivalent to an abstract
form where the identity abstraction is performed on
data. Sound algorithms for computing abstract
dependencies and a systematic characterization of
program slices are provided, which rely on the notion
of agreement between program states.",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Transactions on Computational Logic",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J773",
}
@Article{Matsumoto:2017:ACG,
author = "Stephanos Matsumoto and Raphael M. Reischuk and Pawel
Szalachowski and Tiffany Hyun-Jin Kim and Adrian
Perrig",
title = "Authentication Challenges in a Global Environment",
journal = j-TOPS,
volume = "20",
number = "1",
pages = "1:1--1:??",
month = feb,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3007208",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
ISSN-L = "2471-2566",
bibdate = "Mon Apr 3 09:09:40 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
abstract = "In this article, we address the problem of scaling
authentication for naming, routing, and end-entity (EE)
certification to a global environment in which
authentication policies and users' sets of trust roots
vary widely. The current mechanisms for authenticating
names (DNSSEC), routes (BGPSEC), and EE certificates
(TLS) do not support a coexistence of authentication
policies, affect the entire Internet when compromised,
cannot update trust root information efficiently, and
do not provide users with the ability to make flexible
trust decisions. We propose the Scalable Authentication
Infrastructure for Next-generation Trust (SAINT), which
partitions the Internet into groups with common, local
trust roots and isolates the effects of a compromised
trust root. SAINT requires groups with direct routing
connections to cross-sign each other for authentication
purposes, allowing diverse authentication policies
while keeping all entities' authentication information
globally discoverable. SAINT makes trust root
management a central part of the network architecture,
enabling trust root updates within seconds and allowing
users to make flexible trust decisions. SAINT operates
without a significant performance penalty and can be
deployed alongside existing infrastructures.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Mazumdar:2017:CRS,
author = "Bodhisatwa Mazumdar and Debdeep Mukhopadhyay",
title = "Construction of Rotation Symmetric {S}-Boxes with High
Nonlinearity and Improved {DPA} Resistivity",
journal = j-IEEE-TRANS-COMPUT,
volume = "66",
number = "1",
pages = "59--72",
month = jan,
year = "2017",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2569410",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Dec 15 06:48:58 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Mazumder:2017:PSK,
author = "Rashed Mazumder and Atsuko Miyaji and Chunhua Su",
title = "Probably Secure Keyed-Function Based Authenticated
Encryption Schemes for Big Data",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "661--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400123",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mazumder:2017:SAE,
author = "Rashed Mazumder and Atsuko Miyaji and Chunhua Su",
title = "A simple authentication encryption scheme",
journal = j-CCPE,
volume = "29",
number = "16",
pages = "",
day = "25",
month = aug,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4058",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Jul 24 08:22:39 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Misc{McGrew:2017:IDH,
author = "Danile McGrew and M. Curcio and Scott Fluhrer",
title = "{Internet}-Draft: Hash-Based Signatures",
howpublished = "Internet Engineering Task Force document.",
year = "2017",
bibdate = "Thu Aug 31 16:19:53 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://datatracker.ietf.org/doc/draft-mcgrew-hash-sigs",
acknowledgement = ack-nhfb,
}
@Article{Menesidou:2017:CKM,
author = "Sofia Anna Menesidou and Vasilios Katos and Georgios
Kambourakis",
title = "Cryptographic Key Management in Delay Tolerant
Networks: a Survey",
journal = j-FUTURE-INTERNET,
volume = "9",
number = "3",
pages = "26",
day = "27",
month = jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi9030026",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:57 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/9/3/26",
abstract = "Since their appearance at the dawn of the second
millennium, Delay or Disruption Tolerant Networks
(DTNs) have gradually evolved, spurring the development
of a variety of methods and protocols for making them
more secure and resilient. In this context, perhaps,
the most challenging problem to deal with is that of
cryptographic key management. To the best of our
knowledge, the work at hand is the first to survey the
relevant literature and classify the various so far
proposed key management approaches in such a restricted
and harsh environment. Towards this goal, we have
grouped the surveyed key management methods into three
major categories depending on whether the particular
method copes with (a) security initialization, (b) key
establishment, and (c) key revocation. We have
attempted to provide a concise but fairly complete
evaluation of the proposed up-to-date methods in a
generalized way with the aim of offering a central
reference point for future research.",
acknowledgement = ack-nhfb,
}
@Article{Migliore:2017:HSA,
author = "Vincent Migliore and C{\'e}dric Seguin and Maria
M{\'e}ndez Real and Vianney Lapotre and Arnaud
Tisserand and Caroline Fontaine and Guy Gogniat and
Russell Tessier",
title = "A High-Speed Accelerator for Homomorphic Encryption
using the {Karatsuba} Algorithm",
journal = j-TECS,
volume = "16",
number = "5s",
pages = "138:1--138:??",
month = oct,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3126558",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:33 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Somewhat Homomorphic Encryption (SHE) schemes can be
used to carry out operations on ciphered data. In a
cloud computing scenario, personal information can be
processed secretly, inferring a high level of
confidentiality. The principle limitation of SHE is the
size of ciphertext compared to the size of the message.
This issue can be addressed by using a batching
technique that ``packs'' several messages into one
ciphertext. However, this method leads to important
drawbacks in standard implementations. This paper
presents a fast hardware/software co-design
implementation of an encryption procedure using the
Karatsuba algorithm. Our hardware accelerator is 1.5
times faster than the state of the art for 1 encryption
and 4 times faster for 4 encryptions.",
acknowledgement = ack-nhfb,
articleno = "138",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Mosenia:2017:CCA,
author = "A. Mosenia and S. Sur-Kolay and A. Raghunathan and N.
K. Jha",
title = "{CABA}: Continuous Authentication Based on {BioAura}",
journal = j-IEEE-TRANS-COMPUT,
volume = "66",
number = "5",
pages = "759--772",
month = may,
year = "2017",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2622262",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Apr 6 07:46:06 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Authentication; Authorization; behaviometrics;
Biomedical monitoring; biomedical signals; biometrics;
Biometrics (access control); biostreams; continuous
authentication; machine learning; Monitoring;
Scalability; security; wearable medical devices",
}
@Article{Mosenia:2017:PTS,
author = "Arsalan Mosenia and Xiaoliang Dai and Prateek Mittal
and Niraj Jha",
title = "{PinMe}: Tracking a Smartphone User around the World",
journal = "{IEEE} Transactions on Multi-Scale Computing Systems",
volume = "??",
number = "??",
pages = "1--17",
month = "????",
year = "2017",
DOI = "https://doi.org/10.1109/tmscs.2017.2751462",
ISSN = "2332-7766",
ISSN-L = "2332-7766",
bibdate = "Fri Dec 8 14:47:55 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
remark = "Still in prepublication stage, not fully edited, and
not yet assigned to a journal issue. The article
describes non-GPS ways to track mobile phones.",
}
@Article{Mozaffari-Kermani:2017:FDA,
author = "Mehran Mozaffari-Kermani and Reza Azarderakhsh and
Anita Aghaie",
title = "Fault Detection Architectures for Post-Quantum
Cryptographic Stateless Hash-Based Secure Signatures
Benchmarked on {ASIC}",
journal = j-TECS,
volume = "16",
number = "2",
pages = "59:1--59:??",
month = apr,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2930664",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Jul 24 09:51:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Symmetric-key cryptography can resist the potential
post-quantum attacks expected with the not-so-faraway
advent of quantum computing power. Hash-based,
code-based, lattice-based, and multivariate-quadratic
equations are all other potential candidates, the merit
of which is that they are believed to resist both
classical and quantum computers, and applying ``Shor's
algorithm''-the quantum-computer discrete-logarithm
algorithm that breaks classical schemes-to them is
infeasible. In this article, we propose, assess, and
benchmark reliable constructions for stateless
hash-based signatures. Such architectures are believed
to be one of the prominent post-quantum schemes,
offering security proofs relative to plausible
properties of the hash function; however, it is well
known that their confidentiality does not guarantee
reliable architectures in the presence natural and
malicious faults. We propose and benchmark fault
diagnosis methods for this post-quantum cryptography
variant through case studies for hash functions and
present the simulations and implementations results
(through application-specific integrated circuit
evaluations) to show the applicability of the presented
schemes. The proposed approaches make such hash-based
constructions more reliable against natural faults and
help protecting them against malicious faults and can
be tailored based on the resources available and for
different reliability objectives.",
acknowledgement = ack-nhfb,
articleno = "59",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Mukherjee:2017:EPP,
author = "Srilekha Mukherjee and Goutam Sanyal",
title = "Enhanced Position Power First Mapping {(PPFM)} based
image steganography",
journal = j-INT-J-COMPUT-APPL,
volume = "39",
number = "2",
pages = "59--68",
year = "2017",
CODEN = "IJCAFW",
DOI = "https://doi.org/10.1080/1206212X.2016.1273624",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:31:06 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2016.1273624",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "02 Jan 2017",
}
@Article{Mulholland:2017:DCD,
author = "John Mulholland and Michele Mosca and Johannes Braun",
title = "The Day the Cryptography Dies",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "4",
pages = "14--21",
month = jul # "\slash " # aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2017.3151325",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Aug 29 06:15:10 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/04/msp2017040014-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Mundhenk:2017:SAN,
author = "Philipp Mundhenk and Andrew Paverd and Artur Mrowca
and Sebastian Steinhorst and Martin Lukasiewycz and
Suhaib A. Fahmy and Samarjit Chakraborty",
title = "Security in Automotive Networks: Lightweight
Authentication and Authorization",
journal = j-TODAES,
volume = "22",
number = "2",
pages = "25:1--25:??",
month = mar,
year = "2017",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/2960407",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Jul 21 10:49:30 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "With the increasing amount of interconnections between
vehicles, the attack surface of internal vehicle
networks is rising steeply. Although these networks are
shielded against external attacks, they often do not
have any internal security to protect against malicious
components or adversaries who can breach the network
perimeter. To secure the in-vehicle network, all
communicating components must be authenticated, and
only authorized components should be allowed to send
and receive messages. This is achieved through the use
of an authentication framework. Cryptography is widely
used to authenticate communicating parties and provide
secure communication channels (e.g., Internet
communication). However, the real-time performance
requirements of in-vehicle networks restrict the types
of cryptographic algorithms and protocols that may be
used. In particular, asymmetric cryptography is
computationally infeasible during vehicle operation. In
this work, we address the challenges of designing
authentication protocols for automotive systems. We
present Lightweight Authentication for Secure
Automotive Networks (LASAN), a full lifecycle
authentication approach. We describe the core LASAN
protocols and show how they protect the internal
vehicle network while complying with the real-time
constraints and low computational resources of this
domain. By leveraging the fixed structure of automotive
networks, we minimize bandwidth and computation
requirements. Unlike previous work, we also explain how
this framework can be integrated into all aspects of
the automotive product lifecycle, including
manufacturing, vehicle maintenance, and software
updates. We evaluate LASAN in two different ways:
First, we analyze the security properties of the
protocols using established protocol verification
techniques based on formal methods. Second, we evaluate
the timing requirements of LASAN and compare these to
other frameworks using a new highly modular discrete
event simulator for in-vehicle networks, which we have
developed for this evaluation.",
acknowledgement = ack-nhfb,
articleno = "25",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Book{Mundy:2017:CGU,
author = "Liza Mundy",
title = "Code girls: the untold story of the {American} women
code breakers of {World War II}",
publisher = "Hachette Books",
address = "New York, NY, USA",
pages = "xiv + 416",
year = "2017",
ISBN = "0-316-35253-5 (hardcover), 0-316-43989-4 (large
print), 1-4789-2270-2 (audio book), 1-4789-2271-0
(audio download), 0-316-35255-1 (e-book)",
ISBN-13 = "978-0-316-35253-6 (hardcover), 978-0-316-43989-3
(large print), 978-1-4789-2270-4 (audio book),
978-1-4789-2271-1 (audio download), 978-0-316-35255-0
(e-book)",
LCCN = "D810.C88 M86 2017",
bibdate = "Sat Dec 23 09:01:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
z3950.loc.gov:7090/Voyager",
abstract = "Recruited by the U.S. Army and Navy from small towns
and elite colleges, more than ten thousand women served
as codebreakers during World War II. While their
brothers and boyfriends took up arms, these women moved
to Washington and learned the meticulous work of
code-breaking. Their efforts shortened the war, saved
countless lives, and gave them access to careers
previously denied to them. A strict vow of secrecy
nearly erased their efforts from history; now, through
dazzling research and interviews with surviving code
girls, bestselling author Liza Mundy brings to life
this riveting and vital story of American courage,
service, and scientific accomplishment.",
acknowledgement = ack-nhfb,
author-dates = "1960--",
subject = "World War, 1939-1945; Cryptography; Participation,
Female; Cryptographers; United States; History; 20th
century",
tableofcontents = "Introduction: ``Your country needs you, young
ladies'' \\
Part I. ``In the event of total war women will be
needed'' \\
Twenty-eight acres of girls \\
``This is a man's size job, but I seem to be getting
away with it'' \\
The most difficult problem \\
``So many girls in one place'' \\
Part II. ``Over all this vast expanse of waters Japan
was supreme'' \\
``It was heart-rending'' \\
``Q for communications'' \\
The forlorn shoe \\
``Hell's half-acre'' \\
``It was only human to complain'' \\
Pencil-pushing mamas sink the shipping of Japan \\
Part III. The tide turns \\
Sugar camp \\
``All my love, Jim'' \\
``Enemy landing at the mouth of the Seine'' \\
Teedy \\
The surrender message \\
Good-bye to Crow \\
Epilogue: The mitten",
}
@Article{Nacer:2017:DAM,
author = "Hassina Nacer and Nabil Djebari and Hachem Slimani and
Djamil Aissani",
title = "A distributed authentication model for composite {Web}
services",
journal = j-COMPUT-SECUR,
volume = "70",
number = "??",
pages = "144--178",
month = sep,
year = "2017",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:51 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404817301153",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Nain:2017:SPE,
author = "Ajay Kumar Nain and Jagadish Bandaru and Mohammed
Abdullah Zubair and Rajalakshmi Pachamuthu",
title = "A Secure Phase-Encrypted {IEEE 802.15.4} Transceiver
Design",
journal = j-IEEE-TRANS-COMPUT,
volume = "66",
number = "8",
pages = "1421--1427",
month = "????",
year = "2017",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2017.2672752",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 13 14:57:15 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/document/7862216/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Namasudra:2017:NSA,
author = "Suyel Namasudra and Pinki Roy",
title = "A new secure authentication scheme for cloud computing
environment",
journal = j-CCPE,
volume = "29",
number = "20",
pages = "??--??",
day = "25",
month = oct,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3864",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Oct 2 11:26:28 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Nandakumar:2017:CAI,
author = "Rajalakshmi Nandakumar and Alex Takakuwa and Tadayoshi
Kohno and Shyamnath Gollakota",
title = "{CovertBand}: Activity Information Leakage using
Music",
journal = j-IMWUT,
volume = "1",
number = "3",
pages = "87:1--87:24",
month = "????",
year = "2017",
CODEN = "????",
ISSN = "????",
bibdate = "Fri Aug 25 15:07:55 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "http://musicattacks.cs.washington.edu/activity-information-leakage.pdf",
abstract = "This paper contributes a novel method for low-cost,
covert physical sensing and, by doing so, surfaces new
privacy threats. We demonstrate how a smartphone and
portable speaker playing music with embedded, inaudible
signals can track multiple individuals' locations and
activities both within a room and through barriers in
2D space. We achieve this by transforming a smartphone
into an active sonar system that emits a combination of
a sonar pulse and music and listens to the reflections
off of humans in the environment. Our implementation,
CovertBand, monitors minute changes to these
reflections to track multiple people concurrently and
to recognize different types of motion, leaking
information about where people are in addition to what
they may be doing. We evaluated CovertBand by running
experiments in five homes in the Seattle area, showing
that we can localize both single and multiple
individuals through barriers. These tests show
CovertBand can track walking subjects with a mean
tracking error of 18 cm and subjects moving at a fixed
position with an accuracy of 8 cm at up to 6 m in
line-of-sight and 3 m through barriers. We test a
variety of rhythmic mot ions such as pumping arms,
jumping, and supine pelvic tilts in through-wall
scenarios and show that they produce discernibly
different spectrograms from walking in the acoustic
reflections. In tests with 33 subjects, we also show
that even in ideal scenarios, listeners were unlikely
to detect a CovertBand attack",
acknowledgement = ack-nhfb,
articleno = "87",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1566",
keywords = "active sonar; information leakage; motion tracking;
music processing",
}
@Article{Natgunanathan:2017:PBM,
author = "Iynkaran Natgunanathan and Yong Xiang and Guang Hua
and Gleb Beliakov and John Yearwood",
title = "Patchwork-Based Multilayer Audio Watermarking",
journal = j-IEEE-ACM-TASLP,
volume = "25",
number = "11",
pages = "2176--2187",
month = "????",
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/TASLP.2017.2749001",
ISSN = "2329-9290",
ISSN-L = "2329-9290",
bibdate = "Sat Jan 20 08:35:32 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeeacmtaslp.bib",
URL = "http://ieeexplore.ieee.org/document/8025572/",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6570655",
}
@Article{Ngo:2017:CSS,
author = "Xuan Thuy Ngo and Jean-Luc Danger and Sylvain Guilley
and Tarik Graba and Yves Mathieu and Zakaria Najm and
Shivam Bhasin",
title = "Cryptographically Secure Shield for Security {IPs}
Protection",
journal = j-IEEE-TRANS-COMPUT,
volume = "66",
number = "2",
pages = "354--360",
month = "????",
year = "2017",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2584041",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jan 19 06:52:50 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Nguyen:2017:DPA,
author = "Toan Van Nguyen and Napa Sae-Bae and Nasir Memon",
title = "{DRAW}-A-{PIN}: Authentication using finger-drawn
{PIN} on touch devices",
journal = j-COMPUT-SECUR,
volume = "66",
number = "??",
pages = "115--128",
month = may,
year = "2017",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404817300123",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Noorman:2017:SLC,
author = "Job Noorman and Jo {Van Bulck} and Jan Tobias
M{\"u}hlberg and Frank Piessens and Pieter Maene and
Bart Preneel and Ingrid Verbauwhede and Johannes
G{\"o}tzfried and Tilo M{\"u}ller and Felix Freiling",
title = "{Sancus 2.0}: a Low-Cost Security Architecture for
{IoT} Devices",
journal = j-TOPS,
volume = "20",
number = "3",
pages = "7:1--7:??",
month = aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3079763",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
ISSN-L = "2471-2566",
bibdate = "Sat Dec 23 09:59:06 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
abstract = "The Sancus security architecture for networked
embedded devices was proposed in 2013 at the USENIX
Security conference. It supports remote (even
third-party) software installation on devices while
maintaining strong security guarantees. More
specifically, Sancus can remotely attest to a software
provider that a specific software module is running
uncompromised and can provide a secure communication
channel between software modules and software
providers. Software modules can securely maintain local
state and can securely interact with other software
modules that they choose to trust. Over the past three
years, significant experience has been gained with
applications of Sancus, and several extensions of the
architecture have been investigated-both by the
original designers as well as by independent
researchers. Informed by these additional research
results, this journal version of the Sancus paper
describes an improved design and implementation,
supporting additional security guarantees (such as
confidential deployment) and a more efficient
cryptographic core. We describe the design of Sancus
2.0 (without relying on any prior knowledge of Sancus)
and develop and evaluate a prototype FPGA
implementation. The prototype extends an MSP430
processor with hardware support for the memory access
control and cryptographic functionality required to run
Sancus. We report on our experience using Sancus in a
variety of application scenarios and discuss some
important avenues of ongoing and future work.",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Nordrum:2017:GBD,
author = "A. Nordrum",
title = "Govern by blockchain: {Dubai} wants one platform to
rule them all, while {Illinois} will try anything",
journal = j-IEEE-SPECTRUM,
volume = "54",
number = "10",
pages = "54--55",
month = oct,
year = "2017",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2017.8048841",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 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/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Buildings; Contracts; cryptography; Economics;
financial industry; Government; government data
processing; public-sector blockchain experiments; Urban
areas",
}
@Article{Nunez:2017:PRE,
author = "David Nu{\~n}ez and Isaac Agudo and Javier Lopez",
title = "Proxy Re-Encryption: Analysis of constructions and its
application to secure access delegation",
journal = j-J-NETW-COMPUT-APPL,
volume = "87",
number = "??",
pages = "193--209",
day = "1",
month = jun,
year = "2017",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sat Jul 29 15:40:53 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517301078",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Odelu:2017:PSA,
author = "Vanga Odelu and Ashok Kumar Das and Saru Kumari and
Xinyi Huang and Mohammad Wazid",
title = "Provably secure authenticated key agreement scheme for
distributed mobile cloud computing services",
journal = j-FUT-GEN-COMP-SYS,
volume = "68",
number = "??",
pages = "74--88",
month = mar,
year = "2017",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Dec 10 08:32:13 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16303065",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Ozturk:2017:CAH,
author = "Erdin{\c{c}} {\"O}zt{\"u}rk and Yark{\i}n Dor{\"o}z
and Erkay Sava{\c{s}} and Berk Sunar",
title = "A Custom Accelerator for Homomorphic Encryption
Applications",
journal = j-IEEE-TRANS-COMPUT,
volume = "66",
number = "1",
pages = "3--16",
month = jan,
year = "2017",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2574340",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Dec 15 06:48:58 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Padget:2017:FGA,
author = "Julian A. Padget and Wamberto W. Vasconcelos",
title = "Fine-Grained Access Control via Policy-Carrying Data",
journal = j-TOIT,
volume = "18",
number = "3",
pages = "31:1--31:??",
month = may,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3133324",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:09 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "We address the problem of associating access policies
with datasets and how to monitor compliance via
policy-carrying data. Our contributions are a formal
model in first-order logic inspired by normative
multi-agent systems to regulate data access, and a
computational model for the validation of specific use
cases and the verification of policies against
criteria. Existing work on access policy identifies
roles as a key enabler, with which we concur, but much
of the rest focusses on authentication and
authorization technology. Our proposal aims to address
the normative principles put forward in Berners-Lee's
bill of rights for the internet, through human-readable
but machine-processable access control policies.",
acknowledgement = ack-nhfb,
articleno = "31",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Patranabis:2017:PSK,
author = "S. Patranabis and Y. Shrivastava and D. Mukhopadhyay",
title = "Provably Secure Key-Aggregate Cryptosystems with
Broadcast Aggregate Keys for Online Data Sharing on the
Cloud",
journal = j-IEEE-TRANS-COMPUT,
volume = "66",
number = "5",
pages = "891--904",
month = may,
year = "2017",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2629510",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Apr 6 07:46:06 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Aggregates; broadcast encryption; CCA security; Cloud
computing; Data privacy; data security; data sharing;
Encryption; key-aggregate cryptosystem; provable
security; Scalability; scalability; semantic security",
}
@Article{Peck:2017:BWD,
author = "Morgan E. Peck",
title = "Blockchain world --- Do you need a blockchain? {This}
chart will tell you if the technology can solve your
problem",
journal = j-IEEE-SPECTRUM,
volume = "54",
number = "10",
pages = "38--60",
month = oct,
year = "2017",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2017.8048838",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 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/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Bitcoin; blockchain technology; Companies;
Conferences; cryptography; data-management systems;
Databases; digital ecosystem; electronic health
records; health care; health care records management;
Juniper Research; online identities; Oracle Corp;
Packaging; Privacy; property titles; records
management; relational databases; Software; supply
chains",
}
@Book{Pellikaan:2017:CCC,
author = "Ruud Pellikaan and Xin-Wen Wu and Stanislav Bulygin
and Relinde Jurrius",
title = "Codes, Cryptology and Curves with Computer Algebra",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "xii + 597",
year = "2017",
ISBN = "0-521-52036-3 (paperback), 0-521-81711-0 (hardcover),
0-511-98217-8 (e-book)",
ISBN-13 = "978-0-521-52036-2 (paperback), 978-0-521-81711-0
(hardcover), 978-0-511-98217-0 (e-book)",
LCCN = "QA268 .P45 2017",
bibdate = "Tue Oct 22 09:50:04 MDT 2019",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "This well-balanced text touches on theoretical and
applied aspects of protecting digital data. The reader
is provided with the basic theory and is then shown
deeper fascinating detail, including the current state
of the art. Readers will soon become familiar with
methods of protecting digital data while it is
transmitted, as well as while the data is being stored.
Both basic and advanced error-correcting codes are
introduced together with numerous results on their
parameters and properties. The authors explain how to
apply these codes to symmetric and public key
cryptosystems and secret sharing. Interesting
approaches based on polynomial systems solving are
applied to cryptography and decoding codes. Computer
algebra systems are also used to provide an
understanding of how objects introduced in the book are
constructed, and how their properties can be examined.
This book is designed for Masters-level students
studying mathematics, computer science, electrical
engineering or physics.",
acknowledgement = ack-nhfb,
remark = "Title from publisher's bibliographic system (viewed on
27 Oct 2017).",
subject = "Error-correcting codes (Information theory); Curves,
Algebraic; Coding theory; Coding theory; Curves,
Algebraic; Error-correcting codes (Information
theory)",
tableofcontents = "Error-correcting codes / Ruud Pellikaan and Xin-Wen
Wu \\
Code constructions and bounds on codes / Ruud Pellikaan
and Xin-Wen Wu \\
Weight enumeration / Relinde Jurrius, Ruud Pellikaan
and Xin-Wen Wu \\
Cyclic codes / Ruud Pellikaan \\
Polynomial codes / Ruud Pellikaan \\
Algebraic decoding / Ruud Pellikaan and Xin-Wen Wu \\
Complexity and decoding / Stanislav Bulygin, Ruud
Pellikaan and Xin-Wen Wu \\
Codes and related structures / Relinde Jurrius and Ruud
Pellikaan \\
Cryptology / Stanislav Bulygin \\
Gr{\"o}bner bases for coding and cryptology / Stanislav
Bulygin \\
Codes on curves / Ruud Pellikaan \\
Coding and cryptology with computer algebra / Stanislav
Bulygin",
}
@Article{Pendleton:2017:SSS,
author = "Marcus Pendleton and Richard Garcia-Lebron and Jin-Hee
Cho and Shouhuai Xu",
title = "A Survey on Systems Security Metrics",
journal = j-COMP-SURV,
volume = "49",
number = "4",
pages = "62:1--62:??",
month = feb,
year = "2017",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3005714",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Feb 9 09:18:20 MST 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Security metrics have received significant attention.
However, they have not been systematically explored
based on the understanding of attack-defense
interactions, which are affected by various factors,
including the degree of system vulnerabilities, the
power of system defense mechanisms, attack (or threat)
severity, and situations a system at risk faces. This
survey particularly focuses on how a system security
state can evolve as an outcome of cyber attack-defense
interactions. This survey concerns how to measure
system-level security by proposing a security metrics
framework based on the following four sub-metrics: (1)
metrics of system vulnerabilities, (2) metrics of
defense power, (3) metrics of attack or threat
severity, and (4) metrics of situations. To investigate
the relationships among these four sub-metrics, we
propose a hierarchical ontology with four
sub-ontologies corresponding to the four sub-metrics
and discuss how they are related to each other. Using
the four sub-metrics, we discuss the state-of-art
existing security metrics and their advantages and
disadvantages (or limitations) to obtain lessons and
insight in order to achieve an ideal goal in developing
security metrics. Finally, we discuss open research
questions in the security metrics research domain and
we suggest key factors to enhance security metrics from
a system security perspective.",
acknowledgement = ack-nhfb,
articleno = "62",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Poh:2017:SDV,
author = "Geong Sen Poh and Vishnu Monn Baskaran and Ji-Jian
Chin and Moesfa Soeheila Mohamad and Kay Win Lee and
Dharmadharshni Maniam and Muhammad Reza Z'aba",
title = "Searchable Data Vault: Encrypted Queries in Secure
Distributed Cloud Storage",
journal = j-ALGORITHMS-BASEL,
volume = "10",
number = "2",
month = jun,
year = "2017",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a10020052",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:13 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.mdpi.com/1999-4893/10/2/52",
acknowledgement = ack-nhfb,
articleno = "52",
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
ORCID-numbers = "Geong Sen Poh/0000-0002-2905-688X; Ji-Jian
Chin/0000-0001-9809-6976",
pagecount = "??",
pubdates = "Received: 28 February 2017 / Revised: 19 April 2017 /
Accepted: 3 May 2017 / Published: 9 May 2017",
}
@Article{Poh:2017:SSE,
author = "Geong Sen Poh and Ji-Jian Chin and Wei-Chuen Yau and
Kim-Kwang Raymond Choo and Moesfa Soeheila Mohamad",
title = "Searchable Symmetric Encryption: Designs and
Challenges",
journal = j-COMP-SURV,
volume = "50",
number = "3",
pages = "40:1--40:??",
month = oct,
year = "2017",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3064005",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Jan 20 09:25:00 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Searchable Symmetric Encryption (SSE) when deployed in
the cloud allows one to query encrypted data without
the risk of data leakage. Despite the widespread
interest, existing surveys do not examine in detail how
SSE's underlying structures are designed and how these
result in the many properties of a SSE scheme. This is
the gap we seek to address, as well as presenting
recent state-of-the-art advances on SSE. Specifically,
we present a general framework and believe the
discussions may lead to insights for potential new
designs. We draw a few observations. First, most
schemes use index table, where optimal index size and
sublinear search can be achieved using an inverted
index. Straightforward updating can only be achieved
using direct index, but search time would be linear. A
recent trend is the combinations of index table, and
tree, deployed for efficient updating and storage.
Secondly, mechanisms from related fields such as
Oblivious RAM (ORAM) have been integrated to reduce
leakages. However, using these mechanisms to minimise
leakages in schemes with richer functionalities (e.g.,
ranked, range) is relatively unexplored. Thirdly, a new
approach (e.g., multiple servers) is required to
mitigate new and emerging attacks on leakage. Lastly,
we observe that a proposed index may not be practically
efficient when implemented, where I/O access must be
taken into consideration.",
acknowledgement = ack-nhfb,
articleno = "40",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Polyakov:2017:FPR,
author = "Yuriy Polyakov and Kurt Rohloff and Gyana Sahu and
Vinod Vaikuntanathan",
title = "Fast Proxy Re-Encryption for Publish\slash Subscribe
Systems",
journal = j-TOPS,
volume = "20",
number = "4",
pages = "14:1--14:??",
month = oct,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3128607",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
ISSN-L = "2471-2566",
bibdate = "Sat Dec 23 09:59:06 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
abstract = "We develop two IND-CPA-secure multihop unidirectional
Proxy Re-Encryption (PRE) schemes by applying the
Ring-LWE (RLWE) key switching approach from the
homomorphic encryption literature. Unidirectional PRE
is ideal for secure publish-subscribe operations where
a publisher encrypts information using a public key
without knowing upfront who the subscriber will be and
what private key will be used for decryption. The
proposed PRE schemes provide a multihop capability,
meaning that when PRE-encrypted information is
published onto a PRE-enabled server, the server can
either delegate access to specific clients or enable
other servers the right to delegate access. Our first
scheme (which we call NTRU-ABD-PRE) is based on a
variant of the NTRU-RLWE homomorphic encryption scheme.
Our second and main PRE scheme (which we call BV-PRE)
is built on top of the Brakerski-Vaikuntanathan (BV)
homomorphic encryption scheme and relies solely on the
RLWE assumption. We present an open-source C++
implementation of both schemes and discuss several
algorithmic and software optimizations. We examine
parameter selection tradeoffs in the context of
security, runtime\slash latency, throughput, ciphertext
expansion, memory usage, and multihop capabilities. Our
experimental analysis demonstrates that BV-PRE
outperforms NTRU-ABD-PRE in both single-hop and
multihop settings. The BV-PRE scheme has a lower time
and space complexity than existing IND-CPA-secure
lattice-based PRE schemes and requires small concrete
parameters, making the scheme computationally efficient
for use on low-resource embedded systems while still
providing 100 bits of security. We present practical
recommendations for applying the PRE schemes to several
use cases of ad hoc information sharing for
publish-subscribe operations.",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Puthal:2017:DDK,
author = "Deepak Puthal and Surya Nepal and Rajiv Ranjan and
Jinjun Chen",
title = "{DLSeF}: a Dynamic Key-Length-Based Efficient
Real-Time Security Verification Model for Big Data
Stream",
journal = j-TECS,
volume = "16",
number = "2",
pages = "51:1--51:??",
month = apr,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2937755",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Jul 24 09:51:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Applications in risk-critical domains such as
emergency management and industrial control systems
need near-real-time stream data processing in
large-scale sensing networks. The key problem is how to
ensure online end-to-end security (e.g.,
confidentiality, integrity, and authenticity) of data
streams for such applications. We refer to this as an
online security verification problem. Existing data
security solutions cannot be applied in such
applications as they cannot deal with data streams with
high-volume and high-velocity data in real time. They
introduce a significant buffering delay during security
verification, resulting in a requirement for a large
buffer size for the stream processing server. To
address this problem, we propose a Dynamic
Key-Length-Based Security Framework (DLSeF) based on a
shared key derived from synchronized prime numbers; the
key is dynamically updated at short intervals to thwart
potential attacks to ensure end-to-end security.
Theoretical analyses and experimental results of the
DLSeF framework show that it can significantly improve
the efficiency of processing stream data by reducing
the security verification time and buffer usage without
compromising security.",
acknowledgement = ack-nhfb,
articleno = "51",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Qin:2017:DIR,
author = "Chuan Qin and Jingwei Li and Patrick P. C. Lee",
title = "The Design and Implementation of a Rekeying-Aware
Encrypted Deduplication Storage System",
journal = j-TOS,
volume = "13",
number = "1",
pages = "9:1--9:??",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3032966",
ISSN = "1553-3077 (print), 1553-3093 (electronic)",
ISSN-L = "1553-3077",
bibdate = "Sat Mar 25 07:00:07 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/tos/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tos.bib",
abstract = "Rekeying refers to an operation of replacing an
existing key with a new key for encryption. It renews
security protection to protect against key compromise
and enable dynamic access control in cryptographic
storage. However, it is non-trivial to realize
efficient rekeying in encrypted deduplication storage
systems, which use deterministic content-derived
encryption keys to allow deduplication on ciphertexts.
We design and implement a rekeying-aware encrypted
deduplication (REED) storage system. REED builds on a
deterministic version of all-or-nothing transform, such
that it enables secure and lightweight rekeying, while
preserving the deduplication capability. We propose two
REED encryption schemes that trade between performance
and security and extend REED for dynamic access
control. We implement a REED prototype with various
performance optimization techniques and demonstrate how
we can exploit similarity to mitigate key generation
overhead. Our trace-driven testbed evaluation shows
that our REED prototype maintains high performance and
storage efficiency.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on Storage",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960",
}
@Article{Qiu:2017:AAS,
author = "Yue Qiu and Maode Ma and Shuo Chen",
title = "An anonymous authentication scheme for multi-domain
machine-to-machine communication in cyber-physical
systems",
journal = j-COMP-NET-AMSTERDAM,
volume = "129 (part 1)",
number = "??",
pages = "306--318",
day = "24",
month = dec,
year = "2017",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Nov 22 06:05:46 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S138912861730381X",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Qiu:2017:PSB,
author = "Yue Qiu and Maode Ma and Xilei Wang",
title = "A proxy signature-based handover authentication scheme
for {LTE} wireless networks",
journal = j-J-NETW-COMPUT-APPL,
volume = "83",
number = "??",
pages = "63--71",
day = "1",
month = apr,
year = "2017",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Fri Mar 31 07:48:45 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517300449",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Radke:2017:SPP,
author = "Kenneth Radke and Colin Boyd",
title = "Security Proofs for Protocols Involving Humans",
journal = j-COMP-J,
volume = "60",
number = "4",
pages = "527--540",
day = "23",
month = mar,
year = "2017",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/4/527/2354604",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Rao:2017:CFA,
author = "Y. Sreenivasa Rao and Ratna Dutta",
title = "Computational friendly attribute-based encryptions
with short ciphertext",
journal = j-THEOR-COMP-SCI,
volume = "668",
number = "??",
pages = "1--26",
day = "15",
month = mar,
year = "2017",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Mar 8 12:16:00 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397516307587",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Rao:2017:SEC,
author = "Y. Sreenivasa Rao",
title = "A secure and efficient Ciphertext-Policy
Attribute-Based Signcryption for Personal Health
Records sharing in cloud computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "67",
number = "??",
pages = "133--151",
month = feb,
year = "2017",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Nov 22 14:20:56 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16302746",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Rawat:2017:VIS,
author = "Hemendra Rawat and Patrick Schaumont",
title = "Vector Instruction Set Extensions for Efficient
Computation of {Keccak}",
journal = j-IEEE-TRANS-COMPUT,
volume = "66",
number = "10",
pages = "1778--1789",
month = oct,
year = "2017",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2017.2700795",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Sep 7 07:00:50 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/document/7918507/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Razaque:2017:SDA,
author = "Abdul Razaque and Syed S. Rizvi",
title = "Secure data aggregation using access control and
authentication for wireless sensor networks",
journal = j-COMPUT-SECUR,
volume = "70",
number = "??",
pages = "532--545",
month = sep,
year = "2017",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:51 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404817301402",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Reaves:2017:MBM,
author = "Bradley Reaves and Jasmine Bowers and Nolen Scaife and
Adam Bates and Arnav Bhartiya and Patrick Traynor and
Kevin R. B. Butler",
title = "Mo(bile) Money, Mo(bile) Problems: Analysis of
Branchless Banking Applications",
journal = j-TOPS,
volume = "20",
number = "3",
pages = "11:1--11:??",
month = aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3092368",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
ISSN-L = "2471-2566",
bibdate = "Sat Dec 23 09:59:06 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
abstract = "Mobile money, also known as branchless banking,
leverages ubiquitous cellular networks to bring
much-needed financial services to the unbanked in the
developing world. These services are often deployed as
smartphone apps, and although marketed as secure, these
applications are often not regulated as strictly as
traditional banks, leaving doubt about the truth of
such claims. In this article, we evaluate these claims
and perform the first in-depth measurement analysis of
branchless banking applications. We first perform an
automated analysis of all 46 known Android mobile money
apps across the 246 known mobile money providers from
2015. We then perform a comprehensive manual teardown
of the registration, login, and transaction procedures
of a diverse 15\% of these apps. We uncover pervasive
vulnerabilities spanning botched certification
validation, do-it-yourself cryptography, and other
forms of information leakage that allow an attacker to
impersonate legitimate users, modify transactions, and
steal financial records. These findings show that the
majority of these apps fail to provide the protections
needed by financial services. In an expanded
re-evaluation one year later, we find that these
systems have only marginally improved their security.
Additionally, we document our experiences working in
this sector for future researchers and provide
recommendations to improve the security of this
critical ecosystem. Finally, through inspection of
providers' terms of service, we also discover that
liability for these problems unfairly rests on the
shoulders of the customer, threatening to erode trust
in branchless banking and hinder efforts for global
financial inclusion.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Reinicke:2017:RDS,
author = "Bryan Reinicke and Jeffrey Cummings and Howard
Kleinberg",
title = "The Right to Digital Self-Defense",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "4",
pages = "68--71",
month = jul # "\slash " # aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2017.3151324",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Aug 29 06:15:10 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/04/msp2017040068-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "https://publications.computer.org/security-and-privacy/",
}
@Article{Rivest:2017:WEV,
author = "Ronald L. Rivest and Philip B. Stark",
title = "When Is an Election Verifiable?",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "3",
pages = "48--50",
month = may # "\slash " # jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2017.78",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Jul 25 21:35:08 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/03/msp2017030048-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "https://publications.computer.org/security-and-privacy/",
}
@Article{Roy:2017:LOS,
author = "Dipanjan Roy and Anirban Sengupta",
title = "Low overhead symmetrical protection of reusable {IP}
core using robust fingerprinting and watermarking
during high level synthesis",
journal = j-FUT-GEN-COMP-SYS,
volume = "71",
number = "??",
pages = "89--101",
month = jun,
year = "2017",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Thu Mar 9 14:20:18 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16305556",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Sadhya:2017:PRE,
author = "Debanjan Sadhya and Sanjay Kumar Singh",
title = "Privacy risks ensuing from cross-matching among
databases: a case study for soft biometrics",
journal = j-INFO-PROC-LETT,
volume = "128",
number = "??",
pages = "38--45",
month = dec,
year = "2017",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri Aug 25 11:46:56 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019017301436",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Safkhani:2017:PSD,
author = "Masoumeh Safkhani and Nasour Bagheri",
title = "Passive secret disclosure attack on an
ultralightweight authentication protocol for {Internet
of Things}",
journal = j-J-SUPERCOMPUTING,
volume = "73",
number = "8",
pages = "3579--3585",
month = aug,
year = "2017",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-017-1959-0",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Mon Oct 2 11:08:37 MDT 2017",
bibsource = "http://link.springer.com/journal/11227/73/8;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Sendrier:2017:CBC,
author = "Nicolas Sendrier",
title = "Code-Based Cryptography: State of the Art and
Perspectives",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "4",
pages = "44--50",
month = jul # "\slash " # aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2017.3151345",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Aug 29 06:15:10 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/04/msp2017040044-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Sengupta:2017:USB,
author = "Binanda Sengupta and Abhijit Das",
title = "Use of {SIMD}-based data parallelism to speed up
sieving in integer-factoring algorithms",
journal = j-APPL-MATH-COMP,
volume = "293",
number = "??",
pages = "204--217",
day = "15",
month = jan,
year = "2017",
CODEN = "AMHCBQ",
DOI = "https://doi.org/10.1016/j.amc.2016.08.019",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Sep 30 06:36:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2015.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300316305148",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003/",
keywords = "Integer factorization; Lattice sieve method;
Multiple-polynomial quadratic sieve method;
Number-field sieve method; Single instruction multiple
data",
}
@Book{Shemanske:2017:MCE,
author = "Thomas R. Shemanske",
title = "Modern Cryptography and Elliptic Curves: a Beginner's
Guide",
volume = "83",
publisher = pub-AMS,
address = pub-AMS:adr,
pages = "xii + 250",
year = "2017",
ISBN = "1-4704-3582-9, 1-4704-4123-3 (e-book)",
ISBN-13 = "978-1-4704-3582-0, 978-1-4704-4123-4 (e-book)",
LCCN = "QA567.2.E44 S534 2017",
MRclass = "11-01 68-01 11Axx 14G50 11T71 68P25 11Y05 94A60 11G05
81P68",
bibdate = "Tue Oct 22 09:55:53 MDT 2019",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
series = "Student mathematical library",
URL = "http://public.ebookcentral.proquest.com/choice/publicfullrecord.aspx?p=4940250",
abstract = "This book offers the beginning undergraduate student
some of the vista of modern mathematics by developing
and presenting the tools needed to gain an
understanding of the arithmetic of elliptic curves over
finite fields and their applications to modern
cryptography. This gradual introduction also makes a
significant effort to teach students how to produce or
discover a proof by presenting mathematics as an
exploration, and at the same time, it provides the
necessary mathematical underpinnings to investigate the
practical and implementation side of elliptic curve
cryptography (ECC). Elements of.",
acknowledgement = ack-nhfb,
author-dates = "1952--",
remark = "Versement en lot.",
subject = "Cryptography; Textbooks; Curves, Elliptic; Geometry,
Algebraic; Cryptography.; Curves, Elliptic.; Geometry,
Algebraic.",
tableofcontents = "Preface \\
Introduction \\
1. Three Motivating Problems \\
1.1. Fermat's Last Theorem \\
1.2. The Congruent Number Problem \\
1.3. Cryptography \\
2. Back to the Beginning \\
2.1. The Unit Circle: Real vs. Rational Points \\
2.2. Parametrizing the Rational Points on the Unit
Circle \\
2.3. Finding all Pythagorean Triples \\
2.4. Looking for Underlying Structure: Geometry vs.
Algebra \\
2.5. More about Points on Curves \\
2.6. Gathering Some Insight about Plane Curves \\
2.7. Additional Exercises \\
3. Some Elementary Number Theory \\
3.1. The Integers \\
3.2. Some Basic Properties of the Integers \\
3.3. Euclid's Algorithm \\
3.4. A First Pass at Modular Arithmetic \\
3.5. Elementary Cryptography: Caesar Cipher \\
3.6. Affine Ciphers and Linear Congruences \\
3.7. Systems of Congruences \\
4. A Second View of Modular Arithmetic: \Z\_{ } and \_{
} \\
4.1. Groups and Rings \\
4.2. Fractions and the Notion of an Equivalence
Relation \\
4.3. Modular Arithmetic \\
4.4. A Few More Comments on the Euler Totient Function
\\
4.5. An Application to Factoring \\
5. Public-Key Cryptography and RSA \\
5.1. A Brief Overview of Cryptographic Systems \\
5.2. RSA \\
5.3. Hash Functions \\
5.4. Breaking Cryptosystems and Practical RSA Security
Considerations \\
6. A Little More Algebra \\
6.1. Towards a Classification of Groups \\
6.2. Cayley Tables \\
6.3. A Couple of Non-abelian Groups \\
6.4. Cyclic Groups and Direct Products \\
6.5. Fundamental Theorem of Finite Abelian Groups \\
6.6. Primitive Roots \\
6.7. Diffie--Hellman Key Exchange \\
6.8. ElGamal Encryption \\
7. Curves in Affine and Projective Space \\
7.1. Affine and Projective Space \\
7.2. Curves in the Affine and Projective Plane \\
7.3. Rational Points on Curves \\
7.4. The Group Law for Points on an Elliptic Curve \\
7.5. A Formula for the Group Law on an Elliptic Curve
\\
7.6. The Number of Points on an Elliptic Curve \\
8. Applications of Elliptic Curves \\
8.1. Elliptic Curves and Factoring \\
8.2. Elliptic Curves and Cryptography \\
8.3. Remarks on a Post-Quantum Cryptographic World \\
Appendix A. Deeper Results and Concluding Thoughts \\
A.1. The Congruent Number Problem and Tunnell's
Solution \\
A.2. A Digression on Functions of a Complex Variable
\\
A.3. Return to the Birch and Swinnerton-Dyer Conjecture
\\
A.4. Elliptic Curves over $\C$ \\
Appendix B. Answers to Selected Exercises \\
B.1. Chapter 2 \\
B.2. Chapter 3 \\
B.3. Chapter 4 \\
B.4. Chapter 5 \\
B.5. Chapter 6 \\
B.6. Chapter 7 \\
Bibliography \\
Index \\
Back Cover",
}
@Article{Shen:2017:RDP,
author = "Wenting Shen and Guangyang Yang and Jia Yu and Hanlin
Zhang and Fanyu Kong and Rong Hao",
title = "Remote data possession checking with
privacy-preserving authenticators for cloud storage",
journal = j-FUT-GEN-COMP-SYS,
volume = "76",
number = "??",
pages = "136--145",
month = nov,
year = "2017",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Jul 28 15:45:46 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16304939",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Sherman:2017:ICC,
author = "Alan Sherman and Melissa Dark and Agnes Chan and Rylan
Chong and Thomas Morris and Linda Oliva and John
Springer and Bhavani Thuraisingham and Christopher
Vatcher and Rakesh Verma and Susanne Wetzel",
title = "{INSuRE}: Collaborating Centers of Academic Excellence
Engage Students in Cybersecurity Research",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "4",
pages = "72--78",
month = jul # "\slash " # aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2017.3151327",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Aug 29 06:15:10 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/04/msp2017040072-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "https://publications.computer.org/security-and-privacy/",
}
@Article{Shin:2017:CGI,
author = "Kyuyong Shin and Carlee Joe-Wong and Sangtae Ha and
Yung Yi and Injong Rhee and Douglas S. Reeves",
title = "{T-Chain}: a General Incentive Scheme for Cooperative
Computing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "4",
pages = "2122--2137",
month = aug,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2685560",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Oct 3 16:29:33 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In this paper, we propose a simple, distributed, but
highly efficient fairness-enforcing incentive mechanism
for cooperative computing. The proposed mechanism,
called triangle chaining T-Chain, enforces reciprocity
to avoid the exploitable aspects of the schemes that
allow free-riding. In T-Chain, symmetric key
cryptography provides the basis for a lightweight,
almost-fair exchange protocol, which is coupled with a
pay-it-forward mechanism. This combination increases
the opportunity for multi-lateral exchanges and further
maximizes the resource utilization of participants,
each of whom is assumed to operate solely for his or
her own benefit. T-Chain also provides barrier-free
entry to newcomers with flexible resource allocation,
allowing them to immediately benefit, and, therefore,
is suitable for dynamic environments with high churn
i.e., turnover. T-Chain is distributed and simple to
implement, as no trusted third party is required to
monitor or enforce the scheme, nor is there any
reliance on reputation information or tokens.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Shin:2017:SSD,
author = "Youngjoo Shin and Dongyoung Koo and Junbeom Hur",
title = "A Survey of Secure Data Deduplication Schemes for
Cloud Storage Systems",
journal = j-COMP-SURV,
volume = "49",
number = "4",
pages = "74:1--74:??",
month = feb,
year = "2017",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3017428",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Feb 9 09:18:20 MST 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Data deduplication has attracted many cloud service
providers (CSPs) as a way to reduce storage costs. Even
though the general deduplication approach has been
increasingly accepted, it comes with many security and
privacy problems due to the outsourced data delivery
models of cloud storage. To deal with specific security
and privacy issues, secure deduplication techniques
have been proposed for cloud data, leading to a diverse
range of solutions and trade-offs. Hence, in this
article, we discuss ongoing research on secure
deduplication for cloud data in consideration of the
attack scenarios exploited most widely in cloud
storage. On the basis of classification of
deduplication system, we explore security risks and
attack scenarios from both inside and outside
adversaries. We then describe state-of-the-art secure
deduplication techniques for each approach that deal
with different security issues under specific or
combined threat models, which include both
cryptographic and protocol solutions. We discuss and
compare each scheme in terms of security and efficiency
specific to different security goals. Finally, we
identify and discuss unresolved issues and further
research challenges for secure deduplication in cloud
storage.",
acknowledgement = ack-nhfb,
articleno = "74",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Shivani:2017:RIE,
author = "J. L. Divya Shivani and Ranjan K. Senapati",
title = "Robust Image Embedded Watermarking Using {DCT} and
Listless {SPIHT}",
journal = j-FUTURE-INTERNET,
volume = "9",
number = "3",
pages = "33",
day = "12",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi9030033",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:57 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/9/3/33",
abstract = "This paper presents a DCT-based (DCT: discrete cosine
transform) listless set partitioning in hierarchical
trees (SPIHT) digital watermarking technique that is
robust against several common attacks such as cropping,
filtering, sharpening, noise, inversion, contrast
manipulation, and compression. The proposed technique
is made further robust by the incorporation of the
Chinese remainder theorem (CRT) encryption technique.
Our scheme is compared with the recently proposed
CRT-based DCT technique, CRT-based spatial domain
watermarking, and DCT-based inter block correlation
techniques. Extensive simulation experiments show
better robustness in common image manipulations and, at
the same time, the proposed technique successfully
makes the watermark perceptually invisible. A better
Tamper Assessment Function (TAF) value of 2-15\% and a
better Normalized Correlation (NC) is achieved compared
to some of the above techniques. In particular, the
proposed technique shows better robustness on
compression attacks at moderate to higher compression
ratios. It is possible to maintain the imperceptibility
and low TAF for various values by doubling the capacity
of the watermark.",
acknowledgement = ack-nhfb,
}
@Article{Siadati:2017:MYS,
author = "Hossein Siadati and Toan Nguyen and Payas Gupta and
Markus Jakobsson and Nasir Memon",
title = "Mind your {SMSes}: Mitigating social engineering in
second factor authentication",
journal = j-COMPUT-SECUR,
volume = "65",
number = "??",
pages = "14--28",
month = mar,
year = "2017",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:48 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S016740481630116X",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Singh:2017:SCB,
author = "Priyanka Singh and Balasubramanian Raman and Nishant
Agarwal and Pradeep K. Atrey",
title = "Secure Cloud-Based Image Tampering Detection and
Localization Using {POB} Number System",
journal = j-TOMM,
volume = "13",
number = "3",
pages = "23:1--23:??",
month = aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3077140",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Sat Dec 23 10:49:22 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "The benefits of high-end computation infrastructure
facilities provided by cloud-based multimedia systems
are attracting people all around the globe. However,
such cloud-based systems possess security issues as
third party servers become involved in them. Rendering
data in an unreadable form so that no information is
revealed to the cloud data centers will serve as the
best solution to these security issues. One such image
encryption scheme based on a Permutation Ordered Binary
Number System has been proposed in this work. It
distributes the image information in totally random
shares, which can be stored at the cloud data centers.
Further, the proposed scheme authenticates the shares
at the pixel level. If any tampering is done at the
cloud servers, the scheme can accurately identify the
altered pixels via authentication bits and localizes
the tampered area. The tampered portion is also
reflected back in the reconstructed image that is
obtained at the authentic user end. The experimental
results validate the efficacy of the proposed scheme
against various kinds of possible attacks, tested with
a variety of images. The tamper detection accuracy has
been computed on a pixel basis and found to be
satisfactorily high for most of the tampering
scenarios.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Skracic:2017:AAU,
author = "Kristian Skraci{\'c} and Predrag Pale and Zvonko
Kostanjcar",
title = "Authentication approach using one-time challenge
generation based on user behavior patterns captured in
transactional data sets",
journal = j-COMPUT-SECUR,
volume = "67",
number = "??",
pages = "107--121",
month = jun,
year = "2017",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S016740481730055X",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Son:2017:NOC,
author = "Junggab Son and Donghyun Kim and Md Zakirul Alam
Bhuiyan and Rasheed Hussain and Heekuck Oh",
title = "A new outsourcing conditional proxy re-encryption
suitable for mobile cloud environment",
journal = j-CCPE,
volume = "29",
number = "14",
pages = "",
day = "25",
month = jul,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3946",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Jul 24 08:22:38 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Song:2017:PPF,
author = "Wei Song and Bing Wang and Qian Wang and Zhiyong Peng
and Wenjing Lou and Yihui Cui",
title = "A privacy-preserved full-text retrieval algorithm over
encrypted data for cloud storage applications",
journal = j-J-PAR-DIST-COMP,
volume = "99",
number = "??",
pages = "14--27",
month = jan,
year = "2017",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Thu Nov 17 09:55:21 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731516300533",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315/",
}
@Article{Song:2017:SAM,
author = "Jun Song and Fan Yang and Lizhe Wang",
title = "Secure authentication in motion: a novel online
payment framework for drive-thru {Internet}",
journal = j-FUT-GEN-COMP-SYS,
volume = "76",
number = "??",
pages = "146--158",
month = nov,
year = "2017",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Jul 28 15:45:46 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16301960",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Song:2017:SSI,
author = "Jun Song and Fan Yang and Kim-Kwang Raymond Choo and
Zhijian Zhuang and Lizhe Wang",
title = "{SIPF}: a Secure Installment Payment Framework for
Drive-Thru {Internet}",
journal = j-TECS,
volume = "16",
number = "2",
pages = "52:1--52:??",
month = apr,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3014584",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Jul 24 09:51:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Ensuring the security and privacy of vehicular ad hoc
networks (VANETs) and related services such as secure
payment has been the focus of recent research efforts.
Existing secure payment solutions generally require
stable and reliable network connection. This is,
however, a challenge in a VANET setting. Drive-thru
Internet, a secure payment solution for VANETs,
involves a great number of fast-moving vehicles
competing for connections/communications
simultaneously. Thus, service providers may find it
challenging to provide real-time payment services or
may have to sacrifice the confidentiality and the
authenticity of payment vouchers for usability. In this
article, we propose a secure installment payment
framework for drive-thru Internet deployment in a VANET
setting. The framework also provides the capability to
embody properties such as confidentiality of payment
vouchers, offline signature verification, periodical
reconciliation, and installment payment. Performance
evaluation and security analysis demonstrate the
utility of the framework in a VANET setting.",
acknowledgement = ack-nhfb,
articleno = "52",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Misc{Stevens:2017:AFS,
author = "Marc Stevens and Elie Bursztein and Pierre Karpman and
Ange Albertini and Yarik Markov and Alex Petit Bianco
and Clement Baisse",
title = "Announcing the first {SHA1} collision",
howpublished = "Web report",
day = "23",
month = feb,
year = "2017",
bibdate = "Fri Feb 24 16:52:31 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "https://security.googleblog.com/2017/02/announcing-first-sha1-collision.html",
abstract = "Today, more than 20 years after of SHA-1 was first
introduced, we are announcing the first practical
technique for generating a collision. This represents
the culmination of two years of research that sprung
from a collaboration between the CWI Institute in
Amsterdam and Google. We've summarized how we went
about generating a collision below. As a proof of the
attack, we are releasing two PDFs that have identical
SHA-1 hashes but different content.",
acknowledgement = ack-nhfb,
}
@Article{Sun:2017:CPP,
author = "Jiameng Sun and Binrui Zhu and Jing Qin and Jiankun Hu
and Qianhong Wu",
title = "Confidentiality-Preserving Publicly Verifiable
Computation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "799--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400196",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sun:2017:PKE,
author = "Shi-Feng Sun and Dawu Gu and Udaya Parampalli and Yu
Yu and Baodong Qin",
title = "Public key encryption resilient to leakage and
tampering attacks",
journal = j-J-COMP-SYS-SCI,
volume = "89",
number = "??",
pages = "142--156",
month = nov,
year = "2017",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2017.03.004",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:37 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000017300326",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Sutar:2017:DPI,
author = "Soubhagya Sutar and Arnab Raha and Devadatta Kulkarni
and Rajeev Shorey and Jeffrey Tew and Vijay
Raghunathan",
title = "{D-PUF}: An Intrinsically Reconfigurable {DRAM PUF}
for Device Authentication and Random Number
Generation",
journal = j-TECS,
volume = "17",
number = "1",
pages = "1--31",
month = dec,
year = "2017",
DOI = "https://doi.org/10.1145/3105915",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Fri Dec 8 17:33:32 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Physically Unclonable Functions (PUFs) have proved to
be an effective and low-cost measure against
counterfeiting by providing device authentication and
secure key storage services. Memory-based PUF
implementations are an attractive option due to the
ubiquitous nature of memory in electronic devices and
the requirement of minimal (or no) additional
circuitry. Dynamic Random Access Memory-(DRAM) based
PUFs are particularly advantageous due to their large
address space and multiple controllable parameters
during response generation. However, prior works on
DRAM PUFs use a static response-generation mechanism
making them vulnerable to security attacks. Further,
they result in slow device authentication, are not
applicable to commercial off-the-shelf devices, or
require DRAM power cycling prior to authentication. In
this article, we propose D-PUF, an intrinsically
reconfigurable DRAM PUF based on the idea of DRAM
refresh pausing. A key feature of the proposed DRAM PUF
is reconfigurability, that is, by varying the DRAM
refresh-pause interval, the challenge-response behavior
of the PUF can be altered, making it robust to various
attacks. The article is broadly divided into two parts.
In the first part, we demonstrate the use of D-PUF in
performing device authentication through a secure,
low-overhead methodology. In the second part, we show
the generation of true random numbers using D-PUF. The
design is implemented and validated using an Altera
Stratix IV GX FPGA-based Terasic TR4-230 development
board and several off-the-shelf 1GB DDR3 DRAM modules.
Our experimental results demonstrate a 4.3$ \times
$--6.4$ \times $ reduction in authentication time
compared to prior work. Using controlled temperature
and accelerated aging tests, we also demonstrate the
robustness of our authentication mechanism to
temperature variations and aging effects. Finally, the
ability of the design to generate random numbers is
verified using the NIST Statistical Test Suite.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Tan:2017:JDC,
author = "Rui Tan and Sheng-Yuan Chiu and Hoang Hai Nguyen and
David K. Y. Yau and Deokwoo Jung",
title = "A Joint Data Compression and Encryption Approach for
Wireless Energy Auditing Networks",
journal = j-TOSN,
volume = "13",
number = "2",
pages = "9:1--9:??",
month = jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3027489",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Mon Jul 24 09:36:37 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Fine-grained real-time metering is a fundamental
service of wireless energy auditing networks, where
metering data is transmitted from embedded wireless
power meters to gateways for centralized processing,
storage, and forwarding. Due to limited meter
capability and wireless bandwidth, the increasing
sampling rates and network scales needed to support new
energy auditing applications pose significant
challenges to metering data fidelity and secrecy. This
article exploits the compression and encryption
properties of compressive sensing (CS) to design a
joint data compression and encryption (JICE) approach
that addresses these two challenges simultaneously.
Compared with a conventional signal processing pipeline
that compresses and encrypts data sequentially, JICE
reduces computation and space complexities due to its
simple design. It thus leaves more processor time and
available buffer space for handling lossy wireless
transmissions. Moreover, JICE features an adaptive
reconfiguration mechanism that selects the signal
representation basis of CS at runtime among several
candidate bases to achieve the best fidelity of the
recovered data at the gateways. This mechanism enables
JICE to adapt to changing power consumption patterns.
On a smart plug platform, we implemented JICE and
several baseline approaches including downsampling,
lossless compression, and the pipeline approach.
Extensive testbed experiments show that JICE achieves
higher data delivery ratios and lower recovery
distortions under a range of realistic settings. In
particular, at a meter sampling rate of 8 Hz, JICE
increases the number of meters supported by a gateway
by 50\%, compared with the commonly used pipeline
approach, while keeping a signal distortion rate lower
than 5\%.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Tankard:2017:BNK,
author = "Colin Tankard",
title = "{BYOE}: New kid on the block",
journal = j-NETWORK-SECURITY,
volume = "2017",
number = "11",
pages = "20--20",
month = nov,
year = "2017",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(17)30096-X",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:52 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S135348581730096X",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
keywords = "bring your own encryption (BYOE)",
}
@Article{Tankard:2017:ECB,
author = "Colin Tankard",
title = "Encryption as the cornerstone of big data security",
journal = j-NETWORK-SECURITY,
volume = "2017",
number = "3",
pages = "5--7",
month = mar,
year = "2017",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(17)30025-9",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:01:43 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485817300259",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Taylor:2017:EBH,
author = "Michael Bedford Taylor",
title = "The Evolution of {Bitcoin} Hardware",
journal = j-COMPUTER,
volume = "50",
number = "9",
pages = "58--66",
month = sep,
year = "2017",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2017.3571056",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Thu Nov 30 15:24:52 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.computer.org/csdl/mags/co/2017/09/mco2017090058-abs.html",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
keywords = "application specific integrated circuits;
application-specific integrated circuit; ASIC; ASIC
clouds; ASICMiner; AvalonBitFury; Bitmain; blockchain;
Butterfly Labs; cloud; computer centres;
cryptocurrencies; cryptocurrency; cryptography; Data
mining; datacenter; datacenters; digital currency;
Exchange rates; Field programmable gate arrays;
financial technology; GPU; Graphics processing units;
graphics processing units; Hardware; hardware; hashing;
homebrew machines; planet-scale computing; {Bitcoin};
{Bitcoin} hardware",
}
@Article{Tewari:2017:CNU,
author = "Aakanksha Tewari and B. B. Gupta",
title = "Cryptanalysis of a novel ultra-lightweight mutual
authentication protocol for {IoT} devices using {RFID}
tags",
journal = j-J-SUPERCOMPUTING,
volume = "73",
number = "3",
pages = "1085--1102",
month = mar,
year = "2017",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1849-x",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jun 24 10:31:32 MDT 2017",
bibsource = "http://link.springer.com/journal/11227/73/3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.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{Tian:2017:ORA,
author = "Yangguang Tian and Guomin Yang and Yi Mu and Shiwei
Zhang and Kaitai Liang and Yong Yu",
title = "One-Round Attribute-Based Key Exchange in the
Multi-Party Setting",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "725--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400159",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tian:2017:RSP,
author = "Z. Tian and T. Liu and Q. Zheng and E. Zhuang and M.
Fan and Z. Yang",
title = "Reviving Sequential Program Birthmarking for
Multithreaded Software Plagiarism Detection",
journal = j-IEEE-TRANS-SOFTW-ENG,
volume = "PP",
number = "99",
pages = "1--1",
month = "????",
year = "2017",
CODEN = "IESEDJ",
DOI = "https://doi.org/10.1109/TSE.2017.2688383",
ISSN = "0098-5589 (print), 1939-3520 (electronic)",
ISSN-L = "0098-5589",
bibdate = "Thu Feb 1 19:49:24 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng2010.bib;
https://www.math.utah.edu/pub/tex/bib/multithreading.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=7888597",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Software Engineering",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}
@Article{Toreini:2017:TRP,
author = "Ehsan Toreini and Siamak F. Shahandashti and Feng
Hao",
title = "Texture to the Rescue: Practical Paper Fingerprinting
Based on Texture Patterns",
journal = j-TOPS,
volume = "20",
number = "3",
pages = "9:1--9:??",
month = aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3092816",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
ISSN-L = "2471-2566",
bibdate = "Sat Dec 23 09:59:06 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
abstract = "In this article, we propose a novel paper
fingerprinting technique based on analyzing the
translucent patterns revealed when a light source
shines through the paper. These patterns represent the
inherent texture of paper, formed by the random
interleaving of wooden particles during the
manufacturing process. We show that these patterns can
be easily captured by a commodity camera and condensed
into a compact 2,048-bit fingerprint code. Prominent
works in this area (Nature 2005, IEEE S8P 2009, CCS
2011) have all focused on fingerprinting paper based on
the paper ``surface.'' We are motivated by the
observation that capturing the surface alone misses
important distinctive features such as the noneven
thickness, random distribution of impurities, and
different materials in the paper with varying
opacities. Through experiments, we demonstrate that the
embedded paper texture provides a more reliable source
for fingerprinting than features on the surface. Based
on the collected datasets, we achieve 0\% false
rejection and 0\% false acceptance rates. We further
report that our extracted fingerprints contain 807
degrees of freedom (DoF), which is much higher than the
249 DoF with iris codes (that have the same size of
2,048 bits). The high amount of DoF for texture-based
fingerprints makes our method extremely scalable for
recognition among very large databases; it also allows
secure usage of the extracted fingerprint in
privacy-preserving authentication schemes based on
error correction techniques.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Treleaven:2017:BTF,
author = "Philip Treleaven and Richard Gendal Brown and Danny
Yang",
title = "Blockchain Technology in Finance",
journal = j-COMPUTER,
volume = "50",
number = "9",
pages = "14--17",
month = sep,
year = "2017",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Mon Oct 2 08:46:55 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.computer.org/csdl/mags/co/2017/09/mco2017090014.html",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Tuna:2017:SIS,
author = "Gurkan Tuna and Dimitrios G. Kogias and V. Cagri
Gungor and Cengiz Gezer and Erhan Taskin and Erman
Ayday",
title = "A survey on information security threats and solutions
for {Machine to Machine (M2M)} communications",
journal = j-J-PAR-DIST-COMP,
volume = "109",
number = "??",
pages = "142--154",
month = nov,
year = "2017",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Sat Aug 19 13:10:32 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731517301867",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{vandeGraaf:2017:LTT,
author = "Jeroen van de Graaf",
title = "Long-Term Threats to Ballot Privacy",
journal = j-IEEE-SEC-PRIV,
volume = "15",
number = "3",
pages = "40--47",
month = may # "\slash " # jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2017.77",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Jul 25 21:35:08 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2017/03/msp2017030040-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "https://publications.computer.org/security-and-privacy/",
}
@Article{vanRijswijk-Deij:2017:PIE,
author = "Roland van Rijswijk-Deij and Kaspar Hageman and Anna
Sperotto and Aiko Pras",
title = "The Performance Impact of Elliptic Curve Cryptography
on {DNSSEC} Validation",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "2",
pages = "738--750",
month = apr,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2605767",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon Jun 5 18:46:21 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The domain name system DNS is a core Internet
infrastructure that translates names to
machine-readable information, such as IP addresses.
Security flaws in DNS led to a major overhaul, with the
introduction of the DNS security DNSSEC extensions.
DNSSEC adds integrity and authenticity to the DNS using
digital signatures. DNSSEC, however, has its own
concerns. It suffers from availability problems due to
packet fragmentation and is a potent source of
distributed denial-of-service attacks. In earlier work,
we argued that many issues with DNSSEC stem from the
choice of RSA as default signature algorithm. A switch
to alternatives based on elliptic curve cryptography
ECC can resolve these issues. Yet switching to ECC
introduces a new problem: ECC signature validation is
much slower than RSA validation. Thus, switching DNSSEC
to ECC imposes a significant additional burden on DNS
resolvers, pushing load toward the edges of the
network. Therefore, in this paper, we study the
question: will switching DNSSEC to ECC lead to problems
for DNS resolvers, or can they handle the extra load?
To answer this question, we developed a model that
accurately predicts how many signature validations DNS
resolvers have to perform. This allows us to calculate
the additional CPU load ECC imposes on a resolver.
Using real-world measurements from four DNS resolvers
and with two open-source DNS implementations, we
evaluate future scenarios where DNSSEC is universally
deployed. Our results conclusively show that switching
DNSSEC to ECC signature schemes does not impose an
insurmountable load on DNS resolvers, even in worst
case scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Vasiliadis:2017:DIS,
author = "Giorgos Vasiliadis and Lazaros Koromilas and Michalis
Polychronakis and Sotiris Ioannidis",
title = "Design and Implementation of a Stateful Network Packet
Processing Framework for {GPUs}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "25",
number = "1",
pages = "610--623",
month = feb,
year = "2017",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2016.2597163",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Mar 25 08:05:37 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Graphics processing units GPUs are a powerful platform
for building the high-speed network traffic processing
applications using low-cost hardware. The existing
systems tap the massively parallel architecture of GPUs
to speed up certain computationally intensive tasks,
such as cryptographic operations and pattern matching.
However, they still suffer from significant overheads
due to critical-path operations that are still being
carried out on the CPU, and redundant inter-device data
transfers. In this paper, we present GASPP, a
programmable network traffic processing framework
tailored to modern graphics processors. GASPP
integrates optimized GPU-based implementations of a
broad range of operations commonly used in the network
traffic processing applications, including the first
purely GPU-based implementation of network flow
tracking and TCP stream reassembly. GASPP also employs
novel mechanisms for tackling the control flow
irregularities across SIMT threads, and for sharing the
memory context between the network interfaces and the
GPU. Our evaluation shows that GASPP can achieve
multigigabit traffic forwarding rates even for complex
and computationally intensive network operations, such
as stateful traffic classification, intrusion
detection, and packet encryption. Especially when
consolidating multiple network applications on the same
system, GASPP achieves up to $ 16.2 \times $ speedup
compared with different monolithic GPU-based
implementations of the same applications.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Venkatakrishnan:2017:DRB,
author = "Shaileshh Bojja Venkatakrishnan and Giulia Fanti and
Pramod Viswanath",
title = "{Dandelion}: Redesigning the {Bitcoin} Network for
Anonymity",
journal = j-POMACS,
volume = "1",
number = "1",
pages = "22:1--22:??",
month = jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3084459",
ISSN = "2476-1249",
ISSN-L = "2476-1249",
bibdate = "Fri Jun 16 09:11:52 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/pomacs.bib",
URL = "http://dl.acm.org/citation.cfm?id=3084459",
abstract = "Bitcoin and other cryptocurrencies have surged in
popularity over the last decade. Although Bitcoin does
not claim to provide anonymity for its users, it enjoys
a public perception of being a privacy preserving
financial system. In reality, cryptocurrencies publish
users' entire transaction histories in plaintext,
albeit under a pseudonym; this is required for
transaction validation. Therefore, if a user's
pseudonym can be linked to their human identity, the
privacy fallout can be significant. Recently,
researchers have demonstrated deanonymization attacks
that exploit weaknesses in the Bitcoin network's
peer-to-peer (P2P) networking protocols. In particular,
the P2P network currently forwards content in a
structured way that allows observers to deanonymize
users. In this work, we redesign the P2P network from
first principles with the goal of providing strong,
provable anonymity guarantees. We propose a simple
networking policy called Dandelion which provides
quasi-optimal, network-wide anonymity, with minimal
cost to the network's utility. We also discuss
practical implementation challenges and propose
heuristic solutions.",
acknowledgement = ack-nhfb,
articleno = "22",
fjournal = "Proceedings of the ACM on Measurement and Analysis of
Computing Systems (POMACS)",
journal-URL = "http://dl.acm.org/pub.cfm?id=J1567",
}
@Article{Venkatakrishnan:2017:DRBb,
author = "Shaileshh Bojja Venkatakrishnan and Giulia Fanti and
Pramod Viswanath",
title = "{Dandelion}: Redesigning the {Bitcoin} Network for
Anonymity",
journal = j-POMACS,
volume = "1",
number = "1",
pages = "22:1--22:34",
month = jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3084459",
ISSN = "2476-1249",
ISSN-L = "2476-1249",
bibdate = "Fri Jun 16 09:11:52 MDT 2017",
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/pomacs.bib",
URL = "http://dl.acm.org/citation.cfm?id=3084459",
abstract = "Bitcoin and other cryptocurrencies have surged in
popularity over the last decade. Although Bitcoin does
not claim to provide anonymity for its users, it enjoys
a public perception of being a privacy preserving
financial system. In reality, cryptocurrencies publish
users' entire transaction histories in plaintext,
albeit under a pseudonym; this is required for
transaction validation. Therefore, if a user's
pseudonym can be linked to their human identity, the
privacy fallout can be significant. Recently,
researchers have demonstrated deanonymization attacks
that exploit weaknesses in the Bitcoin network's
peer-to-peer (P2P) networking protocols. In particular,
the P2P network currently forwards content in a
structured way that allows observers to deanonymize
users. In this work, we redesign the P2P network from
first principles with the goal of providing strong,
provable anonymity guarantees. We propose a simple
networking policy called Dandelion which provides
quasi-optimal, network-wide anonymity, with minimal
cost to the network's utility. We also discuss
practical implementation challenges and propose
heuristic solutions.",
acknowledgement = ack-nhfb,
articleno = "22",
fjournal = "Proceedings of the ACM on Measurement and Analysis of
Computing Systems (POMACS)",
journal-URL = "http://dl.acm.org/pub.cfm?id=J1567",
}
@Article{Vergnaud:2017:CAB,
author = "Damien Vergnaud",
title = "Comment on {`Attribute-Based Signatures for Supporting
Anonymous Certification' by N. Kaaniche and M. Laurent
(ESORICS 2016)}",
journal = j-COMP-J,
volume = "60",
number = "12",
pages = "1801--1808",
day = "1",
month = dec,
year = "2017",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxx058",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Jan 8 08:15:52 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/12/1801/3861971",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Vollala:2017:EEM,
author = "Satyanarayana Vollala and Ramasubramanian N.",
title = "Energy efficient modular exponentiation for public-key
cryptography based on bit forwarding techniques",
journal = j-INFO-PROC-LETT,
volume = "119",
number = "??",
pages = "25--38",
month = mar,
year = "2017",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Dec 19 07:37:49 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019016301715",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Wang:2017:ABS,
author = "Qi Wang and Xiangxue Li and Yu Yu",
title = "Anonymity for {Bitcoin} from Secure Escrow Address",
journal = j-IEEE-ACCESS,
volume = "??",
number = "??",
pages = "1--1",
month = "????",
year = "2017",
DOI = "https://doi.org/10.1109/ACCESS.2017.2787563",
ISSN = "2169-3536",
ISSN-L = "2169-3536",
bibdate = "Sun Jan 21 12:22:33 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Access",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6287639",
keywords = "Address Shuffling; Anonymity; Bitcoin; Distribute Key
Generation; Encryption; Indexes; Privacy; Protocols;
Public key",
}
@Article{Wang:2017:CAS,
author = "Changji Wang and Yuan Li and Jian Fang and Jianguo
Xie",
title = "Cloud-aided scalable revocable identity-based
encryption scheme with ciphertext update",
journal = j-CCPE,
volume = "29",
number = "20",
pages = "??--??",
day = "25",
month = oct,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4035",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Oct 2 11:26:28 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Wang:2017:CES,
author = "Xu An Wang and Jianfeng Ma and Fatos Xhafa and Mingwu
Zhang and Xiaoshuang Luo",
title = "Cost-effective secure E-health cloud system using
identity based cryptographic techniques",
journal = j-FUT-GEN-COMP-SYS,
volume = "67",
number = "??",
pages = "242--254",
month = feb,
year = "2017",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Nov 22 14:20:56 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16302588",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Wang:2017:DRM,
author = "Yi Wang and Yajun Ha",
title = "A {DFA}-Resistant and Masked {PRESENT} with Area
Optimization for {RFID} Applications",
journal = j-TECS,
volume = "16",
number = "4",
pages = "102:1--102:??",
month = aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3035543",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Aug 14 18:53:33 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Radio-Frequency Identification (RFID) tag-based
applications are usually resource constrained and
security sensitive. However, only about 2,000 gate
equivalents in a tag can be budgeted for implementing
security components [27]. This requires not only
lightweight cryptographic algorithms such as PRESENT
(around 1,000 gate equivalents) but also lightweight
protections against modern Side Channel Attacks (SCAs).
With this budget, the first-order masking and fault
detection are two suitable countermeasures to be
developed for PRESENT. However, if both countermeasures
are applied without any optimization, it will
significantly exceed the given area budget. In this
work, we optimize area to include both countermeasures
to maximize the security for PRESENT within this RFID
area budget. The most area-consuming parts of the
proposed design are the masked S-boxes and the inverse
masked S-boxes. To optimize the area, we have deduced a
computational relationship between these two parts,
which enables us to reuse the hardware resource of the
masked S-boxes to implement the inverse masked S-boxes.
The proposed design takes up only 2,376 gates with UMC
65nm CMOS technology. Compared with the unoptimized
design, our implementation reduces the overall area by
28.45\%. We have tested the effectiveness of the
first-order Differential Power Analysis (DPA) and
Differential Fault Analysis (DFA) -resistant
countermeasures. Experimental results show that we have
enhanced the SCA resistance of our PRESENT
implementation.",
acknowledgement = ack-nhfb,
articleno = "102",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Wang:2017: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 = "??",
number = "??",
pages = "??--??",
month = "????",
year = "2017",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Dec 1 11:14:22 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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:2017:FWA,
author = "Ran Wang and Guangquan Xu and Bin Liu and Yan Cao and
Xiaohong Li",
title = "Flow Watermarking for Antinoise and Multistream
Tracing in Anonymous Networks",
journal = j-IEEE-MULTIMEDIA,
volume = "24",
number = "4",
pages = "38--47",
month = oct # "\slash " # dec,
year = "2017",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2017.4031314",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Mon Jan 15 08:09:14 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
URL = "https://www.computer.org/csdl/mags/mu/2017/04/mmu2017040038-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/multimedia/",
}
@Article{Wang:2017:PPD,
author = "Xiaofen Wang and Yi Mu and Rongmao Chen",
title = "Privacy-preserving data search and sharing protocol
for social networks through wireless applications",
journal = j-CCPE,
volume = "29",
number = "7",
pages = "??--??",
day = "10",
month = apr,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3870",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Fri Mar 31 19:12:52 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Wang:2017:PPK,
author = "Yujue Wang and HweeHwa Pang",
title = "Probabilistic Public Key Encryption for Controlled
Equijoin in Relational Databases",
journal = j-COMP-J,
volume = "60",
number = "4",
pages = "600--612",
day = "23",
month = mar,
year = "2017",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/4/600/2354608",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Wang:2017:RRA,
author = "YiPeng Wang and Xiaochun Yun and Yongzheng Zhang and
Liwei Chen and Tianning Zang",
title = "Rethinking robust and accurate application protocol
identification",
journal = j-COMP-NET-AMSTERDAM,
volume = "129 (part 1)",
number = "??",
pages = "64--78",
day = "24",
month = dec,
year = "2017",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Nov 22 06:05:46 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128617303572",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Wang:2017:SRS,
author = "Wei Wang and Peng Xu and Laurence Tianruo Yang and
Willy Susilo and Jinjun Chen",
title = "Securely Reinforcing Synchronization for Embedded
Online Contests",
journal = j-TECS,
volume = "16",
number = "2",
pages = "58:1--58:??",
month = apr,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2899000",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Jul 24 09:51:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "When competing in eBay bidding, online games, or
e-exams in embedded computing environments, people
naturally face asynchronous starts from different
computing devices, which is treated as a security risk
of online contests. The security risks of online
contests also include eavesdropping during data
transmission without intended rights, and false starts
by malicious competitors, which also means asynchrony
in contests. Accordingly, online contests need security
guarantees, especially on synchronization. In this
article, for synchronic and secure starts in a contest,
we update security requirements of confidentiality,
anonymity, and synchrony, comparing the current work to
our previous work. Based on the updated requirements,
we propose a general framework for the Advanced Secure
Synchronized Reading (ASSR) system, which can hold
multiple contests simultaneously in the cloud. It is
important to note that the system can ignore the
impacts of heterogeneity among competitors. Considering
the heterogeneity both on transmission and computing,
we construct a novel Randomness-reused Identity Based
Key Encapsulation Mechanism (RIBKEM) to support
separable decapsulation, which can shorten both
decryption delay and transmission delay with the best
efforts. Finally, ASSR enhances synchronization
achievement for contest starts with heterogeneous
delays of competitors while satisfying other security
requirements. As a complement, the analysis on the
provable security of ASSR is given, as well as a
further analysis on the achievement of
synchronization.",
acknowledgement = ack-nhfb,
articleno = "58",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Wei:2017:CES,
author = "Jianghong Wei and Xinyi Huang and Wenfen Liu and
Xuexian Hu",
title = "Cost-Effective and Scalable Data Sharing in Cloud
Storage Using Hierarchical Attribute-Based Encryption
with Forward Security",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "7",
pages = "843--??",
month = nov,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500289",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Feb 24 10:21:24 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Weisse:2017:RLC,
author = "Ofir Weisse and Valeria Bertacco and Todd Austin",
title = "Regaining Lost Cycles with {HotCalls}: a Fast
Interface for {SGX} Secure Enclaves",
journal = j-COMP-ARCH-NEWS,
volume = "45",
number = "2",
pages = "81--93",
month = may,
year = "2017",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/3140659.3080208",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri Sep 15 11:09:14 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "Intel's SGX secure execution technology allows running
computations on secret data using untrusted servers.
While recent work showed how to port applications and
large-scale computations to run under SGX, the
performance implications of using the technology
remains an open question. We present the first
comprehensive quantitative study to evaluate the
performance of SGX. We show that straightforward use of
SGX library primitives for calling functions add
between 8,200 --- 17,000 cycles overhead, compared to
150 cycles of a typical system call. We quantify the
performance impact of these library calls and show that
in applications with high system calls frequency, such
as memcached, openVPN, and lighttpd, which all have
high bandwidth network requirements, the performance
degradation may be as high as 79\%. We investigate the
sources of this performance degradation by leveraging a
new set of microbenchmarks for SGX-specific operations
such as enclave entry-calls and out-calls, and
encrypted memory I/O accesses. We leverage the insights
we gain from these analyses to design a new SGX
interface framework HotCalls. HotCalls are based on a
synchronization spin-lock mechanism and provide a
13-27x speedup over the default interface. It can
easily be integrated into existing code, making it a
practical solution. Compared to a baseline SGX
implementation of memcached, openVPN, and lighttpd ---
we show that using the new interface boosts the
throughput by 2.6-3.7x, and reduces application latency
by 62-74\%.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Werner:2017:CIM,
author = "Jorge Werner and Carla Merkle Westphall and Carlos
Becker Westphall",
title = "Cloud identity management: a survey on privacy
strategies",
journal = j-COMP-NET-AMSTERDAM,
volume = "122",
number = "??",
pages = "29--42",
day = "20",
month = jul,
year = "2017",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Thu Jul 20 08:30:08 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128617301664",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Misc{Winder:2017:ROS,
author = "Davey Winder",
title = "Researchers open sliding window to completely break
{\tt libgcrypt} {RSA-1024}",
howpublished = "Web blog.",
day = "6",
month = jul,
year = "2017",
bibdate = "Tue Jul 11 16:58:04 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "See \cite{Bernstein:2017:SRD}.",
URL = "https://www.scmagazineuk.com/researchers-open-sliding-window-to-completely-break-libgcrypt-rsa-1024/article/673178/",
abstract = "The libgcrypt encryption library as used by the open
source Gnu Privacy Guard (GnuPG) has been cracked wide
open by researchers from the universities of Adelaide,
Eindhoven, Illinois, Maryland and Pennsylvania.",
acknowledgement = ack-nhfb,
remark = "Security hole was fixed in libgcrypt-1.7.8, released
29 June 2017.",
}
@Article{Wu:2017:EAK,
author = "Fan Wu and Lili Xu and Saru Kumari and Xiong Li and
Jian Shen and Kim-Kwang Raymond Choo and Mohammad Wazid
and Ashok Kumar Das",
title = "An efficient authentication and key agreement scheme
for multi-gateway wireless sensor networks in {IoT}
deployment",
journal = j-J-NETW-COMPUT-APPL,
volume = "89",
number = "??",
pages = "72--85",
day = "1",
month = jul,
year = "2017",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sat Jul 29 15:40:54 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804516303150",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Wu:2017:HMA,
author = "Ying Wu and Jinyong Chang and Rui Xue and Rui Zhang",
title = "Homomorphic {MAC} from Algebraic One-Way Functions for
Network Coding with Small Key Size",
journal = j-COMP-J,
volume = "60",
number = "12",
pages = "1785--1800",
day = "1",
month = dec,
year = "2017",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxx055",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Jan 8 08:15:52 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/12/1785/3885827",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Wu:2017:SPM,
author = "Wei-Chen Wu",
title = "A secret push messaging service in {VANET} clouds",
journal = j-J-SUPERCOMPUTING,
volume = "73",
number = "7",
pages = "3085--3097",
month = jul,
year = "2017",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1932-3",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Mon Oct 2 11:08:37 MDT 2017",
bibsource = "http://link.springer.com/journal/11227/73/7;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Xiong:2017:CCC,
author = "Hu Xiong and Qiang Wang and Jianfei Sun",
title = "Comments on {``Circuit ciphertext-policy
attribute-based hybrid encryption with verifiable
delegation''}",
journal = j-INFO-PROC-LETT,
volume = "127",
number = "??",
pages = "67--70",
month = nov,
year = "2017",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri Aug 25 11:11:26 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
note = "See \cite{Xu:2016:CCP}.",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019017301308",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Xu:2017:EOS,
author = "Rui Xu and Kirill Morozov and Yanjiang Yang and
Jianying Zhou and Tsuyoshi Takagi",
title = "Efficient outsourcing of secure $k$-nearest neighbour
query over encrypted database",
journal = j-COMPUT-SECUR,
volume = "69",
number = "??",
pages = "65--83",
month = aug,
year = "2017",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404816301651",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Xu:2017:GKG,
author = "Weitao Xu and Chitra Javali and Girish Revadigar and
Chengwen Luo and Neil Bergmann and Wen Hu",
title = "{Gait-Key}: a Gait-Based Shared Secret Key Generation
Protocol for Wearable Devices",
journal = j-TOSN,
volume = "13",
number = "1",
pages = "6:1--6:??",
month = feb,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3023954",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Mon Jul 24 09:36:36 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Recent years have witnessed a remarkable growth in the
number of smart wearable devices. For many of these
devices, an important security issue is to establish an
authenticated communication channel between legitimate
devices to protect the subsequent communications. Due
to the wireless nature of the communication and the
extreme resource constraints of sensor devices,
providing secure, efficient, and user-friendly device
pairing is a challenging task. Traditional solutions
for device pairing mostly depend on key
predistribution, which is unsuitable for wearable
devices in many ways. In this article, we design
Gait-Key, a shared secret key generation scheme that
allows two legitimate devices to establish a common
cryptographic key by exploiting users' walking
characteristics (gait). The intuition is that the
sensors on different locations on the same body
experience similar accelerometer signals when the user
is walking. However, one main challenge is that the
accelerometer also captures motion signals produced by
other body parts (e.g., swinging arms). We address this
issue by using the blind source separation technique to
extract the informative signal produced by the unique
gait patterns. Our experimental results show that
Gait-Key can generate a common 128-bit key for two
legitimate devices with 98.3\% probability. To
demonstrate the feasibility, the proposed key
generation scheme is implemented on modern smartphones.
The evaluation results show that the proposed scheme
can run in real time on modern mobile devices and
incurs low system overhead.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Xu:2017:SEP,
author = "Zhiyan Xu and Libing Wu and Muhammad Khurram Khan and
Kim-Kwang Raymond Choo and Debiao He",
title = "A secure and efficient public auditing scheme using
{RSA} algorithm for cloud storage",
journal = j-J-SUPERCOMPUTING,
volume = "73",
number = "12",
pages = "5285--5309",
month = dec,
year = "2017",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-017-2085-8",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jan 6 08:59:18 MST 2018",
bibsource = "http://link.springer.com/journal/11227/73/12;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Xue:2017:CNC,
author = "Kaiping Xue and Jianan Hong and Yingjie Xue and David
S. L. Wei and Nenghai Yu and Peilin Hong",
title = "{CABE}: A New Comparable Attribute-Based Encryption
Construction with $0$-Encoding and $1$-Encoding",
journal = j-IEEE-TRANS-COMPUT,
volume = "66",
number = "9",
pages = "1491--1503",
month = sep,
year = "2017",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2017.2693265",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Aug 17 10:06:38 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/document/7896558/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Yakubu:2017:SSN,
author = "Abukari M. Yakubu and Namunu C. Maddage and Pradeep K.
Atrey",
title = "Securing Speech Noise Reduction in Outsourced
Environment",
journal = j-TOMM,
volume = "13",
number = "4",
pages = "51:1--51:??",
month = oct,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3105970",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Sat Dec 23 10:49:23 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Cloud data centers (CDCs) are becoming a
cost-effective method for processing and storage of
multimedia data including images, video, and audio.
Since CDCs are physically located in different
jurisdictions, and are managed by external parties,
data security is a growing concern. Data encryption at
CDCs is commonly practiced to improve data security.
However, to process the data at CDCs, data must often
be decrypted, which raises issues in security. Thus,
there is a growing demand for data processing
techniques in encrypted domain in such an outsourced
environment. In this article, we analyze encrypted
domain speech content processing techniques for noise
reduction. Noise contaminates speech during
transmission or during the acquisition process by
recording. As a result, the quality of the speech
content is degraded. We apply Shamir's secret sharing
as the cryptosystem to encrypt speech data before
uploading it to a CDC. We then propose finite impulse
response digital filters to reduce white and wind noise
in the speech in the encrypted domain. We prove that
our proposed schemes meet the security requirements of
efficiency, accuracy, and checkability for both
semi-honest and malicious adversarial models.
Experimental results show that our proposed filtering
techniques for speech noise reduction in the encrypted
domain produce similar results when compared to
plaintext domain processing.",
acknowledgement = ack-nhfb,
articleno = "51",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Yamada:2017:EPA,
author = "Asahiko Yamada and Tatsuro Ikeda",
title = "Enhanced {PKI} authentication with trusted product at
claimant",
journal = j-COMPUT-SECUR,
volume = "67",
number = "??",
pages = "324--334",
month = jun,
year = "2017",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404817300044",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Yan:2017:PIS,
author = "Jianhua Yan and Licheng Wang and Jing Li and Muzi Li
and Yixan Yang and Wenbin Yao",
title = "Pre-image sample algorithm with irregular {Gaussian}
distribution and construction of identity-based
signature",
journal = j-CCPE,
volume = "29",
number = "20",
pages = "??--??",
day = "25",
month = oct,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3925",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Oct 2 11:26:28 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Yang:2017:CCS,
author = "Kun Yang and Domenic Forte and Mark M. Tehranipoor",
title = "{CDTA}: a Comprehensive Solution for Counterfeit
Detection, Traceability, and Authentication in the
{IoT} Supply Chain",
journal = j-TODAES,
volume = "22",
number = "3",
pages = "42:1--42:??",
month = may,
year = "2017",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/3005346",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Jul 21 10:49:30 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "The Internet of Things (IoT) is transforming the way
we live and work by increasing the connectedness of
people and things on a scale that was once
unimaginable. However, the vulnerabilities in the IoT
supply chain have raised serious concerns about the
security and trustworthiness of IoT devices and
components within them. Testing for device provenance,
detection of counterfeit integrated circuits (ICs) and
systems, and traceability of IoT devices are
challenging issues to address. In this article, we
develop a novel radio-frequency identification
(RFID)-based system suitable for counterfeit detection,
traceability, and authentication in the IoT supply
chain called CDTA. CDTA is composed of different types
of on-chip sensors and in-system structures that
collect necessary information to detect multiple
counterfeit IC types (recycled, cloned, etc.), track
and trace IoT devices, and verify the overall system
authenticity. Central to CDTA is an RFID tag employed
as storage and a channel to read the information from
different types of chips on the printed circuit board
(PCB) in both power-on and power-off scenarios. CDTA
sensor data can also be sent to the remote server for
authentication via an encrypted Ethernet channel when
the IoT device is deployed in the field. A novel board
ID generator is implemented by combining outputs of
physical unclonable functions (PUFs) embedded in the
RFID tag and different chips on the PCB. A light-weight
RFID protocol is proposed to enable mutual
authentication between RFID readers and tags. We also
implement a secure interchip communication on the PCB.
Simulations and experimental results using Spartan 3E
FPGAs demonstrate the effectiveness of this system. The
efficiency of the radio-frequency (RF) communication
has also been verified via a PCB prototype with a
printed slot antenna.",
acknowledgement = ack-nhfb,
articleno = "42",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Yang:2017:SAS,
author = "Ying Yang and Ruggero Pintus and Holly Rushmeier and
Ioannis Ivrissimtzis",
title = "A {$3$D} Steganalytic Algorithm and
Steganalysis-Resistant Watermarking",
journal = j-IEEE-TRANS-VIS-COMPUT-GRAPH,
volume = "23",
number = "2",
pages = "1002--1013",
month = feb,
year = "2017",
CODEN = "ITVGEA",
ISSN = "1077-2626 (print), 1941-0506 (electronic), 2160-9306",
ISSN-L = "1077-2626",
bibdate = "Wed Jan 4 16:45:57 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransviscomputgraph.bib/",
URL = "https://www.computer.org/csdl/trans/tg/2017/02/07399411-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}
@Article{Yang:2017:SKS,
author = "Yang Yang and Xianghan Zheng and Victor Chang and
Chunming Tang",
title = "Semantic keyword searchable proxy re-encryption for
postquantum secure cloud storage",
journal = j-CCPE,
volume = "29",
number = "19",
pages = "??--??",
day = "10",
month = oct,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4211",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Oct 2 11:26:27 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@InProceedings{Ye:2017:VCS,
author = "Katherine Q. Ye and Matthew Green and Naphat
Sanguansin and Lennart Beringer and Adam Petcher and
Andrew W. Appel",
editor = "{ACM}",
booktitle = "{Proceedings of CCS 17, October 30--November 3, 2017,
Dallas, TX, USA}",
title = "Verified Correctness and Security of {mbedTLS
HMAC-DRBG}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "1--14",
year = "2017",
DOI = "https://doi.org/10.1145/3133956.3133974",
ISBN = "1-4503-4946-3",
ISBN-13 = "978-1-4503-4946-8",
LCCN = "????",
bibdate = "Fri Sep 15 09:34:01 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.cs.princeton.edu/~appel/papers/verified-hmac-drbg.pdf",
abstract = "We have formalized the functional specification of
HMAC-DRBG (NIST 800-90A), and we have proved its
cryptographic security --- that its output is
pseudorandom --- using a hybrid game-based proof. We
have also proved that the mbedTLS implementation (C
program) correctly implements this functional
specification. That proof composes with an existing C
compiler correctness proof to guarantee, end-to-end,
that the machine language program gives strong
pseudorandomness. All proofs (hybrid games, C program
verification, compiler, and their composition) are
machine-checked in the Coq proof assistant. Our proofs
are modular: the hybrid game proof holds on any
implementation of HMAC-DRBG that satisfies our
functional specification. Therefore, our functional
specification can serve as a high-assurance
reference.",
acknowledgement = ack-nhfb,
remark = "Check final published page numbers??",
}
@Article{Yeh:2017:SIB,
author = "Lo-Yao Yeh and Woei-Jiunn Tsaur and Hsin-Han Huang",
title = "Secure {IoT}-Based, Incentive-Aware Emergency
Personnel Dispatching Scheme with Weighted Fine-Grained
Access Control",
journal = j-TIST,
volume = "9",
number = "1",
pages = "10:1--10:??",
month = oct,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3063716",
ISSN = "2157-6904 (print), 2157-6912 (electronic)",
ISSN-L = "2157-6904",
bibdate = "Sat Dec 23 10:12:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tist.bib",
abstract = "Emergency response times following a traffic accident
are extremely crucial in reducing the number of
traffic-related deaths. Existing emergency vehicle
dispatching systems rely heavily on manual assignments.
Although some technology-assisted emergency systems
engage in emergency message dissemination and path
planning, efficient emergency response is one of the
main factors that can decrease traffic-related deaths.
Obviously, effective emergency response often plays a
far more important role in a successful rescue. In this
article, we propose a secure IoT-based and
incentive-aware emergency personnel dispatching scheme
(EPDS) with weighted fine-grained access control. Our
EPDS can recruit available medical personnel
on-the-fly, such as physicians driving in the vicinity
of the accident scene. An appropriate incentive, such
as paid leave, can be offered to encourage medical
personnel to join rescue missions. Furthermore,
IoT-based devices are installed in vehicles or wearable
on drivers to gather biometric signals from the driver,
which can be used to decide precisely which divisions
or physicians are needed to administer the appropriate
remedy. Additionally, our scheme can cryptographically
authorize the assigned rescue vehicle to control
traffic to increase rescue efficacy. Our scheme also
takes advantage of adjacent roadside units to organize
the appropriate rescue personnel without requiring
long-distance communication with a trusted traffic
authority. Proof of security is provided and extensive
analyses, including qualitative and quantitative
analyses and simulations, show that the proposed scheme
can significantly improve rescue response time and
effectiveness. To the best of our knowledge, this is
the first work to make use of medical personnel that
are close by in emergency rescue missions.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Intelligent Systems and Technology
(TIST)",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1318",
}
@Article{Yi:2017:ICM,
author = "Haibo Yi and Weijian Li",
title = "On the Importance of Checking Multivariate Public Key
Cryptography for Side-Channel Attacks: The Case of
{enTTS} Scheme",
journal = j-COMP-J,
volume = "60",
number = "8",
pages = "1197--1209",
day = "1",
month = aug,
year = "2017",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:47 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/8/1197/2996413",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Yi:2017:ZCL,
author = "Wentan Yi and Shaozhen Chen and Yuchen Li",
title = "Zero-correlation Linear Cryptanalysis of {SAFER} Block
Cipher Family Using the Undisturbed Bits",
journal = j-COMP-J,
volume = "60",
number = "4",
pages = "613--624",
day = "23",
month = mar,
year = "2017",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/4/613/2354610",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Yildiz:2017:BLF,
author = "Muhammet Yildiz and Berrin Yaniko{\u{g}}lu and Alisher
Kholmatov and Alper Kanak and Umut Uluda{\u{g}} and
Hakan Erdo{\u{g}}an",
title = "Biometric Layering with Fingerprints: Template
Security and Privacy Through Multi-Biometric Template
Fusion",
journal = j-COMP-J,
volume = "60",
number = "4",
pages = "573--587",
day = "23",
month = mar,
year = "2017",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxw081",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/4/573/2354606",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Yin:2017:QPE,
author = "Hui Yin and Zheng Qin and Lu Ou and Keqin Li",
title = "A query privacy-enhanced and secure search scheme over
encrypted data in cloud computing",
journal = j-J-COMP-SYS-SCI,
volume = "90",
number = "??",
pages = "14--27",
month = dec,
year = "2017",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2016.12.003",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:38 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000016301301",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Misc{Yoo:2017:PQD,
author = "Y. Yoo and others",
title = "A Post-Quantum Digital Signature Scheme Based on
Supersingular Isogenies",
howpublished = "Cryptology ePrint Archive report",
year = "2017",
bibdate = "Thu Aug 31 16:02:50 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://eprint.iacr.org/2017/186",
abstract = "We present the first general-purpose digital signature
scheme based on supersingular elliptic curve isogenies
secure against quantum adversaries in the quantum
random oracle model with small key sizes. This scheme
is an application of Unruh's construction of
non-interactive zero-knowledge proofs to an interactive
zero-knowledge proof proposed by De Feo, Jao, and
Pl{\^u}t. We implement our proposed scheme on an x86-64
PC platform as well as an ARM-powered device. We
exploit the state-of-the-art techniques to speed up the
computations for general C and assembly. Finally, we
provide timing results for real world applications.",
acknowledgement = ack-nhfb,
}
@Article{Young:2017:PSC,
author = "Adam L. Young and Moti Yung",
title = "Privacy and security: Cryptovirology: the birth,
neglect, and explosion of ransomware",
journal = j-CACM,
volume = "60",
number = "7",
pages = "24--26",
month = jul,
year = "2017",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3097347",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Jun 27 17:12:39 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2017/7/218875/fulltext",
abstract = "Recent attacks exploiting a known vulnerability
continue a downward spiral of ransomware-related
incidents.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Yu:2017:ACA,
author = "Gang Yu and Xiaoxiao Ma and Zhenfu Cao and Guang Zeng
and Wenbao Han",
title = "Accountable {CP-ABE} with Public Verifiability: How to
Effectively Protect the Outsourced Data in Cloud",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "705--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400147",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yu:2017:PDA,
author = "Meng-Day (Mandel) Yu and Srinivas Devadas",
title = "Pervasive, dynamic authentication of physical items",
journal = j-CACM,
volume = "60",
number = "4",
pages = "32--39",
month = apr,
year = "2017",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3024922",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Mar 28 10:12:40 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://cacm.acm.org/magazines/2017/4/215034/fulltext",
abstract = "The use of silicon PUF circuits.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Yu:2017:PFS,
author = "Huifang Yu and Bo Yang",
title = "Pairing-Free and Secure Certificateless Signcryption
Scheme",
journal = j-COMP-J,
volume = "60",
number = "8",
pages = "1187--1196",
day = "1",
month = aug,
year = "2017",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:47 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/8/1187/2979229",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Yuce:2017:AFI,
author = "Bilgiday Yuce and Nahid Farhady Ghalaty and Chinmay
Deshpande and Harika Santapuri and Conor Patrick and
Leyla Nazhandali and Patrick Schaumont",
title = "Analyzing the Fault Injection Sensitivity of Secure
Embedded Software",
journal = j-TECS,
volume = "16",
number = "4",
pages = "95:1--95:??",
month = aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3063311",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Aug 14 18:53:33 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Fault attacks on cryptographic software use faulty
ciphertext to reverse engineer the secret encryption
key. Although modern fault analysis algorithms are
quite efficient, their practical implementation is
complicated because of the uncertainty that comes with
the fault injection process. First, the intended fault
effect may not match the actual fault obtained after
fault injection. Second, the logic target of the fault
attack, the cryptographic software, is above the
abstraction level of physical faults. The resulting
uncertainty with respect to the fault effects in the
software may degrade the efficiency of the fault
attack, resulting in many more trial fault injections
than the amount predicted by the theoretical fault
attack. In this contribution, we highlight the
important role played by the processor
microarchitecture in the development of a fault attack.
We introduce the microprocessor fault sensitivity model
to systematically capture the fault response of a
microprocessor pipeline. We also propose
Microarchitecture-Aware Fault Injection Attack (MAFIA).
MAFIA uses the fault sensitivity model to guide the
fault injection and to predict the fault response. We
describe two applications for MAFIA. First, we
demonstrate a biased fault attack on an unprotected
Advanced Encryption Standard (AES) software program
executing on a seven-stage pipelined Reduced
Instruction Set Computer (RISC) processor. The use of
the microprocessor fault sensitivity model to guide the
attack leads to an order of magnitude fewer fault
injections compared to a traditional, blind fault
injection method. Second, MAFIA can be used to break
known software countermeasures against fault injection.
We demonstrate this by systematically breaking a
collection of state-of-the-art software fault
countermeasures. These two examples lead to the key
conclusion of this work, namely that software fault
attacks become much more harmful and effective when an
appropriate microprocessor fault sensitivity model is
used. This, in turn, highlights the need for better
fault countermeasures for software.",
acknowledgement = ack-nhfb,
articleno = "95",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Zaeem:2017:MAI,
author = "Razieh Nokhbeh Zaeem and Monisha Manoharan and
Yongpeng Yang and K. Suzanne Barber",
title = "Modeling and analysis of identity threat behaviors
through text mining of identity theft stories",
journal = j-COMPUT-SECUR,
volume = "65",
number = "??",
pages = "50--63",
month = mar,
year = "2017",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:48 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404816301559",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Zaidan:2017:NDW,
author = "B. B. Zaidan and A. A. Zaidan and H. Abdul. Karim and
N. N. Ahmad",
title = "A new digital watermarking evaluation and benchmarking
methodology using an external group of evaluators and
multi-criteria analysis based on `large-scale data'",
journal = j-SPE,
volume = "47",
number = "10",
pages = "1365--1392",
month = oct,
year = "2017",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.2465",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Sat Dec 23 09:28:58 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@Article{Zhai:2017:EEI,
author = "Xiaojun Zhai and Amine Ait Si Ali and Abbes Amira and
Faycal Bensaali",
title = "{ECG} encryption and identification based security
solution on the {Zynq SoC} for connected health
systems",
journal = j-J-PAR-DIST-COMP,
volume = "106",
number = "??",
pages = "143--152",
month = aug,
year = "2017",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Sat Aug 19 13:10:31 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731516301927",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Zhan:2017:NKG,
author = "Furui Zhan and Nianmin Yao and Zhenguo Gao and Guozhen
Tan",
title = "A novel key generation method for wireless sensor
networks based on system of equations",
journal = j-J-NETW-COMPUT-APPL,
volume = "82",
number = "??",
pages = "114--127",
day = "15",
month = mar,
year = "2017",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Fri Mar 31 07:48:45 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517300395",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Zhang:2017:FBI,
author = "Yunpeng Zhang and Chengyou Wang and Xiaoli Wang and
Min Wang",
title = "Feature-Based Image Watermarking Algorithm Using {SVD}
and {APBT} for Copyright Protection",
journal = j-FUTURE-INTERNET,
volume = "9",
number = "2",
pages = "13",
day = "19",
month = apr,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi9020013",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:57 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/9/2/13",
abstract = "Watermarking techniques can be applied in digital
images to maintain the authenticity and integrity for
copyright protection. In this paper, scale-invariant
feature transform (SIFT) is combined with local digital
watermarking and a digital watermarking algorithm based
on SIFT, singular value decomposition (SVD), and all
phase biorthogonal transform (APBT) is proposed. It
describes the generation process of the SIFT algorithm
in detail and obtains a series of scale-invariant
feature points. A large amount of candidate feature
points are selected to obtain the neighborhood which
can be used to embed the watermark. For these selected
feature points, block-based APBT is carried out on
their neighborhoods. Moreover, a coefficients matrix of
certain APBT coefficients is generated for SVD to embed
the encrypted watermark. Experimental results
demonstrate that the proposed watermarking algorithm
has stronger robustness than some previous schemes. In
addition, APBT-based digital watermarking algorithm has
good imperceptibility and is more robust to different
combinations of attacks, which can be applied for the
purpose of copyright protection.",
acknowledgement = ack-nhfb,
remark = "Collection Information Systems Security.",
}
@Article{Zhang:2017:FGA,
author = "Rui Zhang and Hui Ma and Yao Lu",
title = "Fine-grained access control system based on fully
outsourced attribute-based encryption",
journal = j-J-SYST-SOFTW,
volume = "125",
number = "??",
pages = "344--353",
month = mar,
year = "2017",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Sat Feb 4 12:20:39 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "//www.sciencedirect.com/science/article/pii/S0164121216302606",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Zhang:2017:FWI,
author = "Heng Zhang and Chengyou Wang and Xiao Zhou",
title = "Fragile Watermarking for Image Authentication Using
the Characteristic of {SVD}",
journal = j-ALGORITHMS-BASEL,
volume = "10",
number = "1",
month = mar,
year = "2017",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a10010027",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:13 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.mdpi.com/1999-4893/10/1/27",
acknowledgement = ack-nhfb,
articleno = "27",
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
ORCID-numbers = "Heng Zhang/0000-0003-1864-5432; Chengyou
Wang/0000-0002-0901-2492; Xiao
Zhou/0000-0002-1331-7379",
pagecount = "??",
pubdates = "Received: 21 December 2016 / Accepted: 15 February
2017 / Published: 17 February 2017",
}
@Article{Zhang:2017:GFD,
author = "Jian Zhang and Yang Yang and Yanjiao Chen and Jing
Chen and Qian Zhang",
title = "A general framework to design secure cloud storage
protocol using homomorphic encryption scheme",
journal = j-COMP-NET-AMSTERDAM,
volume = "129 (part 1)",
number = "??",
pages = "37--50",
day = "24",
month = dec,
year = "2017",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Nov 22 06:05:46 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128617303328",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Zhang:2017:NLR,
author = "Leyou Zhang and Jingxia Zhang and Yi Mu",
title = "Novel Leakage-Resilient Attribute-Based Encryption
from Hash Proof System",
journal = j-COMP-J,
volume = "60",
number = "4",
pages = "541--554",
day = "23",
month = mar,
year = "2017",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "https://academic.oup.com/comjnl/article/60/4/541/2608069",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Zhang:2017:PPN,
author = "Yuankai Zhang and Adam O'Neill and Micah Sherr and
Wenchao Zhou",
title = "Privacy-preserving network provenance",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "10",
number = "11",
pages = "1550--1561",
month = aug,
year = "2017",
CODEN = "????",
ISSN = "2150-8097",
bibdate = "Tue Sep 5 16:07:00 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Network accountability, forensic analysis, and failure
diagnosis are becoming increasingly important for
network management and security. Network provenance
significantly aids network administrators in these
tasks by explaining system behavior and revealing the
dependencies between system states. Although
resourceful, network provenance can sometimes be too
rich, revealing potentially sensitive information that
was involved in system execution. In this paper, we
propose a cryptographic approach to preserve the
confidentiality of provenance (sub)graphs while
allowing users to query and access the parts of the
graph for which they are authorized. Our proposed
solution is a novel application of searchable symmetric
encryption (SSE) and more generally structured
encryption (SE). Our SE-enabled provenance system
allows a node to enforce access control policies over
its provenance data even after the data has been
shipped to remote nodes (e.g., for optimization
purposes). We present a prototype of our design and
demonstrate its practicality, scalability, and
efficiency for both provenance maintenance and
querying.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhang:2017:RIW,
author = "Heng Zhang and Chengyou Wang and Xiao Zhou",
title = "A Robust Image Watermarking Scheme Based on {SVD} in
the Spatial Domain",
journal = j-FUTURE-INTERNET,
volume = "9",
number = "3",
pages = "45",
day = "07",
month = aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi9030045",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:57 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/9/3/45",
abstract = "With the development of image processing technology,
the copyright protection of digital images has become
an urgent problem to be solved. As an effective method,
the robust digital watermarking technique emerges at a
historic moment. Currently, most robust watermarking
schemes are performed in the transform domains, such as
the discrete cosine transform (DCT) and singular value
decomposition (SVD). Compared with spatial domain
watermarking schemes, these methods have achieved good
performance, such as better robustness and higher
security. However, the computational complexity
increases with the use of forward and reverse
transforms. In this paper, we analyze the SVD-based
watermarking scheme and its impact on the spatial
domain. Based on this analysis and the mathematical
characteristics of SVD, we present a robust image
watermarking scheme where a binary watermark is
embedded into the largest singular value of each image
block in the spatial domain. Several experiments are
conducted to verify the performance of the proposed
watermarking scheme. The experimental results show that
compared with the existing SVD domain watermarking
schemes, our proposed method has maintained good
robustness against various attacks. Moreover, it avoids
the false positive problem existing in traditional
SVD-based watermarking schemes and has lower
computational complexity.",
acknowledgement = ack-nhfb,
}
@Article{Zhao:2017:RAS,
author = "Caidan Zhao and Minmin Huang and Lianfen Huang and
Xiaojiang Du and Mohsen Guizani",
title = "A robust authentication scheme based on physical-layer
phase noise fingerprint for emerging wireless
networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "128",
number = "??",
pages = "164--171",
day = "9",
month = dec,
year = "2017",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Oct 30 06:00:14 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128617302347",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Zhou:2017:CLR,
author = "Yanwei Zhou and Bo Yang",
title = "Continuous Leakage-Resilient Public-Key Encryption
Scheme with {CCA} Security",
journal = j-COMP-J,
volume = "60",
number = "8",
pages = "1161--1172",
day = "1",
month = aug,
year = "2017",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:47 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://academic.oup.com/comjnl/article/60/8/1161/2882687",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Zhou:2017:ENQ,
author = "Lu Zhou and Youwen Zhu and Aniello Castiglione",
title = "Efficient $k$-{NN} query over encrypted data in cloud
with limited key-disclosure and offline data owner",
journal = j-COMPUT-SECUR,
volume = "69",
number = "??",
pages = "84--96",
month = aug,
year = "2017",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404816301663",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Zhou:2017:IBB,
author = "Fucai Zhou and Su Peng and Jian Xu and Zifeng Xu",
title = "Identity-Based Batch Provable Data Possession with
Detailed Analyses",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "743--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400160",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhou:2017:LRC,
author = "Yanwei Zhou and Bo Yang",
title = "Leakage-resilient {CCA2}-secure certificateless
public-key encryption scheme without bilinear pairing",
journal = j-INFO-PROC-LETT,
volume = "130",
number = "??",
pages = "16--24",
month = feb,
year = "2017",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Oct 30 08:51:08 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019017301680",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Zhu:2017:PSN,
author = "Youwen Zhu and Xingxin Li and Jian Wang and Yining Liu
and Zhiguo Qu",
title = "Practical Secure Na{\"\i}ve {Bayesian} Classification
Over Encrypted Big Data in Cloud",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "683--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400135",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zufiria:2017:GLM,
author = "Pedro J. Zufiria and Jos{\'e} A. {\'A}lvarez-Cubero",
title = "Generalized Lexicographic {MultiObjective}
Combinatorial Optimization. {Application} to
Cryptography",
journal = j-SIAM-J-OPT,
volume = "27",
number = "4",
pages = "2182--2201",
month = "????",
year = "2017",
CODEN = "SJOPE8",
DOI = "https://doi.org/10.1137/16M1107826",
ISSN = "1052-6234 (print), 1095-7189 (electronic)",
ISSN-L = "1052-6234",
bibdate = "Fri Jan 12 07:04:38 MST 2018",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toc/SIOPT/27/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/siamjopt.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Optimization",
journal-URL = "http://epubs.siam.org/siopt",
onlinedate = "January 2017",
}
@Article{Abarzua:2018:ASC,
author = "Rodrigo Abarz{\'u}a and Santi Mart{\'\i}nez and
Valeria Mendoza and Javier Valera",
title = "Avoiding Side-Channel Attacks by Computing Isogenous
and Isomorphic Elliptic Curves",
journal = j-MATH-COMPUT-SCI,
volume = "12",
number = "3",
pages = "295--307",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1007/s11786-018-0346-4",
ISSN = "1661-8270 (print), 1661-8289 (electronic)",
ISSN-L = "1661-8270",
bibdate = "Mon Mar 4 06:59:44 MST 2019",
bibsource = "http://link.springer.com/journal/11786/12/3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/math-comput-sci.bib",
acknowledgement = ack-nhfb,
fjournal = "Mathematics in Computer Science",
journal-URL = "http://link.springer.com/journal/11786",
}
@Article{Abbasinezhad-Mood:2018:DHI,
author = "Dariush Abbasinezhad-Mood and Morteza Nikooghadam",
title = "Design and hardware implementation of a
security-enhanced elliptic curve cryptography based
lightweight authentication scheme for smart grid
communications",
journal = j-FUT-GEN-COMP-SYS,
volume = "84",
number = "??",
pages = "47--57",
month = jul,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2018.02.034",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Apr 16 14:45:08 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17315376",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Abdou:2018:SLV,
author = "Abdelrahman Abdou and P. C. {Van Oorschot}",
title = "Server Location Verification {(SLV)} and Server
Location Pinning: Augmenting {TLS} Authentication",
journal = j-TOPS,
volume = "21",
number = "1",
pages = "1:1--1:??",
month = jan,
year = "2018",
DOI = "https://doi.org/10.1145/3139294",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
bibdate = "Sat Sep 21 08:26:23 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
URL = "https://dl.acm.org/citation.cfm?id=3139294",
abstract = "We introduce the first known mechanism providing
realtime server location verification. Its uses include
enhancing server authentication by enabling browsers to
automatically interpret server location information. We
describe the design of this new measurement-based
technique, Server Location Verification (SLV), and
evaluate it using PlanetLab. We explain how SLV is
compatible with the increasing trends of geographically
distributed content dissemination over the Internet,
without causing any new interoperability conflicts.
Additionally, we introduce the notion of (verifiable)
server location pinning (conceptually similar to
certificate pinning) to support SLV, and evaluate their
combined impact using a server-authentication
evaluation framework. The results affirm the addition
of new security benefits to the existing TLS-based
authentication mechanisms. We implement SLV through a
location verification service, the simplest version of
which requires no server-side changes. We also
implement a simple browser extension that interacts
seamlessly with the verification infrastructure to
obtain realtime server location-verification results.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Abellan:2018:FCQ,
author = "C. Abellan and V. Pruneri",
title = "The future of cybersecurity is quantum",
journal = j-IEEE-SPECTRUM,
volume = "55",
number = "7",
pages = "30--35",
month = jul,
year = "2018",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2018.8389185",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "1870 book Telegraphic Code; California; cryptography;
Distributed feedback devices; Encryption; fraud; French
Atlantic Telegraph Co; Generators; military
investigator; Photonics; Public key; quantum
cryptography; quantum cybersecurity; Quantum mechanics;
Sacramento; security of data; telegram transmission;
telegraphy; U.S. Civil War; unbreakable encryption
method; wire --- a problem",
}
@Article{Acar:2018:SHE,
author = "Abbas Acar and Hidayet Aksu and A. Selcuk Uluagac and
Mauro Conti",
title = "A Survey on Homomorphic Encryption Schemes: Theory and
Implementation",
journal = j-COMP-SURV,
volume = "51",
number = "4",
pages = "79:1--79:??",
month = sep,
year = "2018",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3214303",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Aug 31 09:04:35 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Legacy encryption systems depend on sharing a key
(public or private) among the peers involved in
exchanging an encrypted message. However, this approach
poses privacy concerns. The users or service providers
with the key have exclusive rights on the data.
Especially with popular cloud services, control over
the privacy of the sensitive data is lost. Even when
the keys are not shared, the encrypted material is
shared with a third party that does not necessarily
need to access the content. Moreover, untrusted
servers, providers, and cloud operators can keep
identifying elements of users long after users end the
relationship with the services. Indeed, Homomorphic
Encryption (HE), a special kind of encryption scheme,
can address these concerns as it allows any third party
to operate on the encrypted data without decrypting it
in advance. Although this extremely useful feature of
the HE scheme has been known for over 30 years, the
first plausible and achievable Fully Homomorphic
Encryption (FHE) scheme, which allows any computable
function to perform on the encrypted data, was
introduced by Craig Gentry in 2009. Even though this
was a major achievement, different implementations so
far demonstrated that FHE still needs to be improved
significantly to be practical on every platform.
Therefore, this survey focuses on HE and FHE schemes.
First, we present the basics of HE and the details of
the well-known Partially Homomorphic Encryption (PHE)
and Somewhat Homomorphic Encryption (SWHE), which are
important pillars for achieving FHE. Then, the main FHE
families, which have become the base for the other
follow-up FHE schemes, are presented. Furthermore, the
implementations and recent improvements in Gentry-type
FHE schemes are also surveyed. Finally, further
research directions are discussed. This survey is
intended to give a clear knowledge and foundation to
researchers and practitioners interested in knowing,
applying, and extending the state-of-the-art HE, PHE,
SWHE, and FHE systems.",
acknowledgement = ack-nhfb,
articleno = "79",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Aghili:2018:ISA,
author = "Seyed Farhad Aghili and Maede Ashouri-Talouki and
Hamid Mala",
title = "{DoS}, impersonation and de-synchronization attacks
against an ultra-lightweight {RFID} mutual
authentication protocol for {IoT}",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "1",
pages = "509--525",
month = jan,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-017-2139-y",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jan 6 08:59:19 MST 2018",
bibsource = "http://link.springer.com/journal/11227/74/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Agrawal:2018:RLR,
author = "Megha Agrawal and Tarun Kumar Bansal and Donghoon
Chang and Amit Kumar Chauhan and Seokhie Hong and
Jinkeon Kang and Somitra Kumar Sanadhya",
title = "{RCB}: leakage-resilient authenticated encryption via
re-keying",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "9",
pages = "4173--4198",
month = sep,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1824-6",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Oct 10 15:31:14 MDT 2019",
bibsource = "http://link.springer.com/journal/11227/74/9;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Ahmadzadeh:2018:HPE,
author = "Armin Ahmadzadeh and Omid Hajihassani and Saeid
Gorgin",
title = "A high-performance and energy-efficient exhaustive key
search approach via {GPU} on {DES}-like cryptosystems",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "1",
pages = "160--182",
month = jan,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-017-2120-9",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jan 6 08:59:19 MST 2018",
bibsource = "http://link.springer.com/journal/11227/74/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Akhtar:2018:BSI,
author = "Z. Akhtar and A. Hadid and M. S. Nixon and M.
Tistarelli and J. Dugelay and S. Marcel",
title = "Biometrics: In Search of Identity and Security
({Q\&A})",
journal = j-IEEE-MULTIMEDIA,
volume = "25",
number = "3",
pages = "22--35",
month = jul # "\slash " # sep,
year = "2018",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2018.2873494",
ISSN = "1070-986x (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Fri Aug 2 10:38:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
journal-URL = "http://www.computer.org/multimedia/",
keywords = "authorisation; biometrics; Biometrics; biometrics
(access control); Databases; DNA; Face; Face
Recognition; Feature extraction; Fingerprint
recognition; Fingerprint Recognition; Forensics;
identity theft; Iris Recognition; Iris recognition;
Privacy; Security; security threats",
}
@Article{Al-Azzam:2018:SRC,
author = "Saad Al-Azzam and Ahmad Sharieh and Azzam Sleit and
Nedaa Al-Azzam",
title = "Securing robot communication using packet encryption
distribution",
journal = j-NETWORK-SECURITY,
volume = "2018",
number = "2",
pages = "8--14",
month = feb,
year = "2018",
CODEN = "NTSCF5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Thu Sep 12 12:57:47 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485818300151",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Al-Qurishi:2018:EKA,
author = "Muhammad Al-Qurishi and Sk Md Mizanur Rahman and M.
Shamim Hossain and Ahmad Almogren and Majed Alrubaian
and Atif Alamri and Mabrook Al-Rakhami and B. B.
Gupta",
title = "An efficient key agreement protocol for
{Sybil}-precaution in online social networks",
journal = j-FUT-GEN-COMP-SYS,
volume = "84",
number = "??",
pages = "139--148",
month = jul,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.07.055",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Apr 16 14:45:08 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17306623",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Alam:2018:AFC,
author = "Badiul Alam and Zhe Jin and Wun-She Yap and Bok-Min
Goi",
title = "An alignment-free cancelable fingerprint template for
bio-cryptosystems",
journal = j-J-NETW-COMPUT-APPL,
volume = "115",
number = "??",
pages = "20--32",
day = "1",
month = aug,
year = "2018",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2018.04.013",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sun May 27 08:10:17 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518301450",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Alharbi:2018:CME,
author = "Rawan Alharbi and Tammy Stump and Nilofar Vafaie and
Angela Pfammatter and Bonnie Spring and Nabil
Alshurafa",
title = "{I} Can't Be Myself: Effects of Wearable Cameras on
the Capture of Authentic Behavior in the Wild",
journal = j-IMWUT,
volume = "2",
number = "3",
pages = "1--40",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3264900",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:37:04 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3264900",
abstract = "Wearable sensors can provide reliable, automated
measures of health behaviors in free-living
populations. However, validation of these measures is
impossible without observable confirmation of
behaviors. Participants have expressed discomfort
during the \ldots{}",
acknowledgement = ack-nhfb,
articleno = "90",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Ali:2018:CBR,
author = "Zulfiqar Ali and Muhammad Imran and Mansour Alsulaiman
and Muhammad Shoaib and Sana Ullah",
title = "Chaos-based robust method of zero-watermarking for
medical signals",
journal = j-FUT-GEN-COMP-SYS,
volume = "88",
number = "??",
pages = "400--412",
month = nov,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2018.05.058",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Sep 18 14:07:58 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18304709",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Ali:2018:ECM,
author = "Zulfiqar Ali and M. Shamim Hossain and Ghulam Muhammad
and Ihsan Ullah and Hamid Abachi and Atif Alamri",
title = "Edge-centric multimodal authentication system using
encrypted biometric templates",
journal = j-FUT-GEN-COMP-SYS,
volume = "85",
number = "??",
pages = "76--87",
month = aug,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Thu Apr 19 14:05:57 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17328741",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Ali:2018:SUA,
author = "Rifaqat Ali and Arup Kumar Pal and Saru Kumari and
Marimuthu Karuppiah and Mauro Conti",
title = "A secure user authentication and key-agreement scheme
using wireless sensor networks for agriculture
monitoring",
journal = j-FUT-GEN-COMP-SYS,
volume = "84",
number = "??",
pages = "200--215",
month = jul,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.06.018",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Apr 16 14:45:08 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17303862",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Ali:2018:ZWA,
author = "Zulfiqar Ali and Muhammad Imran and Mansour Alsulaiman
and Tanveer Zia and Muhammad Shoaib",
title = "A zero-watermarking algorithm for privacy protection
in biomedical signals",
journal = j-FUT-GEN-COMP-SYS,
volume = "82",
number = "??",
pages = "290--303",
month = may,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.12.007",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sun Feb 18 14:42:10 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17322975",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Alpar:2018:BTA,
author = "Orcan Alpar",
title = "Biometric touchstroke authentication by fuzzy
proximity of touch locations",
journal = j-FUT-GEN-COMP-SYS,
volume = "86",
number = "??",
pages = "71--80",
month = sep,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Jun 20 10:38:06 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17326055",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Altawy:2018:SLT,
author = "Riham Altawy and Raghvendra Rohit and Morgan He and
Kalikinkar Mandal and Gangqiang Yang and Guang Gong",
title = "{SLISCP-light}: Towards Hardware Optimized
Sponge-specific Cryptographic Permutations",
journal = j-TECS,
volume = "17",
number = "4",
pages = "81:1--81:??",
month = aug,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3233245",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:41 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "The emerging areas in which highly resource
constrained devices are interacting wirelessly to
accomplish tasks have led manufacturers to embed
communication systems in them. Tiny low-end devices
such as sensor networks nodes and Radio Frequency
Identification (RFID) tags are of particular importance
due to their vulnerability to security attacks, which
makes protecting their communication privacy and
authenticity an essential matter. In this work, we
present a lightweight do-it-all cryptographic design
that offers the basic underlying functionalities to
secure embedded communication systems in tiny devices.
Specifically, we revisit the design approach of the
sLiSCP family of lightweight cryptographic
permutations, which was proposed in SAC 2017. sLiSCP is
designed to be used in a unified duplex sponge
construction to provide minimal overhead for multiple
cryptographic functionalities within one hardware
design. The design of sLiSCP follows a 4-subblock
Type-2 Generalized Feistel-like Structure (GFS) with
unkeyed round-reduced Simeck as the round function,
which are extremely efficient building blocks in terms
of their hardware area requirements. In SLISCP-light,
we tweak the GFS design and turn it into an elegant
Partial Substitution-Permutation Network construction,
which further reduces the hardware areas of the SLISCP
permutations by around 16\% of their original values.
The new design also enhances the bit diffusion and
algebraic properties of the permutations and enables us
to reduce the number of steps, thus achieving a better
throughput in both the hashing and authentication
modes. We perform a thorough security analysis of the
new design with respect to its diffusion, differential
and linear, and algebraic properties. For
SLISCP-light-192, we report parallel implementation
hardware areas of 1,820 (respectively, 1,892)GE in CMOS
65 nm (respectively, 130 nm) ASIC. The areas for
SLISCP-light-256 are 2,397 and 2,500GE in CMOS 65 nm
and 130 nm ASIC, respectively. Overall, the unified
duplex sponge mode of SLISCP-light-192, which provides
(authenticated) encryption and hashing functionalities,
satisfies the area (1,958GE), power (3.97 $ \mu $W),
and throughput (44.4kbps) requirements of passive RFID
tags.",
acknowledgement = ack-nhfb,
articleno = "81",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{AlTawy:2018:TCM,
author = "Riham AlTawy and Raghvendra Rohit and Morgan He and
Kalikinkar Mandal and Gangqiang Yang and Guang Gong",
title = "Towards a Cryptographic Minimal Design: The {sLiSCP}
Family of Permutations",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "9",
pages = "1341--1358",
month = "????",
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2811467",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Aug 9 10:45:38 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8305605/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Amin:2018:UAP,
author = "Ruhul Amin and S. K. Hafizul Islam and Neeraj Kumar
and Kim-Kwang Raymond Choo",
title = "An untraceable and anonymous password authentication
protocol for heterogeneous wireless sensor networks",
journal = j-J-NETW-COMPUT-APPL,
volume = "104",
number = "??",
pages = "133--144",
day = "15",
month = feb,
year = "2018",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2017.12.012",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sat Mar 3 15:22:10 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517304058",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Aminifar:2018:OME,
author = "Amir Aminifar and Petru Eles and Zebo Peng",
title = "Optimization of Message Encryption for Real-Time
Applications in Embedded Systems",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "5",
pages = "748--754",
month = may,
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2017.2778728",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Apr 12 07:11:24 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8125122/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Anandakumar:2018:RHA,
author = "N. Nalla Anandakumar and M. Prem Laxman Das and
Somitra K. Sanadhya and Mohammad S. Hashmi",
title = "Reconfigurable Hardware Architecture for Authenticated
Key Agreement Protocol Over Binary {Edwards} Curve",
journal = j-TRETS,
volume = "11",
number = "2",
pages = "12:1--12:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3231743",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Sat Oct 19 17:43:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
abstract = "In this article, we present a high-performance
hardware architecture for Elliptic curve based
(authenticated) key agreement protocol ``Elliptic Curve
Menezes, Qu and Vanstone'' (ECMQV) over Binary Edwards
Curve (BEC). We begin by analyzing inversion module on
a 251-bit binary field. Subsequently, we present Field
Programmable Gate Array (FPGA) implementations of the
unified formula for computing elliptic curve point
addition on BEC in affine and projective coordinates
and investigate the relative performance of these two
coordinates. Then, we implement the w -coordinate based
differential addition formulae suitable for usage in
Montgomery ladder. Next, we present a novel hardware
architecture of BEC point multiplication using mixed w
-coordinates of the Montgomery laddering algorithm and
analyze it in terms of resistance to Simple Power
Analysis (SPA) attack. In order to improve the
performance, the architecture utilizes registers
efficiently and uses efficient scheduling mechanisms
for the BEC arithmetic implementations. Our
implementation results show that the proposed
architecture is resistant against SPA attack and yields
a better performance when compared to the existing
state-of-the-art BEC designs for computing point
multiplication (PM). Finally, we present an FPGA design
of ECMQV key agreement protocol using BEC defined over
GF(2$^{251}$ ). The execution of ECMQV protocol takes
66.47 $ \mu $ s using 32,479 slices on Virtex-4 FPGA
and 52.34 $ \mu $ s using 15,988 slices on Virtex-5
FPGA. To the best of our knowledge, this is the first
FPGA design of the ECMQV protocol using BEC.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
}
@Article{Anastasiadis:2018:BTA,
author = "M. Anastasiadis and N. Chatzis and K. A. Draziotis",
title = "Birthday type attacks to the {Naccache--Stern}
knapsack cryptosystem",
journal = j-INFO-PROC-LETT,
volume = "138",
number = "??",
pages = "35--38",
month = oct,
year = "2018",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2018.06.002",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri Sep 14 08:04:51 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019018301273",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Araldo:2018:CEC,
author = "Andrea Araldo and Gyorgy Dan and Dario Rossi",
title = "Caching Encrypted Content Via Stochastic Cache
Partitioning",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "548--561",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2793892",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In-network caching is an appealing solution to cope
with the increasing bandwidth demand of video, audio,
and data transfer over the Internet. Nonetheless, in
order to protect consumer privacy and their own
business, content providers CPs increasingly deliver
encrypted content, thereby preventing Internet service
providers ISPs from employing traditional caching
strategies, which require the knowledge of the objects
being transmitted. To overcome this emerging tussle
between security and efficiency, in this paper we
propose an architecture in which the ISP partitions the
cache space into slices, assigns each slice to a
different CP, and lets the CPs remotely manage their
slices. This architecture enables transparent caching
of encrypted content and can be deployed in the very
edge of the ISP's network i.e., base stations and
femtocells, while allowing CPs to maintain exclusive
control over their content. We propose an algorithm,
called SDCP, for partitioning the cache storage into
slices so as to maximize the bandwidth savings provided
by the cache. A distinctive feature of our algorithm is
that ISPs only need to measure the aggregated miss
rates of each CP, but they need not know the individual
objects that are requested. We prove that the SDCP
algorithm converges to a partitioning that is close to
the optimal, and we bound its optimality gap. We use
simulations to evaluate SDCP's convergence rate under
stationary and nonstationary content popularity.
Finally, we show that SDCP significantly outperforms
traditional reactive caching techniques, considering
both CPs with perfect and with imperfect knowledge of
their content popularity.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Archer:2018:KDR,
author = "David W. Archer and Dan Bogdanov and Yehuda Lindell
and Liina Kamm and Kurt Nielsen and Jakob Illeborg
Pagter and Nigel P. Smart and Rebecca N. Wright",
title = "From Keys to Databases --- Real-World Applications of
Secure Multi-Party Computation",
journal = j-COMP-J,
volume = "61",
number = "12",
pages = "1749--1771",
day = "1",
month = dec,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy090",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 27 19:24:38 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/12/1749/5095655",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Au:2018:PPP,
author = "Man Ho Au and Kaitai Liang and Joseph K. Liu and
Rongxing Lu and Jianting Ning",
title = "Privacy-preserving personal data operation on mobile
cloud: Chances and challenges over advanced persistent
threat",
journal = j-FUT-GEN-COMP-SYS,
volume = "79 (part 1)",
number = "??",
pages = "337--349",
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.06.021",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Nov 24 15:16:17 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17312864",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
keywords = "Applied cryptography; Mobile could; Privacy;
Security",
}
@Article{Badawi:2018:ASS,
author = "Ahmad {Al Badawi} and Bharadwaj Veeravalli and Khin Mi
Mi Aung and Brahim Hamadicharef",
title = "Accelerating subset sum and lattice based public-key
cryptosystems with multi-core {CPUs} and {GPUs}",
journal = j-J-PAR-DIST-COMP,
volume = "119",
number = "??",
pages = "179--190",
month = sep,
year = "2018",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2018.04.014",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Thu May 31 06:49:57 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731518302831",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Balagani:2018:IAC,
author = "Kiran S. Balagani and Paolo Gasti and Aaron Elliott
and Azriel Richardson and Mike O'Neal",
title = "The impact of application context on privacy and
performance of keystroke authentication systems",
journal = j-J-COMP-SECUR,
volume = "26",
number = "4",
pages = "543--556",
month = "????",
year = "2018",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-171017",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Mon Sep 23 05:47:17 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Barbareschi:2018:PBH,
author = "Mario Barbareschi and Alessandra {De Benedictis} and
Nicola Mazzocca",
title = "A {PUF}-based hardware mutual authentication
protocol",
journal = j-J-PAR-DIST-COMP,
volume = "119",
number = "??",
pages = "107--120",
month = sep,
year = "2018",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2018.04.007",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Thu May 31 06:49:57 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731518302582",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Barcellos:2018:RSP,
author = "M. Barcellos and D. F. Aranha",
title = "Research in Security and Privacy in {Brazil}",
journal = j-IEEE-SEC-PRIV,
volume = "16",
number = "6",
pages = "14--21",
month = nov # "\slash " # dec,
year = "2018",
DOI = "https://doi.org/10.1109/MSEC.2018.2874855",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "Brazil; Communication networks; Cryptography; data
privacy; geographical distribution; Internet of Things;
Privacy; privacy; research areas.; security; Security
of data",
}
@Article{Baruah:2018:TFA,
author = "Barnana Baruah and Subhasish Dhal",
title = "A two-factor authentication scheme against {FDM}
attack in {IFTTT} based Smart Home System",
journal = j-COMPUT-SECUR,
volume = "77",
number = "??",
pages = "21--35",
month = aug,
year = "2018",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:55 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818302402",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Misc{Bellovin:2018:UAE,
author = "Steven M. Bellovin",
title = "{Usenet}, Authentication, and Engineering (or: Early
Design Decisions for {Usenet})",
howpublished = "Web article.",
day = "23",
month = feb,
year = "2018",
bibdate = "Thu Mar 01 07:29:49 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
URL = "https://www.cs.columbia.edu/~smb/blog/2018-02/2018-02-23.html",
acknowledgement = ack-nhfb,
}
@Article{Beltran:2018:IAA,
author = "Marta Beltr{\'a}n",
title = "Identifying, authenticating and authorizing smart
objects and end users to cloud services in {Internet of
Things}",
journal = j-COMPUT-SECUR,
volume = "77",
number = "??",
pages = "595--611",
month = aug,
year = "2018",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:55 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818301366",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Berman:2018:CFC,
author = "Itay Berman and Iftach Haitner and Aris Tentes",
title = "Coin Flipping of Any Constant Bias Implies One-Way
Functions",
journal = j-J-ACM,
volume = "65",
number = "3",
pages = "14:1--14:??",
month = mar,
year = "2018",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/2979676",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
bibdate = "Wed Jul 25 16:08:11 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "We show that the existence of a coin-flipping protocol
safe against any nontrivial constant bias (e.g., .499)
implies the existence of one-way functions. This
improves upon a result of Haitner and Omri (FOCS'11),
who proved this implication for protocols with bias $
\sqrt 2 - 1 / 2 - o (1) \approx .207 $. Unlike the
result of Haitner and Omri, our result also holds for
weak coin-flipping protocols.",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Berretti:2018:IAS,
author = "Stefano Berretti",
title = "Improved Audio Steganalytic Feature and Its
Applications in Audio Forensics",
journal = j-TOMM,
volume = "14",
number = "2",
pages = "43:1--43:??",
month = may,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3190575",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue May 29 08:39:06 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Digital multimedia steganalysis has attracted wide
attention over the past decade. Currently, there are
many algorithms for detecting image steganography.
However, little research has been devoted to audio
steganalysis. Since the statistical properties of image
and audio files are quite different, features that are
effective in image steganalysis may not be effective
for audio. In this article, we design an improved audio
steganalytic feature set derived from both the time and
Mel-frequency domains for detecting some typical
steganography in the time domain, including LSB
matching, Hide4PGP, and Steghide. The experiment
results, evaluated on different audio sources,
including various music and speech clips of different
complexity, have shown that the proposed features
significantly outperform the existing ones. Moreover,
we use the proposed features to detect and further
identify some typical audio operations that would
probably be used in audio tampering. The extensive
experiment results have shown that the proposed
features also outperform the related forensic methods,
especially when the length of the audio clip is small,
such as audio clips with 800 samples. This is very
important in real forensic situations.",
acknowledgement = ack-nhfb,
articleno = "43",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Bhattacharya:2018:UPC,
author = "Sarani Bhattacharya and Debdeep Mukhopadhyay",
title = "Utilizing Performance Counters for Compromising Public
Key Ciphers",
journal = j-TOPS,
volume = "21",
number = "1",
pages = "5:1--5:??",
month = jan,
year = "2018",
DOI = "https://doi.org/10.1145/3156015",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
bibdate = "Sat Sep 21 08:26:23 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
URL = "https://dl.acm.org/citation.cfm?id=3156015",
abstract = "Hardware performance counters (HPCs) are useful
artifacts for evaluating the performance of software
implementations. Recently, HPCs have been made more
convenient to use without requiring explicit kernel
patches or superuser privileges. However, in this
article, we highlight that the information revealed by
HPCs can be also exploited to attack standard
implementations of public key algorithms. In
particular, we analyze the vulnerability due to the
event branch miss leaked via the HPCs during execution
of the target ciphers. We present an iterative attack
that targets the key bits of 1,024-bit RSA and 256-bit
ECC, whereas in the offline phase, the system's
underlying branch predictor is approximated by a
theoretical predictor in the literature. Subsimulations
are performed corresponding to each bit guess to
classify the message space into distinct partitions
based on the event branch misprediction and the target
key bit value. In the online phase, branch
mispredictions obtained from the hardware performance
monitors on the target system reveal the secret key
bits. We also theoretically prove that the probability
of success of the attack is equivalent to the accurate
modeling of the theoretical predictor to the underlying
system predictor. In addition, we propose an improved
version of the attack that requires fewer branch
misprediction traces from the HPCs to recover the
secret. Experimentations using both attack strategies
have been provided on Intel Core 2 Duo, Core i3, and
Core i5 platforms for 1,024-bit implementation of RSA
and 256-bit scalar multiplication over the secp 256 r 1
curve followed by results on the effect of change of
parameters on the success rate. The attack can
successfully reveal the exponent bits and thus seeks
attention to model secure branch predictors such that
it inherently prevents information leakage.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Bibak:2018:AUH,
author = "Khodakhast Bibak and Bruce M. Kapron and Venkatesh
Srinivasan and L{\'a}szl{\'o} T{\'o}th",
title = "On an Almost-Universal Hash Function Family with
Applications to Authentication and Secrecy Codes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "3",
pages = "357--??",
month = apr,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500089",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 10 06:25:10 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bitansky:2018:IOF,
author = "Nir Bitansky and Vinod Vaikuntanathan",
title = "Indistinguishability Obfuscation from Functional
Encryption",
journal = j-J-ACM,
volume = "65",
number = "6",
pages = "39:1--39:??",
month = nov,
year = "2018",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/3234511",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Thu Nov 29 14:39:21 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3234511",
abstract = "Indistinguishability obfuscation (IO) is a tremendous
notion, powerful enough to give rise to almost any
known cryptographic object. Prior candidate IO
constructions were based on specific assumptions on
algebraic objects called multi-linear graded encodings.
We present a generic construction of
indistinguishability obfuscation from public-key
functional encryption with succinct encryption circuits
and subexponential security. This shows the equivalence
of indistinguishability obfuscation and public-key
functional encryption, a primitive that has previously
seemed to be much weaker, lacking the power and the
staggering range of applications of
indistinguishability obfuscation. Our main construction
can be based on functional encryption schemes that
support a single functional key, and where the
encryption circuit grows sub-linearly in the
circuit-size of the function. We further show that
sublinear succinctness in circuit-size for single-key
schemes can be traded with sublinear succinctness in
the number of keys (also known as the collusion-size )
for multi-key schemes. We also show that, under the
Learning with Errors assumption, our techniques imply
that any indistinguishability obfuscator can be
converted into one where the size of obfuscated
circuits is twice that of the original circuit plus an
additive overhead that is polynomial in its depth,
input length, and the security parameter.",
acknowledgement = ack-nhfb,
articleno = "39",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Bocu:2018:HEB,
author = "R. Bocu and C. Costache",
title = "A homomorphic encryption-based system for securely
managing personal health metrics data",
journal = j-IBM-JRD,
volume = "62",
number = "1",
pages = "1:1--1:10",
month = "????",
year = "2018",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Thu Feb 1 06:34:25 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
URL = "http://ieeexplore.ieee.org/document/8269765/",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
@Article{Bogdanov:2018:IEA,
author = "Dan Bogdanov and Liina Kamm and Sven Laur and Ville
Sokk",
title = "Implementation and Evaluation of an Algorithm for
Cryptographically Private Principal Component Analysis
on Genomic Data",
journal = j-TCBB,
volume = "15",
number = "5",
pages = "1427--1432",
month = sep,
year = "2018",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2018.2858818",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Thu Nov 8 06:18:46 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "We improve the quality of cryptographically
privacy-preserving genome-wide association studies by
correctly handling population stratification-the
inherent genetic difference of patient groups, e.g.,
people with different ancestries. Our approach is to
use principal component analysis to reduce the
dimensionality of the problem so that we get less
spurious correlations between traits of interest and
certain positions in the genome. While this approach is
commonplace in practical genomic analysis, it has not
been used within a privacy-preserving setting. In this
paper, we use cryptographically secure multi-party
computation to tackle principal component analysis, and
present an implementation and experimental results
showing the performance of the approach.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@Article{Bottarelli:2018:PCW,
author = "Mirko Bottarelli and Gregory Epiphaniou and Dhouha
Kbaier {Ben Ismail} and Petros Karadimas and Haider
Al-Khateeb",
title = "Physical characteristics of wireless communication
channels for secret key establishment: a survey of the
research",
journal = j-COMPUT-SECUR,
volume = "78",
number = "??",
pages = "454--476",
month = sep,
year = "2018",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818300841",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Braeken:2018:AAA,
author = "A. Braeken and Abdellah Touhafi",
title = "{AAA} --- autonomous anonymous user authentication and
its application in {V2G}",
journal = j-CCPE,
volume = "30",
number = "12",
pages = "",
day = "25",
month = jun,
year = "2018",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4303",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Aug 4 10:03:15 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://onlinelibrary.wiley.com/doi/abs/10.1002/cpe.4303",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Brewster:2018:RCF,
author = "R. Brewster",
title = "Re-creating the first flip-flop --- A fundamental
component of computers turns 100 [Resources Hands On]",
journal = j-IEEE-SPECTRUM,
volume = "55",
number = "6",
pages = "13--14",
month = jun,
year = "2018",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2018.8362215",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "amplifying vacuum tube; cryptography; digital
circuits; electronic toggle switch; ENIAC; flip-flop;
flip-flops; history; initial electrical control signal;
John Bardeen; time 100.0 year; transistors; vacuum
tubes; William Eccles; William Shockley",
}
@Article{Buchmann:2018:PCP,
author = "J. Buchmann and K. Lauter and M. Mosca",
title = "Postquantum Cryptography, Part 2",
journal = j-IEEE-SEC-PRIV,
volume = "16",
number = "5",
pages = "12--13",
month = sep # "\slash " # oct,
year = "2018",
DOI = "https://doi.org/10.1109/MSP.2018.3761714",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 networks; Computer security; Cryptography;
cryptography; postquantum cryptography; security; Shor;
Special issues and sections",
}
@Article{Budroni:2018:HGB,
author = "Alessandro Budroni and Federico Pintore",
title = "Hashing to {G2} on {BLS} pairing-friendly curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "63--66",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313884",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "When a pairing e: $ G_1 $ x $ G_2 $ -{$>$} $ G_T $, on
an elliptic curve E defined over F$_q$, is exploited in
a cryptographic protocol, there is often the need to
hash binary strings into $ G_1$ and $ G_2$.
Traditionally, if $E$ admits a twist $ \tilde {E}$ of
order $d$, then $ G_1$ = E (F$_q$ ) \cap E [ r ], where
r is a prime integer, and $ G_2$ = $ \tilde {E}$ (F
$_q^{k / d}$ ) \cap $ \tilde {E}$ [ r ], where k is the
embedding degree of E w.r.t. r. The standard approach
for hashing a binary string into $ G_1$ and $ G_2$ is
to map it to general points P \in E ( F$_q$ ) and P'
\in $ \tilde {E}$ (F $_q^{k / d}$ ), and then multiply
them by the cofactors c = \#E (F $_q$ )/ r and c ' =
\#$ \tilde {E}$ (F $_q^{k / d}$ )/ r respectively.
Usually, the multiplication by c' is computationally
expensive. In order to speed up such a computation, two
different methods (by Scott et al. and by Fuentes et
al. ) have been proposed. In this poster we consider
these two methods for BLS pairing-friendly curves
having k \in {12, 24, 30, 42,48}, providing efficiency
comparisons. When k = 42,48, the Fuentes et al. method
requires an expensive one-off pre-computation which was
infeasible for the computational power at our disposal.
In these cases, we theoretically obtain hashing maps
that follow Fuentes et al. idea.",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bultan:2018:SCA,
author = "Tevfik Bultan",
title = "Side-Channel Analysis via Symbolic Execution and Model
Counting",
journal = j-SIGSOFT,
volume = "43",
number = "4",
pages = "55--55",
month = oct,
year = "2018",
CODEN = "SFENDP",
DOI = "https://doi.org/10.1145/3282517.3302416",
ISSN = "0163-5948 (print), 1943-5843 (electronic)",
ISSN-L = "0163-5948",
bibdate = "Sat Oct 19 18:11:10 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/java2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsoft2010.bib",
abstract = "An important problem in computer security is the
detection of side-channel vulnerabilities. Information
gained by observing nonfunctional properties of program
executions (i.e., sidechannels such as execution time
or memory usage) can enable attackers to infer secrets
that the program accesses (such as a password). In this
talk, I will discuss how symbolic execution, combined
with a model counting constraint solver, can be used
for quantifying side-channel leakage in Java programs.
I will also discuss automata-based model counting
techniques. We have implemented these techniques by
integrating our model counting constraint solver,
called Automata-Based model Counter (ABC), with the
symbolic execution tool Symbolic Path Finder (SPF).",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGSOFT Software Engineering Notes",
journal-URL = "https://dl.acm.org/citation.cfm?id=J728",
}
@Article{Canard:2018:CPK,
author = "S{\'e}bastien Canard and Viet Cuong Trinh",
title = "Certificateless Public Key Cryptography in the
Standard Model",
journal = j-FUND-INFO,
volume = "161",
number = "3",
pages = "219--248",
month = "????",
year = "2018",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2018-1701",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Fri Sep 21 07:16:52 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Canard:2018:NTC,
author = "S. Canard and D. H. Phan and D. Pointcheval and V. C.
Trinh",
title = "A new technique for compacting ciphertext in
multi-channel broadcast encryption and attribute-based
encryption",
journal = j-THEOR-COMP-SCI,
volume = "723",
number = "??",
pages = "51--72",
day = "2",
month = may,
year = "2018",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2018.02.036",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Mar 30 09:27:56 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397518301427",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Cao:2018:CUP,
author = "Kaidi Cao and Jing Liao and Lu Yuan",
title = "{CariGANs}: unpaired photo-to-caricature translation",
journal = j-TOG,
volume = "37",
number = "6",
pages = "244:1--244:??",
month = nov,
year = "2018",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/3272127.3275046",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Tue Oct 22 12:28:14 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
abstract = "Facial caricature is an art form of drawing faces in
an exaggerated way to convey humor or sarcasm. In this
paper, we propose the first Generative Adversarial
Network (GAN) for unpaired photo-to-caricature
translation, which we call ``CariGANs''. It explicitly
models geometric exaggeration and appearance
stylization using two components: CariGeoGAN, which
only models the geometry-to-geometry transformation
from face photos to caricatures, and CariStyGAN, which
transfers the style appearance from caricatures to face
photos without any geometry deformation. In this way, a
difficult cross-domain translation problem is decoupled
into two easier tasks. The perceptual study shows that
caricatures generated by our CariGANs are closer to the
hand-drawn ones, and at the same time better persevere
the identity, compared to state-of-the-art methods.
Moreover, our CariGANs allow users to control the shape
exaggeration degree and change the color/texture style
by tuning the parameters or giving an example
caricature.",
acknowledgement = ack-nhfb,
articleno = "244",
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@Article{Cao:2018:EEG,
author = "Jin Cao and Maode Ma and Hui Li and Yulong Fu and
Xuefeng Liu",
title = "{EGHR}: Efficient group-based handover authentication
protocols for {mMTC} in {5G} wireless networks",
journal = j-J-NETW-COMPUT-APPL,
volume = "102",
number = "??",
pages = "1--16",
day = "15",
month = jan,
year = "2018",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Fri Jan 12 10:10:20 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517303776",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Cerf:2018:CSA,
author = "Vinton G. Cerf",
title = "{Cerf}'s up: Self-authenticating identifiers",
journal = j-CACM,
volume = "61",
number = "12",
pages = "5--5",
month = dec,
year = "2018",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3289429",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Nov 26 10:11:32 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://cacm.acm.org/magazines/2018/12/232883/fulltext",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Chang:2018:DMU,
author = "Doohwang Chang and Ganapati Bhat and Umit Ogras and
Bertan Bakkaloglu and Sule Ozev",
title = "Detection Mechanisms for Unauthorized Wireless
Transmissions",
journal = j-TODAES,
volume = "23",
number = "6",
pages = "70:1--70:??",
month = dec,
year = "2018",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/3241046",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Mar 22 16:58:40 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "With increasing diversity of supply chains from design
to delivery, there is an increasing risk that
unauthorized changes can be made within an IC. One of
the motivations for this type of change is to learn
important information (such as encryption keys,
spreading codes) from the hardware, and transmit this
information to a malicious party. To evade detection,
such unauthorized communication can be hidden within
legitimate bursts of transmit signal. In this article,
we present several signal processing techniques to
detect unauthorized transmissions which can be hidden
within the legitimate signal. We employ a scheme where
the legitimate transmission is configured to emit a
single sinusoidal waveform. We use time and spectral
domain analysis techniques to explore the transmit
spectrum. Since every transmission, no matter how low
the signal power is, must have a spectral signature, we
identify unauthorized transmission by eliminating the
desired signal from the spectrum after capture.
Experiment results show that when spread spectrum
techniques are used, the presence of an unauthorized
signal can be determined without the need for decoding
the malicious signal. The proposed detection techniques
need to be used as enhancements to the regular testing
and verification procedures if hardware security is a
concern.",
acknowledgement = ack-nhfb,
articleno = "70",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Chattaraj:2018:NTS,
author = "Durbadal Chattaraj and Monalisa Sarma and Ashok Kumar
Das",
title = "A new two-server authentication and key agreement
protocol for accessing secure cloud services",
journal = j-COMP-NET-AMSTERDAM,
volume = "131",
number = "??",
pages = "144--164",
day = "11",
month = feb,
year = "2018",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Feb 3 10:51:33 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S1389128617304255",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Chaudhry:2018:IRB,
author = "Shehzad Ashraf Chaudhry and Husnain Naqvi and Mohammad
Sabzinejad Farash and Taeshik Shon and Muhammad Sher",
title = "An improved and robust biometrics-based three factor
authentication scheme for multiserver environments",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "8",
pages = "3504--3520",
month = aug,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-015-1601-y",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Oct 10 15:31:14 MDT 2019",
bibsource = "http://link.springer.com/journal/11227/74/8;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Chauhan:2018:BBA,
author = "Jagmohan Chauhan and Suranga Seneviratne and Yining Hu
and Archan Misra and Aruna Seneviratne and Youngki
Lee",
title = "Breathing-Based Authentication on Resource-Constrained
{IoT} Devices using Recurrent Neural Networks",
journal = j-COMPUTER,
volume = "51",
number = "5",
pages = "60--67",
month = may,
year = "2018",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2018.2381119",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Thu May 31 05:53:38 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.computer.org/csdl/mags/co/2018/05/mco2018050060-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Chauhan:2018:PCD,
author = "Jagmohan Chauhan and Jathushan Rajasegaran and Suranga
Seneviratne and Archan Misra and Aruna Seneviratne and
Youngki Lee",
title = "Performance Characterization of Deep Learning Models
for Breathing-based Authentication on
Resource-Constrained Devices",
journal = j-IMWUT,
volume = "2",
number = "4",
pages = "1--24",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3287036",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:37:06 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3287036",
abstract = "Providing secure access to smart devices such as
smartphones, wearables and various other IoT devices is
becoming increasingly important, especially as these
devices store a range of sensitive personal
information. Breathing acoustics-based \ldots{}",
acknowledgement = ack-nhfb,
articleno = "158",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Checkoway:2018:WDL,
author = "Stephen Checkoway and Jacob Maskiewicz and Christina
Garman and Joshua Fried and Shaanan Cohney and Matthew
Green and Nadia Heninger and Ralf-Philipp Weinmann and
Eric Rescorla and Hovav Shacham",
title = "Where did {I} leave my keys?: lessons from the
{Juniper Dual EC} incident",
journal = j-CACM,
volume = "61",
number = "11",
pages = "148--155",
month = nov,
year = "2018",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3266291",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Oct 29 12:40:16 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "https://cacm.acm.org/magazines/2018/11/232227/fulltext",
abstract = "In December 2015, Juniper Networks announced multiple
security vulnerabilities stemming from unauthorized
code in ScreenOS, the operating system for their
NetScreen Virtual Private Network (VPN) routers. The
more sophisticated of these vulnerabilities was a
passive VPN decryption capability, enabled by a change
to one of the parameters used by the Dual Elliptic
Curve (EC) pseudorandom number generator. In this
paper, we described the results of a full independent
analysis of the ScreenOS randomness and VPN key
establishment protocol subsystems, which we carried out
in response to this incident. While Dual EC is known to
be insecure against an attacker who can choose the
elliptic curve parameters, Juniper had claimed in 2013
that ScreenOS included countermeasures against this
type of attack. We find that, contrary to Juniper's
public statements, the ScreenOS VPN implementation has
been vulnerable to passive exploitation by an attacker
who selects the Dual EC curve point since 2008. This
vulnerability arises due to flaws in Juniper's
countermeasures as well as a cluster of changes that
were all introduced concurrently with the inclusion of
Dual EC in a single 2008 release. We demonstrate the
vulnerability on a real NetScreen device by modifying
the firmware to install our own parameters, and we show
that it is possible to passively decrypt an individual
VPN session in isolation without observing any other
network traffic. This incident is an important example
of how guidelines for random number generation,
engineering, and validation can fail in practice.
Additionally, it casts further doubt on the
practicality of designing a safe ``exceptional access''
or ``key escrow'' scheme of the type contemplated by
law enforcement agencies in the United States and
elsewhere.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Chen:2018:ERS,
author = "Siyuan Chen and Peng Zeng and Kim-Kwang Raymond Choo
and Xiaolei Dong",
title = "Efficient Ring Signature and Group Signature Schemes
Based on $q$-ary Identification Protocols",
journal = j-COMP-J,
volume = "61",
number = "4",
pages = "545--560",
day = "1",
month = apr,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxx112",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:19 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/4/545/4656252",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Chen:2018:ESA,
author = "Yung-Chih Chen",
title = "Enhancements to {SAT} Attack: Speedup and Breaking
Cyclic Logic Encryption",
journal = j-TODAES,
volume = "23",
number = "4",
pages = "52:1--52:??",
month = jul,
year = "2018",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/3190853",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Mar 22 16:58:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "Logic encryption is an IC protection technique for
preventing an IC design from overproduction and
unauthorized use. It hides a design's functionality by
inserting key gates and key inputs, such that a secret
key is required to activate the design and make it
function correctly. The security of a logic encryption
algorithm is evaluated according to the difficulty of
cracking the secret key. The state-of-the-art attack
method identifies a secret key with a series of
SAT-solving calls to prune all the incorrect keys.
Although it can break most of the existing logic
encryption algorithms within a few hours, we observe
that there exist two enhancements for increasing its
efficiency. First, we introduce a preprocess to
identify and eliminate redundant key inputs and
simplify SAT problems. Second, we present a key
checking process for increasing the pruned incorrect
keys in each SAT-solving iteration. We conducted the
experiments on a set of benchmark circuits encrypted by
six different logic encryption algorithms. The
simulation results show that the enhanced method can
successfully unlock 10 benchmark circuits which
originally could not be cracked within 1 hour. For all
the benchmark circuits, the average speedup is
approximately 2.2x in terms of simulation time.
Furthermore, a recent logic encryption method locks a
design by creating cyclic paths, which can invalidate
the SAT-based attack method. We analyze the impact of
cyclic paths and propose an enhancement to break the
cyclic logic encryption method.",
acknowledgement = ack-nhfb,
articleno = "52",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Chen:2018:RLF,
author = "Yu Chen and Baodong Qin and Haiyang Xue",
title = "Regular lossy functions and their applications in
leakage-resilient cryptography",
journal = j-THEOR-COMP-SCI,
volume = "739",
number = "??",
pages = "13--38",
day = "29",
month = aug,
year = "2018",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2018.04.043",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Jun 8 16:52:50 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397518302937",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Chen:2018:SIA,
author = "Jiageng Chen and Chunhua Su and Kuo-Hui Yeh and Moti
Yung",
title = "Special Issue on Advanced Persistent Threat",
journal = j-FUT-GEN-COMP-SYS,
volume = "79 (part 1)",
number = "??",
pages = "243--246",
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.11.005",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Nov 24 15:16:17 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17324913",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
keywords = "APT; Behavior based detection; Data driven security;
Encrypted traffic; Zero-day vulnerability",
}
@Article{Chung:2018:ERN,
author = "Heewon Chung and Myungsun Kim",
title = "Encoding of Rational Numbers and Their Homomorphic
Computations for {FHE}-Based Applications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "6",
pages = "??--??",
month = sep,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500193",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:47 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500193",
abstract = "This work addresses a basic problem of security
systems that operate on very sensitive information.
Specifically, we are interested in the problem of
privately handling numeric data represented by rational
numbers (e.g., medical records). Fully homomorphic
encryption (FHE) is one of the natural and powerful
tools for ensuring privacy of sensitive data, while
allowing complicated computations on the data. However,
because the native plaintext domain of known FHE
schemes is restricted to a set of quite small integers,
it is not easy to obtain efficient algorithms for
encrypted rational numbers in terms of space and
computation costs. For example, the na{\"\i}ve decimal
representation considerably restricts the choice of
parameters in employing an FHE scheme, particularly the
plaintext size. Our basic strategy is to alleviate this
inefficiency by using a different representation of
rational numbers instead of na{\"\i}ve expressions. In
this work we express rational numbers as continued
fractions. Because continued fractions enable us to
represent rational numbers as a sequence of integers,
we can use a plaintext space with a small size while
preserving the same quality of precision. However, this
encoding technique requires performing very complex
arithmetic operations, such as division and modular
reduction. Theoretically, FHE allows the evaluation of
any function, including modular reduction at encrypted
data, but it requires a Boolean circuit of very high
degree to be constructed. Hence, the primary
contribution of this work is developing an approach to
solve this efficiency problem using homomorphic
operations with small degrees.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Claxson:2018:SVE,
author = "Nick Claxson",
title = "Securing {VoIP}: encrypting today's digital telephony
systems",
journal = j-NETWORK-SECURITY,
volume = "2018",
number = "11",
pages = "11--13",
month = nov,
year = "2018",
CODEN = "NTSCF5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Thu Sep 12 12:58:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485818301120",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Cohen:2018:WCC,
author = "Aloni Cohen and Justin Holmgren and Ryo Nishimaki and
Vinod Vaikuntanathan and Daniel Wichs",
title = "Watermarking Cryptographic Capabilities",
journal = j-SIAM-J-COMPUT,
volume = "47",
number = "6",
pages = "2157--2202",
month = "????",
year = "2018",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/18M1164834",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Wed Oct 9 17:50:55 MDT 2019",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/47/6;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 2018",
}
@Article{Connolly:2018:FE,
author = "Aisling Connolly",
title = "Freedom of Encryption",
journal = j-IEEE-SEC-PRIV,
volume = "16",
number = "1",
pages = "102--103",
month = jan # "\slash " # feb,
year = "2018",
CODEN = "????",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Feb 16 07:55:13 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "https://www.computer.org/csdl/mags/sp/2018/01/msp2018010102.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security",
}
@Article{Cui:2018:ABC,
author = "Hui Cui and Robert H. Deng and Yingjiu Li",
title = "Attribute-based cloud storage with secure provenance
over encrypted data",
journal = j-FUT-GEN-COMP-SYS,
volume = "79 (part 2)",
number = "??",
pages = "461--472",
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.10.010",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Nov 24 15:16:17 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17322835",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
keywords = "Access control; Anonymity; Cloud storage;
Confidentiality; Revocation; Scalability; Secure
provenance; Traceability",
}
@Article{Dai:2018:OPC,
author = "Wei Dai and William Whyte and Zhenfei Zhang",
title = "Optimizing Polynomial Convolution for {NTRUEncrypt}",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "11",
pages = "1572--1583",
month = "????",
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2809723",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Oct 11 14:31:34 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8303667/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Daneshgar:2018:SSS,
author = "Amir Daneshgar and Fahimeh Mohebbipoor",
title = "A Secure Self-Synchronized Stream Cipher",
journal = j-COMP-J,
volume = "61",
number = "8",
pages = "1180--1201",
day = "1",
month = aug,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy053",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:57 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/8/1180/5005423",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Darivandpour:2018:ESP,
author = "Javad Darivandpour and Mikhail J. Atallah",
title = "Efficient and secure pattern matching with wildcards
using lightweight cryptography",
journal = j-COMPUT-SECUR,
volume = "77",
number = "??",
pages = "666--674",
month = aug,
year = "2018",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:55 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S016740481830021X",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Delledonne:2018:CDA,
author = "Lorenzo Delledonne and Vittorio Zaccaria and Ruggero
Susella and Guido Bertoni and Filippo Melzani",
title = "{CASCA}: a Design Automation Approach for Designing
Hardware Countermeasures Against Side-Channel Attacks",
journal = j-TODAES,
volume = "23",
number = "6",
pages = "69:1--69:??",
month = dec,
year = "2018",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/3241047",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Mar 22 16:58:40 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "Implementing a cryptographic circuit poses challenges
not always acknowledged in the backing mathematical
theory. One of them is the vulnerability against
side-channel attacks. A side-channel attack is a
procedure that uses information leaked by the circuit
through, for example, its own power consumption or
electromagnetic emissions, to derive sensitive data
(e.g, the secret key used for encryption). Nowadays, we
design circuitry to keep this sensitive information
from leaking (i.e., a countermeasure ), but the path
from specification down to implementation is far from
being fully automatic. As we know, manual refinement
steps can be error prone and the sheer potential of
these errors can be devastating in a scenario such as
the one we are dealing with. In this article, we
investigate whether a single embedded domain specific
language (EDSL) can, at the same time, help us in
specifying and enforcing the functionality of the
circuit as well as its protection against side-channel
attacks. The EDSL is a fundamental block of an original
design flow (named Countermeasure Against Side-Channel
Attacks, i.e., CASCA) whose aim is to complement an
existing industrial scenario and to provide the
necessary guarantee that a secure primitive is not
vulnerable up to a first-order attack. As a practical
case study, we will show how we applied the proposed
tools to ensure both functional and extra-functional
correctness of a composite-field Advanced Encryption
Standard (AES) S-Box. To ensure the reproducibility of
this research, this article is accompanied by an open
source release of the EDSL$^1$ that contains the
presented S-Box implementation and an additional
3-Shares threshold implementation of the Keccak $ \chi
$ function [7].",
acknowledgement = ack-nhfb,
articleno = "69",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Deng:2018:SFE,
author = "Lih-Yuan Deng and Jyh-Jen Horng Shiau and Henry
Horng-Shing Lu and Dale Bowman",
title = "{Secure and Fast Encryption (SAFE)} with Classical
Random Number Generators",
journal = j-TOMS,
volume = "44",
number = "4",
pages = "45:1--45:17",
month = aug,
year = "2018",
CODEN = "ACMSCU",
DOI = "https://doi.org/10.1145/3212673",
ISSN = "0098-3500 (print), 1557-7295 (electronic)",
ISSN-L = "0098-3500",
bibdate = "Fri Oct 5 11:23:13 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/toms.bib",
URL = "https://dl.acm.org/citation.cfm?id=3212673",
abstract = "Pseudo-random number generators (PRNGs) play an
important role in both areas of computer simulation and
computer security. Currently, there appears to be a
huge divide between the types of PRNGs used in these
two areas. For PRNGs in computer security applications,
the security concern is extremely important. For PRNGs
in computer simulation applications, the properties of
high-dimensional equi-distribution, efficiency, long
period-length, and portability are important. In recent
years, there have been many PRNGs proposed in the area
of computer simulation satisfying these nice
properties. However, most of them are linear
generators, thus sharing the same weakness in
predictability. The major aim of this article is to
propose a general class of secure generators, called
SAFE (secure and fast encryption) generators, by
properly ``mixing'' two baseline generators with the
aforementioned properties to obtain a secure generator
that would inherit these nice properties. Specifically,
we propose applying a general mutual-shuffling method
to certain linear generators, such as the currently
most popular MT19937 generator and large-order multiple
recursive generators, as well as outputting certain
nonlinear transformations of the generated variates to
construct secure PRNGS.",
acknowledgement = ack-nhfb,
articleno = "45",
fjournal = "ACM Transactions on Mathematical Software (TOMS)",
journal-URL = "http://dl.acm.org/pub.cfm?id=J782",
}
@Article{Dickens:2018:SCI,
author = "Bernard {Dickens III} and Haryadi S. Gunawi and Ariel
J. Feldman and Henry Hoffmann",
title = "{StrongBox}: Confidentiality, Integrity, and
Performance using Stream Ciphers for Full Drive
Encryption",
journal = j-SIGPLAN,
volume = "53",
number = "2",
pages = "708--721",
month = feb,
year = "2018",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/3296957.3173183",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Oct 16 14:12:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "Full-drive encryption (FDE) is especially important
for mobile devices because they contain large
quantities of sensitive data yet are easily lost or
stolen. Unfortunately, the standard approach to FDE-the
AES block cipher in XTS mode-is 3--5$ \times $ slower
than unencrypted storage. Authenticated encryption
based on stream ciphers is already used as a faster
alternative to AES in other contexts, such as HTTPS,
but the conventional wisdom is that stream ciphers are
unsuitable for FDE. Used naively in drive encryption,
stream ciphers are vulnerable to attacks, and
mitigating these attacks with on-drive metadata is
generally believed to ruin performance. In this paper,
we argue that recent developments in mobile hardware
invalidate this assumption, making it possible to use
fast stream ciphers for FDE. Modern mobile devices
employ solid-state storage with Flash Translation
Layers (FTL), which operate similarly to Log-structured
File Systems (LFS). They also include trusted hardware
such as Trusted Execution Environments (TEEs) and
secure storage areas. Leveraging these two trends, we
propose StrongBox, a stream cipher-based FDE layer that
is a drop-in replacement for dm-crypt, the standard
Linux FDE module based on AES-XTS. StrongBox introduces
a system design and on-drive data structures that
exploit LFS's lack of overwrites to avoid costly
rekeying and a counter stored in trusted hardware to
protect against attacks. We implement StrongBox on an
ARM big.LITTLE mobile processor and test its
performance under multiple popular production LFSes. We
find that StrongBox improves read performance by as
much as 2.36$ \times $ (1.72$ \times $ on average)
while offering stronger integrity guarantees.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "ASPLOS '18 proceedings.",
}
@Article{Ding:2018:NPH,
author = "Kaimeng Ding and Shiping Chen and Fan Meng",
title = "A Novel Perceptual Hash Algorithm for Multispectral
Image Authentication",
journal = j-ALGORITHMS-BASEL,
volume = "11",
number = "1",
month = jan,
year = "2018",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a11010006",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:14 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "https://www.mdpi.com/1999-4893/11/1/6",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
ORCID-numbers = "Kaimeng Ding/0000-0002-1339-813X; Shiping
Chen/0000-0002-4603-0024; Fan
Meng/0000-0002-3419-7652",
pagecount = "??",
pubdates = "Received: 21 December 2017 / Revised: 7 January 2018 /
Accepted: 8 January 2018 / Published: 14 January 2018",
}
@Article{Djaziri-Larbi:2018:WDA,
author = "Sonia Djaziri-Larbi and Ga{\"e}l Mah{\'e} and Imen
Mezghani and Monia Turki and M{\'e}riem Ja{\"\i}dane",
title = "Watermark-Driven Acoustic Echo Cancellation",
journal = j-IEEE-ACM-TASLP,
volume = "26",
number = "2",
pages = "367--378",
month = "????",
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1109/TASLP.2017.2778150",
ISSN = "2329-9290",
ISSN-L = "2329-9290",
bibdate = "Sat Jan 20 08:35:33 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeeacmtaslp.bib",
URL = "http://ieeexplore.ieee.org/document/8122007/",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6570655",
}
@Article{Dong:2018:SSM,
author = "Yao Dong and Ana Milanova and Julian Dolby",
title = "{SecureMR}: secure mapreduce using homomorphic
encryption and program partitioning",
journal = j-SIGPLAN,
volume = "53",
number = "1",
pages = "389--390",
month = jan,
year = "2018",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/3200691.3178520",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Oct 16 14:12:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "In cloud computing customers upload data and
computation to cloud providers. As they cede their data
to the cloud provider, they may cede data
confidentiality. We develop SecureMR, a system that
analyzes and transforms MapReduce programs to operate
over encrypted data. SecureMR makes use of partially
homomorphic encryption and a trusted client. We
evaluate SecureMR on a set of MapReduce benchmarks.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "PPoPP '18 proceedings.",
}
@Article{Dou:2018:OHR,
author = "Yi Dou and Henry C B Chan and Man Ho Au",
title = "Order-Hiding Range Query over Encrypted Data without
Search Pattern Leakage",
journal = j-COMP-J,
volume = "61",
number = "12",
pages = "1806--1824",
day = "1",
month = dec,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy075",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 27 19:24:38 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/12/1806/5065094",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Drucker:2018:FMB,
author = "Nir Drucker and Shay Gueron and Vlad Krasnov",
title = "Fast multiplication of binary polynomials with the
forthcoming vectorized {VPCLMULQDQ} instruction",
crossref = "Tenca:2018:PIS",
pages = "115--119",
year = "2018",
DOI = "https://doi.org/10.1109/ARITH.2018.8464777",
bibdate = "Fri Jan 31 08:05:31 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "Polynomial multiplication over binary fields $ \mathbb
{F}_{2^n} $ is a common primitive, used for example by
current cryptosystems such as AES-GCM (with $ n =
128$). It also turns out to be a primitive for other
cryptosystems, that are being designed for the Post
Quantum era, with values n 128. Examples from the
recent submissions to the NIST Post-Quantum
Cryptography project, are BIKE, LEDAKem, and GeMSS,
where the performance of the polynomial
multiplications, is significant. Therefore, efficient
polynomial multiplication over $ \mathbb {F}_{2^n}$,
with large $n$, is a significant emerging optimization
target. Anticipating future applications, Intel has
recently announced that its future architecture
(codename Ice Lake) will introduce a new vectorized way
to use the current VPCLMULQDQ instruction. In this
paper, we demonstrate how to use this instruction for
accelerating polynomial multiplication. Our analysis
shows a prediction for at least $ 2 \times $ speedup
for multiplications with polynomials of degree 512 or
more.",
acknowledgement = ack-nhfb,
keywords = "Acceleration; AES-GCM; ARITH-25; BIKE; binary
field-mathbbF2n; Computer architecture; Cryptography;
cryptosystems; fast binary polynomial multiplication;
fast multiplication; GeMSS; ice lake; LEDAKem; NIST;
NIST Post-Quantum Cryptography project; optimisation;
Optimization; optimization target; polynomials; post
quantum cryptography; quantum cryptography; Registers;
vectorized VPCLMULQDQ instruction; Web services",
}
@Article{Dwivedi:2018:DLR,
author = "Ashutosh Dhar Dwivedi and Pawel Morawiecki and Rajani
Singh and Shalini Dhar",
title = "Differential-linear and related key cryptanalysis of
round-reduced scream",
journal = j-INFO-PROC-LETT,
volume = "136",
number = "??",
pages = "5--8",
month = aug,
year = "2018",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2018.03.010",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri May 18 16:36:27 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019018300656",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Dziembowski:2018:NMC,
author = "Stefan Dziembowski and Krzysztof Pietrzak and Daniel
Wichs",
title = "Non-Malleable Codes",
journal = j-J-ACM,
volume = "65",
number = "4",
pages = "20:1--20:??",
month = aug,
year = "2018",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/3178432",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Thu Nov 29 14:39:20 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "We introduce the notion of ``non-malleable codes''
which relaxes the notion of error correction and error
detection. Informally, a code is non-malleable if the
message contained in a modified codeword is either the
original message, or a completely unrelated value. In
contrast to error correction and error detection,
non-malleability can be achieved for very rich classes
of modifications. We construct an efficient code that
is non-malleable with respect to modifications that
affect each bit of the codeword arbitrarily (i.e.,
leave it untouched, flip it, or set it to either 0 or
1), but independently of the value of the other bits of
the codeword. Using the probabilistic method, we also
show a very strong and general statement: there exists
a non-malleable code for every ``small enough'' family
F of functions via which codewords can be modified.
Although this probabilistic method argument does not
directly yield efficient constructions, it gives us
efficient non-malleable codes in the random-oracle
model for very general classes of tampering
functions-e.g., functions where every bit in the
tampered codeword can depend arbitrarily on any 99\% of
the bits in the original codeword. As an application of
non-malleable codes, we show that they provide an
elegant algorithmic solution to the task of protecting
functionalities implemented in hardware (e.g.,
signature cards) against ``tampering attacks.'' In such
attacks, the secret state of a physical system is
tampered, in the hopes that future interaction with the
modified system will reveal some secret information.
This problem was previously studied in the work of
Gennaro et al. in 2004 under the name ``algorithmic
tamper proof security'' (ATP). We show that
non-malleable codes can be used to achieve important
improvements over the prior work. In particular, we
show that any functionality can be made secure against
a large class of tampering attacks, simply by encoding
the secret state with a non-malleable code while it is
stored in memory.",
acknowledgement = ack-nhfb,
articleno = "20",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
remark = "Distributed Computing, Cryptography, Distributed
Computing, Cryptography, Coding Theory, Automata
Theory, Complexity Theory, Programming Languages,
Algorithms, Invited Paper Foreword and Databases.",
}
@Article{Ehatisham-ul-Haq:2018:CAS,
author = "Muhammad Ehatisham-ul-Haq and Muhammad Awais Azam and
Usman Naeem and Yasar Amin and Jonathan Loo",
title = "Continuous authentication of smartphone users based on
activity pattern recognition using passive mobile
sensing",
journal = j-J-NETW-COMPUT-APPL,
volume = "109",
number = "??",
pages = "24--35",
day = "1",
month = may,
year = "2018",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2018.02.020",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sun May 27 08:10:14 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518300717",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@InProceedings{Emmart:2018:FME,
author = "Niall Emmart and Fangyu Zhengt and Charles Weems",
title = "Faster Modular Exponentiation Using Double Precision
Floating Point Arithmetic on the {GPU}",
crossref = "Tenca:2018:PIS",
pages = "130--137",
year = "2018",
DOI = "https://doi.org/10.1109/ARITH.2018.8464792",
bibdate = "Fri Jan 31 08:05:31 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "This paper presents a new approach to integer multiple
precision (MP) modular exponentiation, using
double-precision floating point (DPF) operations, that
is suitable for GPU implementation. We show speedups
ranging from 20\% to 34\% over the best prior GPU times
for sizes corresponding to common RSA cryptographic
operations (2048 to 4096 bits). Three techniques are
described. First, by adding $ 2^{104} $ to the high
half of the product, and $ 2^{52} $ to the low half, we
set the implicit leading 1 in the DPF mantissa so that
the full 52 explicit bits are available for each half
of the 104-bit products of samples. Second, the DPF
values are cast bitwise to 64-bit integers for adding
the column sums to get the MP result. Normally the cast
would require masking off the exponents, but because
they are constant, we can include them in the column
sums and correct just once for their total. Third, by
initializing the column sums with the appropriate
negative value to compensate for the exponent sums, no
corrective subtraction is needed. Our implementation on
an NVIDIA GTX Titan Black GPU achieves between 132.5K
and 161.9K modular exponentiations per second of size
1024 bits, with latencies ranging from 21.7 ms to 17.8
ms, making it practical for online RSA applications.
Proportional results are shown for 1536 and 2048 bits.
The implementation is so efficient that its maximum
sustained performance is actually bounded by the
thermal limit of the GPU.",
acknowledgement = ack-nhfb,
keywords = "appropriate negative value; ARITH-25; column sums;
common RSA cryptographic operations; Computer
architecture; cryptography; Cryptography; double
precision floating point arithmetic; DPF mantissa;
exponent sum compensation; faster modular
exponentiation; floating point arithmetic;
Floating-point arithmetic; Graphics processing units;
graphics processing units; Hardware; integer multiple
precision modular exponentiation; multiple precision
modular exponentiation; NVIDIA GTX Titan Black GPU;
online RSA applications; parallel architectures; time
17.8 ms to 21.7 ms; word length 1024.0 bit; word length
104 bit; word length 1536.0 bit; word length 2048 bit
to 4096 bit; word length 64 bit",
}
@Article{Espitau:2018:LAF,
author = "Thomas Espitau and Pierre-Alain Fouque and Beno{\^\i}t
G{\'e}rard and Mehdi Tibouchi",
title = "Loop-Abort Faults on Lattice-Based Signature Schemes
and Key Exchange Protocols",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "11",
pages = "1535--1549",
month = nov,
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2833119",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Mar 15 08:10:14 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8354897/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Fahd:2018:CPA,
author = "Shah Fahd and Mehreen Afzal and Haider Abbas and
Waseem Iqbal and Salman Waheed",
title = "Correlation power analysis of modes of encryption in
{AES} and its countermeasures",
journal = j-FUT-GEN-COMP-SYS,
volume = "83",
number = "??",
pages = "496--509",
month = jun,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Thu Mar 15 17:42:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17311822",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Fan:2018:MBP,
author = "Jingyuan Fan and Chaowen Guan and Kui Ren and Chunming
Qiao",
title = "Middlebox-Based Packet-Level Redundancy Elimination
Over Encrypted Network Traffic",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "4",
pages = "1742--1753",
month = aug,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2846791",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Oct 18 05:31:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "To eliminate redundant transfers over WAN links and
improve network efficiency, middleboxes have been
deployed at ingress/egress. These middleboxes can
operate on individual packets and are application layer
protocol transparent. They can identify and remove
duplicated byte strings on the fly. However, with the
increasing use of HTTPS, current redundancy elimination
RE solution can no longer work without violating
end-to-end privacy. In this paper, we present RE over
encrypted traffic REET, the first middlebox-based
system that supports both intra-user and inter-user
packet-level RE directly over encrypted traffic. REET
realizes this by using a novel protocol with limited
overhead and protects end users from honest-but-curious
middleboxes. We implement REET and show its performance
for both end users and middleboxes using several
hundred gigabytes of network traffic traces collected
from a large U.S. university.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Fanti:2018:DLC,
author = "Giulia Fanti and Shaileshh Bojja Venkatakrishnan and
Surya Bakshi and Bradley Denby and Shruti Bhargava and
Andrew Miller and Pramod Viswanath",
title = "{Dandelion++}: Lightweight Cryptocurrency Networking
with Formal Anonymity Guarantees",
journal = j-SIGMETRICS,
volume = "46",
number = "1",
pages = "5--7",
month = jun,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3292040.3219620",
ISSN = "0163-5999 (print), 1557-9484 (electronic)",
ISSN-L = "0163-5999",
bibdate = "Fri Jan 18 06:03:57 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
abstract = "Recent work has demonstrated significant anonymity
vulnerabilities in Bitcoin's networking stack. In
particular, the current mechanism for broadcasting
Bitcoin transactions allows third-party observers to
link transactions to the IP addresses that originated
them. This lays the groundwork for low-cost,
large-scale deanonymization attacks. In this work, we
present Dandelion++, a first-principles defense against
large-scale deanonymization attacks with near-optimal
information-theoretic guarantees. Dandelion++ builds
upon a recent proposal called Dandelion that exhibited
similar goals. However, in this paper, we highlight
some simplifying assumptions made in Dandelion, and
show how they can lead to serious deanonymization
attacks when violated. In contrast, Dandelion++ defends
against stronger adversaries that are allowed to
disobey protocol. Dandleion++ is lightweight, scalable,
and completely interoperable with the existing Bitcoin
network.We evaluate it through experiments on Bitcoin's
mainnet (i.e., the live Bitcoin network) to demonstrate
its interoperability and low broadcast latency
overhead.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journal-URL = "http://portal.acm.org/toc.cfm?id=J618",
}
@Article{Farwa:2018:FAI,
author = "Shabieh Farwa and Nazeer Muhammad and Nargis Bibi and
Sajjad A. Haider and Syed R. Naqvi and Sheraz Anjum",
title = "{Fresnelet} approach for image encryption in the
algebraic frame",
journal = j-APPL-MATH-COMP,
volume = "334",
number = "??",
pages = "343--355",
day = "1",
month = oct,
year = "2018",
CODEN = "AMHCBQ",
DOI = "https://doi.org/10.1016/j.amc.2018.03.105",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jun 2 17:40:19 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2015.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
note = "See retraction notice \cite{Farwa:2019:RNF}.",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300318302868",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Faz-Hernandez:2018:FSI,
author = "Armando Faz-Hern{\'a}ndez and Julio L{\'o}pez and
Eduardo Ochoa-Jim{\'e}nez and Francisco
Rodr{\'\i}guez-Henr{\'\i}quez",
title = "A Faster Software Implementation of the Supersingular
Isogeny {Diffie--Hellman} Key Exchange Protocol",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "11",
pages = "1622--1636",
month = nov,
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2017.2771535",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Mar 15 08:10:14 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8100879/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Feng:2018:ABB,
author = "Qi Feng and Debiao He and Sherali Zeadally and Huaqun
Wang",
title = "Anonymous biometrics-based authentication scheme with
key distribution for mobile multi-server environment",
journal = j-FUT-GEN-COMP-SYS,
volume = "84",
number = "??",
pages = "239--251",
month = jul,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.07.040",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Apr 16 14:45:08 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17309020",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Feng:2018:ALA,
author = "Wei Feng and Yu Qin and Shijun Zhao and Dengguo Feng",
title = "{AAoT}: Lightweight attestation and authentication of
low-resource things in {IoT} and {CPS}",
journal = j-COMP-NET-AMSTERDAM,
volume = "134",
number = "??",
pages = "167--182",
day = "7",
month = apr,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2018.01.039",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Mar 17 13:11:52 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128618300471",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Ferrag:2018:SCN,
author = "Mohamed Amine Ferrag and Leandros Maglaras and
Antonios Argyriou and Dimitrios Kosmanos and Helge
Janicke",
title = "Security for {4G} and {5G} cellular networks: a survey
of existing authentication and privacy-preserving
schemes",
journal = j-J-NETW-COMPUT-APPL,
volume = "101",
number = "??",
pages = "55--82",
day = "1",
month = jan,
year = "2018",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Fri Jan 12 10:10:20 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517303521",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Fidler:2018:CCN,
author = "Bradley Fidler",
title = "Cryptography, Capitalism, and National Security",
journal = j-IEEE-ANN-HIST-COMPUT,
volume = "40",
number = "4",
pages = "80--84",
month = oct # "\slash " # dec,
year = "2018",
CODEN = "IAHCEX",
DOI = "https://doi.org/10.1109/MAHC.2018.2876099",
ISSN = "1058-6180 (print), 1934-1547 (electronic)",
ISSN-L = "1058-6180",
bibdate = "Thu Jan 24 10:01:33 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeeannhistcomput.bib",
URL = "https://ieeexplore.ieee.org/document/8620680/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Annals of the History of Computing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85",
}
@Article{Fu:2018:LUA,
author = "Xingbing Fu and Xuyun Nie and Ting Wu and Fagen Li",
title = "Large universe attribute based access control with
efficient decryption in cloud storage system",
journal = j-J-SYST-SOFTW,
volume = "135",
number = "??",
pages = "157--164",
month = jan,
year = "2018",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Nov 13 10:11:01 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121217302510",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Fugkeaw:2018:SSA,
author = "Somchart Fugkeaw and Hiroyuki Sato",
title = "Scalable and secure access control policy update for
outsourced big data",
journal = j-FUT-GEN-COMP-SYS,
volume = "79 (part 1)",
number = "??",
pages = "364--373",
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.06.014",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Nov 24 15:16:17 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17312426",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
keywords = "Cloud computing; CP-ABE; Data access control; Policy
update; Proxy re-encryption",
}
@Article{Gao:2018:PRR,
author = "Xinwei Gao and Jintai Ding and Lin Li and Jiqiang
Liu",
title = "Practical Randomized {RLWE}-Based Key Exchange Against
Signal Leakage Attack",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "11",
pages = "1584--1593",
month = nov,
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2808527",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Mar 15 08:10:14 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8300634/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Geetha:2018:OVC,
author = "P. Geetha and V. S. Jayanthi and A. N. Jayanthi",
title = "Optimal visual cryptographic scheme with multiple
share creation for multimedia applications",
journal = j-COMPUT-SECUR,
volume = "78",
number = "??",
pages = "301--320",
month = sep,
year = "2018",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818308241",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Gerault:2018:RAR,
author = "David G{\'e}rault and Pascal Lafourcade and Marine
Minier and Christine Solnon",
title = "Revisiting {AES} related-key differential attacks with
constraint programming",
journal = j-INFO-PROC-LETT,
volume = "139",
number = "??",
pages = "18--23",
month = nov,
year = "2018",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2018.07.001",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Fri Sep 14 08:04:51 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S002001901830139X",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Gonzalez-Serrano:2018:SML,
author = "Francisco-Javier Gonz{\'a}lez-Serrano and Adri{\'a}n
Amor-Mart{\'\i}n and Jorge Casamay{\'o}n-Ant{\'o}n",
title = "Supervised machine learning using encrypted training
data",
journal = j-INT-J-INFO-SEC,
volume = "17",
number = "4",
pages = "365--377",
month = aug,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-017-0381-1",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Wed Jul 25 08:53:56 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib",
URL = "http://link.springer.com/article/10.1007/s10207-017-0381-1",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
}
@Article{Gope:2018:LPP,
author = "Prosanta Gope and Ruhul Amin and S. K. Hafizul Islam
and Neeraj Kumar and Vinod Kumar Bhalla",
title = "Lightweight and privacy-preserving {RFID}
authentication scheme for distributed {IoT}
infrastructure with secure localization services for
smart city environment",
journal = j-FUT-GEN-COMP-SYS,
volume = "83",
number = "??",
pages = "629--637",
month = jun,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Thu Mar 15 17:42:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17313043",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Gunleifsen:2018:TCP,
author = "H{\aa}kon Gunleifsen and Vasileios Gkioulos and Thomas
Kemmerich",
title = "A Tiered Control Plane Model for Service Function
Chaining Isolation",
journal = j-FUTURE-INTERNET,
volume = "10",
number = "6",
pages = "46",
day = "04",
month = jun,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi10060046",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:00 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
URL = "https://www.mdpi.com/1999-5903/10/6/46",
abstract = "This article presents an architecture for encryption
automation in interconnected Network Function
Virtualization (NFV) domains. Current NFV
implementations are designed for deployment within
trusted domains, where overlay networks with static
trusted links are utilized for enabling network
security. Nevertheless, within a Service Function Chain
(SFC), Virtual Network Function (VNF) flows cannot be
isolated and end-to-end encrypted because each VNF
requires direct access to the overall SFC data-flow.
This restricts both end-users and Service Providers
from enabling end-to-end security, and in extended VNF
isolation within the SFC data traffic. Encrypting data
flows on a per-flow basis results in an extensive
amount of secure tunnels, which cannot scale
efficiently in manual configurations. Additionally,
creating secure data plane tunnels between NFV
providers requires secure exchange of key parameters,
and the establishment of an east--west control plane
protocol. In this article, we present an architecture
focusing on these two problems, investigating how
overlay networks can be created, isolated, and secured
dynamically. Accordingly, we propose an architecture
for automated establishment of encrypted tunnels in
NFV, which introduces a novel, tiered east--west
communication channel between network controllers in a
multi-domain environment.",
acknowledgement = ack-nhfb,
remark = "Special Issue Software Defined Networking (SDN) and
Network Function Virtualization (NFV).",
}
@Article{Guo:2018:AFH,
author = "Qingwen Guo and Qiong Huang and Guomin Yang",
title = "Authorized Function Homomorphic Signature",
journal = j-COMP-J,
volume = "61",
number = "12",
pages = "1897--1908",
day = "1",
month = dec,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy114",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 27 19:24:38 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/12/1897/5158246",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Guo:2018:KAA,
author = "Cheng Guo and Ningqi Luo and Md Zakirul Alam Bhuiyan
and Yingmo Jie and Yuanfang Chen and Bin Feng and
Muhammad Alam",
title = "Key-aggregate authentication cryptosystem for data
sharing in dynamic cloud storage",
journal = j-FUT-GEN-COMP-SYS,
volume = "84",
number = "??",
pages = "190--199",
month = jul,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.07.038",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Apr 16 14:45:08 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17307926",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Guo:2018:PSC,
author = "Yuyan Guo and Jiguo Li and Yang Lu and Yichen Zhang
and Futai Zhang",
title = "Provably secure certificate-based encryption with
leakage resilience",
journal = j-THEOR-COMP-SCI,
volume = "711",
number = "??",
pages = "1--10",
day = "8",
month = feb,
year = "2018",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2017.10.020",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Feb 8 13:49:55 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S030439751730748X",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Guo:2018:SMK,
author = "Ziqing Guo and Hua Zhang and Caijun Sun and Qiaoyan
Wen and Wenmin Li",
title = "Secure multi-keyword ranked search over encrypted
cloud data for multiple data owners",
journal = j-J-SYST-SOFTW,
volume = "137",
number = "??",
pages = "380--395",
month = mar,
year = "2018",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 5 17:47:04 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121217303011",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Guo:2018:WBS,
author = "Jinyi Guo and Wei Ren and Yi Ren and Tianqing Zhu",
title = "A Watermark-Based In-Situ Access Control Model for
Image Big Data",
journal = j-FUTURE-INTERNET,
volume = "10",
number = "8",
pages = "69",
day = "29",
month = jul,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi10080069",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:01 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/10/8/69",
abstract = "When large images are used for big data analysis, they
impose new challenges in protecting image privacy. For
example, a geographic image may consist of several
sensitive areas or layers. When it is uploaded into
servers, the image will be accessed by diverse
subjects. Traditional access control methods regulate
access privileges to a single image, and their access
control strategies are stored in servers, which imposes
two shortcomings: (1) fine-grained access control is
not guaranteed for areas/layers in a single image that
need to maintain secret for different roles; and (2)
access control policies that are stored in servers
suffers from multiple attacks (e.g., transferring
attacks). In this paper, we propose a novel
watermark-based access control model in which access
control policies are associated with objects being
accessed (called an in-situ model). The proposed model
integrates access control policies as watermarks within
images, without relying on the availability of servers
or connecting networks. The access control for images
is still maintained even though images are
redistributed again to further subjects. Therefore,
access control policies can be delivered together with
the big data of images. Moreover, we propose a
hierarchical key-role-area model for fine-grained
encryption, especially for large size images such as
geographic maps. The extensive analysis justifies the
security and performance of the proposed model.",
acknowledgement = ack-nhfb,
remark = "Section Big Data and Augmented Intelligence.",
}
@Article{Gupta:2018:SCA,
author = "Haritabh Gupta and Shamik Sural and Vijayalakshmi
Atluri and Jaideep Vaidya",
title = "A side-channel attack on smartphones: Deciphering key
taps using built-in microphones",
journal = j-J-COMP-SECUR,
volume = "26",
number = "2",
pages = "255--281",
month = "????",
year = "2018",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-17975",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Mon Sep 23 05:47:15 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Haigh:2018:CP,
author = "Thomas Haigh and Mark Priestley",
title = "{Colossus} and Programmability",
journal = j-IEEE-ANN-HIST-COMPUT,
volume = "40",
number = "4",
pages = "5--27",
month = oct # "\slash " # dec,
year = "2018",
CODEN = "IAHCEX",
DOI = "https://doi.org/10.1109/MAHC.2018.2877912",
ISSN = "1058-6180 (print), 1934-1547 (electronic)",
ISSN-L = "1058-6180",
bibdate = "Thu Jan 24 10:01:33 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeeannhistcomput.bib",
URL = "https://ieeexplore.ieee.org/document/8509146/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Annals of the History of Computing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85",
}
@Article{Ham:2018:IYP,
author = "HyoungMin Ham and JongHyup Lee and JooSeok Song",
title = "Improved yoking proof protocols for preserving
anonymity",
journal = j-INT-J-INFO-SEC,
volume = "17",
number = "4",
pages = "379--393",
month = aug,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-017-0383-z",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Wed Jul 25 08:53:56 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib",
URL = "http://link.springer.com/article/10.1007/s10207-017-0383-z",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
}
@Article{Hamad:2018:DWU,
author = "Safwat Hamad and Ahmed Elhadad and Amal Khalifa",
title = "{DNA} Watermarking Using Codon Postfix Technique",
journal = j-TCBB,
volume = "15",
number = "5",
pages = "1605--1610",
month = sep,
year = "2018",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2017.2754496",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Thu Nov 8 06:18:46 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "DNA watermarking is a data hiding technique that aims
to protect the copyright of DNA sequences and ensures
the security of private genetic information. In this
paper, we proposed a novel DNA watermarking technique
that can be used to embed binary bits into real DNA
sequences. The proposed technique mutates the codon
postfix according to the embedded bit. Our method was
tested for a sample set of DNA sequences and the
extracted bits showed robustness against mutation.
Furthermore, the proposed DNA watermarking method
proved to be secured, undetectable, resistance, and
preservative to biological functions.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@Article{Hameed:2018:TFV,
author = "Khizar Hameed and Abid Khan and Mansoor Ahmed and
Alavalapati Goutham Reddy and M. Mazhar Rathore",
title = "Towards a formally verified zero watermarking scheme
for data integrity in the {Internet of Things}
based-wireless sensor networks",
journal = j-FUT-GEN-COMP-SYS,
volume = "82",
number = "??",
pages = "274--289",
month = may,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.12.009",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sun Feb 18 14:42:10 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17322756",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Hammi:2018:BTD,
author = "Mohamed Tahar Hammi and Badis Hammi and Patrick Bellot
and Ahmed Serhrouchni",
title = "Bubbles of Trust: a decentralized blockchain-based
authentication system for {IoT}",
journal = j-COMPUT-SECUR,
volume = "78",
number = "??",
pages = "126--142",
month = sep,
year = "2018",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818300890",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Han:2018:BEI,
author = "Jinsong Han and Chen Qian and Yuqin Yang and Ge Wang
and Han Ding and Xin Li and Kui Ren",
title = "{Butterfly}: Environment-Independent Physical-Layer
Authentication for Passive {RFID}",
journal = j-IMWUT,
volume = "2",
number = "4",
pages = "1--21",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3287044",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:37:06 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3287044",
abstract = "RFID tag authentication is challenging because most
commodity tags cannot run cryptographic algorithms.
Prior research demonstrates that physical layer
information based authentication is a promising
solution, which uses special features from the
\ldots{}",
acknowledgement = ack-nhfb,
articleno = "166",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Han:2018:ERA,
author = "Qi Han and Yinghui Zhang and Hui Li",
title = "Efficient and robust attribute-based encryption
supporting access policy hiding in {Internet of
Things}",
journal = j-FUT-GEN-COMP-SYS,
volume = "83",
number = "??",
pages = "269--277",
month = jun,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Thu Mar 15 17:42:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X1731868X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Han:2018:TSE,
author = "Shuai Han and Shengli Liu and Lin Lyu and Dawu Gu",
title = "Tightly Secure Encryption Schemes against Related-Key
Attacks",
journal = j-COMP-J,
volume = "61",
number = "12",
pages = "1825--1844",
day = "1",
month = dec,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy074",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 27 19:24:38 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/12/1825/5067538",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{He:2018:LAB,
author = "Qian He and Ning Zhang and Yongzhuang Wei and Yan
Zhang",
title = "Lightweight attribute based encryption scheme for
mobile cloud assisted cyber-physical systems",
journal = j-COMP-NET-AMSTERDAM,
volume = "140",
number = "??",
pages = "163--173",
day = "20",
month = jul,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2018.01.038",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Thu May 31 13:40:46 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128618300458",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{He:2018:MBF,
author = "Jingsha He and Jianan Wu and Nafei Zhu and Muhammad
Salman Pathan",
title = "{MinHash}-Based Fuzzy Keyword Search of Encrypted Data
across Multiple Cloud Servers",
journal = j-FUTURE-INTERNET,
volume = "10",
number = "5",
pages = "38",
day = "01",
month = may,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi10050038",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:00 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/10/5/38",
abstract = "To enhance the efficiency of data searching, most data
owners store their data files in different cloud
servers in the form of cipher-text. Thus, efficient
search using fuzzy keywords becomes a critical issue in
such a cloud computing environment. This paper proposes
a method that aims at improving the efficiency of
cipher-text retrieval and lowering storage overhead for
fuzzy keyword search. In contrast to traditional
approaches, the proposed method can reduce the
complexity of Min-Hash-based fuzzy keyword search by
using Min-Hash fingerprints to avoid the need to
construct the fuzzy keyword set. The method will
utilize Jaccard similarity to rank the results of
retrieval, thus reducing the amount of calculation for
similarity and saving a lot of time and space overhead.
The method will also take consideration of multiple
user queries through re-encryption technology and
update user permissions dynamically. Security analysis
demonstrates that the method can provide better privacy
preservation and experimental results show that
efficiency of cipher-text using the proposed method can
improve the retrieval time and lower storage overhead
as well.",
acknowledgement = ack-nhfb,
}
@Article{Howe:2018:PDG,
author = "James Howe and Ayesha Khalid and Ciara Rafferty and
Francesco Regazzoni and M{\'a}ire O'Neill",
title = "On Practical Discrete {Gaussian} Samplers for
Lattice-Based Cryptography",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "3",
pages = "322--334",
month = "????",
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2642962",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Feb 15 05:53:34 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/document/7792671/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Hu:2018:SVA,
author = "C. Hu and W. Li and X. Cheng and J. Yu and S. Wang and
R. Bie",
title = "A Secure and Verifiable Access Control Scheme for Big
Data Storage in Clouds",
journal = j-IEEE-TRANS-BIG-DATA,
volume = "4",
number = "3",
pages = "341--355",
month = sep,
year = "2018",
DOI = "https://doi.org/10.1109/TBDATA.2016.2621106",
ISSN = "2332-7790",
bibdate = "Fri Aug 2 11:24:47 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "Access control; access control; access legitimacy;
access policy update; authorisation; Big data; Big
Data; Big data storage; ciphertext; cloud computing;
Cloud computing; cloud computing; cloud server;
Cryptography; cryptography; data owner; eligible users;
outsourcing; Outsourcing; secret sharing; secure access
control scheme; security strengths; Servers; storage
management; the NTRU cryptosystem; verifiable access
control scheme",
}
@Article{Huang:2018:BLD,
author = "Chenyu Huang and Huangxun Chen and Lin Yang and Qian
Zhang",
title = "{BreathLive}: Liveness Detection for Heart Sound
Authentication with Deep Breathing",
journal = j-IMWUT,
volume = "2",
number = "1",
pages = "1--25",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3191744",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:36:59 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3191744",
abstract = "Nowadays, considerable number of devices have been
proposed to monitor cardiovascular health. To protect
medical data on these devices from unauthorized access,
researchers have proposed ECG-based and heart
sound-based authentication methods. However, \ldots{}",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Huang:2018:CT,
author = "Qinlong Huang and Yixian Yang and Mansuo Shen",
title = "Corrigendum to {``Secure and efficient data
collaboration with hierarchical attribute-based
encryption in cloud computing'' [Future Gener. Comput.
Syst. {\bf 72} (2017) 239--249]}",
journal = j-FUT-GEN-COMP-SYS,
volume = "86",
number = "??",
pages = "1534--1534",
month = sep,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Jun 20 10:46:17 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
note = "See \cite{Huang:2017:SED}.",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X18312238",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Huang:2018:LRD,
author = "Jianye Huang and Qiong Huang and Willy Susilo",
title = "Leakage-Resilient Dual-Form Signatures",
journal = j-COMP-J,
volume = "61",
number = "8",
pages = "1216--1227",
day = "1",
month = aug,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy059",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:57 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/8/1216/5035762",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Huang:2018:PIB,
author = "Qinlong Huang and Yixian Yang and Jingyi Fu",
title = "{PRECISE}: Identity-based private data sharing with
conditional proxy re-encryption in online social
networks",
journal = j-FUT-GEN-COMP-SYS,
volume = "86",
number = "??",
pages = "1523--1533",
month = sep,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Jun 20 10:46:17 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17310257",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Hubballi:2018:NTC,
author = "Neminath Hubballi and Mayank Swarnkar",
title = "{BitCoding}: Network Traffic Classification Through
Encoded Bit Level Signatures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "5",
pages = "2334--2346",
month = oct,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2018.2868816",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Nov 8 06:12:22 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "With many network protocols using obfuscation
techniques to hide their identity, robust methods of
traffic classification are required. In traditional
deep-packet-inspection DPI methods, application
specific signatures are generated with byte-level data
from payload. Increasingly new data formats are being
used to encode the application protocols with bit-level
information which render the byte-level signatures
ineffective. In this paper, we describe BitCoding a
bit-level DPI-based signature generation technique.
BitCoding uses only a small number of initial bits from
a flow and identify invariant bits as signature.
Subsequently, these bit signatures are encoded and
transformed into a newly defined state transition
machine transition constrained counting automata. While
short signatures are efficient for processing, this
will increase the chances of collision and cross
signature matching with increase in number of
signatures applications. We describe a method for
signature similarity detection using a variant of
Hamming distance and propose to increase the length of
signatures for a subset of protocols to avoid overlaps.
We perform extensive experiments with three different
data sets consisting of 537,380 flows with a packet
count of 3,445,969 and show that, BitCoding has very
good detection performance across different types of
protocols text, binary, and proprietary making it
protocol-type agnostic. Further, to understand the
portability of signatures generated we perform cross
evaluation, i.e., signatures generated from one site
are used for testing with data from other sites to
conclude that it will lead to a small compromise in
detection performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Hunger:2018:DDC,
author = "Casen Hunger and Lluis Vilanova and Charalampos
Papamanthou and Yoav Etsion and Mohit Tiwari",
title = "{DATS} --- Data Containers for {Web} Applications",
journal = j-SIGPLAN,
volume = "53",
number = "2",
pages = "722--736",
month = feb,
year = "2018",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/3296957.3173213",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Oct 16 14:12:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "Data containers enable users to control access to
their data while untrusted applications compute on it.
However, they require replicating an application inside
each container --- compromising functionality,
programmability, and performance. We propose DATS --- a
system to run web applications that retains application
usability and efficiency through a mix of hardware
capability enhanced containers and the introduction of
two new primitives modeled after the popular
model-view-controller (MVC) pattern. (1) DATS
introduces a templating language to create views that
compose data across data containers. (2) DATS uses
authenticated storage and confinement to enable an
untrusted storage service, such as memcached and
deduplication, to operate on plain-text data across
containers. These two primitives act as robust
declassifiers that allow DATS to enforce
non-interference across containers, taking large
applications out of the trusted computing base (TCB).
We showcase eight different web applications including
Gitlab and a Slack-like chat, significantly improve the
worst-case overheads due to application replication,
and demonstrate usable performance for common-case
usage.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "ASPLOS '18 proceedings.",
}
@Article{Hunt:2018:RDS,
author = "Tyler Hunt and Zhiting Zhu and Yuanzhong Xu and Simon
Peter and Emmett Witchel",
title = "{Ryoan}: a Distributed Sandbox for Untrusted
Computation on Secret Data",
journal = j-TOCS,
volume = "35",
number = "4",
pages = "13:1--13:??",
month = dec,
year = "2018",
CODEN = "ACSYEC",
DOI = "https://doi.org/10.1145/3231594",
ISSN = "0734-2071 (print), 1557-7333 (electronic)",
ISSN-L = "0734-2071",
bibdate = "Sat Sep 21 11:44:29 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tocs.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3231594",
abstract = "Users of modern data-processing services such as tax
preparation or genomic screening are forced to trust
them with data that the users wish to keep secret.
Ryoan$^1$ protects secret data while it is processed by
services that the data owner does not trust.
Accomplishing this goal in a distributed setting is
difficult, because the user has no control over the
service providers or the computational platform.
Confining code to prevent it from leaking secrets is
notoriously difficult, but Ryoan benefits from new
hardware and a request-oriented data model. Ryoan
provides a distributed sandbox, leveraging hardware
enclaves (e.g., Intel's software guard extensions (SGX)
[40]) to protect sandbox instances from potentially
malicious computing platforms. The protected sandbox
instances confine untrusted data-processing modules to
prevent leakage of the user's input data. Ryoan is
designed for a request-oriented data model, where
confined modules only process input once and do not
persist state about the input. We present the design
and prototype implementation of Ryoan and evaluate it
on a series of challenging problems including email
filtering, health analysis, image processing and
machine translation.",
acknowledgement = ack-nhfb,
articleno = "13",
fjournal = "ACM Transactions on Computer Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J774",
}
@Article{Hussain:2018:PPP,
author = "Siam Umar Hussain and Farinaz Koushanfar",
title = "{P3}: Privacy Preserving Positioning for Smart
Automotive Systems",
journal = j-TODAES,
volume = "23",
number = "6",
pages = "79:1--79:??",
month = dec,
year = "2018",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/3236625",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Mar 22 16:58:40 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "This article presents the first privacy-preserving
localization method based on provably secure primitives
for smart automotive systems. Using this method, a car
that is lost due to unavailability of GPS can compute
its location with assistance from three nearby cars,
while the locations of all the participating cars
including the lost car remain private. Technological
enhancement of modern vehicles, especially in
navigation and communication, necessitates parallel
enhancement in security and privacy. Previous
approaches to maintaining user location privacy
suffered from one or more of the following drawbacks:
trade-off between accuracy and privacy, one-sided
privacy, and the need of a trusted third party that
presents a single point to attack. The localization
method presented here is one of the very first
location-based services that eliminates all these
drawbacks. Two protocols for computing the location is
presented here based on two Secure Function Evaluation
(SFE) techniques that allow multiple parties to jointly
evaluate a function on inputs that are encrypted to
maintain privacy. The first one is based on the
two-party protocol named Yao's Garbled Circuit (GC).
The second one is based on the Beaver-Micali-Rogaway
(BMR) protocol that allows inputs from more than two
parties. The two secure localization protocols exhibit
trade-offs between performance and resilience against
collusion. Along with devising the protocols, we design
and optimize netlists for the functions required for
location computation by leveraging conventional logic
synthesis tools with custom libraries optimized for
SFE. Proof-of-concept implementation of the protocol
shows that the complete operation can be performed
within only 355ms. The fast computing time enables
localization of even moving cars.",
acknowledgement = ack-nhfb,
articleno = "79",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Hussain:2018:SSH,
author = "Siam Umar Hussain and M. Sadegh Riazi and Farinaz
Koushanfar",
title = "{SHAIP}: {Secure Hamming Distance for Authentication
of Intrinsic PUFs}",
journal = j-TODAES,
volume = "23",
number = "6",
pages = "75:1--75:??",
month = dec,
year = "2018",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/3274669",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Mar 22 16:58:40 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "In this article, we present SHAIP, a secure Hamming
distance-based mutual authentication protocol. It
allows an unlimited number of authentications by
employing an intrinsic Physical Unclonable Function
(PUF). PUFs are being increasingly employed for remote
authentication of devices. Most of these devices have
limited resources. Therefore, the intrinsic PUFs are
most suitable for this task as they can be built with
little or no modification to the underlying hardware
platform. One major drawback of the current
authentication schemes is that they expose the PUF
response. This makes the intrinsic PUFs, which have a
limited number of challenge-response pairs, unusable
after a certain number of authentication sessions.
Moreover, these schemes are one way in the sense that
they only allow one party, the prover, to authenticate
herself to the verifier. We propose a symmetric mutual
authentication scheme based on secure
(privacy-preserving) computation of the Hamming
distance between the PUF response from the remote
device and reference response stored at the verifier
end. This allows both parties to authenticate each
other without revealing their respective sets of
inputs. We show that our scheme is effective with all
state-of-the-art intrinsic PUFs. The proposed scheme is
lightweight and does not require any modification to
the underlying hardware.",
acknowledgement = ack-nhfb,
articleno = "75",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Islam:2018:REP,
author = "SK Hafizul Islam and Mohammad S. Obaidat and Pandi
Vijayakumar and Enas Abdulhay and Fagen Li and M.
Krishna Chaitanya Reddy",
title = "A robust and efficient password-based conditional
privacy preserving authentication and group-key
agreement protocol for {VANETs}",
journal = j-FUT-GEN-COMP-SYS,
volume = "84",
number = "??",
pages = "216--227",
month = jul,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.07.002",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Apr 16 14:45:08 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17308439",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Jaeger:2018:FAP,
author = "David Jaeger and Hendrik Graupner and Chris Pelchen
and Feng Cheng and Christoph Meinel",
title = "Fast Automated Processing and Evaluation of Identity
Leaks",
journal = j-INT-J-PARALLEL-PROG,
volume = "46",
number = "2",
pages = "441--470",
month = apr,
year = "2018",
CODEN = "IJPPE5",
DOI = "https://doi.org/10.1007/s10766-016-0478-6",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
ISSN-L = "0885-7458",
bibdate = "Fri Oct 11 08:37:50 MDT 2019",
bibsource = "http://link.springer.com/journal/10766/46/2;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Jain:2018:MDN,
author = "Ajay Jain and Sachin Soni",
title = "Multi-Directional navigation method for optimized
consumption of user generated content through semantic
mapping of features derived from the user generated
content",
journal = j-SIGSOFT,
volume = "43",
number = "4",
pages = "52--52",
month = oct,
year = "2018",
CODEN = "SFENDP",
DOI = "https://doi.org/10.1145/3282517.3282535",
ISSN = "0163-5948 (print), 1943-5843 (electronic)",
ISSN-L = "0163-5948",
bibdate = "Sat Oct 19 18:11:10 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsoft2010.bib",
abstract = "Gone are the days when a buyer used to depend solely
on the product marketing team to know what's good about
a product or product features. With the advent of
social media, product purchase has become democratic
with product buyers, product users are vocal about
reporting back their experience about the product.
According to Forrester, ``buyers will spend more time
on web pages that have social content than those that
don't'' and ``user-generated content has significant
influence on a buyer's purchase decision.'' The
research doesn't lie --- User Generated Content (termed
as UGC) is more effective at driving purchase intent
and brand loyalty than any other media. To create
engaging, authentic customer experiences, companies
should weave UGC throughout their owned websites,
showcasing the voices that consumers trust the most:
their own.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGSOFT Software Engineering Notes",
journal-URL = "https://dl.acm.org/citation.cfm?id=J728",
}
@Article{Jaiyeola:2018:IPN,
author = "Temitope Gbolahan Jaiyeola and Florentin Smarandache",
title = "Inverse Properties in Neutrosophic Triplet Loop and
Their Application to Cryptography",
journal = j-ALGORITHMS-BASEL,
volume = "11",
number = "3",
month = mar,
year = "2018",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a11030032",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:14 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.mdpi.com/1999-4893/11/3/32",
acknowledgement = ack-nhfb,
articleno = "32",
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
ORCID-numbers = "Temitope Gbolahan Jaiyeola/0000-0002-8695-5478;
Florentin Smarandache/0000-0002-5560-5926",
pagecount = "??",
pubdates = "Received: 7 February 2018 / Revised: 11 March 2018 /
Accepted: 12 March 2018 / Published: 16 March 2018",
}
@Article{Jamil:2018:SPU,
author = "Fuzel Jamil and Abid Khan and Adeel Anjum and Mansoor
Ahmed and Farhana Jabeen and Nadeem Javaid",
title = "Secure provenance using an authenticated data
structure approach",
journal = j-COMPUT-SECUR,
volume = "73",
number = "??",
pages = "34--56",
month = mar,
year = "2018",
CODEN = "CPSEDU",
DOI = "https://doi.org/10.1016/j.cose.2017.10.005",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:53 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404817302122",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Ji:2018:DIR,
author = "Wusheng Ji and Li Li and Weiwei Zhou",
title = "Design and Implementation of a {RFID} Reader\slash
Router in {RFID-WSN} Hybrid System",
journal = j-FUTURE-INTERNET,
volume = "10",
number = "11",
pages = "106",
day = "03",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi10110106",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:03 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/10/11/106",
abstract = "In order to put Radio Frequency Identification (RFID)
and Wireless Sensor Network (WSN) in a hybrid system,
this paper presents the design and implementation of a
RFID reader/router that can obtain information of both
RFID tags and WSN sensor nodes and transmit the
information through the WSN to the PC server. The RFID
reader and WSN router are combined with both hardware
and software. In hardware structure, CC2530 is used as
micro controller and RF module for ZigBee wireless
communication, and MF RC522 is used as reader RF chip.
The software deals with both identity and sensing
information and controls the routing. Experiment
results show that the RFID reader/router achieves long
distance identification, flexibility, scalability, and
low cost. It also provides reliable and secured data
transmission and broadens the communication range and
application scope of RFID readers.",
acknowledgement = ack-nhfb,
}
@Article{Jia:2018:ERH,
author = "Hongyong Jia and Yue Chen and Julong Lan and Kaixiang
Huang and Jun Wang",
title = "Efficient revocable hierarchical identity-based
encryption using cryptographic accumulators",
journal = j-INT-J-INFO-SEC,
volume = "17",
number = "4",
pages = "477--490",
month = aug,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-017-0387-8",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Wed Jul 25 08:53:56 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib",
URL = "http://link.springer.com/article/10.1007/s10207-017-0387-8",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
}
@Article{Jiang:2018:AHP,
author = "Rong Jiang and Rongxing Lu and Kim-Kwang Raymond
Choo",
title = "Achieving high performance and privacy-preserving
query over encrypted multidimensional big metering
data",
journal = j-FUT-GEN-COMP-SYS,
volume = "78 (part 1)",
number = "??",
pages = "392--401",
month = jan,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Sep 23 09:35:45 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16301157",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Jiang:2018:CPA,
author = "Yinhao Jiang and Willy Susilo and Yi Mu and Fuchun
Guo",
title = "Ciphertext-policy attribute-based encryption against
key-delegation abuse in fog computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "78 (part 2)",
number = "??",
pages = "720--729",
month = jan,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Sep 25 09:24:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17301322",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Jiang:2018:FCP,
author = "Yinhao Jiang and Willy Susilo and Yi Mu and Fuchun
Guo",
title = "Flexible ciphertext-policy attribute-based encryption
supporting {AND}-gate and threshold with short
ciphertexts",
journal = j-INT-J-INFO-SEC,
volume = "17",
number = "4",
pages = "463--475",
month = aug,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-017-0376-y",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Wed Jul 25 08:53:56 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib",
URL = "http://link.springer.com/article/10.1007/s10207-017-0376-y",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
}
@Article{Jordan:2018:EPE,
author = "M. Jordan and N. Sardino and M. McGrath and C. Zoellin
and T. E. Morris and C. Carranza Lewis and G. Vance and
B. Naylor and J. Pickel and M. S. Almeida and D.
Wierbowski and C. Meyer and R. Buendgen and M. Zagorski
and H. Schoone and K. Voss",
title = "Enabling pervasive encryption through {IBM Z} stack
innovations",
journal = j-IBM-JRD,
volume = "62",
number = "2--3",
pages = "2:1--2:11",
month = "????",
year = "2018",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Thu May 10 14:55:17 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
URL = "https://ieeexplore.ieee.org/document/8270590/",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
@Article{Jordan:2018:QCS,
author = "S. P. Jordan and Y. Liu",
title = "Quantum Cryptanalysis: {Shor}, {Grover}, and Beyond",
journal = j-IEEE-SEC-PRIV,
volume = "16",
number = "5",
pages = "14--21",
month = sep # "\slash " # oct,
year = "2018",
DOI = "https://doi.org/10.1109/MSP.2018.3761719",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "algorithms; Computers; cryptanalysis; Elliptic curve
cryptography; Elliptic curves; Logic gates; postquantum
cryptography; Postquantum Cryptography Part 2; quantum
algorithms; quantum attack; Quantum computing; quantum
computing; quantum cryptanalysis; quantum cryptography;
security",
}
@Article{K:2018:AAF,
author = "Keerthi K. and Chester Rebeiro and Aritra Hazra",
title = "An Algorithmic Approach to Formally Verify an {ECC}
Library",
journal = j-TODAES,
volume = "23",
number = "5",
pages = "63:1--63:??",
month = oct,
year = "2018",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/3224205",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Mar 22 16:58:40 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "The weakest link in cryptosystems is quite often due
to the implementation rather than the mathematical
underpinnings. A vast majority of attacks in the recent
past have targeted programming flaws and bugs to break
security systems. Due to the complexity, empirically
verifying such systems is practically impossible, while
manual verification as well as testing do not provide
adequate guarantees. In this article, we leverage model
checking techniques to prove the functional correctness
of an elliptic curve cryptography (ECC) library with
respect to its formal specification. We demonstrate how
the huge state space of the C library can be aptly
verified using a hierarchical assume-guarantee
verification strategy. To test the scalability of this
approach, we verify the correctness of five
NIST-specified elliptic curve implementations. We also
verify the newer curve25519 elliptic curve, which is
finding multiple applications, due to its higher
security and simpler implementation. The 192-bit NIST
elliptic curve took 1 day to verify. This was the
smallest curve we verified. The largest curve with a
521-bit prime field took 26 days to verify. Curve25519
took 1.5 days to verify.",
acknowledgement = ack-nhfb,
articleno = "63",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Kalayappan:2018:PAH,
author = "Rajshekar Kalayappan and Smruti R. Sarangi",
title = "Providing Accountability in Heterogeneous
Systems-on-Chip",
journal = j-TECS,
volume = "17",
number = "5",
pages = "83:1--83:??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3241048",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:41 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3241048",
abstract = "When modern systems-on-chip (SoCs), containing designs
from different organizations, miscompute or
underperform in the field, discerning the responsible
component is a non-trivial task. A perfectly
accountable system is one in which the on-chip
component at fault is always unambiguously detected.
The achievement of accountability can be greatly aided
by the collection of runtime information that captures
the events in the system that led to the error. Such
information collection must be fair and impartial to
all parties. In this article, we prove that logging
messages communicated between components from different
organizations is sufficient to provide accountability,
provided the logs are authentic. We then construct a
solution based on this premise, with an on-chip trusted
auditing system to authenticate the logs. We present a
thorough design of the auditing system, and demonstrate
that its performance overhead is a mere 0.49\%, and its
area overhead is a mere 0.194\% (in a heterogeneous 48
core, 400 mm$^2$ chip). We also demonstrate the
viability of this solution using three representative
bugs found in popular commercial SoCs.",
acknowledgement = ack-nhfb,
articleno = "83",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Karthiga:2018:PSA,
author = "I Karthiga and Sharmila Sankar",
title = "Providing Secret Authentication in Clustered Security
Architecture for Cloud-Based {WBAN}",
journal = j-COMP-J,
volume = "61",
number = "2",
pages = "223--232",
day = "1",
month = feb,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxx051",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/2/223/3861967",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Kavun:2018:SAE,
author = "Elif Bilge Kavun and Hristina Mihajloska and Tolga
Yal{\c{c}}in",
title = "A Survey on Authenticated Encryption--{ASIC}
Designer's Perspective",
journal = j-COMP-SURV,
volume = "50",
number = "6",
pages = "88:1--88:??",
month = jan,
year = "2018",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3131276",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Jan 20 09:25:01 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Authenticated encryption (AE) has been a vital
operation in cryptography due to its ability to provide
confidentiality, integrity, and authenticity at the
same time. Its use has soared in parallel with
widespread use of the internet and has led to several
new schemes. There have been studies investigating
software performance of various schemes. However, the
same is yet to be done for hardware. We present a
comprehensive survey of hardware (specifically ASIC)
performance of the most commonly used AE schemes in the
literature. These schemes include encrypt-then-MAC
combination, block-cipher-based AE modes, and the
recently introduced permutation-based AE scheme. For
completeness, we implemented each scheme with various
standardized block ciphers and/or hash algorithms, and
their lightweight versions. Our evaluation targets
minimizing the time-area product while maximizing the
throughput on an ASIC platform. We used 45nm NANGATE
Open Cell Library for syntheses. We present area,
speed, time-area product, throughput, and power figures
for both standard and lightweight versions of each
scheme. We also provide an unbiased discussion on the
impact of the structure and complexity of each scheme
on hardware implementation. Our results reveal
13\%--30\% performance boost in permutation-based AE
compared to conventional schemes, and they can be used
as a benchmark in the ongoing AE competition CAESAR.",
acknowledgement = ack-nhfb,
articleno = "88",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Khamis:2018:CCT,
author = "Mohamed Khamis and Ludwig Trotter and Ville
M{\"a}kel{\"a} and Emanuel von Zezschwitz and Jens Le
and Andreas Bulling and Florian Alt",
title = "{CueAuth}: Comparing Touch, Mid-Air Gestures, and Gaze
for Cue-based Authentication on Situated Displays",
journal = j-IMWUT,
volume = "2",
number = "4",
pages = "1--22",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3287052",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:37:06 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3287052",
abstract = "Secure authentication on situated displays (e.g., to
access sensitive information or to make purchases) is
becoming increasingly important. A promising approach
to resist shoulder surfing attacks is to employ cues
that users respond to while \ldots{}",
acknowledgement = ack-nhfb,
articleno = "174",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Khan:2018:APS,
author = "Imran Khan and Shehzad Ashraf Chaudhry and Muhammad
Sher and Javed I. Khan and Muhammad Khurram Khan",
title = "An anonymous and provably secure biometric-based
authentication scheme using chaotic maps for accessing
medical drop box data",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "8",
pages = "3685--3703",
month = aug,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1886-5",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Oct 10 15:31:14 MDT 2019",
bibsource = "http://link.springer.com/journal/11227/74/8;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Khleborodov:2018:FEC,
author = "Denis Khleborodov",
title = "Fast elliptic curve point multiplication based on
window {Non-Adjacent Form} method",
journal = j-APPL-MATH-COMP,
volume = "334",
number = "??",
pages = "41--59",
day = "1",
month = oct,
year = "2018",
CODEN = "AMHCBQ",
DOI = "https://doi.org/10.1016/j.amc.2018.03.112",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jun 2 17:40:19 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2015.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300318302935",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Kieffer:2018:IBC,
author = "Jean Kieffer and Luca {De Feo}",
title = "Isogeny-based cryptography in {Julia\slash Nemo}: a
case study",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "130--132",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338643",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/julia.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Couveignes--Rostovtsev--Stolbunov key-exchange
protocol based on isogenies of elliptic curves is of
interest because it may resist quantum attacks, but its
efficient implementation remains a challenge. We
briefly present the computations involved, and
efficient algorithms to achieve the critical steps,
with timing results for our implementations in Sage and
Julia\slash Nemo.",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kiljan:2018:ETA,
author = "Sven Kiljan and Harald Vranken and Marko van Eekelen",
title = "Evaluation of transaction authentication methods for
online banking",
journal = j-FUT-GEN-COMP-SYS,
volume = "80",
number = "??",
pages = "430--447",
month = mar,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Dec 2 16:58:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16301352",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Kim:2018:ARD,
author = "Sung Ryoung Kim and Jeong Nyeo Kim and Sung Tae Kim
and Sunwoo Shin and Jeong Hyun Yi",
title = "Anti-reversible dynamic tamper detection scheme using
distributed image steganography for {IoT}
applications",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "9",
pages = "4261--4280",
month = sep,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1848-y",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Oct 10 15:31:14 MDT 2019",
bibsource = "http://link.springer.com/journal/11227/74/9;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Kim:2018:EPP,
author = "Jinsu Kim and Dongyoung Koo and Yuna Kim and Hyunsoo
Yoon and Junbum Shin and Sungwook Kim",
title = "Efficient Privacy-Preserving Matrix Factorization for
Recommendation via Fully Homomorphic Encryption",
journal = j-TOPS,
volume = "21",
number = "4",
pages = "17:1--17:??",
month = oct,
year = "2018",
DOI = "https://doi.org/10.1145/3212509",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
bibdate = "Sat Sep 21 08:26:24 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
URL = "https://dl.acm.org/citation.cfm?id=3212509",
abstract = "There are recommendation systems everywhere in our
daily life. The collection of personal data of users by
a recommender in the system may cause serious privacy
issues. In this article, we propose the first
privacy-preserving matrix factorization for
recommendation using fully homomorphic encryption. Our
protocol performs matrix factorization over encrypted
users' rating data and returns encrypted outputs so
that the recommendation system learns nothing on rating
values and resulting user/item profiles. Furthermore,
the protocol provides a privacy-preserving method to
optimize the tuning parameters that can be a business
benefit for the recommendation service providers. To
overcome the performance degradation caused by the use
of fully homomorphic encryption, we introduce a novel
data structure to perform computations over encrypted
vectors, which are essential for matrix factorization,
through secure two-party computation in part. Our
experiments demonstrate the efficiency of our
protocol.",
acknowledgement = ack-nhfb,
articleno = "17",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Kline:2018:CAR,
author = "Donald {Kline, Jr.} and Rami Melhem and Alex K.
Jones",
title = "Counter Advance for Reliable Encryption in Phase
Change Memory",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "17",
number = "2",
pages = "209--212",
month = jul # "\slash " # dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2018.2861012",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "The use of hardware encryption and new memory
technologies such as phase change memory (PCM) are
gaining popularity in a variety of server applications
such as cloud systems. While PCM provides energy and
density advantages over conventional DRAM memory, it
faces endurance challenges. Such challenges are
exacerbated when employing memory encryption as the
stored data is essentially randomized. losing data
locality and reducing or eliminating the effectiveness
of energy and endurance aware encoding techniques. This
results in increasing dynamic energy consumption and
accelerated wear out. In this paper we propose counter
advance, a technique to leverage the process of
encryption to improve reliability and lifetime while
maintaining low-energy and low-latency operation.
Counter advance is compatible with standard
error-correction codes (ECC) and error correction
pointers (ECP), the standard for mitigating endurance
faults in PCM. Counter advance achieves the same fault
tolerance using three ECP pointers for a 10(-4) cell
failure rate compared to the leading approach to
consider energy savings and reliability for encrypted
PCM (SECRET) using five ECP pointers. At a failure rate
of 10(-2), counter advance can achieve an uncorrectable
bit error rate (UBER) of 10(-1), compared to < 10(-4)
for SECRET using six ECP pointers. This leads to a
lifetime improvement of 3.8x while maintaining
comparable energy consumption and access latency.",
acknowledgement = ack-nhfb,
affiliation = "Kline, D (Reprint Author), Univ Pittsburgh, Dept Elect
\& Comp Engn, Pittsburgh, PA 15260 USA. Kline, Donald,
Jr.; Jones, Alex K., Univ Pittsburgh, Dept Elect \&
Comp Engn, Pittsburgh, PA 15260 USA. Melhem, Rami, Univ
Pittsburgh, Dept Comp Sci, Pittsburgh, PA 15260 USA.",
author-email = "dek61@pitt.edu melhem@cs.pitt.edu akjones@pitt.edu",
da = "2019-06-20",
doc-delivery-number = "HA2CO",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "NSF [1747452]; IUCRC Program of the
National Science Foundation [CNS-1738783]; SHREC",
funding-text = "This work was supported by NSF Graduate Research
Fellowship award number 1747452, and SHREC industry and
agency members and by the IUCRC Program of the National
Science Foundation (Grant No. CNS-1738783).",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "Emerging memories; error correction; reliability;
stuck-at faults",
number-of-cited-references = "16",
oa = "Bronze",
ORCID-numbers = "Kline, Jr, Donald/0000-0002-4414-1513",
research-areas = "Computer Science",
times-cited = "0",
unique-id = "Kline:2018:CAR",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Kobusinska:2018:BDF,
author = "Anna Kobusi{\'n}ska and Kamil Pawluczuk and Jerzy
Brzezi{\'n}ski",
title = "Big Data fingerprinting information analytics for
sustainability",
journal = j-FUT-GEN-COMP-SYS,
volume = "86",
number = "??",
pages = "1321--1337",
month = sep,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Jun 20 10:46:17 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17329965",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Komargodski:2018:LRO,
author = "Ilan Komargodski",
title = "Leakage resilient one-way functions: the
auxiliary-input setting",
journal = j-THEOR-COMP-SCI,
volume = "746",
number = "??",
pages = "6--18",
day = "25",
month = oct,
year = "2018",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2018.06.014",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Sep 21 11:15:31 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397518304304",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Koo:2018:PPD,
author = "Dongyoung Koo and Junbeom Hur",
title = "Privacy-preserving deduplication of encrypted data
with dynamic ownership management in fog computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "78 (part 2)",
number = "??",
pages = "739--752",
month = jan,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Sep 25 09:24:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17301309",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Koya:2018:AHM,
author = "Aneesh M. Koya and Deepthi P. P.",
title = "Anonymous hybrid mutual authentication and key
agreement scheme for wireless body area network",
journal = j-COMP-NET-AMSTERDAM,
volume = "140",
number = "??",
pages = "138--151",
day = "20",
month = jul,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2018.05.006",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Thu May 31 13:40:46 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128618302044",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Koziel:2018:HPS,
author = "Brian Koziel and Reza Azarderakhsh and Mehran
Mozaffari Kermani",
title = "A High-Performance and Scalable Hardware Architecture
for Isogeny-Based Cryptography",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "11",
pages = "1594--1609",
month = "????",
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2815605",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Oct 11 14:31:34 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8315051/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Kreutz:2018:KPS,
author = "D. Kreutz and J. Yu and P. Esteves-Ver{\'\i}ssimo and
C. Magalh{\~a}es and F. M. V. Ramos",
title = "The {KISS} Principle in Software-Defined Networking: A
Framework for Secure Communications",
journal = j-IEEE-SEC-PRIV,
volume = "16",
number = "5",
pages = "60--70",
month = sep # "\slash " # oct,
year = "2018",
DOI = "https://doi.org/10.1109/MSP.2018.3761717",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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; Complexity theory; computer network
security; Control systems; cryptographic primitives;
Cryptography; integrated device verification value
iDVV; KISS principle; perfect forward secrecy;
performance; Performance evaluation; Protocols; SDN;
secure channel support; secure communications; secure
mechanisms; secure SDN control plane communications
architecture; security; software defined networking;
software-defined networking; support infrastructure;
system architecture; telecommunication traffic;
traditional solutions",
}
@Article{Kshetri:2018:BEV,
author = "N. Kshetri and J. Voas",
title = "Blockchain-Enabled E-Voting",
journal = j-IEEE-SOFTWARE,
volume = "35",
number = "4",
pages = "95--99",
month = jul # "\slash " # aug,
year = "2018",
CODEN = "IESOEG",
DOI = "https://doi.org/10.1109/MS.2018.2801546",
ISSN = "0740-7459 (print), 1937-4194 (electronic)",
ISSN-L = "0740-7459",
bibdate = "Fri Aug 2 09:25:48 2019",
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/ieeesoft.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Software",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/software",
keywords = "ballot anonymously; BEV; Blockchain;
blockchain-enabled e-voting; blockchains; cryptography;
Cryptography; data privacy; e-voting; elections;
Electronic voting; electronic voting; eligible voters;
encrypted key; fraud; government data processing;
Invited Content; online voting; paper ballots; software
development; software engineering; tamper-proof
personal ID; Urban areas; voter access; voter fraud;
voter fraud reduction",
}
@Article{Kumari:2018:SAS,
author = "Saru Kumari and Marimuthu Karuppiah and Ashok Kumar
Das and Xiong Li and Fan Wu and Neeraj Kumar",
title = "A secure authentication scheme based on elliptic curve
cryptography for {IoT} and cloud servers",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "12",
pages = "6428--6453",
month = dec,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-017-2048-0",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Oct 10 15:31:10 MDT 2019",
bibsource = "http://link.springer.com/journal/11227/74/12;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Kuo:2018:DRA,
author = "Tsung-Min Kuo and Sung-Ming Yen and Meng-Che Han",
title = "Dynamic reversed accumulator",
journal = j-INT-J-INFO-SEC,
volume = "17",
number = "2",
pages = "183--191",
month = apr,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-017-0360-6",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Sat Mar 3 09:41:24 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib",
URL = "http://link.springer.com/article/10.1007/s10207-017-0360-6",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
keywords = "Dynamic accumulator; Revocation; Zero-knowledge
proof",
}
@Article{Kurkcu:2018:CBE,
author = "{\"O}m{\"u}r K{\i}van{\c{c}} K{\"u}rk{\c{c}}{\"u} and
Ersin Aslan",
title = "A Comparison Between Edge Neighbor Rupture Degree and
Edge Scattering Number in Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "7",
pages = "??--??",
month = nov,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500247",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:50 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500247",
abstract = "The vulnerability measure of a graph or a network
depends on robustness of the remained graph, after
being exposed to any intervention or attack. In this
paper, we consider two edge vulnerability parameters
that are the edge neighbor rupture degree and the edge
scattering number. The values of these parameters of
some specific graphs and their graph operations are
calculated. Thus, we analyze and compare which
parameter is distinctive for the different type of
graphs by using tables.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kwon:2018:CEI,
author = "Jihoon Kwon and Seog Chung Seo and Seokhie Hong",
title = "Correction to: {An efficient implementation of
pairing-based cryptography on MSP430 processor}",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "5",
pages = "2254--2254",
month = may,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-018-2320-y",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Oct 10 15:31:11 MDT 2019",
bibsource = "http://link.springer.com/journal/11227/74/5;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
note = "See \cite{Kwon:2018:EIP}.",
URL = "http://link.springer.com/content/pdf/10.1007/s11227-018-2320-y.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Kwon:2018:EIP,
author = "Jihoon Kwon and Seog Chung Seo and Seokhie Hong",
title = "An efficient implementation of pairing-based
cryptography on {MSP430} processor",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "3",
pages = "1394--1417",
month = mar,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-017-2097-4",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Fri Mar 2 12:22:02 MST 2018",
bibsource = "http://link.springer.com/journal/11227/74/3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Lai:2018:EQK,
author = "Hong Lai and Mingxing Luo and Josef Pieprzyk and
Zhiguo Qu and Mehmet A. Orgun",
title = "Efficient quantum key distribution using
{Fibonacci}-number coding with a biased basis choice",
journal = j-INFO-PROC-LETT,
volume = "134",
number = "??",
pages = "24--30",
month = jun,
year = "2018",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2018.01.011",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Mar 10 13:57:33 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019018300267",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Lai:2018:IBB,
author = "Jianchang Lai and Yi Mu and Fuchun Guo and Peng Jiang
and Sha Ma",
title = "Identity-Based Broadcast Encryption for Inner
Products",
journal = j-COMP-J,
volume = "61",
number = "8",
pages = "1240--1251",
day = "1",
month = aug,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy062",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:57 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/8/1240/5035766",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Lai:2018:NSH,
author = "Qiqi Lai and Bo Yang and Yong Yu and Yuan Chen and
Jian Bai",
title = "Novel Smooth Hash Proof Systems Based on Lattices",
journal = j-COMP-J,
volume = "61",
number = "4",
pages = "561--574",
day = "1",
month = apr,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxx111",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:19 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://academic.oup.com/comjnl/article/61/4/561/4725104",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Lee:2018:NIC,
author = "Eunsung Lee and Sang Woo Kim",
title = "Non-interactive Conditional Proxy Re-Signature in the
Standard Model",
journal = j-COMP-J,
volume = "61",
number = "12",
pages = "1772--1782",
day = "1",
month = dec,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/computer_journal/bxy036",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 27 19:24:38 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/12/1772/4965847",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Leung:2018:TTA,
author = "Ho-Man Colman Leung and Chi-Wing Fu and Pheng-Ann
Heng",
title = "{TwistIn}: Tangible Authentication of Smart Devices
via Motion Co-analysis with a Smartwatch",
journal = j-IMWUT,
volume = "2",
number = "2",
pages = "1--24",
month = jul,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3214275",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:37:01 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3214275",
abstract = "Smart devices contain sensitive information that has
to be guarded against unauthorized access through
authentication. Existing authentication methods become
obsolete as they are designed either for logging-in one
device at a time or are ineffective in \ldots{}",
acknowledgement = ack-nhfb,
articleno = "72",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Li:2018:CIC,
author = "M. Li and H. Fan and Y. Xiang and Y. Li and Y. Zhang",
title = "Cryptanalysis and Improvement of a Chaotic Image
Encryption by First-Order Time-Delay System",
journal = j-IEEE-MULTIMEDIA,
volume = "25",
number = "3",
pages = "92--101",
month = jul # "\slash " # sep,
year = "2018",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2018.112142439",
ISSN = "1070-986x (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Fri Aug 2 10:38:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
journal-URL = "http://www.computer.org/multimedia/",
keywords = "chaos; Correlation; cryptanalysis; cryptography;
delays; Encryption; first-order time-delay system;
hyperchaotic based image encryption scheme; IEEE
Multimedia; image coding; image encryption; Multimedia
communication; Object recognition; plaintext attack;
two-round crossover diffusion; vector partition;
vectors",
}
@Article{Li:2018:CIE,
author = "C. Li and D. Lin and J. L{\"u} and F. Hao",
title = "Cryptanalyzing an Image Encryption Algorithm Based on
Autoblocking and Electrocardiography",
journal = j-IEEE-MULTIMEDIA,
volume = "25",
number = "4",
pages = "46--56",
month = oct # "\slash " # dec,
year = "2018",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2018.2873472",
ISSN = "1070-986x (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Fri Aug 2 10:38:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
journal-URL = "http://www.computer.org/multimedia/",
keywords = "*; autoblocking method; Chaotic communication; chaotic
image encryption algorithm; chaotic system; cipher
images; cryptography; electrocardiography;
Electrocardiography; electrocardiography signals;
Encryption; Feature extraction; image processing;
Logistics; mask image; plain image",
}
@Article{Li:2018:MMA,
author = "Rongjia Li and Chenhui Jin",
title = "Meet-in-the-Middle Attacks on Reduced-Round
{QARMA-64\slash 128}",
journal = j-COMP-J,
volume = "61",
number = "8",
pages = "1158--1165",
day = "1",
month = aug,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy045",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:57 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/8/1158/4993053",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Li:2018:OPP,
author = "Tong Li and Zhengan Huang and Ping Li and Zheli Liu
and Chunfu Jia",
title = "Outsourced privacy-preserving classification service
over encrypted data",
journal = j-J-NETW-COMPUT-APPL,
volume = "106",
number = "??",
pages = "100--110",
day = "15",
month = mar,
year = "2018",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2017.12.021",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sat Mar 3 15:22:11 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517304356",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Li:2018:RBB,
author = "Xiong Li and Jianwei Niu and Saru Kumari and Fan Wu
and Kim-Kwang Raymond Choo",
title = "A robust biometrics based three-factor authentication
scheme for {Global Mobility Networks} in smart city",
journal = j-FUT-GEN-COMP-SYS,
volume = "83",
number = "??",
pages = "607--618",
month = jun,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Thu Mar 15 17:42:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X1730585X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Li:2018:SCM,
author = "Xiong Li and Fan Wu and Muhammad Khurram Khan and Lili
Xu and Jian Shen and Minho Jo",
title = "A secure chaotic map-based remote authentication
scheme for telecare medicine information systems",
journal = j-FUT-GEN-COMP-SYS,
volume = "84",
number = "??",
pages = "149--159",
month = jul,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.08.029",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Apr 16 14:45:08 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X1730688X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Li:2018:TFA,
author = "Xiong Li and Jianwei Niu and Saru Kumari and Fan Wu
and Arun Kumar Sangaiah and Kim-Kwang Raymond Choo",
title = "A three-factor anonymous authentication scheme for
wireless sensor networks in {Internet of Things}
environments",
journal = j-J-NETW-COMPUT-APPL,
volume = "103",
number = "??",
pages = "194--204",
day = "1",
month = feb,
year = "2018",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Fri Jan 12 10:10:21 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517302254",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Li:2018:WMH,
author = "L. Li and H. Li and W. Yuan and J. Lu and X. Feng and
C. Chang",
title = "A Watermarking Mechanism With High Capacity for
Three-Dimensional Mesh Objects Using Integer Planning",
journal = j-IEEE-MULTIMEDIA,
volume = "25",
number = "3",
pages = "49--64",
month = jul # "\slash " # sep,
year = "2018",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2018.112142343",
ISSN = "1070-986x (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Fri Aug 2 10:38:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
journal-URL = "http://www.computer.org/multimedia/",
keywords = "carrier image; computer systems organization; digital
watermarking; Discrete Fourier transforms; flexible
selection process; global optimization; high capacity;
high-capacity information; IEEE Multimedia; image
watermarking; integer planning; mathematics of
computing; Multimedia communication; numerical
analysis; optimization; Robustness; signal processing
systems; Solid modeling; sparsity analysis process;
special-purpose and application-based systems;
Three-dimensional displays; three-dimensional mesh
objects; Watermarking; watermarking mechanism",
}
@Article{Lin:2018:BBB,
author = "Chao Lin and Debiao He and Xinyi Huang and Kim-Kwang
Raymond Choo and Athanasios V. Vasilakos",
title = "{BSeIn}: a blockchain-based secure mutual
authentication with fine-grained access control system
for industry 4.0",
journal = j-J-NETW-COMPUT-APPL,
volume = "116",
number = "??",
pages = "42--52",
day = "15",
month = aug,
year = "2018",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:25 MDT 2019",
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/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518301619",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Lin:2018:CPF,
author = "Xi-Jun Lin and Lin Sun and Haipeng Qu and Dongxiao
Liu",
title = "Cryptanalysis of A Pairing-Free Certificateless
Signcryption Scheme",
journal = j-COMP-J,
volume = "61",
number = "4",
pages = "539--544",
day = "1",
month = apr,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxx104",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:19 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/4/539/4608880",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Lin:2018:SEI,
author = "Tingting Lin and Hailun Yan and Xuejia Lai and Yixin
Zhong and Yin Jia",
title = "Security Evaluation and Improvement of a White-Box
{SMS4} Implementation Based on Affine Equivalence
Algorithm",
journal = j-COMP-J,
volume = "61",
number = "12",
pages = "1783--1790",
day = "1",
month = dec,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy068",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 27 19:24:38 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/12/1783/5055352",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Lin:2018:SSS,
author = "Xi-Jun Lin and Lin Sun and Haipeng Qu and Dongxiao
Liu",
title = "On the Security of Secure Server-Designation Public
Key Encryption with Keyword Search",
journal = j-COMP-J,
volume = "61",
number = "12",
pages = "1791--1793",
day = "1",
month = dec,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy073",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 27 19:24:38 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/12/1791/5055854",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Liu:2018:GEI,
author = "Zhe Liu and Patrick Longa and {\c{C}}etin Kaya
Ko{\c{c}}",
title = "{Guest Editors}' Introduction to the Special Issue on
Cryptographic Engineering in a Post-Quantum World:
State of the Art Advances",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "11",
pages = "1532--1534",
month = "????",
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2869611",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Oct 11 14:31:34 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8485531/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Liu:2018:HMS,
author = "Jianqiang Liu and Shuai Huo and Yi Wang",
title = "A Hierarchical Mapping System for Flat Identifier to
Locator Resolution Based on Active Degree",
journal = j-FUTURE-INTERNET,
volume = "10",
number = "8",
pages = "75",
day = "08",
month = aug,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi10080075",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:01 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/10/8/75",
abstract = "Overloading of IP address semantics appeals for a new
network architecture based on Identifier (ID)/Locator
separation. The challenge of Identifier (ID)/Locator
separation is how to solve the scalability and
efficiency challenges of identity-to-location
resolution. By analyzing the requirements of the
Identifier (ID)/Locator separation protocol, this paper
proposes a hierarchical mapping architecture on
active-degree (HMAA). This HMAA was divided into three
levels: active local level, neutral transfer level, and
inert global level. Each mapping item is dynamically
allocated to different levels to ensure minimizing
delay according to its activity characteristics. The
top layer CHORD is constructed by the Markov Decision
Process, which can keep consistency between the
physical topology and the logical topology. The
simulation results on delay time show that HMAA can
satisfy the scalability and efficiency requirements of
an Identifier (ID)/Locator separation network.",
acknowledgement = ack-nhfb,
}
@Article{Liu:2018:IMM,
author = "Ya Liu and Anren Yang and Bo Dai and Wei Li and
Zhiqiang Liu and Dawu Gu and Zhiqiang Zeng",
title = "Improved Meet-in-the Middle Attacks on Reduced-Round
{TWINE-128}",
journal = j-COMP-J,
volume = "61",
number = "8",
pages = "1252--1258",
day = "1",
month = aug,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy061",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:57 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/8/1252/5040794",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Liu:2018:PAB,
author = "Zechao Liu and Zoe L. Jiang and Xuan Wang and S. M.
Yiu",
title = "Practical attribute-based encryption: Outsourcing
decryption, attribute revocation and policy updating",
journal = j-J-NETW-COMPUT-APPL,
volume = "108",
number = "??",
pages = "112--123",
day = "15",
month = apr,
year = "2018",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2018.01.016",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sun May 27 08:10:14 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518300304",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Liu:2018:SKR,
author = "Jinhui Liu and Yong Yu and Bo Yang and Jianwei Jia and
Shijia Wang and Houzhen Wang",
title = "Structural Key Recovery of Simple Matrix Encryption
Scheme Family",
journal = j-COMP-J,
volume = "61",
number = "12",
pages = "1880--1896",
day = "1",
month = dec,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy093",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 27 19:24:38 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/12/1880/5110544",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Liu:2018:VRU,
author = "Rui Liu and Cory Cornelius and Reza Rawassizadeh and
Ronald Peterson and David Kotz",
title = "Vocal Resonance: Using Internal Body Voice for
Wearable Authentication",
journal = j-IMWUT,
volume = "2",
number = "1",
pages = "1--23",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3191751",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:36:59 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3191751",
abstract = "We observe the advent of body-area networks of
pervasive wearable devices, whether for health
monitoring, personal assistance, entertainment, or home
automation. For many devices, it is critical to
identify the wearer, allowing sensor data to be
\ldots{}",
acknowledgement = ack-nhfb,
articleno = "19",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Liu:2018:VSE,
author = "Zheli Liu and Tong Li and Ping Li and Chunfu Jia and
Jin Li",
title = "Verifiable searchable encryption with aggregate keys
for data sharing system",
journal = j-FUT-GEN-COMP-SYS,
volume = "78 (part 2)",
number = "??",
pages = "778--788",
month = jan,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Sep 25 09:24:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17302340",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Loreti:2018:PAB,
author = "Pierpaolo Loreti and Lorenzo Bracciale and Alberto
Caponi",
title = "Push Attack: Binding Virtual and Real Identities Using
Mobile Push Notifications",
journal = j-FUTURE-INTERNET,
volume = "10",
number = "2",
pages = "13",
day = "31",
month = jan,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi10020013",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/10/2/13",
abstract = "Popular mobile apps use push notifications extensively
to offer an ``always connected'' experience to their
users. Social networking apps use them as a real-time
channel to notify users about new private messages or
new social interactions (e.g., friendship request,
tagging, etc.). Despite the cryptography used to
protect these communication channels, the strict
temporal binding between the actions that trigger the
notifications and the reception of the notification
messages in the mobile device may represent a privacy
issue. In this work, we present the push notification
attack designed to bind the physical owners of mobile
devices with their virtual identities, even if
pseudonyms are used. In an online attack, an active
attacker triggers a push notification and captures the
notification packets that transit in the network. In an
offline attack, a passive attacker correlates the
social network activity of a user with the received
push notification. The push notification attack
bypasses the standard ways of protecting user privacy
based on the network layer by operating at the
application level. It requires no additional software
on the victim's mobile device.",
acknowledgement = ack-nhfb,
remark = "Special Issue Security and Privacy in Wireless and
Mobile Networks.",
}
@Article{Lyu:2018:PKE,
author = "Lin Lyu and Shengli Liu and Shuai Han",
title = "Public-Key Encryption with Tight Simulation-Based
Selective-Opening Security",
journal = j-COMP-J,
volume = "61",
number = "2",
pages = "288--318",
day = "1",
month = feb,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxx080",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/2/288/4259796",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Mahmood:2018:ECC,
author = "Khalid Mahmood and Shehzad Ashraf Chaudhry and Husnain
Naqvi and Saru Kumari and Xiong Li and Arun Kumar
Sangaiah",
title = "An elliptic curve cryptography based lightweight
authentication scheme for smart grid communication",
journal = j-FUT-GEN-COMP-SYS,
volume = "81",
number = "??",
pages = "557--565",
month = apr,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Dec 26 08:55:44 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17309263",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Maitra:2018:TAA,
author = "Subhamoy Maitra and Nishant Sinha and Akhilesh
Siddhanti and Ravi Anand and Sugata Gangopadhyay",
title = "A {TMDTO} Attack Against {Lizard}",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "5",
pages = "733--739",
month = may,
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2017.2773062",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Apr 12 07:11:24 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8107499/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Malina:2018:SET,
author = "Lukas Malina and Petr Dzurenda and Jan Hajny and
Zdenek Martinasek",
title = "Secure and efficient two-factor zero-knowledge
authentication solution for access control systems",
journal = j-COMPUT-SECUR,
volume = "77",
number = "??",
pages = "500--513",
month = aug,
year = "2018",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:55 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818304942",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Martins:2018:SFH,
author = "Paulo Martins and Leonel Sousa and Artur Mariano",
title = "A Survey on Fully Homomorphic Encryption: an
Engineering Perspective",
journal = j-COMP-SURV,
volume = "50",
number = "6",
pages = "83:1--83:??",
month = jan,
year = "2018",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3124441",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Jan 20 09:25:01 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "It is unlikely that a hacker is able to compromise
sensitive data that is stored in an encrypted form.
However, when data is to be processed, it has to be
decrypted, becoming vulnerable to attacks. Homomorphic
encryption fixes this vulnerability by allowing one to
compute directly on encrypted data. In this survey,
both previous and current Somewhat Homomorphic
Encryption (SHE) schemes are reviewed, and the more
powerful and recent Fully Homomorphic Encryption (FHE)
schemes are comprehensively studied. The concepts that
support these schemes are presented, and their
performance and security are analyzed from an
engineering standpoint.",
acknowledgement = ack-nhfb,
articleno = "83",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Mashimo:2018:VMS,
author = "Susumu Mashimo and Ryota Shioya and Koji Inoue",
title = "{VMOR}: Microarchitectural Support for Operand Access
in an Interpreter",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "17",
number = "2",
pages = "217--220",
month = jul # "\slash " # dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2018.2866243",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Tue Jun 25 07:41:05 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Dynamic scripting languages become very popular for
high productivity. However, many of these languages
have significant runtime overheads because they employ
interpreter-based virtual machines. One of the major
overheads for the interpreter is derived from operand
accesses, which significantly increase memory accesses.
We propose VMOR, microarchitectural support for the
operand accesses in the interpreter. VMOR remaps
operand values into floating-point physical registers,
which are rarely used in the interpreter, and thus.
VMOR effectively reduces the memory accesses.",
acknowledgement = ack-nhfb,
affiliation = "Mashimo, S (Reprint Author), Kyushu Univ, Fukuoka,
Fukuoka 8190395, Japan. Mashimo, Susumu; Inoue, Koji,
Kyushu Univ, Fukuoka, Fukuoka 8190395, Japan. Shioya,
Ryota, Nagoya Univ, Nagoya, Aichi 4648601, Japan.",
author-email = "susumu.mashimo@cpc.ait.kyushu-u.ac.jp
shioya@nuee.nagoya-u.ac.jp inoue@ait.kyushu-u.ac.jp",
da = "2019-06-20",
doc-delivery-number = "HA2CO",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "JSPS KAKENHI [JP17J10388]",
funding-text = "This work was supported by JSPS KAKENHI Grant Number
JP17J10388.",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "authoring languages; Cryptography; Dynamic scripting
language; dynamic scripting languages; floating-point
physical registers; Hardware; high productivity;
interpreter; interpreter-based virtual machines; memory
accesses; microarchitectural support;
Microarchitecture; operand access; operand values;
Pipelines; Productivity; program interpreters;
Proposals; Registers; virtual machines; VMOR",
number-of-cited-references = "10",
research-areas = "Computer Science",
times-cited = "0",
unique-id = "Mashimo:2018:VMS",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Matias:2018:NNZ,
author = "P. Matias and P. Barbosa and T. N. C. Cardoso and D.
M. Campos and D. F. Aranha",
title = "{NIZKCTF}: A Noninteractive Zero-Knowledge
Capture-the-Flag Platform",
journal = j-IEEE-SEC-PRIV,
volume = "16",
number = "6",
pages = "42--51",
month = nov # "\slash " # dec,
year = "2018",
DOI = "https://doi.org/10.1109/MSEC.2018.2875324",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "Brazilian cybersecurity community; Computer security;
cryptography; Cryptography; educational tools; NIZKCTF;
noninteractive zero-knowledge capture-the-flag
platform; open-audit CTF platform; Privacy;
professional tools; security issues; Servers; Software
development; zero-knowledge proofs",
}
@Article{Memon:2018:TFS,
author = "Shiraz Memon and Jensen Jens and Elbers Willem and
Helmut Neukirchen and Matthias Book and Morris Riedel",
title = "Towards Federated Service Discovery and Identity
Management in Collaborative Data and Compute Cloud
Infrastructures",
journal = j-J-GRID-COMP,
volume = "16",
number = "4",
pages = "663--681",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10723-018-9445-3",
ISSN = "1570-7873 (print), 1572-9184 (electronic)",
ISSN-L = "1570-7873",
bibdate = "Fri Oct 11 06:43:45 MDT 2019",
bibsource = "http://link.springer.com/journal/10723/16/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib",
URL = "https://link.springer.com/article/10.1007/s10723-018-9445-3",
acknowledgement = ack-nhfb,
fjournal = "Journal of Grid Computing",
journal-URL = "http://link.springer.com/journal/10723",
}
@Article{Meng:2018:TTB,
author = "Weizhi Meng and Yu Wang and Duncan S. Wong and Sheng
Wen and Yang Xiang",
title = "{TouchWB}: Touch behavioral user authentication based
on web browsing on smartphones",
journal = j-J-NETW-COMPUT-APPL,
volume = "117",
number = "??",
pages = "1--9",
day = "1",
month = sep,
year = "2018",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518301723",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Migliore:2018:HSC,
author = "Vincent Migliore and Maria M{\'e}ndez Real and Vianney
Lapotre and Arnaud Tisserand and Caroline Fontaine and
Guy Gogniat",
title = "Hardware\slash Software Co-Design of an Accelerator
for {FV} Homomorphic Encryption Scheme Using
{Karatsuba} Algorithm",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "3",
pages = "335--347",
month = mar,
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2645204",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Feb 15 05:53:34 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/document/7797469/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Migliore:2018:PPF,
author = "Vincent Migliore and Guillaume Bonnoron and Caroline
Fontaine",
title = "Practical Parameters for Somewhat Homomorphic
Encryption Schemes on Binary Circuits",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "11",
pages = "1550--1560",
month = "????",
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2808962",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Oct 11 14:31:34 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8302942/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Min:2018:AAB,
author = "Donghyun Min and Donggyu Park and Jinwoo Ahn and Ryan
Walker and Junghee Lee and Sungyong Park and Youngjae
Kim",
title = "{Amoeba}: An Autonomous Backup and Recovery {SSD} for
Ransomware Attack Defense",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "17",
number = "2",
pages = "243--246",
month = jul # "\slash " # dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2018.2883431",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Tue Jun 25 07:41:05 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Ransomware is one of growing concerns in enterprise
and government organizations, because it may cause
financial damages or loss of important data. Although
there are techniques to detect and prevent ransomware,
an evolved ransomware may evade them because they are
based on monitoring known behaviors. Ransomware can be
mitigated if backup copies of data are retained in a
safe place. However, existing backup solutions may be
under ransomware's control and an intelligent
ransomware may destroy backup copies too. They also
incur overhead to storage space, performance and
network traffic (in case of remote backup). In this
paper, we propose an SSD system that supports automated
backup, called Amoeba. In particular, Amoeba is armed
with a hardware accelerator that can detect the
infection of pages by ransomware attacks at high speed
and a fine-grained backup control mechanism to minimize
space overhead for original data backup. For
evaluation, we extended the Microsoft SSD simulator to
implement Amoeba and evaluated it using the realistic
block-level traces, which are collected while running
the actual ransomware. According to our experiments,
Amoeba has negligible overhead and outperforms in
performance and space efficiency over the
state-of-the-art SSD, FlashGuard, which supports data
backup within the device.",
acknowledgement = ack-nhfb,
affiliation = "Kim, Y (Reprint Author), Sogang Univ, Seoul 04107,
South Korea. Min, Donghyun; Park, Donggyu; Ahn, Jinwoo;
Park, Sungyong; Kim, Youngjae, Sogang Univ, Seoul
04107, South Korea. Walker, Ryan; Lee, Junghee, Univ
Texas San Antonio, San Antonio, TX 78249 USA.",
author-email = "mdh38112@sogang.ac.kr dgpark@sogang.ac.kr
jinu37@sogang.ac.kr ryan.walker@utsa.edu
junghee.lee@utsa.edu parksy@sogang.ac.kr
youkim@sogang.ac.kr",
da = "2019-06-20",
doc-delivery-number = "HE6YC",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "National Research Foundation of Korea (NRF)
--- Korea Government (MSIT) [NRF-2018R1A1A1A05079398]",
funding-text = "This work was supported by the National Research
Foundation of Korea (NRF) grant funded by the Korea
Government (MSIT) (No. NRF-2018R1A1A1A05079398).",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "Aerospace electronics; Amoeba; autonomous backup SSD;
autonomous recovery SSD; back-up procedures;
cryptography; Cryptography; data backup; Entropy;
FlashGuard; intelligent ransomware; invasive software;
Microsoft SSD simulator; Performance evaluation;
Ransomware; ransomware attack; ransomware attack
defense; Solid-state drive (SSD); SSD system; storage
management; storage security",
number-of-cited-references = "12",
ORCID-numbers = "Park, Sungyong/0000-0002-0309-1820 Min,
Donghyun/0000-0002-6043-9264",
research-areas = "Computer Science",
times-cited = "0",
unique-id = "Min:2018:AAB",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
xxpages = "245--248",
}
@Article{Miret:2018:PBC,
author = "Josep M. Miret and Daniel Sadornil and Juan G. Tena",
title = "Pairing-Based Cryptography on Elliptic Curves",
journal = j-MATH-COMPUT-SCI,
volume = "12",
number = "3",
pages = "309--318",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1007/s11786-018-0347-3",
ISSN = "1661-8270 (print), 1661-8289 (electronic)",
ISSN-L = "1661-8270",
bibdate = "Mon Mar 4 06:59:44 MST 2019",
bibsource = "http://link.springer.com/journal/11786/12/3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/math-comput-sci.bib",
acknowledgement = ack-nhfb,
fjournal = "Mathematics in Computer Science",
journal-URL = "http://link.springer.com/journal/11786",
}
@Article{Mo:2018:RUA,
author = "Jiaqing Mo and Zhongwang Hu and Yuhua Lin",
title = "Remote user authentication and key agreement for
mobile client-server environments on elliptic curve
cryptography",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "11",
pages = "5927--5943",
month = nov,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-018-2507-2",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Oct 10 15:31:09 MDT 2019",
bibsource = "http://link.springer.com/journal/11227/74/11;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Moataz:2018:SSE,
author = "Tarik Moataz and Indrajit Ray and Indrakshi Ray and
Abdullatif Shikfa and Fr{\'e}d{\'e}ric Cuppens and Nora
Cuppens",
title = "Substring search over encrypted data",
journal = j-J-COMP-SECUR,
volume = "26",
number = "1",
pages = "1--30",
month = "????",
year = "2018",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-14652",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Mon Sep 23 05:47:14 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Modersheim:2018:ABP,
author = "Sebastian M{\"o}dersheim and Luca Vigan{\`o}",
title = "Alpha--Beta Privacy",
journal = j-TOPS,
volume = "22",
number = "1",
pages = "7:1--7:??",
month = jan,
year = "2018",
DOI = "https://doi.org/10.1145/3289255",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
bibdate = "Sat Sep 21 08:26:24 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
URL = "https://dl.acm.org/citation.cfm?id=3289255",
abstract = "The formal specification of privacy goals in symbolic
protocol models has proved to be not quite trivial so
far. The most widely used approach in formal methods is
based on the static equivalence of frames in the
applied pi-calculus, basically asking whether or not
the intruder is able to distinguish two given worlds.
But then a subtle question emerges: How can we be sure
that we have specified all pairs of worlds to properly
reflect our intuitive privacy goal? To address this
problem, we introduce in this article a novel and
declarative way to specify privacy goals, called (
\alpha , \beta )-privacy. This new approach is based on
specifying two formulae \alpha and \beta in first-order
logic with Herbrand universes, where \alpha reflects
the intentionally released information and \beta
includes the actual cryptographic (``technical'')
messages the intruder can see. Then ( \alpha , \beta
)-privacy means that the intruder cannot derive any
``nontechnical'' statement from \beta that he cannot
derive from \alpha already. We describe by a variety of
examples how this notion can be used in practice. Even
though ( \alpha , \beta )-privacy does not directly
contain a notion of distinguishing between worlds,
there is a close relationship to static equivalence of
frames that we investigate formally. This allows us to
justify (and criticize) the specifications that are
currently used in verification tools and obtain a
decision procedure for a large fragment of ( \alpha ,
\beta )-privacy.",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Misc{Mofrad:2018:CSI,
author = "Saeid Mofrad and Fengwei Zhang and Shiyong Lu and
Weidong (Larry) Shi",
title = "A Comparison Study of {Intel SGX} and {AMD} Memory
Encryption Technology",
howpublished = "Web lecture slides.",
day = "30",
month = may,
year = "2018",
bibdate = "Mon Oct 07 11:03:16 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://caslab.csl.yale.edu/workshops/hasp2018/HASP18_a9-mofrad_slides.pdf",
acknowledgement = ack-nhfb,
remark = "Floating-point performance charts show up to 19.3
times slowdown of Intel SGX compared to AMD SEV when
memory encryption is enabled.",
}
@Article{Mohd:2018:HDM,
author = "Bassam Jamil Mohd and Thaier Hayajneh and Khalil M.
Ahmad Yousef and Zaid Abu Khalaf and Md Zakirul Alam
Bhuiyan",
title = "Hardware design and modeling of lightweight block
ciphers for secure communications",
journal = j-FUT-GEN-COMP-SYS,
volume = "83",
number = "??",
pages = "510--521",
month = jun,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Thu Mar 15 17:42:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17304661",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Morales-Sandoval:2018:PBC,
author = "Miguel Morales-Sandoval and Jose Luis Gonzalez-Compean
and Arturo Diaz-Perez and Victor J. Sosa-Sosa",
title = "A pairing-based cryptographic approach for data
security in the cloud",
journal = j-INT-J-INFO-SEC,
volume = "17",
number = "4",
pages = "441--461",
month = aug,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-017-0375-z",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Wed Jul 25 08:53:56 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib",
URL = "http://link.springer.com/article/10.1007/s10207-017-0375-z",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
}
@Article{Mosca:2018:CEQ,
author = "M. Mosca",
title = "Cybersecurity in an Era with Quantum Computers: Will
We Be Ready?",
journal = j-IEEE-SEC-PRIV,
volume = "16",
number = "5",
pages = "38--41",
month = sep # "\slash " # oct,
year = "2018",
DOI = "https://doi.org/10.1109/MSP.2018.3761723",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "Cryptography; cryptography; cybersecurity; Fault
tolerance; Fault tolerant systems; information assets;
migration time; organizations; quantum attacks; quantum
computers; quantum computing; Quantum computing; risk
management; security; security of data; security shelf
life; specific risks",
}
@Article{Mouris:2018:TSB,
author = "Dimitris Mouris and Nektarios Georgios Tsoutsos and
Michail Maniatakos",
title = "TERMinator Suite: Benchmarking Privacy-Preserving
Architectures",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "17",
number = "2",
pages = "122--125",
month = jul # "\slash " # dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2018.2812814",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Security and privacy are fundamental objectives
characterizing contemporary cloud computing. Despite
the wide adoption of encryption for protecting data in
transit and at rest, data in use remains unencrypted
inside cloud processors and memories, as computation is
not applicable on encrypted values. This limitation
introduces security risks, as unencrypted values can be
leaked through side-channels or hardware Trojans. To
address this problem, encrypted architectures have
recently been proposed, which leverage homomorphic
encryption to natively process encrypted data using
datapaths of thousands of bits. In this case,
additional security protections are traded for higher
performance penalties, which drives the need for more
efficient architectures. In this work, we develop
benchmarks specifically tailored to homomorphic
computers, to enable comparisons across different
architectures. Our benchmark suite, dubbed TERMinator,
is unique as it avoids ``termination {problems''} that
prohibit making control-flow decisions and evaluating
early termination conditions based on encrypted data,
as these can leak information. Contrary to generic
suites that ignore the fundamental challenges of
encrypted computation, our algorithms are tailored to
the security primitives of the target encrypted
architecture, such as the existence of branching
oracles. In our experiments, we compiled our benchmarks
for the Cryptoleq architecture and evaluated their
performance for a range of security parameters.",
acknowledgement = ack-nhfb,
affiliation = "Tsoutsos, NG (Reprint Author), NYU, New York, NY 10003
USA. Mouris, Dimitris, Univ Athens, GR-10679 Athens,
Greece. Tsoutsos, Nektarios Georgios; Maniatakos,
Michail, NYU, New York, NY 10003 USA.",
author-email = "jimouris@di.uoa.gr nektarios.tsoutsos@nyu.edu
michail.maniatakos@nyu.edu",
da = "2019-06-20",
doc-delivery-number = "GP4TI",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "NYU Abu Dhabi Global Ph.D. Student
Fellowship program",
funding-text = "This work was partially sponsored by the NYU Abu Dhabi
Global Ph.D. Student Fellowship program. D. Mouris
thanks Orestis Polychroniou for the fruitful
discussions.",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "Benchmarks; data privacy; encrypted computation;
homomorphic encryption; leakage prevention; performance
evaluation; termination problem",
number-of-cited-references = "14",
ORCID-numbers = "Maniatakos, Michail/0000-0001-6899-0651",
research-areas = "Computer Science",
times-cited = "0",
unique-id = "Mouris:2018:TSB",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Mozaffari-Kermani:2018:ERE,
author = "Mehran Mozaffari-Kermani and Reza Azarderakhsh and
Ausmita Sarker and Amir Jalali",
title = "Efficient and Reliable Error Detection Architectures
of Hash-Counter-Hash Tweakable Enciphering Schemes",
journal = j-TECS,
volume = "17",
number = "2",
pages = "54:1--54:??",
month = apr,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3159173",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:34 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Through pseudorandom permutation, tweakable
enciphering schemes (TES) constitute block cipher modes
of operation which perform length-preserving
computations. The state-of-the-art research has focused
on different aspects of TES, including implementations
on hardware [field-programmable gate array (FPGA)/
application-specific integrated circuit (ASIC)] and
software (hard/soft-core microcontrollers) platforms,
algorithmic security, and applicability to sensitive,
security-constrained usage models. In this article, we
propose efficient approaches for protecting such
schemes against natural and malicious faults.
Specifically, noting that intelligent attackers do not
merely get confined to injecting multiple faults, one
major benchmark for the proposed schemes is evaluation
toward biased and burst fault models. We evaluate a
variant of TES, i.e., the Hash-Counter-Hash scheme,
which involves polynomial hashing as other variants are
either similar or do not constitute finite field
multiplication which, by far, is the most involved
operation in TES. In addition, we benchmark the
overhead and performance degradation on the ASIC
platform. The results of our error injection
simulations and ASIC implementations show the
suitability of the proposed approaches for a wide range
of applications including deeply embedded systems.",
acknowledgement = ack-nhfb,
articleno = "54",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Muhammad:2018:ISU,
author = "Khan Muhammad and Muhammad Sajjad and Irfan Mehmood
and Seungmin Rho and Sung Wook Baik",
title = "Image steganography using uncorrelated color space and
its application for security of visual contents in
online social networks",
journal = j-FUT-GEN-COMP-SYS,
volume = "86",
number = "??",
pages = "951--960",
month = sep,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Jun 20 10:38:06 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X16306768",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Nagano:2018:PRT,
author = "Koki Nagano and Jaewoo Seo and Jun Xing and Lingyu Wei
and Zimo Li and Shunsuke Saito and Aviral Agarwal and
Jens Fursund and Hao Li",
title = "{paGAN}: real-time avatars using dynamic textures",
journal = j-TOG,
volume = "37",
number = "6",
pages = "258:1--258:??",
month = nov,
year = "2018",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/3272127.3275075",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Tue Oct 22 12:28:14 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
abstract = "With the rising interest in personalized VR and gaming
experiences comes the need to create high quality 3D
avatars that are both low-cost and variegated. Due to
this, building dynamic avatars from a single
unconstrained input image is becoming a popular
application. While previous techniques that attempt
this require multiple input images or rely on
transferring dynamic facial appearance from a source
actor, we are able to do so using only one 2D input
image without any form of transfer from a source image.
We achieve this using a new conditional Generative
Adversarial Network design that allows fine-scale
manipulation of any facial input image into a new
expression while preserving its identity. Our photoreal
avatar GAN (paGAN) can also synthesize the unseen mouth
interior and control the eye-gaze direction of the
output, as well as produce the final image from a novel
viewpoint. The method is even capable of generating
fully-controllable temporally stable video sequences,
despite not using temporal information during training.
After training, we can use our network to produce
dynamic image-based avatars that are controllable on
mobile devices in real time. To do this, we compute a
fixed set of output images that correspond to key
blendshapes, from which we extract textures in UV
space. Using a subject's expression blendshapes at
run-time, we can linearly blend these key textures
together to achieve the desired appearance.
Furthermore, we can use the mouth interior and eye
textures produced by our network to synthesize
on-the-fly avatar animations for those regions. Our
work produces state-of-the-art quality image and video
synthesis, and is the first to our knowledge that is
able to generate a dynamically textured avatar with a
mouth interior, all from a single image.",
acknowledgement = ack-nhfb,
articleno = "258",
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@Article{Neustaedter:2018:BTW,
author = "Carman Neustaedter and Samarth Singhal and Rui Pan and
Yasamin Heshmat and Azadeh Forghani and John Tang",
title = "From Being There to Watching: Shared and Dedicated
Telepresence Robot Usage at Academic Conferences",
journal = j-TOCHI,
volume = "25",
number = "6",
pages = "33:1--33:??",
month = dec,
year = "2018",
CODEN = "ATCIF4",
DOI = "https://doi.org/10.1145/3243213",
ISSN = "1073-0516 (print), 1557-7325 (electronic)",
ISSN-L = "1073-0516",
bibdate = "Tue Oct 22 08:21:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tochi.bib",
abstract = "Telepresence attendance at academic conferences is now
a reality and allows people who cannot attend in person
with the opportunity to still be ``present.'' This is
valuable for people who face accessibility challenges,
cost or travel restrictions, or limited time for
travel. We have deployed and studied the use of
telepresence robots at three ACM conferences,
Ubicomp/ISWC 2014, CSCW 2016, and CHI 2016, ranging
from remote users having dedicated telepresence robots
to users sharing telepresence robots both synchronously
and asynchronously. In this article, we report on the
telepresence offerings along with the user behaviors,
experiences, and the social norms found for remote
conference attendance. Our results across the studies
focus around three main themes: shared vs. dedicated
robot usage, identity presentation and the value and
challenges associated with it; and local in-person
support through proxies and instant messaging
backchannels. These themes point to three different
areas of design exploration for telepresence robots,
pointing out the limitations of existing design
solutions with respect to each theme, areas for future
telepresence design work, and the value in considering
varied telepresence robot solutions, including both
dedicated and shared telepresence robots.",
acknowledgement = ack-nhfb,
articleno = "33",
fjournal = "ACM Transactions on Computer-Human Interaction",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J756",
}
@Article{Nguyen:2018:TBU,
author = "Toan Nguyen and Nasir Memon",
title = "Tap-based user authentication for smartwatches",
journal = j-COMPUT-SECUR,
volume = "78",
number = "??",
pages = "174--186",
month = sep,
year = "2018",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818303778",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Ogiela:2018:EBI,
author = "Marek R. Ogiela and Hoon Ko",
title = "Editorial: Bio-inspired and cognitive approaches in
cryptography and security applications",
journal = j-CCPE,
volume = "30",
number = "2",
pages = "??--??",
day = "25",
month = jan,
year = "2018",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4385",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Dec 30 09:12:00 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Ogiela:2018:LTC,
author = "Urszula Ogiela and Lidia Ogiela",
title = "Linguistic techniques for cryptographic data sharing
algorithms",
journal = j-CCPE,
volume = "30",
number = "3",
pages = "",
day = "10",
month = feb,
year = "2018",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4275",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Aug 4 10:03:11 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://onlinelibrary.wiley.com/doi/abs/10.1002/cpe.4275",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Ogiela:2018:VCA,
author = "Urszula Ogiela and Makoto Takizawa and Lidia Ogiela",
title = "Visual {CAPTCHA} application in linguistic
cryptography",
journal = j-CCPE,
volume = "30",
number = "2",
pages = "??--??",
day = "25",
month = jan,
year = "2018",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4362",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Dec 30 09:12:00 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{P:2018:ABE,
author = "Praveen Kumar P and Syam Kumar P and Alphonse P. J.
A.",
title = "Attribute based encryption in cloud computing: A
survey, gap analysis, and future directions",
journal = j-J-NETW-COMPUT-APPL,
volume = "108",
number = "??",
pages = "37--52",
day = "15",
month = apr,
year = "2018",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2018.02.009",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sun May 27 08:10:14 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518300547",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Pagnin:2018:HDB,
author = "Elena Pagnin and Anjia Yang and Qiao Hu and Gerhard
Hancke and Aikaterini Mitrokotsa",
title = "{HB$^+$DB}: Distance bounding meets human based
authentication",
journal = j-FUT-GEN-COMP-SYS,
volume = "80",
number = "??",
pages = "627--639",
month = mar,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Dec 2 16:58:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16301492",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Paletov:2018:ICA,
author = "Rumen Paletov and Petar Tsankov and Veselin Raychev
and Martin Vechev",
title = "Inferring crypto {API} rules from code changes",
journal = j-SIGPLAN,
volume = "53",
number = "4",
pages = "450--464",
month = apr,
year = "2018",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/3296979.3192403",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Oct 16 14:12:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "Creating and maintaining an up-to-date set of security
rules that match misuses of crypto APIs is challenging,
as crypto APIs constantly evolve over time with new
cryptographic primitives and settings, making existing
ones obsolete. To address this challenge, we present a
new approach to extract security fixes from thousands
of code changes. Our approach consists of: (i)
identifying code changes, which often capture security
fixes, (ii) an abstraction that filters irrelevant code
changes (such as refactorings), and (iii) a clustering
analysis that reveals commonalities between semantic
code changes and helps in eliciting security rules. We
applied our approach to the Java Crypto API and showed
that it is effective: (i) our abstraction effectively
filters non-semantic code changes (over 99\% of all
changes) without removing security fixes, and (ii) over
80\% of the code changes are security fixes identifying
security rules. Based on our results, we identified 13
rules, including new ones not supported by existing
security checkers.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "PLDI '18 proceedings.",
}
@Article{Park:2018:OTP,
author = "Chang-Seop Park",
title = "One-time password based on hash chain without shared
secret and re-registration",
journal = j-COMPUT-SECUR,
volume = "75",
number = "??",
pages = "138--146",
month = jun,
year = "2018",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:54 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818301391",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Parveen:2018:IEE,
author = "Farhana Parveen and Shaahin Angizi and Deliang Fan",
title = "{IMFlexCom}: Energy Efficient In-Memory Flexible
Computing Using Dual-Mode {SOT-MRAM}",
journal = j-JETC,
volume = "14",
number = "3",
pages = "35:1--35:??",
month = oct,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3223047",
ISSN = "1550-4832",
bibdate = "Thu Nov 1 16:44:41 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jetc.bib",
abstract = "In this article, we propose an In-Memory Flexible
Computing platform (IMFlexCom) using a novel Spin Orbit
Torque Magnetic Random Access Memory (SOT-MRAM) array
architecture, which could work in dual mode: memory
mode and computing mode. Such intrinsic in-memory logic
(AND/OR/XOR) could be used to process data within
memory to greatly reduce power-hungry and long distance
massive data communication in conventional Von Neumann
computing systems. A comprehensive reliability analysis
is performed, which confirms $ \approx $90mV and $
\approx $10mV (worst-case) sense margin for memory and
in-memory logic operation in variations on
resistance-area product and tunnel magnetoresistance.
We further show that sense margin for in-memory logic
computation can be significantly increased by
increasing the oxide thickness. Furthermore, we employ
bulk bitwise vector operation and data encryption
engine as case studies to investigate the performance
of our proposed design. IMFlexCom shows $ \approx 35
\times $ energy saving and $ \approx 18 \times $
speedup for bulk bitwise in-memory vector AND/OR
operation compared to DRAM-based in-memory logic.
Again, IMFlexCom can achieve 77.27\% and 85.4\% lower
energy consumption compared to CMOS-ASIC- and
CMOL-based Advanced Encryption Standard (AES)
implementations, respectively. It offers almost similar
energy consumption as recent DW-AES implementation with
66.7\% less area overhead.",
acknowledgement = ack-nhfb,
articleno = "35",
fjournal = "ACM Journal on Emerging Technologies in Computing
Systems (JETC)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J967",
}
@Article{Patel:2018:LLA,
author = "Hasmukh Patel and Devesh C. Jinwala",
title = "{LPM}: A lightweight authenticated packet marking
approach for {IP} traceback",
journal = j-COMP-NET-AMSTERDAM,
volume = "140",
number = "??",
pages = "41--50",
day = "20",
month = jul,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2018.04.014",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Thu May 31 13:40:46 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128618301786",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Peris-Lopez:2018:EAC,
author = "Pedro Peris-Lopez and Lorena Gonz{\'a}lez-Manzano and
Carmen Camara and Jos{\'e} Mar{\'\i}a de Fuentes",
title = "Effect of attacker characterization in {ECG}-based
continuous authentication mechanisms for {Internet of
Things}",
journal = j-FUT-GEN-COMP-SYS,
volume = "81",
number = "??",
pages = "67--77",
month = apr,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Dec 26 08:55:44 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17300407",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Phuong:2018:CBE,
author = "Tran Viet Xuan Phuong and Guomin Yang and Willy
Susilo",
title = "Criteria-Based Encryption",
journal = j-COMP-J,
volume = "61",
number = "4",
pages = "512--525",
day = "1",
month = apr,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxx088",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:19 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/4/512/4430306",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Pizzi:2018:ETM,
author = "Sara Pizzi and Chiara Suraci and Leonardo Militano and
Antonino Orsino and Antonella Molinaro and Antonio Iera
and Giuseppe Araniti",
title = "Enabling Trustworthy Multicast Wireless Services
through {D2D} Communications in {5G} Networks",
journal = j-FUTURE-INTERNET,
volume = "10",
number = "7",
pages = "66",
day = "11",
month = jul,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi10070066",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:01 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/10/7/66",
abstract = "Device-to-device (D2D) communication is considered as
one of the key enabling technologies for
fifth-generation (5G) networks as it allows data
offloading generated by the huge number of connected
devices. In this respect, group-oriented services are
among the most interesting usage scenarios. Indeed, D2D
can improve the performance of the conventional
multicast scheme (CMS) in cellular networks, which is
known to suffer from low spectral efficiency. Security
is a further key field of investigation for 5G systems,
as any threat to privacy and security may lead to both
deteriorated user experience and inefficient network
resources' utilization. Security issues are even more
in focus for D2D connections between devices that are
in mutual proximity. To improve the CMS performance and
also sustain security requirements of the 5G network,
this work proposes a secure D2D data transmission
algorithm. Making use of mechanisms such as encryption
and signature, this algorithm aims to protect the
exchanged data and the privacy of the devices involved
in the communication. A simulation campaign conducted
using MATLAB shows the ability of the proposed solution
to take advantage of the establishment of secure D2D
communications and efficiently utilize network
resources.",
acknowledgement = ack-nhfb,
}
@Article{Pournaghi:2018:NNE,
author = "Seyed Morteza Pournaghi and Behnam Zahednejad and
Majid Bayat and Yaghoub Farjami",
title = "{NECPPA}: A novel and efficient conditional
privacy-preserving authentication scheme for {VANET}",
journal = j-COMP-NET-AMSTERDAM,
volume = "134",
number = "??",
pages = "78--92",
day = "7",
month = apr,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2018.01.015",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Mar 17 13:11:52 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128618300227",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Pramila:2018:ICA,
author = "Anu Pramila and Anja Keskinarkaus and Tapio
Sepp{\"a}nen",
title = "Increasing the capturing angle in print-cam robust
watermarking",
journal = j-J-SYST-SOFTW,
volume = "135",
number = "??",
pages = "205--215",
month = jan,
year = "2018",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Nov 13 10:11:01 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121217302522",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Qiao:2018:CTC,
author = "Huidong Qiao and Jiangchun Ren and Zhiying Wang and
Haihe Ba and Huaizhe Zhou",
title = "Compulsory traceable ciphertext-policy attribute-based
encryption against privilege abuse in fog computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "88",
number = "??",
pages = "107--116",
month = nov,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2018.05.032",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Sep 18 14:07:58 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17328820",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Qin:2018:BRO,
author = "Baodong Qin and Qinglan Zhao and Dong Zheng",
title = "Bounded Revocable and Outsourceable {ABE} for Secure
Data Sharing",
journal = j-COMP-J,
volume = "61",
number = "8",
pages = "1259--1268",
day = "1",
month = aug,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy063",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:57 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/8/1259/5045945",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "ABE (attribute-based encryption)",
}
@Article{Qin:2018:NUW,
author = "C. Qin and P. Ji and C. Chang and J. Dong and X. Sun",
title = "Non-uniform Watermark Sharing Based on Optimal
Iterative {BTC} for Image Tampering Recovery",
journal = j-IEEE-MULTIMEDIA,
volume = "25",
number = "3",
pages = "36--48",
month = jul # "\slash " # sep,
year = "2018",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2018.112142509",
ISSN = "1070-986x (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Fri Aug 2 10:38:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
journal-URL = "http://www.computer.org/multimedia/",
keywords = "Authentication; content recovery; image coding; Image
coding; Image reconstruction; image self-embedding
scheme; image tampering recovery; image watermarking;
iterative BTC; Iterative decoding; Multimedia
communication; non-uniform sharing; nonuniform
watermark sharing; optimal iterative block truncation
coding; Self-embedding; self-embedding watermarking;
tampering detection; Visualization; Watermarking",
}
@Article{Qiu:2018:QDS,
author = "Lirong Qiu and Feng Cai and Guixian Xu",
title = "Quantum digital signature for the access control of
sensitive data in the big data era",
journal = j-FUT-GEN-COMP-SYS,
volume = "86",
number = "??",
pages = "372--379",
month = sep,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Jun 20 10:38:06 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X18301250",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Quaglia:2018:SVA,
author = "Elizabeth A. Quaglia and Ben Smyth",
title = "Secret, verifiable auctions from elections",
journal = j-THEOR-COMP-SCI,
volume = "730",
number = "??",
pages = "44--92",
day = "19",
month = jun,
year = "2018",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2018.03.022",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat May 12 14:56:37 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S030439751830183X",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{R:2018:SDM,
author = "Jithin R and Priya Chandran",
title = "Secure and Dynamic Memory Management Architecture for
Virtualization Technologies in {IoT} Devices",
journal = j-FUTURE-INTERNET,
volume = "10",
number = "12",
pages = "119",
day = "30",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi10120119",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:03 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
URL = "https://www.mdpi.com/1999-5903/10/12/119",
abstract = "The introduction of the internet in embedded devices
led to a new era of technology --- the Internet of
Things (IoT) era. The IoT technology-enabled device
market is growing faster by the day, due to its
complete acceptance in diverse areas such as domicile
systems, the automobile industry, and beyond. The
introduction of internet connectivity in objects that
are frequently used in daily life raises the question
of security --- how secure is the information and the
infrastructure handled by these devices when they are
connected to the internet? Security enhancements
through standard cryptographic techniques are not
suitable due to the power and performance constraints
of IoT devices. The introduction of virtualization
technology into IoT devices is a recent development,
meant for fulfilling security and performance needs.
However, virtualization augments the vulnerability
present in IoT devices, due to the addition of one more
software layer --- namely, the hypervisor, which
enables the sharing of resources among different users.
This article proposes the adaptation of ASMI
(Architectural Support for Memory Isolation --- a
general architecture available in the literature for
the improvement of the performance and security of
virtualization technology) on the popular MIPS
(Microprocessor without Interlocked Pipeline Stages)
embedded virtualization platform, which could be
adopted in embedded virtualization architectures for
IoT devices. The article illustrates the performance
enhancement achieved by the proposed architecture with
the existing architectures.",
acknowledgement = ack-nhfb,
remark = "Special Issue IoT Security and Privacy.",
}
@Article{Raisaro:2018:PPS,
author = "Jean Louis Raisaro and Gwangbae Choi and Sylvain
Pradervand and Raphael Colsenet and Nathalie Jacquemont
and Nicolas Rosat and Vincent Mooser and Jean-Pierre
Hubaux",
title = "Protecting Privacy and Security of Genomic Data in
i2b2 with Homomorphic Encryption and Differential
Privacy",
journal = j-TCBB,
volume = "15",
number = "5",
pages = "1413--1426",
month = sep,
year = "2018",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2018.2854782",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Thu Nov 8 06:18:46 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "Re-use of patients' health records can provide
tremendous benefits for clinical research. Yet, when
researchers need to access sensitive/identifying data,
such as genomic data, in order to compile cohorts of
well-characterized patients for specific studies,
privacy and security concerns represent major obstacles
that make such a procedure extremely difficult if not
impossible. In this paper, we address the challenge of
designing and deploying in a real operational setting
an efficient privacy-preserving explorer for genetic
cohorts. Our solution is built on top of the i2b2
Informatics for Integrating Biology and the Bedside
framework and leverages cutting-edge privacy-enhancing
technologies such as homomorphic encryption and
differential privacy. Solutions involving homomorphic
encryption are often believed to be costly and immature
for use in operational environments. Here, we show
that, for specific applications, homomorphic encryption
is actually a very efficient enabler. Indeed, our
solution outperforms prior work by enabling a
researcher to securely compute simple statistics on
more than 3,000 encrypted genetic variants
simultaneously for a cohort of 5,000 individuals in
less than 5 seconds with commodity hardware. To the
best of our knowledge, our privacy-preserving solution
is the first to also be successfully deployed and
tested in a operation setting Lausanne University
Hospital.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@Article{Rakshit:2018:LLO,
author = "Joydeep Rakshit and Kartik Mohanram",
title = "{LEO}: Low Overhead Encryption {ORAM} for Non-Volatile
Memories",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "17",
number = "2",
pages = "100--104",
month = jul # "\slash " # dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2018.2795621",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Data confidentiality attacks utilizing memory access
patterns threaten exposure of data in modern main
memories. Oblivious RAM (ORAM) is an effective
cryptographic primitive developed to thwart
access-pattern-based attacks in DRAM-based systems.
However, in emerging non-volatile memory (NVM) systems,
the increased writes due to encryption of multiple data
blocks on every Path ORAM (state-of-the-art efficient
ORAM) access impose significant energy, lifetime, and
performance overheads. LEO (Low overhead Encryption
ORAM) is an efficient Path ORAM encryption architecture
that addresses the high write overheads of ORAM
integration in NVMs, while providing security
equivalent to the baseline Path ORAM. LEO reduces NVM
cell writes by securely decreasing the number of block
encryptions during the write phase of a Path ORAM
access. LEO uses a secure, two-level counter mode
encryption framework that opportunistically eliminates
re-encryption of unmodified blocks, reducing NVM
writes. Our evaluations show that on average, LEO
decreases NVM energy by 60 percent, improves lifetime
by 1.51 x, and increases performance by 9 percent over
the baseline Path ORAM.",
acknowledgement = ack-nhfb,
affiliation = "Rakshit, J (Reprint Author), Univ Pittsburgh, Dept
Elect \& Comp Engn, Pittsburgh, PA 15260 USA. Rakshit,
Joydeep; Mohanram, Kartik, Univ Pittsburgh, Dept Elect
\& Comp Engn, Pittsburgh, PA 15260 USA.",
author-email = "joydeep.rakshit@pitt.edu kmram@pitt.edu",
da = "2019-06-20",
doc-delivery-number = "GP4TI",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "memory security; non-volatile memory; Oblivious RAM",
number-of-cited-references = "21",
ORCID-numbers = "Rakshit, Joydeep/0000-0002-3670-4814",
research-areas = "Computer Science",
times-cited = "0",
unique-id = "Rakshit:2018:LLO",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Reaves:2018:CSS,
author = "Bradley Reaves and Luis Vargas and Nolen Scaife and
Dave Tian and Logan Blue and Patrick Traynor and Kevin
R. B. Butler",
title = "Characterizing the Security of the {SMS} Ecosystem
with Public Gateways",
journal = j-TOPS,
volume = "22",
number = "1",
pages = "2:1--2:??",
month = jan,
year = "2018",
DOI = "https://doi.org/10.1145/3268932",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
bibdate = "Sat Sep 21 08:26:24 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
URL = "https://dl.acm.org/citation.cfm?id=3268932",
abstract = "Recent years have seen the Short Message Service (SMS)
become a critical component of the security
infrastructure, assisting with tasks including identity
verification and second-factor authentication. At the
same time, this messaging infrastructure has become
dramatically more open and connected to public networks
than ever before. However, the implications of this
openness, the security practices of benign services,
and the malicious misuse of this ecosystem are not well
understood. In this article, we provide a comprehensive
longitudinal study to answer these questions, analyzing
over 900,000 text messages sent to public online SMS
gateways over the course of 28 months. From this data,
we uncover the geographical distribution of spam
messages, study SMS as a transmission medium of
malicious content, and find that changes in benign and
malicious behaviors in the SMS ecosystem have been
minimal during our collection period. The key takeaways
of this research show many services sending sensitive
security-based messages through an unencrypted medium,
implementing low entropy solutions for one-use codes,
and behaviors indicating that public gateways are
primarily used for evading account creation policies
that require verified phone numbers. This latter
finding has significant implications for combating
phone-verified account fraud and demonstrates that such
evasion will continue to be difficult to detect and
prevent.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Ren:2018:IAS,
author = "Shuai Ren and Yan Shi and Maolin Cai and Weiqing Xu",
title = "Influence of Airway Secretion on Airflow Dynamics of
Mechanical Ventilated Respiratory System",
journal = j-TCBB,
volume = "15",
number = "5",
pages = "1660--1668",
month = sep,
year = "2018",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2017.2737621",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Thu Nov 8 06:18:46 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "Secretions in the airways of mechanical ventilated
patients are extremely dangerous to patients' health.
In recent studies, the continuous constant airflow is
adopted, however, it is not consistent with a clinical
situation. To study respiratory airflow dynamic
characteristics with secretion in the airways, a
mathematical model based on clinical mechanical
ventilation is established in this paper. To illustrate
the secretion's influence on the airflow dynamics of
mechanical ventilated respiratory system, three key
parameters which are cross section area ratio of
secretion/ pipe, air-secretion contact area, and
secretion viscosity are involved in the study. Through
the experimental study, the accuracy and dependability
of the model are confirmed. By the simulation study, we
find that: based on the model which combines two
airways and two model lungs, when one of the airways
was covered with secretion, the maximum pressure of the
model lung which is attached to the end of this airway
maintains constant when the cross section area ratio is
less than 66 percent, and then it tends to decline
sharply with the ratio increasing, but it remains
constant with the augment of air-secretion contact
area, the maximum flow declines both with the
increasing of cross section area ratio and
air-secretion contact area. Furthermore, as for the
other airway, the maximum pressure of the model lung
has no significant changes with the augment of area
ratio and air-secretion contact area, however, along
with the increasing of area ratio and air-secretion
contact area, the maximum flow rises up. Moreover, the
secretion viscosity has barely any influence on airflow
dynamics. According to our analysis results, we
conclude that the cross section area ratio of
secretion/pipe has bigger influence on airflow dynamic
characteristics than air-secretion contact area and
secretion viscosity. This paper lays the foundation for
the further study of efficacy and safety in mechanical
ventilation and the secretion clearance of mechanical
ventilated patients. In addition, the mathematical
model proposed in this paper can also be referred to
study on the secretion movement in human airways.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@Article{Rexha:2018:ITF,
author = "Blerim Rexha and Gresa Shala and Valon Xhafa",
title = "Increasing Trustworthiness of Face Authentication in
Mobile Devices by Modeling Gesture Behavior and
Location Using Neural Networks",
journal = j-FUTURE-INTERNET,
volume = "10",
number = "2",
pages = "17",
day = "05",
month = feb,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi10020017",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/10/2/17",
abstract = "Personal mobile devices currently have access to a
significant portion of their user's private sensitive
data and are increasingly used for processing mobile
payments. Consequently, securing access to these mobile
devices is a requirement for securing access to the
sensitive data and potentially costly services. Face
authentication is one of the promising biometrics-based
user authentication mechanisms that has been widely
available in this era of mobile computing. With a
built-in camera capability on smartphones, tablets, and
laptops, face authentication provides an attractive
alternative of legacy passwords for its memory-less
authentication process, which is so sophisticated that
it can unlock the device faster than a fingerprint.
Nevertheless, face authentication in the context of
smartphones has proven to be vulnerable to attacks. In
most current implementations, a sufficiently
high-resolution face image displayed on another mobile
device will be enough to circumvent security measures
and bypass the authentication process. In order to
prevent such bypass attacks, gesture recognition
together with location is proposed to be additionally
modeled. Gestures provide a faster and more convenient
method of authentication compared to a complex
password. The focus of this paper is to build a secure
authentication system with face, location and gesture
recognition as components. User gestures and location
data are a sequence of time series; therefore, in this
paper we propose to use unsupervised learning in the
long short-term memory recurrent neural network to
actively learn to recognize, group and discriminate
user gestures and location. Moreover, a
clustering-based technique is also implemented for
recognizing gestures and location.",
acknowledgement = ack-nhfb,
}
@InProceedings{Reyhani-Masoleh:2018:NAR,
author = "Arash Reyhani-Masoleh and Mostafa Taha and Doaa
Ashmawy",
title = "New Area Record for the {AES} Combined {S}-Box\slash
Inverse {S}-Box",
crossref = "Tenca:2018:PIS",
pages = "145--152",
year = "2018",
DOI = "https://doi.org/10.1109/ARITH.2018.8464780",
bibdate = "Fri Jan 31 08:05:31 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "The AES combined S-box/inverse S-box is a single
construction that is shared between the encryption and
decryption data paths of the AES. The currently most
compact implementation of the AES combined
S-box/inverse S-box is Canright's design, introduced
back in 2005. Since then, the research community has
introduced several optimizations over the S-box only,
however the combined S-boxlinverse S-box received
little attention. In this paper, we propose a new AES
combined S-boxlinverse S-box design that is both
smaller and faster than Canright's design. We achieve
this goal by proposing to use new tower field and
optimizing each and every block inside the combined
architecture for this field. Our complexity analysis
and ASIC implementation results in the CMOS STM 65nm
and NanGate 15nm technologies show that our design
outperforms the counterparts in terms of area and
speed.",
acknowledgement = ack-nhfb,
keywords = "AES combined S-box-inverse S-box; application specific
integrated circuits; ARITH-25; Canright design; circuit
optimisation; CMOS STM; Complexity theory; Computer
architecture; cryptography; decryption data paths;
Encryption; encryption data paths; Generators; Logic
gates; Multiplexing; NanGate; Poles and towers; size
15.0 nm; size 65.0 nm",
}
@Article{Roetteler:2018:QCC,
author = "M. Roetteler and K. M. Svore",
title = "Quantum Computing: Codebreaking and Beyond",
journal = j-IEEE-SEC-PRIV,
volume = "16",
number = "5",
pages = "22--36",
month = sep # "\slash " # oct,
year = "2018",
DOI = "https://doi.org/10.1109/MSP.2018.3761710",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "AES; Computational modeling; Computer security;
cryptographic applications; cryptographic protocols;
Cryptography; cryptography; Logic gates; postquantum
cryptography; quantum algorithms; quantum computer;
quantum computing; Quantum computing; quantum
cryptanalysis; quantum cryptography; quantum mechanical
systems; quantum programming; quantum security
parameters; quantum simulation; quantum theory; RSA;
security; SHA; Training",
}
@Article{Rouhani:2018:RRT,
author = "Bita Darvish Rouhani and Siam Umar Hussain and Kristin
Lauter and Farinaz Koushanfar",
title = "{ReDCrypt}: Real-Time Privacy-Preserving Deep Learning
Inference in Clouds Using {FPGAs}",
journal = j-TRETS,
volume = "11",
number = "3",
pages = "21:1--21:??",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3242899",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Sat Oct 19 17:43:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
abstract = "Artificial Intelligence (AI) is increasingly
incorporated into the cloud business in order to
improve the functionality (e.g., accuracy) of the
service. The adoption of AI as a cloud service raises
serious privacy concerns in applications where the risk
of data leakage is not acceptable. Examples of such
applications include scenarios where clients hold
potentially sensitive private information such as
medical records, financial data, and/or location. This
article proposes ReDCrypt, the first reconfigurable
hardware-accelerated framework that empowers
privacy-preserving inference of deep learning models in
cloud servers. ReDCrypt is well-suited for streaming
(a.k.a., real-time AI) settings where clients need to
dynamically analyze their data as it is collected over
time without having to queue the samples to meet a
certain batch size. Unlike prior work, ReDCrypt neither
requires to change how AI models are trained nor relies
on two non-colluding servers to perform. The
privacy-preserving computation in ReDCrypt is executed
using Yao's Garbled Circuit (GC) protocol. We break
down the deep learning inference task into two phases:
(i) privacy-insensitive (local) computation, and (ii)
privacy-sensitive (interactive) computation. We devise
a high-throughput and power-efficient implementation of
GC protocol on FPGA for the privacy-sensitive phase.
ReDCrypt's accompanying API provides support for
seamless integration of ReDCrypt into any deep learning
framework. Proof-of-concept evaluations for different
DL applications demonstrate up to 57-fold higher
throughput per core compared to the best prior solution
with no drop in the accuracy.",
acknowledgement = ack-nhfb,
articleno = "21",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
}
@Article{Roy:2018:HFB,
author = "Sujoy Sinha Roy and Kimmo J{\"a}rvinen and Jo Vliegen
and Frederik Vercauteren and Ingrid Verbauwhede",
title = "{HEPCloud}: An {FPGA}-Based Multicore Processor for
{FV} Somewhat Homomorphic Function Evaluation",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "11",
pages = "1637--1650",
month = nov,
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2816640",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Mar 15 08:10:14 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8318681/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Roy:2018:HIR,
author = "Aniket Roy and Arpan Kumar Maiti and Kuntal Ghosh",
title = "An {HVS} Inspired Robust Non-blind Watermarking Scheme
in {YCbCr} Color Space",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "18",
number = "3",
pages = "??--??",
month = jul,
year = "2018",
DOI = "https://doi.org/10.1142/S0219467818500158",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Fri Nov 9 06:55:48 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0219467818500158",
abstract = "Digital Watermarking is an important tool for
copyright protection. A good quality watermarking
scheme should provide both perceptual transparency as
well as robustness against attacks. Many efficient
schemes exist for grayscale image watermarking, but
relatively less attention has been paid to watermarking
for color images. Moreover, the existing works do not
provide adequate justification for the possible choice
of color space. In this paper, justification is
provided for the choice of YCbCr color space for
watermark embedding. A human visual system
(HVS)-inspired image-adaptive non-blind watermarking
scheme in the YCbCr space has subsequently been
proposed. This new algorithm has been referred to as
the Additive Embedding Scheme (AES). It comprises of a
modified watermarking strength parameter (
{\textalpha}mean {\textalpha}mean {\textalpha}mean ),
in combination with the discrete wavelet transform and
singular value decomposition (DWT-SVD). Experimental
results demonstrate that the proposed watermarking
scheme in YCbCr color space provides better perceptual
quality as well as robustness against attacks as
compared to existing schemes. We have further
improvised the aforementioned scheme to come up with a
Multiplicative Embedding Scheme (MES) for additional
robustness against a special type of attack, viz. the
Singular Value Exchange Attack.",
acknowledgement = ack-nhfb,
articleno = "1850015",
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{S:2018:EDS,
author = "Prabu S and Gpinath Ganapathy and Ranjan Goyal",
title = "Enhanced Data Security for Public Cloud Environment
with Secured Hybrid Encryption Authentication
Mechanisms",
journal = j-SCPE,
volume = "19",
number = "4",
pages = "351--360",
month = "????",
year = "2018",
CODEN = "????",
ISSN = "1895-1767",
ISSN-L = "1895-1767",
bibdate = "Mon Jan 7 06:46:51 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/scpe.bib",
URL = "https://www.scpe.org/index.php/scpe/article/view/1422",
acknowledgement = ack-nhfb,
fjournal = "Scalable Computing: Practice and Experience",
journal-URL = "http://www.scpe.org/",
}
@Article{Saadeh:2018:HAP,
author = "Maha Saadeh and Azzam Sleit and Khair Eddin Sabri and
Wesam Almobaideen",
title = "Hierarchical architecture and protocol for mobile
object authentication in the context of {IoT} smart
cities",
journal = j-J-NETW-COMPUT-APPL,
volume = "121",
number = "??",
pages = "1--19",
day = "1",
month = nov,
year = "2018",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:27 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518302339",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Safkhani:2018:SRO,
author = "Masoumeh Safkhani and Nasour Bagheri and Mahyar
Shariat",
title = "On the Security of Rotation Operation Based
Ultra-Lightweight Authentication Protocols for {RFID}
Systems",
journal = j-FUTURE-INTERNET,
volume = "10",
number = "9",
pages = "82",
day = "21",
month = aug,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi10090082",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:02 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/10/9/82",
abstract = "Passive Radio Frequency IDentification (RFID) tags are
generally highly constrained and cannot support
conventional encryption systems to meet the required
security. Hence, designers of security protocols may
try to achieve the desired security only using limited
ultra-lightweight operations. In this paper, we show
that the security of such protocols is not provided by
using rotation functions. In the following, for an
example, we investigate the security of an RFID
authentication protocol that has been recently
developed using rotation function named ULRAS, which
stands for an Ultra-Lightweight RFID Authentication
Scheme and show its security weaknesses. More
precisely, we show that the ULRAS protocol is
vulnerable against de-synchronization attack. The given
attack has the success probability of almost
\‘1', with the complexity of only one session of
the protocol. In addition, we show that the given
attack can be used as a traceability attack against the
protocol if the parameters' lengths are an integer
power of 2, e.g., 128. Moreover, we propose a new
authentication protocol named UEAP, which stands for an
Ultra-lightweight Encryption based Authentication
Protocol, and then informally and formally, using
Scyther tool, prove that the UEAP protocol is secure
against all known active and passive attacks.",
acknowledgement = ack-nhfb,
remark = "Special Issue New Developments in RFID Technologies
and Applications and Their Integration into IoT.",
}
@Article{Saha:2018:ASS,
author = "Seemanta Saha and Ismet Burak Kadron and William Eiers
and Lucas Bang and Tevfik Bultan",
title = "Attack Synthesis for Strings using Meta-Heuristics",
journal = j-SIGSOFT,
volume = "43",
number = "4",
pages = "56--56",
month = oct,
year = "2018",
CODEN = "SFENDP",
DOI = "https://doi.org/10.1145/3282517.3282527",
ISSN = "0163-5948 (print), 1943-5843 (electronic)",
ISSN-L = "0163-5948",
bibdate = "Sat Oct 19 18:11:10 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsoft2010.bib",
abstract = "Information leaks are a significant problem in modern
computer systems and string manipulation is prevalent
in modern software. We present techniques for automated
synthesis of side-channel attacks that recover secret
string values based on timing observations on string
manipulating code. Our attack synthesis techniques
iteratively generate inputs which, when fed to code
that accesses the secret, reveal partial information
about the secret based on the timing observations,
leading to recovery of the secret at the end of the
attack sequence. We use symbolic execution to extract
path constraints, automata-based model counting to
estimate the probability of execution paths, and
meta-heuristic methods to maximize information gain
based on entropy for synthesizing adaptive attack
steps.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGSOFT Software Engineering Notes",
journal-URL = "https://dl.acm.org/citation.cfm?id=J728",
}
@Article{Salman:2018:BMM,
author = "S. M. Salman and A. A. Elsadany",
title = "On the bifurcation of {Marotto}'s map and its
application in image encryption",
journal = j-J-COMPUT-APPL-MATH,
volume = "328",
number = "??",
pages = "177--196",
day = "15",
month = jan,
year = "2018",
CODEN = "JCAMDI",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Mon Oct 2 12:20:15 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042717303515",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@Article{Sarier:2018:MBI,
author = "Neyire Deniz Sarier",
title = "Multimodal biometric {Identity Based Encryption}",
journal = j-FUT-GEN-COMP-SYS,
volume = "80",
number = "??",
pages = "112--125",
month = mar,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Dec 2 16:58:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17302613",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Sasaki:2018:QKD,
author = "M. Sasaki",
title = "Quantum Key Distribution and Its Applications",
journal = j-IEEE-SEC-PRIV,
volume = "16",
number = "5",
pages = "42--48",
month = sep # "\slash " # oct,
year = "2018",
DOI = "https://doi.org/10.1109/MSP.2018.3761713",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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; continental-scale QKD networks;
Encryption; one-time pad; postquantum cryptography;
Protocols; QKD; Quantum computing; quantum
cryptography; quantum key distribution; secret key;
Servers; telecommunication security; unlimited
computational ability",
}
@Article{Schneier:2018:CAA,
author = "B. Schneier",
title = "Cryptography after the Aliens Land",
journal = j-IEEE-SEC-PRIV,
volume = "16",
number = "5",
pages = "86--88",
month = sep # "\slash " # oct,
year = "2018",
DOI = "https://doi.org/10.1109/MSP.2018.3761724",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "cryptography; postquantum; quantum cryptography;
security",
}
@Article{Scriber:2018:FDB,
author = "B. A. Scriber",
title = "A Framework for Determining Blockchain Applicability",
journal = j-IEEE-SOFTWARE,
volume = "35",
number = "4",
pages = "70--77",
month = jul # "\slash " # aug,
year = "2018",
CODEN = "IESOEG",
DOI = "https://doi.org/10.1109/MS.2018.2801552",
ISSN = "0740-7459 (print), 1937-4194 (electronic)",
ISSN-L = "0740-7459",
bibdate = "Fri Aug 2 09:25:48 2019",
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/ieeesoft.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Software",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/software",
keywords = "architectural alignment; Blockchain; blockchain
technology; blockchains; Computer architecture;
Cryptography; design decisions; distributed ledgers;
Ecosystems; efficiency; identity; immutability;
investment; optimal technology; optimisation; patterns;
software architecture; software architectures; software
development; software engineering; transaction;
transparency; trust; trust-based problems",
}
@Article{Seo:2018:AOF,
author = "Jae Hong Seo and Keita Emura and Keita Xagawa and
Kazuki Yoneyama",
title = "Accumulable optimistic fair exchange from verifiably
encrypted homomorphic signatures",
journal = j-INT-J-INFO-SEC,
volume = "17",
number = "2",
pages = "193--220",
month = apr,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-017-0367-z",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Sat Mar 3 09:41:24 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib",
URL = "http://link.springer.com/article/10.1007/s10207-017-0367-z",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
}
@Article{Seo:2018:CIA,
author = "Hwajeong Seo and Ilwoong Jeong and Jungkeun Lee and
Woo-Hwan Kim",
title = "Compact Implementations of {ARX}-Based Block Ciphers
on {IoT} Processors",
journal = j-TECS,
volume = "17",
number = "3",
pages = "60:1--60:??",
month = jun,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3173455",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:35 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "In this article, we present implementations for
Addition, Rotation, and eXclusive-or (ARX)-based block
ciphers, including LEA and HIGHT, on IoT devices,
including 8-bit AVR, 16-bit MSP, 32-bit ARM, and 32-bit
ARM-NEON processors. We optimized 32-/8-bitwise ARX
operations for LEA and HIGHT block ciphers by
considering variations in word size, the number of
general purpose registers, and the instruction set of
the target IoT devices. Finally, we achieved the most
compact implementations of LEA and HIGHT block ciphers.
The implementations were fairly evaluated through the
Fair Evaluation of Lightweight Cryptographic Systems
framework, and implementations won the competitions in
the first and the second rounds.",
acknowledgement = ack-nhfb,
articleno = "60",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Seo:2018:CSI,
author = "Hwajeong Seo",
title = "Compact Software Implementation of Public-Key
Cryptography on {MSP430X}",
journal = j-TECS,
volume = "17",
number = "3",
pages = "66:1--66:??",
month = jun,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3190855",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:35 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "On the low-end embedded processors, the
implementations of Elliptic Curve Cryptography (ECC)
are considered to be a challenging task due to the
limited computation power and storage of the low-end
embedded processors. Particularly, the multi-precision
multiplication and squaring operations are the most
expensive operations for ECC implementations. In order
to enhance the performance, many works presented
efficient multiplication and squaring routines on the
target devices. Recent works show that 128-bit security
level ECC is available within a second and this is
practically fast enough for IoT services. However,
previous approaches missed the other important storage
issues (i.e., program size, ROM). Considering that the
embedded processors only have a few KB ROM, we need to
pay attention to the compact ROM size with reasonable
performance. In this article, we present very compact
and generic implementations of multiplication and
squaring operations on the 16-bit MSP430X processors
for the ECC. The implementations utilize the new 32-bit
multiplier and advanced multiplication and squaring
routines. Since the proposed routines are generic, the
arbitrary length of operand is available with
high-speed and small code size. With proposed
multiplication and squaring routines, we implemented
Curve25519 on the MSP430X processors. The scalar
multiplication is performed within 6,666,895 clock
cycles and 4,054 bytes. Compared with previous works
based on the speed-optimized version, our
memory-efficient version reduces the code size by
59.8\%, sacrificing the execution timing by 20.5\%.",
acknowledgement = ack-nhfb,
articleno = "66",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Sepczuk:2018:NRB,
author = "Mariusz Sepczuk and Zbigniew Kotulski",
title = "A new risk-based authentication management model
oriented on user's experience",
journal = j-COMPUT-SECUR,
volume = "73",
number = "??",
pages = "17--33",
month = mar,
year = "2018",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:53 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404817302079",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Sharma:2018:CSS,
author = "Himani Sharma and D. C. Mishra and R. K. Sharma and
Naveen Kumar",
title = "Crypto-stego System for Securing Text and Image Data",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "18",
number = "4",
pages = "??--??",
month = oct,
year = "2018",
DOI = "https://doi.org/10.1142/S0219467818500201",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Fri Nov 9 06:55:50 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0219467818500201",
abstract = "Conventional techniques for security of data, designed
by using only one of the security mechanisms,
cryptography or steganography, are suitable for limited
applications only. In this paper, we propose a
crypto-stego system that would be appropriate for
secure transmission of different forms of data. In the
proposed crypto-stego system, we present a mechanism to
provide secure transmission of data by multiple safety
measures, firstly by applying encryption using Affine
Transform and Discrete Cosine Transform (DCT) and then
merging this encrypted data with an image, randomly
chosen from a set of available images, and sending the
image so obtained to the receiver at the other end
through the network. The data to be sent over a
communication channel may be a gray-scale or colored
image, or a text document (doc, .txt, or .pdf file). As
it is encrypted and sent hidden in an image, it avoids
any attention to itself by the observers in the
network. At the receiver's side, reverse
transformations are applied to obtain the original
information. The experimental results, security
analysis and statistical analysis for gray-scale
images, RGB images, text documents (.doc, .txt, .pdf
files), show robustness and appropriateness of the
proposed crypto-stego system for secure transmission of
the data through unsecured network. The security
analysis and key space analysis demonstrate that the
proposed technique is immune from cryptanalysis.",
acknowledgement = ack-nhfb,
articleno = "1850020",
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Shen:2018:CAL,
author = "Jian Shen and Ziyuan Gui and Sai Ji and Jun Shen and
Haowen Tan and Yi Tang",
title = "Cloud-aided lightweight certificateless authentication
protocol with anonymity for wireless body area
networks",
journal = j-J-NETW-COMPUT-APPL,
volume = "106",
number = "??",
pages = "117--123",
day = "15",
month = mar,
year = "2018",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2018.01.003",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sat Mar 3 15:22:11 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518300031",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Shwartz:2018:DMI,
author = "Ofir Shwartz and Yitzhak Birk",
title = "Distributed Memory Integrity Trees",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "17",
number = "2",
pages = "159--162",
month = jul # "\slash " # dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2018.2822705",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Ensuring the correct execution of a program running on
untrusted computing platforms, wherein the OS,
hypervisor, and all off-CPU-chip hardware, including
memory, are untrusted, (also) requires protecting the
integrity of the memory content against replay attacks.
This requires dedicated tracking structures and in-chip
state storage. For this purpose, integrity trees are
used in various forms, varying in complexity, size, and
performance; yet, existing integrity trees do not
address distributed, shared-memory computations, for
which one must also ensure the integrity of the
coherence state of the memory. Observing that a block
not residing at a given node merely needs to be known
by that node as such, we present the novel Distributed
Integrity Tree (DIT) method, and show that it can be
used effectively to extend existing integrity trees to
parallel and distributed environments. Using DIT, we
constructed a Distributed Merkle Tree, a Distributed
Bonsai Merkle Tree, and a distributed Intel SGX's
Memory Encryption Engine integrity mechanism. All these
extensions entail negligible overhead.",
acknowledgement = ack-nhfb,
affiliation = "Shwartz, O (Reprint Author), Technion, Elect Engn
Dept, IL-3200003 Haifa, Israel. Shwartz, Ofir; Birk,
Yitzhak, Technion, Elect Engn Dept, IL-3200003 Haifa,
Israel.",
author-email = "ofirshw@tx.technion.ac.il birk@ee.technion.ac.il",
da = "2019-06-20",
doc-delivery-number = "GP4TI",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "Hasso Plattner Institute",
funding-text = "This work was supported in part by the Hasso Plattner
Institute.",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "computer security; Distributed computing; integrity
tree; shared memory",
keywords-plus = "PERFORMANCE",
number-of-cited-references = "11",
research-areas = "Computer Science",
times-cited = "0",
unique-id = "Shwartz:2018:DMI",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Silva-Garcia:2018:SBG,
author = "V. M. Silva-Garc{\'\i}a and R. Flores-Carapia and C.
Renter{\'\i}a-M{\'a}rquez and B. Luna-Benoso and M.
Aldape-P{\'e}rez",
title = "Substitution box generation using {Chaos}: An image
encryption application",
journal = j-APPL-MATH-COMP,
volume = "332",
number = "??",
pages = "123--135",
day = "1",
month = sep,
year = "2018",
CODEN = "AMHCBQ",
DOI = "https://doi.org/10.1016/j.amc.2018.03.019",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Apr 23 08:50:53 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2015.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S009630031830184X",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Singh:2018:MWT,
author = "Amit Kumar Singh and Basant Kumar and Sanjay Kumar
Singh and S. P. Ghrera and Anand Mohan",
title = "Multiple watermarking technique for securing online
social network contents using Back Propagation Neural
Network",
journal = j-FUT-GEN-COMP-SYS,
volume = "86",
number = "??",
pages = "926--939",
month = sep,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Jun 20 10:38:06 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X16306628",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Singh:2018:SDD,
author = "Priyanka Singh and Nishant Agarwal and Balasubramanian
Raman",
title = "Secure data deduplication using secret sharing schemes
over cloud",
journal = j-FUT-GEN-COMP-SYS,
volume = "88",
number = "??",
pages = "156--167",
month = nov,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2018.04.097",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Sep 18 14:07:58 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17327474",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Sluganovic:2018:ARE,
author = "Ivo Sluganovic and Marc Roeschlin and Kasper B.
Rasmussen and Ivan Martinovic",
title = "Analysis of Reflexive Eye Movements for Fast
Replay-Resistant Biometric Authentication",
journal = j-TOPS,
volume = "22",
number = "1",
pages = "4:1--4:??",
month = jan,
year = "2018",
DOI = "https://doi.org/10.1145/3281745",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
bibdate = "Sat Sep 21 08:26:24 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
URL = "https://dl.acm.org/citation.cfm?id=3281745",
abstract = "Eye tracking devices have recently become increasingly
popular as an interface between people and
consumer-grade electronic devices. Due to the fact that
human eyes are fast, responsive, and carry information
unique to an individual, analyzing person's gaze is
particularly attractive for rapid biometric
authentication. Unfortunately, previous proposals for
gaze-based authentication systems either suffer from
high error rates or requires long authentication times.
We build on the fact that some eye movements can be
reflexively and predictably triggered and develop an
interactive visual stimulus for elicitation of
reflexive eye movements that support the extraction of
reliable biometric features in a matter of seconds,
without requiring any memorization or cognitive effort
on the part of the user. As an important benefit, our
stimulus can be made unique for every authentication
attempt and thus incorporated in a challenge-response
biometric authentication system. This allows us to
prevent replay attacks, which are possibly the most
applicable attack vectors against biometric
authentication. Using a gaze tracking device, we build
a prototype of our system and perform a series of
systematic user experiments with 30 participants from
the general public. We thoroughly analyze various
system parameters and evaluate the performance and
security guarantees under several different attack
scenarios. The results show that our system matches or
surpasses existing gaze-based authentication methods in
achieved equal error rates (6.3\%) while achieving
significantly lower authentication times (5s).",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Son:2018:GFD,
author = "Yunmok Son and Juhwan Noh and Jaeyeong Choi and
Yongdae Kim",
title = "{GyrosFinger}: Fingerprinting Drones for Location
Tracking Based on the Outputs of {MEMS} Gyroscopes",
journal = j-TOPS,
volume = "21",
number = "2",
pages = "10:1--10:??",
month = feb,
year = "2018",
DOI = "https://doi.org/10.1145/3177751",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
bibdate = "Sat Sep 21 08:26:23 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
URL = "https://dl.acm.org/citation.cfm?id=3177751",
abstract = "Drones are widely used for various purposes such as
delivery, aerial photography, and surveillance.
Considering the increasing drone-related services,
tracking the locations of drones can cause security
threats such as escaping from drone surveillance,
disturbing drone-related services, and capturing
drones. For wirelessly monitoring the status of drones,
telemetry is used, and this status information contains
various data such as latitude and longitude, calibrated
sensor outputs, and sensor offsets. Because most of the
telemetry implementation supports neither
authentication nor encryption, an attacker can obtain
the status information of the drones by using an
appropriate wireless communication device such as
software-defined radio. While the attacker knows the
locations of the drones from the status information,
this information is not sufficient for tracking drones
because the status information does not include any
identity information that can bind the identity of the
drone with its location. \In this article, we propose a
fingerprinting method for drones in motion for the
binding of the identity of the drone with its location.
Our fingerprinting method is based on the sensor
outputs included in the status information, i.e., the
offsets of micro-electro mechanical systems (MEMS)
gyroscope, an essential sensor for maintaining the
attitude of drones. We found that the offsets of MEMS
gyroscopes are different from each other because of
manufacturing mismatches, and the offsets of five
drones obtained through their telemetry are
distinguishable and constant during their flights. To
evaluate the performance of our fingerprinting method
on a larger scale, we collected the offsets from 70
stand-alone MEMS gyroscopes to generate fingerprints.
Our experimental results show that, when using the
offsets of three and two axes calculated from 128
samples of the raw outputs per axis as fingerprints,
the F-scores of the proposed method reach 98.78\% and
94.47\%, respectively. The offsets collected after a
month are also fingerprinted with F-scores of 96.58\%
and 78.45\% under the same condition, respectively. The
proposed fingerprinting method is effective, robust,
and persistent. Additionally, unless the MEMS gyroscope
is not replaced, our fingerprinting method can be used
for drone tracking even when the target drones are
flying.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Stobert:2018:TAL,
author = "E. Stobert and E. Cavar and L. Malisa and D. Sommer",
title = "Teaching Authentication as a Life Skill",
journal = j-IEEE-SEC-PRIV,
volume = "16",
number = "5",
pages = "82--85",
month = sep # "\slash " # oct,
year = "2018",
DOI = "https://doi.org/10.1109/MSP.2018.3761712",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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; authentication; authentication
teaching; computer aided instruction; computer science
education; daily living move; education; educational
courses; educational institutions; Fingerprint
recognition; integral life skill; message
authentication; Password; password security; security;
security curriculum modules; security management tasks;
Swiss high schoolers; Task analysis; teaching",
}
@Article{Streit:2018:PQK,
author = "Silvan Streit and Fabrizio {De Santis}",
title = "Post-Quantum Key Exchange on {ARMv8-A}: a New Hope for
{NEON} Made Simple",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "11",
pages = "1651--1662",
month = nov,
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2017.2773524",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Mar 15 08:10:14 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8107588/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Sun:2018:RPP,
author = "Weiwei Sun and Jiantao Zhou and Shuyuan Zhu and Yuan
Yan Tang",
title = "Robust Privacy-Preserving Image Sharing over Online
Social Networks {(OSNs)}",
journal = j-TOMM,
volume = "14",
number = "1",
pages = "14:1--14:??",
month = jan,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3165265",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Jan 16 18:18:12 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Sharing images online has become extremely easy and
popular due to the ever-increasing adoption of mobile
devices and online social networks (OSNs). The privacy
issues arising from image sharing over OSNs have
received significant attention in recent years. In this
article, we consider the problem of designing a secure,
robust, high-fidelity, storage-efficient image-sharing
scheme over Facebook, a representative OSN that is
widely accessed. To accomplish this goal, we first
conduct an in-depth investigation on the manipulations
that Facebook performs to the uploaded images. Assisted
by such knowledge, we propose a DCT-domain image
encryption/decryption framework that is robust against
these lossy operations. As verified theoretically and
experimentally, superior performance in terms of data
privacy, quality of the reconstructed images, and
storage cost can be achieved.",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Suomalainen:2018:SAS,
author = "Jani Suomalainen and Kimmo Ahola and Mikko Majanen and
Olli M{\"a}mmel{\"a} and Pekka Ruuska",
title = "Security Awareness in Software-Defined Multi-Domain
{5G} Networks",
journal = j-FUTURE-INTERNET,
volume = "10",
number = "3",
pages = "27",
day = "08",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi10030027",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:50:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/10/3/27",
abstract = "Fifth generation (5G) technologies will boost the
capacity and ease the management of mobile networks.
Emerging virtualization and softwarization technologies
enable more flexible customization of network services
and facilitate cooperation between different actors.
However, solutions are needed to enable users,
operators, and service providers to gain an up-to-date
awareness of the security and trustworthiness of 5G
systems. We describe a novel framework and enablers for
security monitoring, inferencing, and trust measuring.
The framework leverages software-defined networking and
big data technologies to customize monitoring for
different applications. We present an approach for
sharing security measurements across administrative
domains. We describe scenarios where the correlation of
multi-domain information improves the accuracy of
security measures with respect to two threats: end-user
location tracking and Internet of things (IoT)
authentication storms. We explore the security
characteristics of data flows in software networks
dedicated to different applications with a mobile
network testbed.",
acknowledgement = ack-nhfb,
}
@Article{Sutar:2018:DPI,
author = "Soubhagya Sutar and Arnab Raha and Devadatta Kulkarni
and Rajeev Shorey and Jeffrey Tew and Vijay
Raghunathan",
title = "{D-PUF}: an Intrinsically Reconfigurable {DRAM PUF}
for Device Authentication and Random Number
Generation",
journal = j-TECS,
volume = "17",
number = "1",
pages = "17:1--17:??",
month = jan,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3105915",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:34 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Physically Unclonable Functions (PUFs) have proved to
be an effective and low-cost measure against
counterfeiting by providing device authentication and
secure key storage services. Memory-based PUF
implementations are an attractive option due to the
ubiquitous nature of memory in electronic devices and
the requirement of minimal (or no) additional
circuitry. Dynamic Random Access Memory-- (DRAM) based
PUFs are particularly advantageous due to their large
address space and multiple controllable parameters
during response generation. However, prior works on
DRAM PUFs use a static response-generation mechanism
making them vulnerable to security attacks. Further,
they result in slow device authentication, are not
applicable to commercial off-the-shelf devices, or
require DRAM power cycling prior to authentication. In
this article, we propose D-PUF, an intrinsically
reconfigurable DRAM PUF based on the idea of DRAM
refresh pausing. A key feature of the proposed DRAM PUF
is reconfigurability, that is, by varying the DRAM
refresh-pause interval, the challenge-response behavior
of the PUF can be altered, making it robust to various
attacks. The article is broadly divided into two parts.
In the first part, we demonstrate the use of D-PUF in
performing device authentication through a secure,
low-overhead methodology. In the second part, we show
the generation of true random numbers using D-PUF. The
design is implemented and validated using an Altera
Stratix IV GX FPGA-based Terasic TR4-230 development
board and several off-the-shelf 1GB DDR3 DRAM modules.
Our experimental results demonstrate a $ 4.3 \times
$--$ 6.4 \times $ reduction in authentication time
compared to prior work. Using controlled temperature
and accelerated aging tests, we also demonstrate the
robustness of our authentication mechanism to
temperature variations and aging effects. Finally, the
ability of the design to generate random numbers is
verified using the NIST Statistical Test Suite.",
acknowledgement = ack-nhfb,
articleno = "17",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Swami:2018:AAS,
author = "Shivam Swami and Kartik Mohanram",
title = "{ARSENAL}: Architecture for Secure Non-Volatile
Memories",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "17",
number = "2",
pages = "192--196",
month = jul # "\slash " # dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2018.2863281",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Whereas data persistence in non-volatile memories
(NVMs) enables instant data recovery (IDR) in the face
of power/system failures, it also exposes NVMs to data
confidentiality and integrity attacks. Counter mode
encryption and Merkle Tree authentication are
established measures to thwart data confidentiality and
integrity attacks, respectively, in NVMs. However,
these security mechanisms require high overhead atomic
security meta-data updates on every write-back in order
to support IDR in NVMs. This increases memory traffic
and negatively impacts system performance and memory
lifetime. Architecture for Secure Non-Volatile Memories
(ARSENAL) is an IDR-preserving, low cost, high
performance security solution that protects NVM systems
against data confidentiality and integrity attacks.
ARSENAL synergistically integrates (i) Smart Writes for
Faster Transactions (SWIFT), a novel technique to
reduce the performance overhead of atomic security
meta-data updates on every write-back, with (ii)
Terminal BMT Updates (TBU), a novel
BMT-consistency-preserving technique, to facilitate IDR
in the face of power/system failures. Our evaluations
show that on average, ARSENAL improves system
performance (measured in IPC) by 2.26x (4x), reduces
memory traffic overhead by 1.47x (1.88x), and improves
memory lifetime by 2x (3.5x) in comparison to
conventional IDR-preserving 64-bit (128-bit)
encryption+authentication.",
acknowledgement = ack-nhfb,
affiliation = "Mohanram, K (Reprint Author), Univ Pittsburgh, Dept
Elect \& Comp Engn, Pittsburgh, PA 15260 USA. Swami,
Shivam; Mohanram, Kartik, Univ Pittsburgh, Dept Elect
\& Comp Engn, Pittsburgh, PA 15260 USA.",
author-email = "shs173@pitt.edu kmram@pitt.edu",
da = "2019-06-20",
doc-delivery-number = "GT5EV",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "NSF [CCF-1217738]",
funding-text = "This research was supported by NSF Award CCF-1217738.
We also thank the editor and the reviewers for their
constructive comments that have helped us elaborate and
improve the content of the paper.",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "authentication; encryption; hardware security;
Non-volatile memories",
keywords-plus = "ENCRYPTION; PERFORMANCE",
number-of-cited-references = "28",
research-areas = "Computer Science",
times-cited = "0",
unique-id = "Swami:2018:AAS",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Taassori:2018:VRP,
author = "Meysam Taassori and Ali Shafiee and Rajeev
Balasubramonian",
title = "{VAULT}: Reducing Paging Overheads in {SGX} with
Efficient Integrity Verification Structures",
journal = j-SIGPLAN,
volume = "53",
number = "2",
pages = "665--678",
month = feb,
year = "2018",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/3296957.3177155",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Oct 16 14:12:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "Intel's SGX offers state-of-the-art security features,
including confidentiality, integrity, and
authentication (CIA) when accessing sensitive pages in
memory. Sensitive pages are placed in an Enclave Page
Cache (EPC) within the physical memory before they can
be accessed by the processor. To control the overheads
imposed by CIA guarantees, the EPC operates with a
limited capacity (currently 128 MB). Because of this
limited EPC size, sensitive pages must be frequently
swapped between EPC and non-EPC regions in memory. A
page swap is expensive (about 40K cycles) because it
requires an OS system call, page copying, updates to
integrity trees and metadata, etc. Our analysis shows
that the paging overhead can slow the system on average
by 5$ \times $, and other studies have reported even
higher slowdowns for memory-intensive workloads. The
paging overhead can be reduced by growing the size of
the EPC to match the size of physical memory, while
allowing the EPC to also accommodate non-sensitive
pages. However, at least two important problems must be
addressed to enable this growth in EPC: (i) the depth
of the integrity tree and its cacheability must be
improved to keep memory bandwidth overheads in check,
(ii) the space overheads of integrity verification
(tree and MACs) must be reduced. We achieve both goals
by introducing a variable arity unified tree (VAULT)
organization that is more compact and has lower depth.
We further reduce the space overheads with techniques
that combine MAC sharing and compression. With
simulations, we show that the combination of our
techniques can address most inefficiencies in SGX
memory access and improve overall performance by 3.7$
\times $, relative to an SGX baseline, while incurring
a memory capacity over-head of only 4.7\%.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "ASPLOS '18 proceedings.",
}
@Article{Talbi:2018:SIW,
author = "Mourad Talbi and Med Salim Bouhlel",
title = "Secure Image Watermarking Based on {LWT} and {SVD}",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "18",
number = "4",
pages = "??--??",
month = oct,
year = "2018",
DOI = "https://doi.org/10.1142/S0219467818500213",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Fri Nov 9 06:55:50 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0219467818500213",
abstract = "Nowadays, digital watermarking is employed for
authentication and copyright protection. In this paper,
a secure image watermarking scheme based on lifting
wavelet transform (LWT) and singular value
decomposition (SVD), is proposed. Both LWT and SVD are
used as mathematical tools for embedding watermark in
the host image. In this work, the watermark is a speech
signal which is segmented into shorted portions having
the same length. This length is equal to 256 and these
different portions constitute the different columns of
a speech image. The latter is then embedded into a
grayscale or color image (the host image). This
procedure is performed in order to insert into an image
a confidential data which is in our case a speech
signal. But instead of embedding this speech signal
directly into the image, we transform it into a matrix
and treated it as an image (``a speech image''). Of
course, this speech signal transformation permits us to
use LWT-2D and SVD to both the host image and the
watermark (``a speech image''). The proposed technique
is applied to a number of grayscale and color images.
The obtained results from peak signal-to-noise ratio
(PSNR) and structural similarity (SSIM) computations
show the performance of the proposed technique.
Experimental evaluation also shows that the proposed
scheme is able to withstand a number of attacks such as
JPEG compression, mean and median attacks. In our
evaluation of the proposed technique, we used another
technique of secure image watermarking based on DWT-2D
and SVD.",
acknowledgement = ack-nhfb,
articleno = "1850021",
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Tankard:2018:LAA,
author = "Colin Tankard",
title = "A layered approach to authentication",
journal = j-NETWORK-SECURITY,
volume = "2018",
number = "12",
pages = "20--20",
month = dec,
year = "2018",
CODEN = "NTSCF5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Thu Sep 12 12:58:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485818301284",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Tao:2018:AAC,
author = "Ming Tao and Kaoru Ota and Mianxiong Dong and Zhuzhong
Qian",
title = "{AccessAuth}: Capacity-aware security access
authentication in federated-{IoT}-enabled {V2G}
networks",
journal = j-J-PAR-DIST-COMP,
volume = "118 (part 1)",
number = "??",
pages = "107--117",
month = aug,
year = "2018",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2017.09.004",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Sat May 12 16:27:31 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0743731517302587",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Teng:2018:KPA,
author = "Sheng-Hua Teng",
title = "{2018 Knuth Prize} is Awarded to {Johan H{\aa}stad}",
journal = j-SIGACT,
volume = "49",
number = "3",
pages = "78--79",
month = sep,
year = "2018",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/3289137.3289152",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Oct 22 09:39:54 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
abstract = "The 2018 Donald E. Knuth Prize will be awarded to
Johan H{\aa}stad of KTH Royal Institute of Technology
for his long and sustained record of milestone
breakthroughs at the foundations of computer science,
with huge impact on many areas including optimization,
cryptography, parallel computing, and complexity
theory. H{\aa}stad's multiple seminal works have not
only resolved longstanding deepest problems central to
circuit lower bounds, pseudorandom generation, and
approximability, but also introduced transformative
techniques that have fundamentally influenced much of
the subsequent work in these areas.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Toor:2018:VQA,
author = "Andeep S. Toor and Harry Wechsler and Michele Nappi
and Kim-Kwang Raymond Choo",
title = "Visual Question Authentication Protocol {(VQAP)}",
journal = j-COMPUT-SECUR,
volume = "76",
number = "??",
pages = "285--294",
month = jul,
year = "2018",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:55 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404817302547",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Tsoutsos:2018:EDM,
author = "Nektarios Georgios Tsoutsos and Michail Maniatakos",
title = "Efficient Detection for Malicious and Random Errors in
Additive Encrypted Computation",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "1",
pages = "16--31",
month = jan,
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2017.2722440",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Dec 14 07:11:27 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/document/7967774/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Additives; Computational modeling; Encrypted
computation; Encryption; Fault detection; Hardware;
homomorphic encryption; memory integrity; Mersenne
primes; residue numbering",
}
@TechReport{Turan:2018:RES,
author = "Meltem S{\"o}nmez Turan and Elaine Barker and John
Kelsey and Kerry A. McKay and Mary L. Baish and Mike
Boyle",
title = "Recommendation for the entropy sources used for random
bit generation",
type = "{NIST} Special Publication",
number = "800-90B",
institution = "National Institute of Standards and Technology, U.S.
Department of Commerce",
address = "Gaithersburg, MD, USA",
month = jan,
year = "2018",
DOI = "https://doi.org/10.6028/NIST.SP.800-90B",
bibdate = "Fri Jul 29 08:14:53 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://csrc.nist.gov/publications/detail/sp/800-90b/final",
abstract = "This Recommendation specifies the design principles
and requirements for the entropy sources used by Random
Bit Generators, and the tests for the validation of
entropy sources. These entropy sources are intended to
be combined with Deterministic Random Bit Generator
mechanisms that are specified in SP 800-90A to
construct Random Bit Generators, as specified in SP
800-90C.",
acknowledgement = ack-nhfb,
}
@Book{Turing:2018:XYZ,
author = "Dermot Turing",
title = "{X}, {Y} and {Z}: the Real Story of How {Enigma} Was
Broken",
publisher = "The History Press",
address = "Gloucestershire, UK",
pages = "319 + 1",
year = "2018",
ISBN = "0-7509-8782-0 (hardcover), 0-7509-8967-X (ePub)",
ISBN-13 = "978-0-7509-8782-0 (hardcover), 978-0-7509-8967-1
(ePub)",
LCCN = "D810.C88 T87 2018",
bibdate = "Fri Feb 4 16:28:59 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/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
abstract = "X, Y and Z describes how French, British and Polish
secret services came together to unravel the Enigma
machine. It tells of how, under the very noses of the
Germans, Enigma code-breaking continued in Vichy
France. And how code-breakers from Poland continued
their work for Her Majesty's Secret Service, watching
the USSR's first steps of the Cold War. The people of
X, Y and Z were eccentric, colourful and caught up in
world events that they could watch not control. This is
their story \ldots{}.",
acknowledgement = ack-nhfb,
subject = "Enigma (maszyna szyfruj{\'y}aca).; Wojna {\'y}swiatowa
(1939-1945); s{\'y}u{\'y}zby wywiadowcze; Wielka
Brytania; Enigma cipher system; World War, 1939-1945;
Military intelligence; Great Britain; Enigma cipher
system.; Military intelligence.",
tableofcontents = "List of Maps \\
Foreword \\
Dramatis Personae \\
Timeline \\
Introduction \\
1 Nulle Part \\
2 Enter the King \\
3 Mighty Pens \\
4 The Scarlet Pimpernels \\
5 How They Brought the Good News from Ghent to Aix \\
6 Monstrous Pile \\
7 The Mirror Crack'd from Side to Side \\
8 Into Three Parts \\
9 A Mystery Inside an Enigma \\
10 Hide and Seek \\
11 The Last Play \\
Epilogue \\
Appendix \\
Notes \\
Abbreviations \\
Select Bibliography",
}
@Article{Uzunkol:2018:SWU,
author = "Osmanbey Uzunkol and Mehmet Sabir Kiraz",
title = "Still wrong use of pairings in cryptography",
journal = j-APPL-MATH-COMP,
volume = "333",
number = "??",
pages = "467--479",
day = "15",
month = sep,
year = "2018",
CODEN = "AMHCBQ",
DOI = "https://doi.org/10.1016/j.amc.2018.03.062",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Wed May 16 08:01:07 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2015.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300318302352",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{vanderWalt:2018:CSI,
author = "Estee van der Walt and J. H. P. Eloff and Jacomine
Grobler",
title = "Cyber-security: Identity deception detection on social
media platforms",
journal = j-COMPUT-SECUR,
volume = "78",
number = "??",
pages = "76--89",
month = sep,
year = "2018",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818306503",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{VanDijkhuizen:2018:SNT,
author = "Niels {Van Dijkhuizen} and Jeroen {Van Der Ham}",
title = "A Survey of Network Traffic Anonymisation Techniques
and Implementations",
journal = j-COMP-SURV,
volume = "51",
number = "3",
pages = "52:1--52:??",
month = jul,
year = "2018",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3182660",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Aug 31 09:04:35 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Many networking research activities are dependent on
the availability of network captures. Even outside
academic research, there is a need for sharing network
captures to cooperate on threat assessments or for
debugging. However, most network captures cannot be
shared due to privacy concerns. Anonymisation of
network captures has been a subject of research for
quite some time, and many different techniques exist.
In this article, we present an overview of the
currently available techniques and implementations for
network capture anonymisation. There have been many
advances in the understanding of anonymisation and
cryptographic methods, which have changed the
perspective on the effectiveness of many anonymisation
techniques. However, these advances, combined with the
increase of computational abilities, may have also made
it feasible to perform anonymisation in real time. This
may make it easier to collect and distribute network
captures both for research and for other applications.
This article surveys the literature over the period of
1998-2017 on network traffic anonymisation techniques
and implementations. The aim is to provide an overview
of the current state of the art and to highlight how
advances in related fields have shed new light on
anonymisation and pseudonimisation methodologies. The
few currently maintained implementations are also
reviewed. Last, we identify future research directions
to enable easier sharing of network traffic, which in
turn can enable new insights in network traffic
analysis.",
acknowledgement = ack-nhfb,
articleno = "52",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Varadharajan:2018:AUR,
author = "V. S. Varadharajan and D. S. Onge and C. Gu{\ss} and
G. Beltrame",
title = "Over-the-Air Updates for Robotic Swarms",
journal = j-IEEE-SOFTWARE,
volume = "35",
number = "2",
pages = "44--50",
month = mar # "\slash " # apr,
year = "2018",
CODEN = "IESOEG",
DOI = "https://doi.org/10.1109/MS.2018.111095718",
ISSN = "0740-7459 (print), 1937-4194 (electronic)",
ISSN-L = "0740-7459",
bibdate = "Fri Aug 2 09:25:48 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "active sensor arrays; AI; artificial intelligence;
autonomous vehicles; code updates; code version;
computers and society; Cryptography; currently deployed
code; distributed applications; distributed artificial
intelligence; distributed systems; helicopters;
information technology; Internet of Things; mobile
robots; multiagent systems; OTA; over-the-air;
over-the-air code update; over-the-air updates;
particle swarm optimisation; Robot sensing systems;
robotic devices; robotic swarms; robotics; robots;
sensor arrays; software development; Software
development management; Software engineering; software
engineering; Software tools; swarm intelligence
ensures; UAVs; unmanned aerial vehicles; update
process; wireless sensor networks",
}
@Article{Vasisht:2018:DEU,
author = "Deepak Vasisht and Anubhav Jain and Chen-Yu Hsu and
Zachary Kabelac and Dina Katabi",
title = "{Duet}: Estimating User Position and Identity in Smart
Homes Using Intermittent and Incomplete {RF-Data}",
journal = j-IMWUT,
volume = "2",
number = "2",
pages = "1--21",
month = jul,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3214287",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:37:01 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3214287",
abstract = "Although past work on RF-based indoor localization has
delivered important advances, it typically makes
assumptions that hinder its adoption in smart home
applications. Most localization systems assume that
users carry their phones on them at home, an \ldots{}",
acknowledgement = ack-nhfb,
articleno = "84",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Viswanathan:2018:EEG,
author = "Sreejaya Viswanathan and Rui Tan and David K. Y. Yau",
title = "Exploiting Electrical Grid for Accurate and Secure
Clock Synchronization",
journal = j-TOSN,
volume = "14",
number = "2",
pages = "12:1--12:??",
month = jul,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3195182",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Wed Oct 2 09:20:25 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Desynchronized clocks among network nodes in critical
infrastructures can degrade system performance and even
lead to safety incidents. Clock synchronization
protocols based on network message exchanges, though
widely used in current network systems, are susceptible
to delay attacks against the packet transmission. This
vulnerability cannot be solved by conventional security
measures, such as encryption, and remains an open
problem. This article proposes to use the sine voltage
waveform of a utility power grid to synchronize network
nodes connected to the same grid. Our experiments
demonstrate that minute fluctuations of the voltage's
cycle length encode fine-grained global time
information in Singapore's utility grid. Based on this
key result, we develop a clock synchronization approach
that achieves good accuracy and is provably secure
against packet-delay attacks. Implementation results
show that our approach achieves an average
synchronization error of 0.1 ms between two network
nodes that are deployed in office and residential
buildings 10 km apart. When the proposed system is
deployed within the same floor of an office building,
the error reduces to 10 $ \mu $ s. When there are heavy
industrial loads close to one of the two nodes 10 km
apart, the system can still maintain subsecond
accuracy. Moreover, when the two nodes are deployed
within the same building floor with industrial loads
nearby, the average synchronization error is 34 $ \mu $
s",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Walter:2018:RCS,
author = "Kenny Walter",
title = "Researchers Close Security Vulnerability in Popular
Encryption Program",
journal = "{R\&D} Magazine",
volume = "??",
number = "??",
pages = "??--??",
day = "9",
month = aug,
year = "2018",
bibdate = "Thu Aug 09 17:50:02 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.rdmag.com/article/2018/08/researchers-close-security-vulnerability-popular-encryption-program",
acknowledgement = ack-nhfb,
remark = "From the article about a vulnerability in OpenSSL on
mobile devices: ``unlike previous attacks that require
analyzing several logins, this attack was conducted by
just listening in on one decryption cycle and was the
first attack that showed a single recoding of a
cryptography key trace was enough to break 2,048 bits
of a private RSA key.\par
``This is something that could be done at an airport to
steal people's information without arousing suspicion
and makes the so-called `coffee shop attack' much more
realistic,'' Prvulovic said. ``The designers of
encryption software now have another issue that they
need to take into account because continuous snooping
over long periods of time would no longer be required
to steal this information.''\,''",
}
@Article{Wang:2018:AMB,
author = "Rong Wang and Yan Zhu and Tung-Shou Chen and Chin-Chen
Chang",
title = "An Authentication Method Based on the Turtle Shell
Algorithm for Privacy-Preserving Data Mining",
journal = j-COMP-J,
volume = "61",
number = "8",
pages = "1123--1132",
day = "1",
month = aug,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy024",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:57 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/8/1123/4925401",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Wang:2018:CIW,
author = "Xiang-yang Wang and Huan Xu and Si-yu Zhang and
Lin-lin Liang and Pan-pan Niu and Hong-ying Yang",
title = "A Color Image Watermarking Approach Based on
Synchronization Correction",
journal = j-FUND-INFO,
volume = "158",
number = "4",
pages = "385--407",
month = "????",
year = "2018",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2018-1654",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Fri Sep 21 07:16:36 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Wang:2018:ERS,
author = "Hong Wang and Jie Guan and Lin Ding",
title = "On Equivalence Relations of State Diagram of Cascade
Connection of an {LFSR} into an {NFSR}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "7",
pages = "??--??",
month = nov,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500235",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:50 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500235",
abstract = "Grain is one of the hardware-oriented finalists of the
eSTREAM. The cipher has a cascade connection of an LFSR
into an NFSR which is denoted by Cascade Model. In this
paper, we study the equivalence relations between state
diagrams of two functions, and apply them to the
Cascade Models, then some results regarding their
equivalence relations are obtained.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2018:GAD,
author = "Lin Wang and Zhi Hu",
title = "On Graph Algorithms for Degeneracy Test and Recursive
Description of Stream Ciphers",
journal = j-FUND-INFO,
volume = "160",
number = "3",
pages = "343--359",
month = "????",
year = "2018",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2018-1686",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Fri Sep 21 07:16:46 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Wang:2018:LRI,
author = "Zhiwei Wang",
title = "Leakage resilient {ID}-based proxy re-encryption
scheme for access control in fog computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "87",
number = "??",
pages = "679--685",
month = oct,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Jun 26 08:47:57 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17310075",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Wang:2018:PPA,
author = "Zhiwei Wang",
title = "A privacy-preserving and accountable authentication
protocol for {IoT} end-devices with weaker identity",
journal = j-FUT-GEN-COMP-SYS,
volume = "82",
number = "??",
pages = "342--348",
month = may,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.09.042",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sun Feb 18 14:42:10 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17307495",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Wang:2018:SEA,
author = "Haijiang Wang and Xiaolei Dong and Zhenfu Cao and
Dongmei Li",
title = "Secure and Efficient Attribute-Based Encryption with
Keyword Search",
journal = j-COMP-J,
volume = "61",
number = "8",
pages = "1133--1142",
day = "1",
month = aug,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy031",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:57 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/8/1133/4975828",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Wang:2018:SNU,
author = "King-Hang Wang and Chien-Ming Chen and Weicheng Fang
and Tsu-Yang Wu",
title = "On the security of a new ultra-lightweight
authentication protocol in {IoT} environment for {RFID}
tags",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "1",
pages = "65--70",
month = jan,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-017-2105-8",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jan 6 08:59:19 MST 2018",
bibsource = "http://link.springer.com/journal/11227/74/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Wang:2018:VMF,
author = "Nana Wang and Mohan Kankanhalli",
title = "{$2$D} Vector Map Fragile Watermarking with Region
Location",
journal = j-TSAS,
volume = "4",
number = "4",
pages = "12:1--12:??",
month = oct,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3239163",
ISSN = "2374-0353",
bibdate = "Fri Dec 6 16:16:50 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tsas.bib",
URL = "https://dl.acm.org/citation.cfm?id=3239163",
abstract = "Locating the original region of tampered features is a
challenging task for existing 2D vector map fragile
watermarking methods. This article presents a 2D vector
map fragile watermarking framework that locates not
only the current but also the original region of
tampered feature groups. In particular, we propose
dividing the features of the host vector map into
groups, and embedding a watermark consisting of
location-bits and check-bits into each group at the
sender side. At the receiver side, by comparing the
extracted and calculated check-bits, one can identify
tampered groups and locate their current regions. Then
the location-bits extracted from the mapping groups are
used to indicate the original regions of the tampered
groups. To demonstrate and analyze the applicability of
this framework, we instantiate it by proposing a
simulated annealing (SA)-based group division method, a
group mapping method, a minimum encasing rectangle
(MER) based location-bits generation method and a
check-bits generation method, and use an existing
reversible data hiding method for watermark embedding.
The experimental results show that the proposed
framework can locate all the regions influenced by
tampering, and the SA-based group division method can
get a better region location ability.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Spatial Algorithms and Systems
(TSAS)",
journal-URL = "http://dl.acm.org/pub.cfm?id=J1514",
}
@Article{Wazid:2018:AKM,
author = "Mohammad Wazid and Ashok Kumar Das and Athanasios V.
Vasilakos",
title = "Authenticated key management protocol for
cloud-assisted body area sensor networks",
journal = j-J-NETW-COMPUT-APPL,
volume = "123",
number = "??",
pages = "112--126",
day = "1",
month = dec,
year = "2018",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:28 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518302960",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Wei:2018:GCQ,
author = "Chun-Yan Wei and Xiao-Qiu Cai and Bin Liu and Tian-Yin
Wang and Fei Gao",
title = "A Generic Construction of
Quantum-Oblivious-Key-Transfer-Based Private Query with
Ideal Database Security and Zero Failure",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "1",
pages = "2--8",
month = jan,
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2017.2721404",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Dec 14 07:11:27 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/document/7962191/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Cryptography; Databases; low-shift and addition;
Optical wavelength conversion; Photonics; Protocols;
Quantum computing; quantum oblivious key transfer;
Quantum private query; simulation; weak coherent
source",
}
@Article{Williams:2018:FPD,
author = "Michael Williams",
title = "The First Public Discussion of the Secret {Colossus
Project}",
journal = j-IEEE-ANN-HIST-COMPUT,
volume = "40",
number = "1",
pages = "84--87",
month = jan # "\slash " # mar,
year = "2018",
CODEN = "IAHCEX",
ISSN = "1058-6180 (print), 1934-1547 (electronic)",
ISSN-L = "1058-6180",
bibdate = "Thu May 10 07:18:20 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeeannhistcomput.bib",
URL = "https://www.computer.org/csdl/mags/an/2018/01/man2018010084.pdf",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85",
remark = "See \url{https://history.computer.org/annals/dtp/} for
additional notes, corrections, interviews, and
photographs.",
}
@Article{Wu:2018:ESS,
author = "Libing Wu and Biwen Chen and Kim-Kwang Raymond Choo
and Debiao He",
title = "Efficient and secure searchable encryption protocol
for cloud-based {Internet of Things}",
journal = j-J-PAR-DIST-COMP,
volume = "111",
number = "??",
pages = "152--161",
month = jan,
year = "2018",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Tue Oct 24 15:08:48 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S074373151730237X",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Wu:2018:SMI,
author = "Pin Wu and Yang Yang and Xiaoqiang Li",
title = "{StegNet}: Mega Image Steganography Capacity with Deep
Convolutional Network",
journal = j-FUTURE-INTERNET,
volume = "10",
number = "6",
pages = "54",
day = "15",
month = jun,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi10060054",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:00 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/10/6/54",
abstract = "Traditional image steganography often leans interests
towards safely embedding hidden information into cover
images with payload capacity almost neglected. This
paper combines recent deep convolutional neural network
methods with image-into-image steganography. It
successfully hides the same size images with a decoding
rate of 98.2\% or bpp (bits per pixel) of 23.57 by
changing only 0.76\% of the cover image on average. Our
method directly learns end-to-end mappings between the
cover image and the embedded image and between the
hidden image and the decoded image. We further show
that our embedded image, while with mega payload
capacity, is still robust to statistical analysis.",
acknowledgement = ack-nhfb,
}
@Article{Xiang:2018:SSA,
author = "Y. Xiang and I. Natgunanathan and D. Peng and G. Hua
and B. Liu",
title = "Spread Spectrum Audio Watermarking Using Multiple
Orthogonal {PN} Sequences and Variable Embedding
Strengths and Polarities",
journal = j-IEEE-ACM-TASLP,
volume = "26",
number = "3",
pages = "529--539",
month = mar,
year = "2018",
DOI = "https://doi.org/10.1109/TASLP.2017.2782487",
ISSN = "2329-9290",
bibdate = "Sat Aug 3 09:10:28 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "audio coding; audio data; audio signal; audio signal
processing; Audio watermarking; audio watermarking;
compression attacks; copyright; Copyright protection;
copyright protection; Discrete cosine transforms;
Electronic mail; embedding capacity; existing audio
watermarking methods; high robustness; Interference;
Multiple Orthogonal PN Sequences; noise addition;
Robustness; Speech; spread spectrum; spread spectrum
audio watermarking; SS-based audio watermarking method;
Variable Embedding Strengths; watermark bits;
Watermarking",
}
@Article{Xiao:2018:FEI,
author = "Chang Xiao and Cheng Zhang and Changxi Zheng",
title = "{FontCode}: Embedding Information in Text Documents
Using Glyph Perturbation",
journal = j-TOG,
volume = "37",
number = "2",
pages = "15:1--15:??",
month = jul,
year = "2018",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/3152823",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Thu Nov 29 17:19:42 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
abstract = "We introduce FontCode, an information embedding
technique for text documents. Provided a text document
with specific fonts, our method embeds user-specified
information in the text by perturbing the glyphs of
text characters while preserving the text content. We
devise an algorithm to choose unobtrusive yet
machine-recognizable glyph perturbations, leveraging a
recently developed generative model that alters the
glyphs of each character continuously on a font
manifold. We then introduce an algorithm that embeds a
user-provided message in the text document and produces
an encoded document whose appearance is minimally
perturbed from the original document. We also present a
glyph recognition method that recovers the embedded
information from an encoded document stored as a vector
graphic or pixel image, or even on a printed paper. In
addition, we introduce a new error-correction coding
scheme that rectifies a certain number of recognition
errors. Lastly, we demonstrate that our technique
enables a wide array of applications, using it as a
text document metadata holder, an unobtrusive optical
barcode, a cryptographic message embedding scheme, and
a text document signature.",
acknowledgement = ack-nhfb,
articleno = "15",
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@Article{Xiao:2018:KRL,
author = "Dianyan Xiao and Yang Yu",
title = "Klepto for Ring-{LWE} Encryption",
journal = j-COMP-J,
volume = "61",
number = "8",
pages = "1228--1239",
day = "1",
month = aug,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy060",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:57 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/8/1228/5035449",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Xu:2018:DFH,
author = "Jian Xu and Laiwen Wei and Yu Zhang and Andi Wang and
Fucai Zhou and Chong-zhi Gao",
title = "Dynamic Fully Homomorphic encryption-based {Merkle}
Tree for lightweight streaming authenticated data
structures",
journal = j-J-NETW-COMPUT-APPL,
volume = "107",
number = "??",
pages = "113--124",
day = "1",
month = apr,
year = "2018",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2018.01.014",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sun May 27 08:10:13 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518300286",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Xu:2018:SKS,
author = "Li Xu and Chi-Yao Weng and Lun-Pin Yuan and Mu-En Wu
and Raylin Tso and Hung-Min Sun",
title = "A shareable keyword search over encrypted data in
cloud computing",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "3",
pages = "1001--1023",
month = mar,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-015-1515-8",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Fri Mar 2 12:22:02 MST 2018",
bibsource = "http://link.springer.com/journal/11227/74/3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Xue:2018:SNN,
author = "W. Xue and H. Li and Y. Peng and J. Cui and Y. Shi",
title = "Secure $k$ Nearest Neighbors Query for
High-Dimensional Vectors in Outsourced Environments",
journal = j-IEEE-TRANS-BIG-DATA,
volume = "4",
number = "4",
pages = "586--599",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1109/TBDATA.2017.2740954",
ISSN = "2332-7790",
bibdate = "Fri Aug 2 11:24:47 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "Cloud computing; Data privacy; Encryption; encryption;
quantization; query processing; Secure$k$nearest
neighbors query; Security of data; Servers",
}
@Article{Yan:2018:FPS,
author = "Qiuchen Yan and Stephen McCamant",
title = "{Fast PokeEMU}: Scaling Generated Instruction Tests
Using Aggregation and State Chaining",
journal = j-SIGPLAN,
volume = "53",
number = "3",
pages = "71--83",
month = mar,
year = "2018",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/3296975.3186417",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Oct 16 14:12:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "Software that emulates a CPU has many applications,
but is difficult to implement correctly and requires
extensive testing. Since a large number of test cases
are required for full coverage, it is important that
the tests execute efficiently. We explore techniques
for combining many instruction tests into one program
to amortize overheads such as booting an emulator. To
ensure the results of each test are reflected in a
final result, we use the outputs of one instruction
test as an input to the next, and adopt the ``Feistel
network'' construction from cryptography so that each
step is invertible. We evaluate this approach by
applying it to PokeEMU, a tool that generates emulator
tests using symbolic execution. The combined tests run
much faster, but still reveal most of the same behavior
differences as when run individually.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "VEE '18 proceedings.",
}
@Article{Yang:2018:AIW,
author = "Zhi-Fang Yang and Chih-Ting Kuo and Te-Hsi Kuo",
title = "Authorization Identification by Watermarking in
Log-polar Coordinate System",
journal = j-COMP-J,
volume = "61",
number = "11",
pages = "1710--1723",
day = "1",
month = nov,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy048",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Nov 3 07:20:54 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/11/1710/4993056",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Yang:2018:CDD,
author = "Yang Yang and Xianghan Zheng and Ximeng Liu and
Shangping Zhong and Victor Chang",
title = "Cross-domain dynamic anonymous authenticated group key
management with symptom-matching for e-health social
system",
journal = j-FUT-GEN-COMP-SYS,
volume = "84",
number = "??",
pages = "160--176",
month = jul,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.06.025",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Apr 16 14:45:08 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X1730554X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Yang:2018:CPG,
author = "Hongbin Yang and Shuxiong Jiang and Wenfeng Shen and
Zhou Lei",
title = "Certificateless Provable Group Shared Data Possession
with Comprehensive Privacy Preservation for Cloud
Storage",
journal = j-FUTURE-INTERNET,
volume = "10",
number = "6",
pages = "49",
day = "07",
month = jun,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi10060049",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:00 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/10/6/49",
abstract = "Provable Data Possession (PDP) protocol makes it
possible for cloud users to check whether the cloud
servers possess their original data without downloading
all the data. However, most of the existing PDP schemes
are based on either public key infrastructure (PKI) or
identity-based cryptography, which will suffer from
issues of expensive certificate management or key
escrow. In this paper, we propose a new construction of
certificateless provable group shared data possession
(CL-PGSDP) protocol by making use of certificateless
cryptography, which will eliminate the above issues.
Meanwhile, by taking advantage of zero-knowledge
protocol and randomization method, the proposed
CL-PGSDP protocol leaks no information of the stored
data and the group user's identity to the verifiers
during the verifying process, which is of the property
of comprehensive privacy preservation. In addition, our
protocol also supports efficient user revocation from
the group. Security analysis and experimental
evaluation indicate that our CL-PGSDP protocol provides
strong security with desirable efficiency.",
acknowledgement = ack-nhfb,
remark = "Special Issue Big Data and Internet of Thing.",
}
@Article{Yang:2018:EEC,
author = "Wencheng Yang and Song Wang and Guanglou Zheng and
Junaid Chaudhry and Craig Valli",
title = "{ECB4CI}: an enhanced cancelable biometric system for
securing critical infrastructures",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "10",
pages = "4893--4909",
month = oct,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-018-2266-0",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Oct 10 15:31:09 MDT 2019",
bibsource = "http://link.springer.com/journal/11227/74/10;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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:2018:HEP,
author = "Kun Yang and Haoting Shen and Domenic Forte and Swarup
Bhunia and Mark Tehranipoor",
title = "Hardware-Enabled Pharmaceutical Supply Chain
Security",
journal = j-TODAES,
volume = "23",
number = "2",
pages = "23:1--23:??",
month = jan,
year = "2018",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/3144532",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Mar 22 16:58:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "The pharmaceutical supply chain is the pathway through
which prescription and over-the-counter (OTC) drugs are
delivered from manufacturing sites to patients.
Technological innovations, price fluctuations of raw
materials, as well as tax, regulatory, and market
demands are driving change and making the
pharmaceutical supply chain more complex. Traditional
supply chain management methods struggle to protect the
pharmaceutical supply chain, maintain its integrity,
enhance customer confidence, and aid regulators in
tracking medicines. To develop effective measures that
secure the pharmaceutical supply chain, it is important
that the community is aware of the state-of-the-art
capabilities available to the supply chain owners and
participants. In this article, we will be presenting a
survey of existing hardware-enabled pharmaceutical
supply chain security schemes and their limitations. We
also highlight the current challenges and point out
future research directions. This survey should be of
interest to government agencies, pharmaceutical
companies, hospitals and pharmacies, and all others
involved in the provenance and authenticity of
medicines and the integrity of the pharmaceutical
supply chain.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Yang:2018:IAC,
author = "Xiaokun Yang and Wujie Wen and Ming Fan",
title = "Improving {AES} Core Performance via an Advanced
{ASBUS} Protocol",
journal = j-JETC,
volume = "14",
number = "1",
pages = "6:1--6:??",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3110713",
ISSN = "1550-4832",
bibdate = "Thu Nov 1 16:44:40 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jetc.bib",
abstract = "Security is becoming a de-facto requirement of
System-on-Chips (SoC), leading up to a significant
share of circuit design cost. In this article, we
propose an advanced SBUS protocol (ASBUS), to improve
the data feeding efficiency of the Advanced Encryption
Standard (AES) encrypted circuits. As a case study, the
direct memory access (DMA) combined with AES engine and
memory controller are implemented as our
design-under-test (DUT) using field-programmable gate
arrays (FPGA). The results show that our presented
ASBUS structure outperforms the AXI-based design for
cipher tests. As an example, the 32-bit ASBUS design
costs less in terms of hardware resources and achieves
higher throughput ($ 1.30 \times $) than the 32-bit AXI
implementation, and the dynamic energy consumed by the
ASBUS cipher test is reduced to 71.27\% compared with
the AXI test.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Journal on Emerging Technologies in Computing
Systems (JETC)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J967",
}
@Article{Yang:2018:NSS,
author = "Zheng Yang and Chao Liu and Wanping Liu and Daigu
Zhang and Song Luo",
title = "A new strong security model for stateful authenticated
group key exchange",
journal = j-INT-J-INFO-SEC,
volume = "17",
number = "4",
pages = "423--440",
month = aug,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-017-0373-1",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Wed Jul 25 08:53:56 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib",
URL = "http://link.springer.com/article/10.1007/s10207-017-0373-1",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
}
@Article{Yang:2018:PBC,
author = "Rupeng Yang and Qiuliang Xu and Man Ho Au and Zuoxia
Yu and Hao Wang and Lu Zhou",
title = "Position based cryptography with location privacy: a
step for {Fog Computing}",
journal = j-FUT-GEN-COMP-SYS,
volume = "78 (part 2)",
number = "??",
pages = "799--806",
month = jan,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Sep 25 09:24:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17311032",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Yang:2018:RKF,
author = "Li Yang and Ziyi Han and Zhengan Huang and Jianfeng
Ma",
title = "A remotely keyed file encryption scheme under mobile
cloud computing",
journal = j-J-NETW-COMPUT-APPL,
volume = "106",
number = "??",
pages = "90--99",
day = "15",
month = mar,
year = "2018",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2017.12.017",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Sat Mar 3 15:22:11 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517304241",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Yang:2018:RRE,
author = "Kun Yang and Domenic Forte and Mark Tehranipoor",
title = "{ReSC}: an {RFID-Enabled} Solution for Defending {IoT}
Supply Chain",
journal = j-TODAES,
volume = "23",
number = "3",
pages = "29:1--29:??",
month = apr,
year = "2018",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/3174850",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Mar 22 16:58:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "The Internet of Things (IoT), an emerging global
network of uniquely identifiable embedded computing
devices within the existing Internet infrastructure, is
transforming how we live and work by increasing the
connectedness of people and things on a scale that was
once unimaginable. In addition to facilitated
information and service exchange between connected
objects, enhanced computing power and analytic
capabilities of individual objects, and increased
interaction between objects and their environments, the
IoT also raises new security and privacy challenges.
Hardware trust across the IoT supply chain is the
foundation of IoT security and privacy. Two major
supply chain issues --- disappearance/theft of
authentic IoT devices and appearance of unauthentic
ones --- have to be addressed to secure the IoT supply
chain and lay the foundation for further security and
privacy-defensive measures. Comprehensive solutions
that enable IoT device authentication and traceability
across the entire supply chain (i.e., during
distribution and after being provisioned) need to be
established. Existing hardware, software, and network
protection methods, however, do not address IoT supply
chain issues. To mitigate this shortcoming, we propose
an RFID-enabled solution called ReSC that aims at
defending the IoT supply chain. By incorporating three
techniques-one-to-one mapping between RFID tag identity
and control chip identity; unique tag trace, which
records tag provenance and history information; and
neighborhood attestation of IoT devices-ReSC is
resistant to split attacks (i.e., separating tag from
product, swapping tags), counterfeit injection, product
theft throughout the entire supply chain, device
recycling, and illegal network service access (e.g.,
Internet, cable TV, online games, remote firmware
updates). Simulations, theoretical analysis, and
experimental results based on a printed circuit board
(PCB) prototype demonstrate the effectiveness of ReSC.
Finally, we evaluate the security of our proposed
scheme against various attacks.",
acknowledgement = ack-nhfb,
articleno = "29",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Ye:2018:ISS,
author = "Jun Ye and Zheng Xu and Yong Ding",
title = "Image search scheme over encrypted database",
journal = j-FUT-GEN-COMP-SYS,
volume = "87",
number = "??",
pages = "251--258",
month = oct,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Jun 26 08:47:57 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17324354",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Ye:2018:VBA,
author = "Guixin Ye and Zhanyong Tang and Dingyi Fang and
Xiaojiang Chen and Willy Wolff and Adam J. Aviv and
Zheng Wang",
title = "A Video-based Attack for {Android} Pattern Lock",
journal = j-TOPS,
volume = "21",
number = "4",
pages = "19:1--19:??",
month = oct,
year = "2018",
DOI = "https://doi.org/10.1145/3230740",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
bibdate = "Sat Sep 21 08:26:24 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
URL = "https://dl.acm.org/citation.cfm?id=3230740",
abstract = "Pattern lock is widely used for identification and
authentication on Android devices. This article
presents a novel video-based side channel attack that
can reconstruct Android locking patterns from video
footage filmed using a smartphone. As a departure from
previous attacks on pattern lock, this new attack does
not require the camera to capture any content displayed
on the screen. Instead, it employs a computer vision
algorithm to track the fingertip movement trajectory to
infer the pattern. Using the geometry information
extracted from the tracked fingertip motions, the
method can accurately infer a small number of (often
one) candidate patterns to be tested by an attacker. We
conduct extensive experiments to evaluate our approach
using 120 unique patterns collected from 215
independent users. Experimental results show that the
proposed attack can reconstruct over 95\% of the
patterns in five attempts. We discovered that, in
contrast to most people's belief, complex patterns do
not offer stronger protection under our attacking
scenarios. This is demonstrated by the fact that we are
able to break all but one complex patterns (with a
97.5\% success rate) as opposed to 60\% of the simple
patterns in the first attempt. We demonstrate that this
video-side channel is a serious concern for not only
graphical locking patterns but also PIN-based
passwords, as algorithms and analysis developed from
the attack can be easily adapted to target PIN-based
passwords. As a countermeasure, we propose to change
the way the Android locking pattern is constructed and
used. We show that our proposal can successfully defeat
this video-based attack. We hope the results of this
article can encourage the community to revisit the
design and practical use of Android pattern lock.",
acknowledgement = ack-nhfb,
articleno = "19",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Youn:2018:DAH,
author = "Taek-Young Youn and Nam-Su Jho and Ku-Young Chang",
title = "Design of additive homomorphic encryption with
multiple message spaces for secure and practical
storage services over encrypted data",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "8",
pages = "3620--3638",
month = aug,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1796-6",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Oct 10 15:31:14 MDT 2019",
bibsource = "http://link.springer.com/journal/11227/74/8;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Zhan:2018:EKG,
author = "Furui Zhan and Nianmin Yao and Zhenguo Gao and Haitao
Yu",
title = "Efficient key generation leveraging wireless channel
reciprocity for {MANETs}",
journal = j-J-NETW-COMPUT-APPL,
volume = "103",
number = "??",
pages = "18--28",
day = "1",
month = feb,
year = "2018",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Fri Jan 12 10:10:21 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517303909",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Zhang:2018:AAG,
author = "Qikun Zhang and Yong Gan and Lu Liu and Xianmin Wang
and Xiangyang Luo and Yuanzhang Li",
title = "An authenticated asymmetric group key agreement based
on attribute encryption",
journal = j-J-NETW-COMPUT-APPL,
volume = "123",
number = "??",
pages = "1--10",
day = "1",
month = dec,
year = "2018",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2018.08.013",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:28 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518302704",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Zhang:2018:AKE,
author = "Yuexin Zhang and Yang Xiang and Tao Wang and Wei Wu
and Jian Shen",
title = "An over-the-air key establishment protocol using
keyless cryptography",
journal = j-FUT-GEN-COMP-SYS,
volume = "79 (part 1)",
number = "??",
pages = "284--294",
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2016.12.013",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Nov 24 15:16:17 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X1630752X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
keywords = "Anonymous channel; Key establishment; Security; Source
indistinguishability",
}
@Article{Zhang:2018:PPE,
author = "Yin Zhang and Raffaele Gravina and Huimin Lu and
Massimo Villari and Giancarlo Fortino",
title = "{PEA}: Parallel electrocardiogram-based authentication
for smart healthcare systems",
journal = j-J-NETW-COMPUT-APPL,
volume = "117",
number = "??",
pages = "10--16",
day = "1",
month = sep,
year = "2018",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518301693",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Zhang:2018:SPF,
author = "Jianhong Zhang and Jian Mao",
title = "On the Security of a Pairing-Free Certificateless
Signcryption Scheme",
journal = j-COMP-J,
volume = "61",
number = "4",
pages = "469--471",
day = "1",
month = apr,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxx081",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:19 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/4/469/4107198",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Zhang:2018:SSH,
author = "Yinghui Zhang and Robert H. Deng and Gang Han and Dong
Zheng",
title = "Secure smart health with privacy-aware aggregate
authentication and access control in {Internet of
Things}",
journal = j-J-NETW-COMPUT-APPL,
volume = "123",
number = "??",
pages = "89--100",
day = "1",
month = dec,
year = "2018",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:28 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518302935",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Zhang:2018:VPA,
author = "Yuexin Zhang and Yang Xiang and Wei Wu and Abdulhameed
Alelaiwi",
title = "A variant of password authenticated key exchange
protocol",
journal = j-FUT-GEN-COMP-SYS,
volume = "78 (part 2)",
number = "??",
pages = "699--711",
month = jan,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Sep 25 09:24:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17302145",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Zheng:2018:GDP,
author = "Zhigao Zheng and Nitin Saxena and K. K. Mishra and
Arun Kumar Sangaiah",
title = "Guided dynamic particle swarm optimization for
optimizing digital image watermarking in industry
applications",
journal = j-FUT-GEN-COMP-SYS,
volume = "88",
number = "??",
pages = "92--106",
month = nov,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2018.05.027",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Sep 18 14:07:58 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18307945",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Zhou:2018:CBG,
author = "Caixue Zhou and Guangyong Gao and Zongmin Cui and
Zhiqiang Zhao",
title = "Certificate-Based Generalized Ring Signcryption
Scheme",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "6",
pages = "1063--1088",
month = sep,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500211",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:47 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500211",
abstract = "Generalized ring signcryption (GRSC) can realize ring
signature and ring signcryption functions with only one
key pair and one algorithm. It is very useful for a
system with a large number of users, or whose function
may be changed, or with limited storage space. We give
a formal definition and security model of GRSC in the
certificate-based cryptosystem setting and propose a
concrete scheme by using bilinear pairings. The
confidentiality of our scheme can be proved under the
GBDH and CDH assumptions and the unforgeability of our
scheme can be proved under GDH' and CDH assumptions in
the random oracle model, and what is more, our scheme
has unconditional anonymity. Compared with other
certificateless ring signcryption schemes that use
bilinear pairings, it is a highly efficient one.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhou:2018:CLR,
author = "Yanwei Zhou and Bo Yang and Yi Mu",
title = "Continuous Leakage-Resilient Identity-Based Encryption
without Random Oracles",
journal = j-COMP-J,
volume = "61",
number = "4",
pages = "586--600",
day = "1",
month = apr,
year = "2018",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy003",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Aug 3 11:54:19 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/61/4/586/4824746",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Zhou:2018:QTA,
author = "Lu Zhou and Quanlong Wang and Xin Sun and Piotr
Kulicki and Arcangelo Castiglione",
title = "Quantum technique for access control in cloud
computing {II}: Encryption and key distribution",
journal = j-J-NETW-COMPUT-APPL,
volume = "103",
number = "??",
pages = "178--184",
day = "1",
month = feb,
year = "2018",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Fri Jan 12 10:10:21 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804517303922",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Zhou:2018:SAE,
author = "Yukun Zhou and Dan Feng and Yu Hua and Wen Xia and Min
Fu and Fangting Huang and Yucheng Zhang",
title = "A similarity-aware encrypted deduplication scheme with
flexible access control in the cloud",
journal = j-FUT-GEN-COMP-SYS,
volume = "84",
number = "??",
pages = "177--189",
month = jul,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2017.10.014",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Apr 16 14:45:08 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17309238",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Zhou:2018:TPW,
author = "Lu Zhou and Chunhua Su and Yamin Wen and Weijie Li and
Zheng Gong",
title = "Towards practical white-box lightweight block cipher
implementations for {IoTs}",
journal = j-FUT-GEN-COMP-SYS,
volume = "86",
number = "??",
pages = "507--514",
month = sep,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Jun 20 10:38:06 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17326705",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Zhu:2018:CAC,
author = "Biaokai Zhu and Jumin Zhao and Dengao Li and Hong Wang
and Ruiqin Bai and Yanxia Li and Hao Wu",
title = "Cloud access control authentication system using
dynamic accelerometers data",
journal = j-CCPE,
volume = "30",
number = "20",
pages = "e4474:1--e4474:??",
day = "25",
month = oct,
year = "2018",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4474",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Thu Mar 28 08:07:52 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "15 April 2018",
}
@Article{Zoni:2018:CSC,
author = "Davide Zoni and Alessandro Barenghi and Gerardo Pelosi
and William Fornaciari",
title = "A Comprehensive Side-Channel Information Leakage
Analysis of an In-Order {RISC CPU} Microarchitecture",
journal = j-TODAES,
volume = "23",
number = "5",
pages = "57:1--57:??",
month = oct,
year = "2018",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/3212719",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Mar 22 16:58:40 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "Side-channel attacks are a prominent threat to the
security of embedded systems. To perform them, an
adversary evaluates the goodness of fit of a set of
key-dependent power consumption models to a collection
of side-channel measurements taken from an actual
device, identifying the secret key value as the one
yielding the best-fitting model. In this work, we
analyze for the first time the microarchitectural
components of a 32-bit in-order RISC CPU, showing which
one of them is accountable for unexpected side-channel
information leakage. We classify the leakage sources,
identifying the data serialization points in the
microarchitecture and providing a set of hints that can
be fruitfully exploited to generate implementations
resistant against side-channel attacks, either writing
or generating proper assembly code.",
acknowledgement = ack-nhfb,
articleno = "57",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Zuo:2018:CSA,
author = "Cong Zuo and Jun Shao and Guiyi Wei and Mande Xie and
Min Ji",
title = "{CCA}-secure {ABE} with outsourced decryption for fog
computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "78 (part 2)",
number = "??",
pages = "730--738",
month = jan,
year = "2018",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Sep 25 09:24:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16304745",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Abouaroek:2019:NAU,
author = "Musaeed Abouaroek and Khaleel Ahmad",
title = "Node Authentication Using {NTRU} Algorithm in
Opportunistic Network",
journal = j-SCPE,
volume = "20",
number = "1",
pages = "83--92",
month = "????",
year = "2019",
CODEN = "????",
ISSN = "1895-1767",
ISSN-L = "1895-1767",
bibdate = "Thu Oct 3 07:39:16 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/scpe.bib",
URL = "https://www.scpe.org/index.php/scpe/article/view/1481",
acknowledgement = ack-nhfb,
fjournal = "Scalable Computing: Practice and Experience",
journal-URL = "http://www.scpe.org/",
}
@Article{Abraham:2019:DPL,
author = "Ittai Abraham and Danny Dolev and Joseph Y. Halpern",
title = "Distributed Protocols for Leader Election: a
Game-Theoretic Perspective",
journal = j-TEAC,
volume = "7",
number = "1",
pages = "4:1--4:??",
month = feb,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3303712",
ISSN = "2167-8375 (print), 2167-8383 (electronic)",
ISSN-L = "2167-8375",
bibdate = "Sat Oct 19 12:38:46 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/teac.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3303712",
abstract = "We do a game-theoretic analysis of leader election,
under the assumption that each agent prefers to have
some leader than no leader at all. We show that it is
possible to obtain a fair Nash equilibrium, where each
agent has an equal probability of being elected leader,
in a completely connected network, in a bidirectional
ring, and a unidirectional ring, in the synchronous
setting. In the asynchronous setting, Nash equilibrium
is not quite the right solution concept. Rather, we
must consider ex post Nash equilibrium; this means that
we have a Nash equilibrium no matter what a scheduling
adversary does. We show that ex post Nash equilibrium
is attainable in the asynchronous setting in all the
networks we consider, using a protocol with bounded
running time. However, in the asynchronous setting, we
require that n \> 2. We show that we can get a fair
ex post \epsilon -Nash equilibrium if n =2 in the
asynchronous setting under some cryptographic
assumptions (specifically, the existence of a one-way
functions), using a commitment protocol. We then
generalize these results to a setting where we can have
deviations by a coalition of size k. In this case, we
can get what we call a fair k -resilient equilibrium in
a completely connected network if n \> 2 k; under
the same cryptographic assumptions, we can a get a k
-resilient equilibrium in a completely connected
network, unidirectional ring, or bidirectional ring if
n \> k. Finally, we show that under minimal
assumptions, not only do our protocols give a Nash
equilibrium, they also give a sequential equilibrium,
so players even play optimally off the equilibrium
path.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Economics and Computation",
journal-URL = "http://dl.acm.org/citation.cfm?id=2542174",
}
@Article{Abro:2019:LEE,
author = "Adeel Abro and Zhongliang Deng and Kamran Ali Memon",
title = "A Lightweight Elliptic-{Elgamal}-Based Authentication
Scheme for Secure Device-to-Device Communication",
journal = j-FUTURE-INTERNET,
volume = "11",
number = "5",
pages = "108",
day = "07",
month = may,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi11050108",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:06 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/11/5/108",
abstract = "Device-to-Device (D2D) is a major part of 5G that will
facilitate deployments with extended coverage where
devices can act as users or relays. These relays
normally act as decode and forward relays
(semi-intelligent devices) with limited computational
and storage capabilities. However, introducing such a
technology, where users can act as relays, presents a
wide range of security threats, in particular, rogue
relay devices or man in the middle attacks (M-I-T-M).
Second, passing fewer control messages is always
advisable when considering authenticity and secrecy. To
mitigate M-I-T-M and to reduce communication costs,
this paper presents a lightweight
elliptic-ElGamal-based authentication scheme using PKI
(FHEEP) in D2D communication. Pollard's rho and Baby
Step, Giant Step (BSGS) methods are used to evaluate
the authenticity and secrecy of our proposed scheme.
The communication cost is calculated based on the
comparative analysis indicating that our proposed
scheme outperforms the baseline protocol. The proposed
scheme can be used for any infrastructure architecture
that will enhance the security of any D2D settings with
better performance.",
acknowledgement = ack-nhfb,
remark = "Section Internet of Things.",
}
@Article{Aceto:2019:MME,
author = "Giuseppe Aceto and Domenico Ciuonzo and Antonio
Montieri and Antonio Pescap{\`e}",
title = "{MIMETIC}: {Mobile} encrypted traffic classification
using multimodal deep learning",
journal = j-COMP-NET-AMSTERDAM,
volume = "165",
number = "??",
pages = "Article 106944",
day = "24",
month = dec,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2019.106944",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Fri Aug 14 09:46:25 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128619304669",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Aditya:2019:ISF,
author = "B. P. Aditya and U. G. K. Avaneesh and K. Adithya and
Akshay Murthy and R. Sandeep and B. Kavyashree",
title = "Invisible Semi-Fragile Watermarking and Steganography
of Digital Videos for Content Authentication and Data
Hiding",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "19",
number = "3",
pages = "??--??",
year = "2019",
DOI = "https://doi.org/10.1142/S0219467819500153",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Tue Jul 23 06:58:38 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0219467819500153",
abstract = "In the current digital age, the piracy of digital
media content has become rampant. Illegal distribution
of movies and video clips on a global scale causes a
significant loss to the media industry. To prevent such
theft and distribution of content, we use a
watermarking technique for videos where copyright
information is hidden inside the original video in the
form of a watermark video. Using a video as the
watermark facilitates the user in hiding a large amount
of information. The watermarking scheme used in this
paper is semi-fragile, such that tampering of videos
can be detected with relative ease. To improve the
robustness of the watermark, we embed the watermark in
frequency domain, where we use DWT+DCT+SVD to embed the
watermark. The original video and watermark video are
transformed by using the DWT and DCT sequentially, then
the singular values of the watermark with some
embedding strength are added to the singular values of
the original video thus obtaining a watermarked video.
Some detection tools which are available today cannot
detect the watermark video inside the original video.
This method equalizes the frames of the watermark and
original video to reduce time consumed as well as
complexity. The effects of various attacks on the
watermarked video have been analyzed using the
calculated PSNR values.",
acknowledgement = ack-nhfb,
articleno = "1950015",
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Adrian:2019:IFS,
author = "David Adrian and Karthikeyan Bhargavan and Zakir
Durumeric and Pierrick Gaudry and Matthew Green and J.
Alex Halderman and Nadia Heninger and Drew Springall
and Emmanuel Thom{\'e} and Luke Valenta and Benjamin
VanderSloot and Eric Wustrow and Santiago
Zanella-B{\'e}guelin and Paul Zimmermann",
title = "Imperfect forward secrecy: how {Diffie--Hellman} fails
in practice",
journal = j-CACM,
volume = "62",
number = "1",
pages = "106--114",
month = jan,
year = "2019",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3292035",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Dec 20 07:08:41 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://cacm.acm.org/magazines/2019/1/233523/fulltext",
abstract = "We investigate the security of Diffie--Hellman key
exchange as used in popular Internet protocols and find
it to be less secure than widely believed. First, we
present Logjam, a novel flaw in TLS that lets a
man-in-the-middle downgrade connections to
``export-grade'' Diffie--Hellman. To carry out this
attack, we implement the number field sieve discrete
logarithm algorithm. After a week-long precomputation
for a specified 512-bit group, we can compute arbitrary
discrete logarithms in that group in about a minute. We
find that 82\% of vulnerable servers use a single
512-bit group, and that 8.4\% of Alexa Top Million
HTTPS sites are vulnerable to the attack. In response,
major browsers have changed to reject short groups. We
go on to consider Diffie--Hellman with 768- and
1024-bit groups. We estimate that even in the 1024-bit
case, the computations are plausible given nation-state
resources. A small number of fixed or standardized
groups are used by millions of servers; performing
precomputation for a single 1024-bit group would allow
passive eavesdropping on 18\% of popular HTTPS sites,
and a second group would allow decryption of traffic to
66\% of IPsec VPNs and 26\% of SSH servers. A close
reading of published NSA leaks shows that the agency's
attacks on VPNs are consistent with having achieved
such a break. We conclude that moving to stronger key
exchange methods should be a priority for the Internet
community.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Aghili:2019:LLT,
author = "Seyed Farhad Aghili and Hamid Mala and Mohammad
Shojafar and Pedro Peris-Lopez",
title = "{LACO}: Lightweight Three-Factor Authentication,
Access Control and Ownership Transfer Scheme for
E-Health Systems in {IoT}",
journal = j-FUT-GEN-COMP-SYS,
volume = "96",
number = "??",
pages = "410--424",
month = jul,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18331297",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Aghili:2019:SSL,
author = "Seyed Farhad Aghili and Hamid Mala and Pallavi Kaliyar
and Mauro Conti",
title = "{SecLAP}: Secure and lightweight {RFID} authentication
protocol for {Medical IoT}",
journal = j-FUT-GEN-COMP-SYS,
volume = "101",
number = "??",
pages = "621--634",
month = dec,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.07.004",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:02 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19304777",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Ahmad:2019:PQE,
author = "Awais Ahmad and Mudassar Ahmad and Muhammad Asif Habib
and Shahzad Sarwar and Junaid Chaudhry and Muhammad
Ahsan Latif and Saadat Hanif Dar and Muhammad Shahid",
title = "Parallel query execution over encrypted data in
database-as-a-service {(DaaS)}",
journal = j-J-SUPERCOMPUTING,
volume = "75",
number = "4",
pages = "2269--2288",
month = apr,
year = "2019",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-019-02831-8",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Oct 10 15:31:18 MDT 2019",
bibsource = "http://link.springer.com/journal/11227/75/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Akdogan:2019:SKA,
author = "Dilara Akdogan and Duygu Karaoglan Altop and Albert
Levi",
title = "Secure key agreement based on ordered biometric
features",
journal = j-COMP-NET-AMSTERDAM,
volume = "163",
number = "??",
pages = "Article 106885",
month = "????",
year = "2019",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Oct 14 17:22:05 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128618313975",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Aldaya:2019:MTA,
author = "Alejandro Cabrera Aldaya and Billy Bob Brumley and
Alejandro J. Cabrera Sarmiento and Santiago
S{\'a}nchez-Solano",
title = "Memory Tampering Attack on Binary {GCD} Based
Inversion Algorithms",
journal = j-INT-J-PARALLEL-PROG,
volume = "47",
number = "4",
pages = "621--640",
month = aug,
year = "2019",
CODEN = "IJPPE5",
DOI = "https://doi.org/10.1007/s10766-018-0610-x",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
ISSN-L = "0885-7458",
bibdate = "Fri Oct 11 08:37:52 MDT 2019",
bibsource = "http://link.springer.com/journal/10766/47/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Alghamdi:2019:RAM,
author = "Wael Alghamdi and Mohsen Rezvani and Hui Wu and Salil
S. Kanhere",
title = "Routing-Aware and Malicious Node Detection in a
Concealed Data Aggregation for {WSNs}",
journal = j-TOSN,
volume = "15",
number = "2",
pages = "18:1--18:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3293537",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Wed Oct 2 09:20:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3293537",
abstract = "Data aggregation in Wireless Sensor Networks (WSNs)
can effectively reduce communication overheads and
reduce the energy consumption of sensor nodes. A WSN
needs to be not only energy efficient but also secure.
Various attacks may make data aggregation unsecure. We
investigate the reliable and secure end-to-end data
aggregation problem considering selective forwarding
attacks and modification attacks in homogeneous WSNs,
and propose two data aggregation approaches. Our
approaches, namely Sign-Share and Sham-Share, use
secret sharing and signatures to allow aggregators to
aggregate the data without understanding the contents
of messages and the base station to verify the
aggregated data and retrieve the raw data from the
aggregated data. To the best of our knowledge, this is
the first lightweight en-routing malicious node
detection in concealed data aggregation. We have
performed an extensive simulation to compare our
approaches and the two state-of-the-art approaches PIP
and RCDA-HOMO. The simulation results show that both
Sign-Share and Sham-Share consume a reasonable amount
of time in processing and aggregating the data. The
simulation results show that our first approach
achieved an average network lifetime of 102.33\% over
PIP and average aggregation energy consumption of
74.93\%. In addition, it achieved an average
aggregation processing time and sensor data processing
time of 95.4\% and 90.34\% over PIP and 98.7\% and
92.07\% over RCDA-HOMO, respectively, and it achieved
an average network delay of 71.95\% over PIP. Although
RCDA-HOMO is completely a different technique, a
comparison was performed to measure the computational
overhead.",
acknowledgement = ack-nhfb,
articleno = "18",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Ali:2019:PRD,
author = "Zulfiqar Ali and Muhammad Imran and Sally McClean and
Naveed Khan and Muhammad Shoaib",
title = "Protection of records and data authentication based on
secret shares and watermarking",
journal = j-FUT-GEN-COMP-SYS,
volume = "98",
number = "??",
pages = "331--341",
month = sep,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18328802",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Allender:2019:NIN,
author = "Eric Allender and Shuichi Hirahara",
title = "New Insights on the (Non-)Hardness of Circuit
Minimization and Related Problems",
journal = j-TOCT,
volume = "11",
number = "4",
pages = "27:1--27:??",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3349616",
ISSN = "1942-3454 (print), 1942-3462 (electronic)",
ISSN-L = "1942-3454",
bibdate = "Tue Oct 22 10:25:11 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toct.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3349616",
abstract = "The Minimum Circuit Size Problem (MCSP) and a related
problem (MKTP) that deal with time-bounded Kolmogorov
complexity are prominent candidates for NP-intermediate
status. We show that, under very modest cryptographic
assumptions (such as the existence of one-way
functions), the problem of approximating the minimum
circuit size (or time-bounded Kolmogorov complexity)
within a factor of n$^{1 - o (1)}$ is indeed
NP-intermediate. To the best of our knowledge, these
problems are the first natural NP-intermediate problems
under the existence of an arbitrary one-way function.
Our technique is quite general; we use it also to show
that approximating the size of the largest clique in a
graph within a factor of n$^{1 - o (1)}$ is also
NP-intermediate unless NP \subseteq P/poly. We also
prove that MKTP is hard for the complexity class DET
under non-uniform NC$^0$ reductions. This is
surprising, since prior work on MCSP and MKTP had
highlighted weaknesses of ``local'' reductions such as
\leq $^{NC 0}$ $_m$. We exploit this local reduction to
obtain several new consequences: --- MKTP is not in
AC$^0$ [ p ]. --- Circuit size lower bounds are
equivalent to hardness of a relativized version
MKTP$^A$ of MKTP under a class of uniform AC$^0$
reductions, for a significant class of sets A. ---
Hardness of MCSP$^A$ implies hardness of MCSP$^A$ for a
significant class of sets A. This is the first result
directly relating the complexity of MCSP$^A$ and
MCSP$^A$, for any A.",
acknowledgement = ack-nhfb,
articleno = "27",
fjournal = "ACM Transactions on Computation Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1190",
}
@Article{Altakrori:2019:AAA,
author = "Malik H. Altakrori and Farkhund Iqbal and Benjamin C.
M. Fung and Steven H. H. Ding and Abdallah Tubaishat",
title = "{Arabic} Authorship Attribution: an Extensive Study on
{Twitter} Posts",
journal = j-TALLIP,
volume = "18",
number = "1",
pages = "5:1--5:??",
month = jan,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3236391",
ISSN = "2375-4699 (print), 2375-4702 (electronic)",
ISSN-L = "2375-4699",
bibdate = "Wed Oct 2 10:34:32 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tallip.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3236391",
abstract = "Law enforcement faces problems in tracing the true
identity of offenders in cybercrime investigations.
Most offenders mask their true identity, impersonate
people of high authority, or use identity deception and
obfuscation tactics to avoid detection and
traceability. To address the problem of anonymity,
authorship analysis is used to identify individuals by
their writing styles without knowing their actual
identities. Most authorship studies are dedicated to
English due to its widespread use over the Internet,
but recent cyber-attacks such as the distribution of
Stuxnet indicate that Internet crimes are not limited
to a certain community, language, culture, ideology, or
ethnicity. To effectively investigate cybercrime and to
address the problem of anonymity in online
communication, there is a pressing need to study
authorship analysis of languages such as Arabic,
Chinese, Turkish, and so on. Arabic, the focus of this
study, is the fourth most widely used language on the
Internet. This study investigates authorship of Arabic
discourse/text, especially tiny text, Twitter posts. We
benchmark the performance of a profile-based approach
that uses n-grams as features and compare it with
state-of-the-art instance-based classification
techniques. Then we adapt an event-visualization tool
that is developed for English to accommodate both
Arabic and English languages and visualize the result
of the attribution evidence. In addition, we
investigate the relative effect of the training set,
the length of tweets, and the number of authors on
authorship classification accuracy. Finally, we show
that diacritics have an insignificant effect on the
attribution process and part-of-speech tags are less
effective than character-level and word-level
n-grams.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Asian and Low-Resource Language
Information Processing (TALLIP)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1521",
}
@PhdThesis{Alzahrani:2019:SAC,
author = "Naif Saeed Alzahrani",
title = "A Secure Anti-Counterfeiting System Using Near Field
Communication, Public Key Cryptography, Blockchain, and
{Bayesian} Games",
type = "{Ph.D.}",
school = "Portland State University",
address = "Portland, OR, USA",
pages = "176",
year = "2019",
ISBN = "1-08-830493-1",
ISBN-13 = "978-1-08-830493-8",
bibdate = "Fri Nov 29 08:59:46 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://search.proquest.com/pqdtglobal/docview/2305527274",
abstract = "Counterfeit products, especially in the pharmaceutical
sector, have plagued the international community for
decades [56]. To combat this problem, many
anti-counterfeiting approaches have been proposed
[43,79,88,99]. They use either Radio Frequency
Identification (RFID) or Near Field Communication (NFC)
physical tags affixed to the products. Current
anti-counterfeiting approaches detect two
counterfeiting attacks: (1) modifications to a
product's tag details, such as changing the expiration
date; and (2) cloning of a genuine product's details to
reuse on counterfeit products. In addition, these
anti-counterfeiting approaches track-and-trace the
physical locations of products as the products flow
through supply chains.",
acknowledgement = ack-nhfb,
advisor = "Nirupama Bulusu",
keywords = "0984:Computer science; Anti-Counterfeiting; Bayesian
Games; Blockchain; Computer science; Consensus
protocols; Near Field Communication; Public Key
Cryptography",
ris-m1 = "13900130",
}
@Article{Anderson:2019:QCN,
author = "Mark Anderson",
title = "Quantum cryptography needs a reboot: A failed security
product could someday power large-scale quantum
computing --- [News]",
journal = j-IEEE-SPECTRUM,
volume = "56",
number = "10",
pages = "9--10",
month = oct,
year = "2019",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2019.8847578",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
}
@Article{Anonymous:2019:GES,
author = "Anonymous",
title = "Guest editorial: Special Issue on {Information Systems
Security, Privacy, Security and Cryptography (ICISSP
2017 and SECRYPT 2017)}",
journal = j-COMPUT-SECUR,
volume = "86",
number = "??",
pages = "419--419",
month = sep,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404819301233",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Anonymous:2019:HCC,
author = "Anonymous",
title = "The History of Cryptography and Codes",
journal = j-BRITISH-J-HIST-MATH,
volume = "34",
number = "1",
pages = "71--72",
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1080/17498430.2018.1542200",
ISSN = "2637-5494",
ISSN-L = "????",
bibdate = "Mon Feb 4 14:38:29 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bshm.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.tandfonline.com/doi/full/10.1080/17498430.2018.1542200",
acknowledgement = ack-nhfb,
ajournal = "Br. J. Hist. Math.",
fjournal = "British Journal for the History of Mathematics",
journal-URL = "http://www.tandfonline.com/loi/tbsh21",
onlinedate = "08 Jan 2019",
}
@Article{Anonymous:2019:PBT,
author = "Anonymous",
title = "Preface: Blockchain: From Technology to Solutions",
journal = j-IBM-JRD,
volume = "63",
number = "2--3",
pages = "1--2",
month = mar # "\slash " # may,
year = "2019",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/JRD.2019.2912087",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Thu Jul 25 15:06:42 2019",
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/ibmjrd.bib",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
keywords = "Blockchain; Computer architecture; Cryptography;
Fabrics; History; Smart contracts; Supply chains",
}
@Article{Arab:2019:IEM,
author = "Alireza Arab and Mohammad Javad Rostami and Behnam
Ghavami",
title = "An image encryption method based on chaos system and
{AES} algorithm",
journal = j-J-SUPERCOMPUTING,
volume = "75",
number = "10",
pages = "6663--6682",
month = oct,
year = "2019",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-019-02878-7",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Oct 10 15:31:16 MDT 2019",
bibsource = "http://link.springer.com/journal/11227/75/10;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/content/pdf/10.1007/s11227-019-02878-7.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Araghi:2019:EHI,
author = "Tanya Koohpayeh Araghi and Azizah Abd Manaf",
title = "An enhanced hybrid image watermarking scheme for
security of medical and non-medical images based on
{DWT} and {$2$-D SVD}",
journal = j-FUT-GEN-COMP-SYS,
volume = "101",
number = "??",
pages = "1223--1246",
month = dec,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.07.064",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:02 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19310842",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Arfaoui:2019:CAA,
author = "Amel Arfaoui and Ali Kribeche and Sidi-Mohammed
Senouci",
title = "Context-aware anonymous authentication protocols in
the {Internet of Things} dedicated to e-health
applications",
journal = j-COMP-NET-AMSTERDAM,
volume = "159",
number = "??",
pages = "23--36",
day = "4",
month = aug,
year = "2019",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Oct 14 17:19:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128619300465",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Arias-Cabarcos:2019:SAA,
author = "Patricia Arias-Cabarcos and Christian Krupitzer and
Christian Becker",
title = "A Survey on Adaptive Authentication",
journal = j-COMP-SURV,
volume = "52",
number = "4",
pages = "80:1--80:??",
month = sep,
year = "2019",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3336117",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Tue Oct 29 09:52:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3336117",
abstract = "Adaptive Authentication allows a system to dynamically
select the best mechanism(s) for authenticating a user
depending on contextual factors, such as location,
proximity to devices, and other attributes. Though this
technology has the potential to change the current
password-dominated authentication landscape, research
to date has not led to practical solutions that
transcend to our daily lives. Motivated to find out how
to improve adaptive authentication design, we provide a
structured survey of the existing literature to date
and analyze it to identify and discuss current research
challenges and future directions.",
acknowledgement = ack-nhfb,
articleno = "80",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Misc{Armasu:2019:IFA,
author = "Lucian Armasu",
title = "{Intel} Follows {AMD}'s Lead on Full Memory
Encryption",
howpublished = "Web site",
day = "27",
month = may,
year = "2019",
bibdate = "Mon Oct 07 10:58:17 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.tomshardware.com/news/intel-mktme-amd-memory-encryption,39467.html",
abstract = "Intel announced a new patchset for the next version of
the Linux kernel that will enable Multi-Key Total
Memory Encryption (MKTME). The feature is an extension
of Intel's Total Memory Encryption that brings support
for encrypting multiple pages in memory with different
encryption keys (up to 64 in total).",
acknowledgement = ack-nhfb,
remark = "From the article: ``What about Spectre/MDS Attacks? Do
these encryption features protect against side-channel
attacks such as the Spectre and MDS family? No, not so
much. Researchers have warned before that memory
encryption is not an effective way of stopping
side-channel attacks, and in fact blocking or
restricting memory access to certain parts of the
system is a far better way to prevent this type of
attack from happening. Researchers have also found
several flaws in AMD's SEV feature that allow attackers
to steal data. Even if Intel's feature comes with a few
improvements, it likely won't stand the test of time,
especially considering that Intel's chips seem to be
more vulnerable to side-channel attacks than AMD's.''",
}
@Article{Athmani:2019:EED,
author = "Samir Athmani and Azeddine Bilami and Djallel Eddine
Boubiche",
title = "{EDAK}: An Efficient Dynamic Authentication and Key
Management Mechanism for heterogeneous {WSNs}",
journal = j-FUT-GEN-COMP-SYS,
volume = "92",
number = "??",
pages = "789--799",
month = mar,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Feb 5 08:15:51 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17315388",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Atighehchi:2019:GHC,
author = "Kevin Atighehchi and Loubna Ghammam and Morgan Barbier
and Christophe Rosenberger",
title = "{GREYC-Hashing}: Combining biometrics and secret for
enhancing the security of protected templates",
journal = j-FUT-GEN-COMP-SYS,
volume = "101",
number = "??",
pages = "819--830",
month = dec,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.07.022",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:02 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1833125X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Avoine:2019:SDB,
author = "Gildas Avoine and Muhammed Ali Bing{\"o}l and Ioana
Boureanu and Srdjan Capkun and Gerhard Hancke and
S{\"u}leyman Kardas and Chong Hee Kim and C{\'e}dric
Lauradoux and Benjamin Martin and Jorge Munilla and
Alberto Peinado and Kasper Bonne Rasmussen and Dave
Singel{\'e}e and Aslan Tchamkerten and Rolando
Trujillo-Rasua and Serge Vaudenay",
title = "Security of Distance-Bounding: a Survey",
journal = j-COMP-SURV,
volume = "51",
number = "5",
pages = "94:1--94:??",
month = jan,
year = "2019",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3264628",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Aug 31 09:04:36 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3264628",
abstract = "Distance-bounding protocols allow a verifier to both
authenticate a prover and evaluate whether the latter
is located in his vicinity. These protocols are of
particular interest in contactless systems, e.g.,
electronic payment or access control systems, which are
vulnerable to distance-based frauds. This survey
analyzes and compares in a unified manner many existing
distance-bounding protocols with respect to several key
security and complexity features.",
acknowledgement = ack-nhfb,
articleno = "94",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Babamir:2019:DDB,
author = "Faezeh Sadat Babamir and Murvet Kirci",
title = "Dynamic digest based authentication for client-server
systems using biometric verification",
journal = j-FUT-GEN-COMP-SYS,
volume = "101",
number = "??",
pages = "112--126",
month = dec,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.05.025",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:02 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19304480",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Bai:2019:HAF,
author = "Xu Bai and Jiajia Yang and Qiong Dai and Zhaolin
Chen",
title = "A hybrid {ARM-FPGA} cluster for cryptographic
algorithm acceleration",
journal = j-CCPE,
volume = "31",
number = "24",
pages = "e5257:1--e5257:??",
day = "25",
month = dec,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.5257",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Wed Mar 31 07:52:11 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 August 2019",
}
@Article{Bai:2019:LMD,
author = "Tong Bai and Jinzhao Lin and Guoquan Li and Huiqian
Wang and Peng Ran and Zhangyong Li and Dan Li and Yu
Pang and Wei Wu and Gwanggil Jeon",
title = "A lightweight method of data encryption in {BANs}
using electrocardiogram signal",
journal = j-FUT-GEN-COMP-SYS,
volume = "92",
number = "??",
pages = "800--811",
month = mar,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2018.01.031",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Feb 5 08:15:51 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17310361",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Baillot:2019:ICC,
author = "Patrick Baillot and Gilles Barthe and Ugo {Dal Lago}",
title = "Implicit Computational Complexity of Subrecursive
Definitions and Applications to Cryptographic Proofs",
journal = j-J-AUTOM-REASON,
volume = "63",
number = "4",
pages = "813--855",
month = dec,
year = "2019",
CODEN = "JAREEW",
DOI = "https://doi.org/10.1007/s10817-019-09530-2",
ISSN = "0168-7433 (print), 1573-0670 (electronic)",
ISSN-L = "0168-7433",
bibdate = "Fri Oct 11 15:17:40 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jautomreason.bib",
URL = "http://link.springer.com/article/10.1007/s10817-019-09530-2",
acknowledgement = ack-nhfb,
fjournal = "Journal of Automated Reasoning",
journal-URL = "http://link.springer.com/journal/10817",
}
@Article{Bala:2019:SAG,
author = "Suman Bala and Gaurav Sharma and Himani Bansal and
Tarunpreet Bhatia",
title = "On the Security of Authenticated Group Key Agreement
Protocols",
journal = j-SCPE,
volume = "20",
number = "1",
pages = "93--99",
month = "????",
year = "2019",
CODEN = "????",
ISSN = "1895-1767",
ISSN-L = "1895-1767",
bibdate = "Thu Oct 3 07:39:16 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/scpe.bib",
URL = "https://www.scpe.org/index.php/scpe/article/view/1440",
acknowledgement = ack-nhfb,
fjournal = "Scalable Computing: Practice and Experience",
journal-URL = "http://www.scpe.org/",
}
@Article{Balagurusamy:2019:CA,
author = "V. S. K. Balagurusamy and C. Cabral and S.
Coomaraswamy and E. Delamarche and D. N. Dillenberger
and G. Dittmann and D. Friedman and O. G{\"o}k{\c{c}}e
and N. Hinds and J. Jelitto and A. Kind and A. D. Kumar
and F. Libsch and J. W. Ligman and S. Munetoh and C.
Narayanaswami and A. Narendra and A. Paidimarri and M.
A. P. Delgado and J. Rayfield and C. Subramanian and R.
Vaculin",
title = "Crypto anchors",
journal = j-IBM-JRD,
volume = "63",
number = "2--3",
pages = "4:1--4:12",
month = mar # "\slash " # may,
year = "2019",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/JRD.2019.2900651",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Thu Jul 25 15:06:42 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "Authentication; Blockchain; Cryptography; Databases;
Supply chains",
}
@Article{Bana:2019:VMC,
author = "Gergei Bana and Rohit Chadha and Ajay Kumar Eeralla
and Mitsuhiro Okada",
title = "Verification Methods for the Computationally Complete
Symbolic Attacker Based on Indistinguishability",
journal = j-TOCL,
volume = "21",
number = "1",
pages = "2:1--2:??",
month = oct,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3343508",
ISSN = "1529-3785 (print), 1557-945X (electronic)",
ISSN-L = "1529-3785",
bibdate = "Wed Oct 23 06:27:14 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tocl.bib",
abstract = "In recent years, a new approach has been developed for
verifying security protocols with the aim of combining
the benefits of symbolic attackers and the benefits of
unconditional soundness: the technique of the
computationally complete symbolic attacker of Bana and
Comon (BC) [8]. In this article, we argue that the real
breakthrough of this technique is the recent
introduction of its version for indistinguishability
[9], because, with the extensions we introduce here,
for the first time, there is a computationally sound
symbolic technique that is syntactically strikingly
simple, to which translating standard computational
security notions is a straightforward matter, and that
can be effectively used for verification of not only
equivalence properties but trace properties of
protocols as well. We first fully develop the core
elements of this newer version by introducing several
new axioms. We illustrate the power and the diverse use
of the introduced axioms on simple examples first. We
introduce an axiom expressing the Decisional
Diffie--Hellman property. We analyze the
Diffie--Hellman key exchange, both in its simplest form
and an authenticated version as well. We provide
computationally sound verification of real-or-random
secrecy of the Diffie--Hellman key exchange protocol
for multiple sessions, without any restrictions on the
computational implementation other than the DDH
assumption. We also show authentication for a
simplified version of the station-to-station protocol
using UF-CMA assumption for digital signatures.
Finally, we axiomatize IND-CPA, IND-CCA1, and IND-CCA2
security properties and illustrate their usage. We have
formalized the axiomatic system in an interactive
theorem prover, Coq, and have machine-checked the
proofs of various auxiliary theorems and security
properties of Diffie--Hellman and station-to-station
protocol.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Computational Logic",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J773",
}
@Article{Barbareschi:2019:PBM,
author = "Mario Barbareschi and Alessandra {De Benedictis} and
Erasmo {La Montagna} and Antonino Mazzeo and Nicola
Mazzocca",
title = "A {PUF}-based mutual authentication scheme for
Cloud-Edges {IoT} systems",
journal = j-FUT-GEN-COMP-SYS,
volume = "101",
number = "??",
pages = "246--261",
month = dec,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.06.012",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:02 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19301293",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Bard:2019:DWG,
author = "Gregory V. Bard",
title = "Determining whether a given cryptographic function is
a permutation of another given cryptographic function
--- a problem in intellectual property",
journal = j-THEOR-COMP-SCI,
volume = "800",
number = "??",
pages = "3--14",
day = "31",
month = dec,
year = "2019",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Nov 19 07:57:39 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397519306395",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@TechReport{Barker:2019:TUC,
author = "Elaine Barker and Allen Roginsky",
title = "Transitioning the Use of Cryptographic Algorithms and
Key Lengths",
type = "NIST Special Publication",
number = "800-131A Revision 2",
institution = pub-NIST,
address = pub-NIST:adr,
pages = "iv + 27",
month = mar,
year = "2019",
DOI = "https://doi.org/10.6028/NIST.SP.800-131Ar2",
bibdate = "Thu Jun 16 06:53:49 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "The National Institute of Standards and Technology
(NIST) provides cryptographic key management guidance
for defining and implementing appropriate key
management procedures, using algorithms that adequately
protect sensitive information, and planning ahead for
possible changes in the use of cryptography because of
algorithm breaks or the availability of more powerful
computing techniques. NIST Special Publication (SP)
800- 57, Part 1, Recommendation for Key Management:
General, includes a general approach for transitioning
from one algorithm or key length to another. This
Recommendation (SP 800-131A) provides more specific
guidance for transitions to the use of stronger
cryptographic keys and more robust algorithms",
acknowledgement = ack-nhfb,
keywords = "cryptographic algorithm; digital signatures;
encryption; hash function; key agreement; key
derivation functions; key management; key transport;
key wrapping; message authentication codes;
post-quantum algorithms; random number generation;
security strength; transition",
}
@Article{Barthe:2019:SLN,
author = "Gilles Barthe and Gustavo Betarte and Juan Diego Campo
and Carlos Luna",
title = "System-Level Non-interference of Constant-Time
Cryptography. {Part I}: Model",
journal = j-J-AUTOM-REASON,
volume = "63",
number = "1",
pages = "1--51",
month = jun,
year = "2019",
CODEN = "JAREEW",
DOI = "https://doi.org/10.1007/s10817-017-9441-5",
ISSN = "0168-7433 (print), 1573-0670 (electronic)",
ISSN-L = "0168-7433",
bibdate = "Fri Oct 11 15:17:38 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jautomreason.bib",
URL = "http://link.springer.com/article/10.1007/s10817-017-9441-5",
acknowledgement = ack-nhfb,
fjournal = "Journal of Automated Reasoning",
journal-URL = "http://link.springer.com/journal/10817",
}
@Article{Bartoli:2019:VEW,
author = "Alberto Bartoli and Eric Medvet and Andrea {De
Lorenzo} and Fabiano Tarlao",
title = "Viewpoint: Enterprise wi-fi: we need devices that are
secure by default",
journal = j-CACM,
volume = "62",
number = "5",
pages = "33--35",
month = may,
year = "2019",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Apr 27 18:22:12 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://cacm.acm.org/magazines/2019/5/236421/fulltext",
abstract = "Seeking to increase awareness of WPA2 Enterprise
network security technology flaws and reduce risk to
users.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Baskaran:2019:TEL,
author = "Annie Gilda Roselin Arockia Baskaran and Priyadarsi
Nanda and Surya Nepal and Sean He",
title = "Testbed evaluation of Lightweight Authentication
Protocol {(LAUP)} for {6LoWPAN} wireless sensor
networks",
journal = j-CCPE,
volume = "31",
number = "23",
pages = "e4868:1--e4868:??",
day = "10",
month = dec,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4868",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Wed Mar 31 07:52:10 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "27 August 2018",
}
@Article{Batina:2019:ISI,
author = "Lejla Batina and Sherman S. M. Chow and Gerhard Hancke
and Zhe Liu",
title = "Introduction to the Special Issue on Cryptographic
Engineering for {Internet of Things}: Security
Foundations, Lightweight Solutions, and Attacks",
journal = j-TECS,
volume = "18",
number = "3",
pages = "22:1--22:??",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3322641",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:43 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3322641",
acknowledgement = ack-nhfb,
articleno = "22",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Belkhouja:2019:BBA,
author = "Taha Belkhouja and Xiaojiang Du and Amr Mohamed and
Abdulla K. Al-Ali and Mohsen Guizani",
title = "Biometric-based authentication scheme for Implantable
Medical Devices during emergency situations",
journal = j-FUT-GEN-COMP-SYS,
volume = "98",
number = "??",
pages = "109--119",
month = sep,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18325792",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Belleville:2019:ASP,
author = "Nicolas Belleville and Damien Courouss{\'e} and Karine
Heydemann and Henri-Pierre Charles",
title = "Automated Software Protection for the Masses Against
Side-Channel Attacks",
journal = j-TACO,
volume = "15",
number = "4",
pages = "47:1--47:??",
month = jan,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3281662",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Tue Jan 8 17:20:00 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
abstract = "We present an approach and a tool to answer the need
for effective, generic, and easily applicable
protections against side-channel attacks. The
protection mechanism is based on code polymorphism, so
that the observable behaviour of the protected
component is variable and unpredictable to the
attacker. Our approach combines lightweight specialized
runtime code generation with the optimization
capabilities of static compilation. It is extensively
configurable. Experimental results show that programs
secured by our approach present strong security levels
and meet the performance requirements of constrained
systems.",
acknowledgement = ack-nhfb,
articleno = "47",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Bellovin:2019:LI,
author = "S. M. Bellovin",
title = "Layered Insecurity",
journal = j-IEEE-SEC-PRIV,
volume = "17",
number = "3",
pages = "96--95",
month = may # "\slash " # jun,
year = "2019",
DOI = "https://doi.org/10.1109/MSEC.2019.2906807",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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; Special
issues and sections",
}
@Article{Bendiab:2019:FNF,
author = "Keltoum Bendiab and Stavros Shiaeles and Samia
Boucherkha and Bogdan Ghita",
title = "{FCMDT}: a novel fuzzy cognitive maps dynamic trust
model for cloud federated identity management",
journal = j-COMPUT-SECUR,
volume = "86",
number = "??",
pages = "270--290",
month = sep,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818312252",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Benhamouda:2019:SPD,
author = "F. Benhamouda and S. Halevi and T. Halevi",
title = "Supporting private data on {Hyperledger Fabric} with
secure multiparty computation",
journal = j-IBM-JRD,
volume = "63",
number = "2--3",
pages = "3:1--3:8",
month = mar # "\slash " # may,
year = "2019",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/JRD.2019.2913621",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Thu Jul 25 15:06:42 2019",
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/ibmjrd.bib",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
keywords = "Blockchain; Computer architecture; Cryptography;
Fabrics; Peer-to-peer computing; Smart contracts",
}
@Article{Benyamina:2019:ANE,
author = "Zakarya Benyamina and Khelifa Benahmed and Fateh
Bounaama",
title = "{ANEL}: a novel efficient and lightweight
authentication scheme for vehicular ad hoc networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "164",
number = "??",
pages = "Article 106899",
day = "9",
month = dec,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2019.106899",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Fri Aug 14 09:46:24 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128619306012",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Bingol:2019:EPP,
author = "Muhammed Ali Bing{\"o}l and Osman Bi{\c{c}}er and
Mehmet Sabir Kiraz and Albert Levi",
title = "An Efficient 2-Party Private Function Evaluation
Protocol Based on Half Gates",
journal = j-COMP-J,
volume = "62",
number = "4",
pages = "598--613",
month = apr,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy136",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Apr 2 12:10:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/4/598/5259181",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Blais:2019:DTL,
author = "Eric Blais and Cl{\'e}ment L. Canonne and Tom Gur",
title = "Distribution Testing Lower Bounds via Reductions from
Communication Complexity",
journal = j-TOCT,
volume = "11",
number = "2",
pages = "6:1--6:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3305270",
ISSN = "1942-3454 (print), 1942-3462 (electronic)",
ISSN-L = "1942-3454",
bibdate = "Tue Oct 22 10:25:10 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toct.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3305270",
abstract = "We present a new methodology for proving distribution
testing lower bounds, establishing a connection between
distribution testing and the simultaneous message
passing (SMP) communication model. Extending the
framework of Blais, Brody, and Matulef [15], we show a
simple way to reduce (private-coin) SMP problems to
distribution testing problems. This method allows us to
prove new distribution testing lower bounds, as well as
to provide simple proofs of known lower bounds. Our
main result is concerned with testing identity to a
specific distribution, p, given as a parameter. In a
recent and influential work, Valiant and Valiant [55]
showed that the sample complexity of the aforementioned
problem is closely related to the l$_{2 / 3}$
-quasinorm of p. We obtain alternative bounds on the
complexity of this problem in terms of an arguably more
intuitive measure and using simpler proofs. More
specifically, we prove that the sample complexity is
essentially determined by a fundamental operator in the
theory of interpolation of Banach spaces, known as
Peetre's K-functional. We show that this quantity is
closely related to the size of the effective support of
p (loosely speaking, the number of supported elements
that constitute the vast majority of the mass of p ).
This result, in turn, stems from an unexpected
connection to functional analysis and refined
concentration of measure inequalities, which arise
naturally in our reduction.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Transactions on Computation Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1190",
}
@Article{Boche:2019:SMT,
author = "Holger Boche and Minglai Cai and Janis N{\"o}tzel and
Christian Deppe",
title = "Secret message transmission over quantum channels
under adversarial quantum noise: Secrecy capacity and
super-activation",
journal = j-J-MATH-PHYS,
volume = "60",
number = "6",
pages = "062202",
month = jun,
year = "2019",
CODEN = "JMAPAQ",
DOI = "https://doi.org/10.1063/1.5019461",
ISSN = "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
ISSN-L = "0022-2488",
bibdate = "Fri Sep 6 15:08:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jmathphys2015.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Mathematical Physics",
journal-URL = "http://jmp.aip.org/",
}
@Article{Bogatov:2019:CEO,
author = "Dmytro Bogatov and George Kollios and Leonid Reyzin",
title = "A comparative evaluation of order-revealing encryption
schemes and secure range-query protocols",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "12",
number = "8",
pages = "933--947",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.14778/3324301.3324309",
ISSN = "2150-8097",
bibdate = "Wed Oct 2 06:49:01 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Database query evaluation over encrypted data can
allow database users to maintain the privacy of their
data while outsourcing data processing.
Order-Preserving Encryption (OPE) and Order-Revealing
Encryption (ORE) were designed to enable efficient
query execution, but provide only partial privacy. More
private protocols, based on Searchable Symmetric
Encryption (SSE), Oblivious RAM (ORAM) or custom
encrypted data structures, have also been designed. In
this paper, we develop a framework to provide the first
comprehensive comparison among a number of range query
protocols that ensure varying levels of privacy of user
data. We evaluate five ORE-based and five generic range
query protocols. We analyze and compare them both
theoretically and experimentally and measure their
performance over database indexing and query
evaluation. We report not only execution time but also
I/O performance, communication amount, and usage of
cryptographic primitive operations. Our comparison
reveals some interesting insights concerning the
relative security and performance of these approaches
in database settings.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Boneh:2019:ACK,
author = "Dan Boneh",
title = "Attacking cryptographic key exchange with
precomputation: technical perspective",
journal = j-CACM,
volume = "62",
number = "1",
pages = "105--105",
month = jan,
year = "2019",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3292033",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Dec 20 07:08:41 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://cacm.acm.org/magazines/2019/1/233522/fulltext",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Bos:2019:ACI,
author = "J. W. Bos and S. J. Friedberger",
title = "Arithmetic Considerations for Isogeny-Based
Cryptography",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "7",
pages = "979--990",
month = jul,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2851238",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 11 09:46:20 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "arithmetic; arithmetic considerations; arithmetic
techniques; Computer architecture; cryptographic
protocols; curve models; digital arithmetic; efficient
addition-subtraction chains; efficient arithmetic
modulo; efficient chains; elliptic curve scalar
multiplication; Elliptic curves; isogeny-based
cryptography; Montgomery curves; Montgomery reduction;
NIST; Optimization; post-quantum public-key arena;
Protocols; Public key cryptography; quadratic extension
field; scalar multiplication arithmetic; SIDH setting;
special shape; supersingular isogeny Diffie-Hellman
key-exchange protocol; systematic overview; twisted
Edwards curves",
}
@Misc{Boudot:2019:BFD,
author = "Fabrice Boudot and Pierrick Gaudry and Aurore
Guillevic and Nadia Heninger and Emmanuel Thom{\'e} and
Paul Zimmermann",
title = "795-bit factoring and discrete logarithms",
howpublished = "Cado-nfs-discuss mailing list.",
day = "2",
month = dec,
year = "2019",
bibdate = "Tue Dec 03 07:19:25 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://lists.gforge.inria.fr/pipermail/cado-nfs-discuss/2019-December/001139.html",
acknowledgement = ack-nhfb,
remark = "The authors announced the simultaneous cracking of the
challenges RSA-240 (795 bits) and DLP-240 (768 bits),
at a cost of about 4000 core years on Intel Xeon Gold
6130 CPUs. They write: ``More details will be given in
a forthcoming scientific publication.''",
}
@InProceedings{Breitner:2019:BNS,
author = "Joachum Breitner and Nadia Heninger",
editor = "I. Godberg and T. Moore",
booktitle = "{Financial Cryptography and Data Security: 23rd
International Conference, FC 2019, Frigate Bay, St.
Kitts and Nevis, February 18--22, 2019, Revised
Selected Papers}",
title = "Biased nonce sense: lattice attacks against weak
{ECDSA} signatures in cryptocurrencies.",
volume = "11598",
publisher = pub-SV,
address = pub-SV:adr,
pages = "3--20",
year = "2019",
DOI = "https://doi.org/10.1007/978-3-030-32101-7_1",
bibdate = "Fri Jul 29 07:36:25 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = ser-LNCS,
URL = "https://www.springerprofessional.de/en/biased-nonce-sense-lattice-attacks-against-weak-ecdsa-signatures/17265526",
acknowledgement = ack-nhfb,
}
@Article{Bronzino:2019: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-POMACS,
volume = "3",
number = "3",
pages = "56:1--56:25",
month = dec,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3366704",
ISSN = "2476-1249",
ISSN-L = "2476-1249",
bibdate = "Mon Mar 29 10:31:32 MDT 2021",
bibsource = "http://portal.acm.org/https://www.math.utah.edu/pub/tex/bib/pomacs.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://dl.acm.org/doi/10.1145/3366704",
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 resolution) for
encrypted streaming video services. Our paper builds on
previous work, but extends it in several ways. First,
the models work in deployment settings where the video
sessions and segments must be identified from a mix of
traffic and the time precision of the collected traffic
statistics is more coarse (e.g., due to aggregation).
Second, we develop a single composite model that works
for a range of different services (i.e., Netflix,
YouTube, Amazon, and Twitch), as opposed to just a
single service. Third, unlike many previous models, our
models perform predictions at finer granularity (e.g.,
the precise startup delay instead of just detecting
short versus long delays) allowing to draw better
conclusions on the ongoing streaming quality. Fourth,
we demonstrate the models are practical through a
16-month deployment in 66 homes and provide new
insights about the relationships between Internet
``speed'' and the quality of the corresponding video
streams, for a variety of services; we find that higher
speeds provide only minimal improvements to startup
delay and resolution.",
acknowledgement = ack-nhfb,
articleno = "56",
fjournal = "Proceedings of the ACM on Measurement and Analysis of
Computing Systems (POMACS)",
journal-URL = "https://dl.acm.org/loi/pomacs",
}
@Article{Broumandnia:2019:MCM,
author = "Ali Broumandnia",
title = "The {$3$D} modular chaotic map to digital color image
encryption",
journal = j-FUT-GEN-COMP-SYS,
volume = "99",
number = "??",
pages = "489--499",
month = oct,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19300214",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Bruguera:2019:GEI,
author = "J. D. Bruguera and F. de Dinechin",
title = "{Guest Editors} Introduction: Special Section on
Computer Arithmetic",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "7",
pages = "951--952",
month = jul,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2019.2918447",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 11 09:46:20 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Cryptography; Digital arithmetic; Mathematics;
Software algorithms; Special issues and sections",
}
@InProceedings{Buhren:2019:IUP,
author = "Robert Buhren and Christian Werling and Jean-Pierre
Seifert",
booktitle = "Proceedings of the {2019 ACM SIGSAC Conference on
Computer and Communications Security --- CCS '19}",
title = "Insecure Until Proven Updated: Analyzing {AMD SEV}'s
Remote Attestation",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "1--13",
year = "2019",
DOI = "https://doi.org/10.1145/3319535.3354216",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://arxiv.org/abs/1908.11680",
abstract = "Customers of cloud services have to trust the cloud
providers, as they control the building blocks that
form the cloud. This includes the hypervisor enabling
the sharing of a single hardware platform among
multiple tenants. AMD Secure Encrypted Virtualization
(SEV) claims a new level of protection in cloud
scenarios. AMD SEV encrypts the main memory of virtual
machines with VM-specific keys, thereby denying the
higher-privileged hypervisor access to a guest's
memory. To enable the cloud customer to verify the
correct deployment of his virtual machine, SEV
additionally introduces a remote attestation
protocol.This paper analyzes the firmware components
that implement the SEV remote attestation protocol on
the current AMD Epyc Naples CPU series. We demonstrate
that it is possible to extract critical CPU-specific
keys that are fundamental for the security of the
remote attestation protocol.Building on the extracted
keys, we propose attacks that allow a malicious cloud
provider a complete circumvention of the SEV protection
mechanisms. Although the underlying firmware issues
were already fixed by AMD, we show that the current
series of AMD Epyc CPUs, i.e., the Naples series, does
not prevent the installation of previous firmware
versions. We show that the severity of our proposed
attacks is very high as no purely software-based
mitigations are possible. This effectively renders the
SEV technology on current AMD Epyc CPUs useless when
confronted with an untrusted cloud provider. To
overcome these issues, we also propose robust changes
to the SEV design that allow future generations of the
SEV technology to mitigate the proposed attacks.",
acknowledgement = ack-nhfb,
}
@Article{Cai:2019:UMD,
author = "Hongyun Cai and Fuzhi Zhang",
title = "An Unsupervised Method for Detecting Shilling Attacks
in Recommender Systems by Mining Item Relationship and
Identifying Target Items",
journal = j-COMP-J,
volume = "62",
number = "4",
pages = "579--597",
month = apr,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy124",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Apr 2 12:10:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/4/579/5255729",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Calegari:2019:WPH,
author = "Patrice Calegari and Marc Levrier and Pawe{\l}
Balczy{\'n}ski",
title = "{Web} Portals for High-performance Computing: a
Survey",
journal = j-TWEB,
volume = "13",
number = "1",
pages = "5:1--5:??",
month = feb,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3197385",
ISSN = "1559-1131 (print), 1559-114X (electronic)",
ISSN-L = "1559-1131",
bibdate = "Tue Oct 22 08:10:06 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tweb.bib",
abstract = "This article addresses web interfaces for
High-performance Computing (HPC) simulation software.
First, it presents a brief history, starting in the
1990s with Java applets, of web interfaces used for
accessing and making best possible use of remote HPC
resources. It introduces HPC web-based portal use
cases. Then it identifies and discusses the key
features, among functional and non-functional
requirements, that characterize such portals. A brief
state of the art is then presented. The design and
development of Bull extreme factory Computing Studio v3
(XCS3) is chosen as a common thread for showing how the
identified key features can all be implemented in one
software: multi-tenancy, multi-scheduler compatibility,
complete control through an HTTP RESTful API,
customizable user interface with Responsive Web Design,
HPC application template framework, remote
visualization, and access through the Authentication,
Authorization, and Accounting security framework with
the Role-Based Access Control permission model.
Non-functional requirements (security, usability,
performance, reliability) are discussed, and the
article concludes by giving perspective for future
work.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on the Web (TWEB)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1062",
}
@Article{Cao:2019:AML,
author = "Nanyuan Cao and Zhenfu Cao and Zhen Liu and Xiaolei
Dong and Xiaopeng Zhao",
title = "All-But-Many Lossy Trapdoor Functions under Decisional
{RSA} Subgroup Assumption and Application",
journal = j-COMP-J,
volume = "62",
number = "8",
pages = "1148--1157",
month = aug,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz008",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Aug 19 07:31:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/8/1148/5369686",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Cao:2019:PPS,
author = "Yang Cao and Yonghui Xiao and Li Xiong and Liquan Bai
and Masatoshi Yoshikawa",
title = "{PriSTE}: protecting spatiotemporal event privacy in
continuous location-based services",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "12",
number = "12",
pages = "1866--1869",
month = aug,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.14778/3352063.3352086",
ISSN = "2150-8097",
bibdate = "Wed Oct 2 06:49:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Location privacy-preserving mechanisms (LPPMs) have
been extensively studied for protecting a user's
location in location-based services. However, when
user's perturbed locations are released continuously,
existing LPPMs may not protect users' sensitive
spatiotemporal event, such as ``visited hospital in the
last week'' or ``regularly commuting between location 1
and location 2 every morning and afternoon'' (it is
easy to infer that locations 1 and 2 may be home and
office). In this demonstration, we demonstrate PriSTE
for protecting spatiotemporal event privacy in
continuous location release. First, to raise users'
awareness of such a new privacy goal, we design an
interactive tool to demonstrate how accurate an
adversary could infer a secret spatiotemporal event
from a sequence of locations or even LPPM-protected
locations. The attendees can find that some
spatiotemporal events are quite risky and even these
state-of-the-art LPPMs do not always protect
spatiotemporal event privacy. Second, we demonstrate
how a user can use PriSTE to automatically or manually
convert an LPPM for location privacy into one
protecting spatiotemporal event privacy in continuous
location-based services. Finally, we visualize the
trade-off between privacy and utility so that users can
choose appropriate privacy parameters in different
application scenarios.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chakraborty:2019:TIP,
author = "Nilesh Chakraborty and Vijay S. Anand and Samrat
Mondal",
title = "Towards identifying and preventing behavioral side
channel attack on recording attack resilient unaided
authentication services",
journal = j-COMPUT-SECUR,
volume = "84",
number = "??",
pages = "193--205",
month = jul,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818302062",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Chang:2019:GTS,
author = "Jinyong Chang and Yanyan Ji and Maozhi Xu and Rui
Xue",
title = "General transformations from single-generation to
multi-generation for homomorphic message authentication
schemes in network coding",
journal = j-FUT-GEN-COMP-SYS,
volume = "91",
number = "??",
pages = "416--425",
month = feb,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Feb 5 08:15:51 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17330170",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Chang:2019:KCS,
author = "Jinyong Chang and Genqing Bian and Yanyan Ji and
Maozhi Xu",
title = "On the {KDM--CCA} Security from Partial Trapdoor
One-Way Family in the Random Oracle Model",
journal = j-COMP-J,
volume = "62",
number = "8",
pages = "1232--1245",
month = aug,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz044",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Aug 19 07:31:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/8/1232/5492772",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Chang:2019:PPN,
author = "Sang-Yoon Chang and Sristi Lakshmi Sravana Kumar and
Yih-Chun Hu and Younghee Park",
title = "Power-Positive Networking: Wireless-Charging-Based
Networking to Protect Energy against Battery {DoS}
Attacks",
journal = j-TOSN,
volume = "15",
number = "3",
pages = "27:1--27:??",
month = aug,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3317686",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Wed Oct 2 09:20:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3317686",
abstract = "Energy is required for networking and computation and
is a valuable resource for unplugged systems such as
mobile, sensor, and embedded systems. Energy
denial-of-service (DoS) attack where a remote attacker
exhausts the victim's battery via networking remains a
critical challenge for the device availability. While
prior literature proposes mitigation- and
detection-based solutions, we propose to eliminate the
vulnerability entirely by offloading the power
requirements to the entity who makes the networking
requests. To do so, we build communication channels
using wireless charging signals (as opposed to the
traditional radio-frequency signals), so that the
communication and the power transfer are simultaneous
and inseparable, and use the channels to build
power-positive networking (PPN). PPN also offloads the
computation-based costs to the requester, enabling
authentication and other tasks considered too
power-hungry for battery-operated devices. In this
article, we study the energy DoS attack impacts on
off-the-shelf embedded system platforms (Raspberry Pi
and the ESP 8266 system-on-chip (SoC) module), present
PPN, implement and build a
Qi-charging-technology-compatible prototype, and use
the prototype for evaluations and analyses. Our
prototype, built on the hardware already available for
wireless charging, effectively defends against energy
DoS and supports simultaneous power and data
transfer.",
acknowledgement = ack-nhfb,
articleno = "27",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Chattopadhyay:2019:QIL,
author = "Sudipta Chattopadhyay and Moritz Beck and Ahmed Rezine
and Andreas Zeller",
title = "Quantifying the Information Leakage in Cache Attacks
via Symbolic Execution",
journal = j-TECS,
volume = "18",
number = "1",
pages = "7:1--7:??",
month = feb,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3288758",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:42 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3288758",
abstract = "Cache attacks allow attackers to infer the properties
of a secret execution by observing cache hits and
misses. But how much information can actually leak
through such attacks? For a given program, a cache
model, and an input, our CHALICE framework leverages
symbolic execution to compute the amount of information
that can possibly leak through cache attacks. At the
core of CHALICE is a novel approach to quantify
information leakage that can highlight critical cache
side-channel leakage on arbitrary binary code. In our
evaluation on real-world programs from OpenSSL and
Linux GDK libraries, CHALICE effectively quantifies
information leakage: For an AES-128 implementation on
Linux, for instance, CHALICE finds that a cache attack
can leak as much as 127 out of 128 bits of the
encryption key.",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Chen:2019:BBS,
author = "Lanxiang Chen and Wai-Kong Lee and Chin-Chen Chang and
Kim-Kwang Raymond Choo and Nan Zhang",
title = "Blockchain based searchable encryption for electronic
health record sharing",
journal = j-FUT-GEN-COMP-SYS,
volume = "95",
number = "??",
pages = "420--429",
month = jun,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:56 MDT 2019",
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/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18314134",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Chen:2019:IAS,
author = "Yi-Cheng Chen and Yueh-Peng Chou and Yung-Chen Chou",
title = "An Image Authentication Scheme Using {Merkle} Tree
Mechanisms",
journal = j-FUTURE-INTERNET,
volume = "11",
number = "7",
pages = "149",
day = "06",
month = jul,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi11070149",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:06 MST 2019",
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/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/11/7/149",
abstract = "Research on digital image processing has become quite
popular and rapid in recent years, and scholars have
proposed various image verification mechanisms.
Similarly, blockchain technology has also become very
popular in recent years. This paper proposes a new
image verification mechanism based on the Merkle tree
technique in the blockchain. The Merkle tree root in
the blockchain mechanism provides a reliable
environment for storage of image features. In image
verification, the verification of each image can be
performed by the Merkle tree mechanism to obtain the
hash value of the Merkle tree node on the path. In
addition, the method combines the Inter-Planetary File
System (IPFS) to improve the availability of images.
The main purpose of this paper is to achieve the goal
of image integrity verification. The proposed method
can not only verify the integrity of the image but also
restore the tampered area in the case of image
tampering. Since the proposed method employs the
blockchain mechanism, the image verification mechanism
does not need third party resources. The verification
method is performed by each node in the blockchain
network. The experimental results demonstrate that the
proposed method successfully achieved the goal of image
authentication and tampered area restoration.",
acknowledgement = ack-nhfb,
remark = "Special Issue Blockchain Theory and Its
Applications.",
}
@Article{Chen:2019:IBS,
author = "Jiahui Chen and Jie Ling and Jianting Ning and Jintai
Ding",
title = "Identity-Based Signature Schemes for Multivariate
Public Key Cryptosystems",
journal = j-COMP-J,
volume = "62",
number = "8",
pages = "1132--1147",
month = aug,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz013",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Aug 19 07:31:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/8/1132/5369678",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Chen:2019:MBR,
author = "Lele Chen and Gaoli Wang and GuoYan Zhang",
title = "{MILP}-based Related-Key Rectangle Attack and Its
Application to {GIFT}, {Khudra}, {MIBS}",
journal = j-COMP-J,
volume = "62",
number = "12",
pages = "1805--1821",
month = dec,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz076",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Dec 23 06:38:51 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/12/1805/5587703",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Chen:2019:WBS,
author = "Yu-Chi Chen and Xin Xie and Peter Shaojui Wang and
Raylin Tso",
title = "Witness-based searchable encryption with optimal
overhead for cloud-edge computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "100",
number = "??",
pages = "715--723",
month = nov,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.05.038",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:01 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19301086",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Chikouche:2019:PPC,
author = "Noureddine Chikouche and Pierre-Louis Cayrel and El
Hadji Modou Mboup and Brice Odilon Boidje",
title = "A privacy-preserving code-based authentication
protocol for {Internet of Things}",
journal = j-J-SUPERCOMPUTING,
volume = "75",
number = "12",
pages = "8231--8261",
month = dec,
year = "2019",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-019-03003-4",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jul 25 07:17:52 MDT 2020",
bibsource = "http://link.springer.com/journal/11227/75/12;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Choi:2019:PTE,
author = "Hoyul Choi and Jongmin Jeong and Simon S. Woo and
Kyungtae Kang and Junbeom Hur",
title = "Password typographical error resilience in honey
encryption",
journal = j-COMPUT-SECUR,
volume = "87",
number = "??",
pages = "Article 101411",
month = nov,
year = "2019",
CODEN = "CPSEDU",
DOI = "https://doi.org/10.1016/j.cose.2018.07.020",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Sat Jan 22 15:25:37 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818311246",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Chretien:2019:TMF,
author = "R{\'e}my Chr{\'e}tien and V{\'e}ronique Cortier and
Antoine Dallon and St{\'e}phanie Delaune",
title = "Typing Messages for Free in Security Protocols",
journal = j-TOCL,
volume = "21",
number = "1",
pages = "1:1--1:??",
month = oct,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3343507",
ISSN = "1529-3785 (print), 1557-945X (electronic)",
ISSN-L = "1529-3785",
bibdate = "Wed Oct 23 06:27:14 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tocl.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3343507",
abstract = "Security properties of cryptographic protocols are
typically expressed as reachability or equivalence
properties. Secrecy and authentication are examples of
reachability properties, while privacy properties such
as untraceability, vote secrecy, or anonymity are
generally expressed as behavioral equivalence in a
process algebra that models security protocols. Our
main contribution is to reduce the search space for
attacks for reachability as well as equivalence
properties. Specifically, we show that if there is an
attack then there is one that is well-typed. Our result
holds for a large class of typing systems, a family of
equational theories that encompasses all standard
primitives, and protocols without else branches. For
many standard protocols, we deduce that it is
sufficient to look for attacks that follow the format
of the messages expected in an honest execution,
therefore considerably reducing the search space.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Computational Logic",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J773",
}
@Article{Conti:2019:BUB,
author = "Mauro Conti and Muhammad Hassan and Chhagan Lal",
title = "{BlockA{\em uth}}: {BlockChain} based distributed
producer authentication in {ICN}",
journal = j-COMP-NET-AMSTERDAM,
volume = "164",
number = "??",
pages = "Article 106888",
day = "9",
month = dec,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2019.106888",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Fri Aug 14 09:46:24 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128619308308",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Courtois:2019:RRR,
author = "J. Courtois and L. Abbas-Turki and J. Bajard",
title = "Resilience of Randomized {RNS} Arithmetic with Respect
to Side-Channel Leaks of Cryptographic Computation",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "12",
pages = "1720--1730",
month = dec,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2019.2924630",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Nov 7 11:20:24 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "CPA; DPA; ECC; Elliptic curve cryptography; Elliptic
curves; Hamming distance; Hamming weight; information
leakage; Maximum likelihood estimation; maximum
likelihood estimator; moduli randomization; Monte
Carlo; Multiprotocol label switching; Resilience; RNS;
side channel",
}
@Article{Cremers:2019:SAG,
author = "Cas Cremers and Martin Dehnel-Wild and Kevin Milner",
title = "Secure authentication in the grid: a formal analysis
of {DNP3 SAv5}",
journal = j-J-COMP-SECUR,
volume = "27",
number = "2",
pages = "203--232",
month = "????",
year = "2019",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-181139",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Mon Sep 23 05:47:21 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Cui:2019:ABS,
author = "H. Cui and R. H. Deng and Y. Li and G. Wu",
title = "Attribute-Based Storage Supporting Secure
Deduplication of Encrypted Data in Cloud",
journal = j-IEEE-TRANS-BIG-DATA,
volume = "5",
number = "3",
pages = "330--342",
month = sep,
year = "2019",
DOI = "https://doi.org/10.1109/TBDATA.2017.2656120",
ISSN = "2332-7790",
ISSN-L = "2332-7790",
bibdate = "Tue Oct 29 11:08:44 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "ABE; access policy; attribute-based storage system;
authorisation; Cloud computing; cloud computing; cloud
service provider; cryptography; data confidentiality;
data deduplication systems; data provider;
deduplication; duplicate copies; duplicate detection;
encrypted data; encryption; Encryption; hybrid cloud
setting; identical data; network bandwidth;
outsourcing; private cloud; public cloud; secure
deduplication; Secure storage; security notion;
semantic security; Semantics; standard ABE system;
Standards; storage; storage management; storage space",
}
@Article{Cui:2019:CPA,
author = "Yuzhao Cui and Qiong Huang and Jianye Huang and Hongbo
Li and Guomin Yang",
title = "Ciphertext-Policy Attribute-Based Encrypted Data
Equality Test and Classification",
journal = j-COMP-J,
volume = "62",
number = "8",
pages = "1166--1177",
month = aug,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz036",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Aug 19 07:31:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/8/1166/5480373",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Culnane:2019:KKR,
author = "C. Culnane and A. Essex and S. J. Lewis and O. Pereira
and V. Teague",
title = "Knights and Knaves Run Elections: {Internet} Voting
and Undetectable Electoral Fraud",
journal = j-IEEE-SEC-PRIV,
volume = "17",
number = "4",
pages = "62--70",
month = jul # "\slash " # aug,
year = "2019",
DOI = "https://doi.org/10.1109/MSEC.2019.2915398",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "cryptographic weaknesses; cryptography; Cryptography;
e-voting system; electoral fraud; Electronic voting;
fraud; government data processing; Internet; Internet
voting systems; politics; trusted computing;
trustworthy elections",
}
@Article{Dai:2019:SAM,
author = "Hua Dai and Xuelong Dai and Xun Yi and Geng Yang and
Haiping Huang",
title = "Semantic-aware multi-keyword ranked search scheme over
encrypted cloud data",
journal = j-J-NETW-COMPUT-APPL,
volume = "147",
number = "??",
pages = "??--??",
day = "1",
month = dec,
year = "2019",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2019.102442",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon May 24 15:12:30 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804519303029",
acknowledgement = ack-nhfb,
articleno = "102442",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Dang:2019:SBS,
author = "Van Tuyen Dang and Truong Thu Huong and Nguyen Huu
Thanh and Pham Ngoc Nam and Nguyen Ngoc Thanh and Alan
Marshall",
title = "{SDN}-Based {SYN} Proxy --- A Solution to Enhance
Performance of Attack Mitigation Under {TCP} {SYN}
Flood",
journal = j-COMP-J,
volume = "62",
number = "4",
pages = "518--534",
month = apr,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy117",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Apr 2 12:10:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/4/518/5183521",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{DeMarsico:2019:SGR,
author = "Maria {De Marsico} and Alessio Mecca",
title = "A Survey on Gait Recognition via Wearable Sensors",
journal = j-COMP-SURV,
volume = "52",
number = "4",
pages = "86:1--86:??",
month = sep,
year = "2019",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3340293",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Tue Oct 29 09:52:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3340293",
abstract = "Gait is a biometric trait that can allow user
authentication, though it is classified as a ``soft''
one due to a certain lack in permanence and to
sensibility to specific conditions. The earliest
research relies on computer vision, especially applied
in video surveillance. More recently, the spread of
wearable sensors, especially those embedded in mobile
devices, has spurred a different research line. In
fact, they are able to capture the dynamics of the
walking pattern through simpler one-dimensional
signals. This capture modality can avoid some problems
related to computer vision-based techniques but suffers
from specific limitations. Related research is still in
a less advanced phase with respect to other biometric
traits. However, many factors --- the promising results
achieved so far, the increasing accuracy of sensors,
the ubiquitous presence of mobile devices, and the low
cost of related techniques --- contribute to making
this biometrics attractive and suggest continuing
investigating. This survey provides interested readers
with a reasoned and systematic overview of problems,
approaches, and available benchmarks.",
acknowledgement = ack-nhfb,
articleno = "86",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Demay:2019:PSS,
author = "Gr{\'e}gory Demay and Peter Ga{\v{z}}i and Ueli Maurer
and Bj{\"o}rn Tackmann",
title = "Per-session security: Password-based cryptography
revisited",
journal = j-J-COMP-SECUR,
volume = "27",
number = "1",
pages = "75--111",
month = "????",
year = "2019",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-181131",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Mon Sep 23 05:47:20 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Deng:2019:DMS,
author = "Cheng Deng and Zhao Li and Xinbo Gao and Dacheng Tao",
title = "Deep Multi-scale Discriminative Networks for Double
{JPEG} Compression Forensics",
journal = j-TIST,
volume = "10",
number = "2",
pages = "20:1--20:??",
month = feb,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3301274",
ISSN = "2157-6904 (print), 2157-6912 (electronic)",
ISSN-L = "2157-6904",
bibdate = "Tue Oct 22 11:55:44 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tist.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3301274",
abstract = "As JPEG is the most widely used image format, the
importance of tampering detection for JPEG images in
blind forensics is self-evident. In this area,
extracting effective statistical characteristics from a
JPEG image for classification remains a challenge.
Effective features are designed manually in traditional
methods, suggesting that extensive labor-consuming
research and derivation is required. In this article,
we propose a novel image tampering detection method
based on deep multi-scale discriminative networks
(MSD-Nets). The multi-scale module is designed to
automatically extract multiple features from the
discrete cosine transform (DCT) coefficient histograms
of the JPEG image. This module can capture the
characteristic information in different scale spaces.
In addition, a discriminative module is also utilized
to improve the detection effect of the networks in
those difficult situations when the first compression
quality ( QF 1) is higher than the second one ( QF 2).
A special network in this module is designed to
distinguish the small statistical difference between
authentic and tampered regions in these cases. Finally,
a probability map can be obtained and the specific
tampering area is located using the last classification
results. Extensive experiments demonstrate the
superiority of our proposed method in both quantitative
and qualitative metrics when compared with
state-of-the-art approaches.",
acknowledgement = ack-nhfb,
articleno = "20",
fjournal = "ACM Transactions on Intelligent Systems and Technology
(TIST)",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1318",
}
@Article{DeOliveiraNunes:2019:SSC,
author = "Ivan {De Oliveira Nunes} and Karim Eldefrawy and
Tancr{\`e}de Lepoint",
title = "{SNUSE}: a secure computation approach for large-scale
user re-enrollment in biometric authentication
systems",
journal = j-FUT-GEN-COMP-SYS,
volume = "98",
number = "??",
pages = "259--273",
month = sep,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1833098X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@InProceedings{Didier:2019:RAP,
author = "Laurent-Stephane Didier and Fangan-Yssouf Dosso and
Nadia {El Mrabet} and Jeremy Marrez and Pascal
V{\'e}ron",
title = "Randomization of Arithmetic Over Polynomial Modular
Number System",
crossref = "Takagi:2019:ISC",
pages = "199--206",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1109/ARITH.2019.00048",
bibdate = "Fri Jan 31 08:18:07 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "The Polynomial Modular Number System (PMNS) is an
integer number system designed to speed up arithmetic
operations modulo a prime p. Such a system is defined
by a tuple B = (p, n, , , E) where E Z[X] and E() = 0
mod p. In a PMNS, an element a of Z/pZ is represented
by a polynomial A such that: A() = a mod p, deg A <; n
||A|| <; p. In [6], the authors mentioned that PMNS can
be highly redundant but they didn't really take
advantage of this possibility. In this paper we use,
for the first time, the redundancy of PMNS to protect
algorithms against Side Channel Attacks (SCA). More
precisely, we focus on elliptic curve cryptography. We
show how to randomize the modular multiplication in
order to be safe against existing SCA and we
demonstrate the resistance of our construction. We
describe the generation of a PMNS while guaranteeing,
for all elements of Z/pZ, the minimum number of
distinct representations we want. We also show how to
reach all these representations.",
acknowledgement = ack-nhfb,
keywords = "ARITH-26; arithmetic operations; digital arithmetic;
elliptic curve cryptography; Elliptic curve
cryptography; Elliptic curves; integer number system;
Lattices; Manganese; modular multiplication; PMNS;
polynomial modular number system; Polynomial Modular
Number System, Side Channel Countermeasure, Modular
Arithmetic; polynomials; Protocols; public key
cryptography; Resistance; side channel attacks;
Side-channel attacks",
}
@Article{Dixit:2019:FBD,
author = "Umesh D. Dixit and M. S. Shirdhonkar",
title = "Fingerprint-Based Document Image Retrieval",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "19",
number = "2",
pages = "??--??",
year = "2019",
DOI = "https://doi.org/10.1142/S0219467819500086",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Fri May 10 09:47:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0219467819500086",
abstract = "Most of the documents use fingerprint impression for
authentication. Property related documents, bank
checks, application forms, etc., are the examples of
such documents. Fingerprint-based document image
retrieval system aims to provide a solution for
searching and browsing of such digitized documents. The
major challenges in implementing fingerprint-based
document image retrieval are an efficient method for
fingerprint detection and an effective feature
extraction method. In this work, we propose a method
for automatic detection of a fingerprint from given
query document image employing Discrete Wavelet
Transform (DWT)-based features and SVM classifier. In
this paper, we also propose and investigate two feature
extraction schemes, DWT and Stationary Wavelet
Transform (SWT)-based Local Binary Pattern (LBP)
features for fingerprint-based document image
retrieval. The standardized Euclidean distance is
employed for matching and ranking of the documents.
Proposed method is tested on a database of 1200
document images and is also compared with current
state-of-art. The proposed scheme provided 98.87\% of
detection accuracy and 73.08\% of Mean Average Precision
(MAP) for document image retrieval.",
acknowledgement = ack-nhfb,
articleno = "1950008",
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@InProceedings{Djath:2019:HAR,
author = "Libey Djath and Karim Bigou and Arnaud Tisserand",
title = "Hierarchical Approach in {RNS} Base Extension for
Asymmetric Cryptography",
crossref = "Takagi:2019:ISC",
pages = "46--53",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1109/ARITH.2019.00016",
bibdate = "Fri Jan 31 08:18:07 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "Base extension is a critical operation in RNS
implementations of asymmetric cryptosystems. In this
paper, we propose a new way to perform base extensions
using a hierarchical approach for computing the Chinese
remainder theorem. For well chosen parameters, it
significantly reduces the computational cost and still
ensures a high level of internal parallelism. We
illustrate the interest of the proposed approach on the
cost of typical arithmetic primitives used in
asymmetric cryptography. We also demonstrate
improvements in FPGA implementations of base extensions
on typical elliptic curve cryptography field sizes
using high-level synthesis tools.",
acknowledgement = ack-nhfb,
keywords = "ARITH-26; asymmetric cryptosystems; Cathode ray tubes;
Chinese remainder theorem; Computer architecture;
computer arithmetic; cryptography; Elliptic curve
cryptography; elliptic curve cryptography field sizes;
field programmable gate arrays; FPGA implementations;
hardware implementation; high level synthesis;
high-level synthesis tools; modular reduction; Parallel
processing; residue number system; residue number
systems; RNS base extension; RNS implementations;
Signal processing algorithms; Standards",
}
@Article{Dobre:2019:PWR,
author = "D. Dobre and G. O. Karame and W. Li and M. Majuntke
and N. Suri and M. {Vukoli }",
title = "Proofs of Writing for Robust Storage",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "30",
number = "11",
pages = "2547--2566",
month = nov,
year = "2019",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2019.2919285",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Dec 19 09:20:35 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "BFT storage; Byzantine fault tolerant storage;
Byzantine fault tolerant storage solutions; Byzantine
storage servers; commitment schemes; Computer crashes;
crash fault tolerance; crash-faulty writers;
cryptography; data storage protocol; data storage
technique; distributed processing; fault tolerance;
Fault tolerance; fault tolerant computing; History;
lightweight cryptography coding; meta data; Metadata;
metadata write-backs; PoW; PoWerStore robustness;
proofs of writing; Proofs of Writing; Protocols;
Servers; software fault tolerance; storage management;
Writing",
}
@Article{Dolev:2019:AAC,
author = "Shlomi Dolev and Niv Gilboa and Ximing Li",
title = "Accumulating automata and cascaded equations automata
for communicationless information theoretically secure
multi-party computation",
journal = j-THEOR-COMP-SCI,
volume = "795",
number = "??",
pages = "81--99",
day = "26",
month = nov,
year = "2019",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Oct 16 07:39:37 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397519303883",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Dong:2019:FOI,
author = "Shi Dong and Raj Jain",
title = "Flow online identification method for the encrypted
{Skype}",
journal = j-J-NETW-COMPUT-APPL,
volume = "132",
number = "??",
pages = "75--85",
day = "15",
month = apr,
year = "2019",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:31 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804519300074",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Dou:2019:DTE,
author = "Y. Dou and H. C. B. Chan and M. H. Au",
title = "A Distributed Trust Evaluation Protocol with Privacy
Protection for Intercloud",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "30",
number = "6",
pages = "1208--1221",
month = jun,
year = "2019",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2018.2883080",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Fri Aug 30 06:09:58 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "Business; Cloud computing; cloud computing;
Computational modeling; cryptographic protocols;
Cryptography; data protection; distributed trust
evaluation protocol; formal security model; formal
verification; homomorphic encryption; Intercloud; Logic
gates; privacy; Privacy; privacy protection; Protocols;
reputation; resource allocation; resource sharing;
trust evaluation; trusted computing; verifiable secret
sharing",
}
@Article{Drozdz:2019:SCC,
author = "Stanis{\l}aw Drozdz and Ludovico Minati and Pawe{\l}
O{\'s}wi{\k{e}}cimka and Marek Stanuszek and Marcin
W{\k{a}}torek",
title = "Signatures of the Crypto-Currency Market Decoupling
from the {Forex}",
journal = j-FUTURE-INTERNET,
volume = "11",
number = "7",
pages = "154",
day = "10",
month = jul,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi11070154",
ISSN = "1999-5903",
ISSN-L = "1999-5903",
bibdate = "Thu Nov 21 16:51:06 MST 2019",
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/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/11/7/154",
abstract = "Based on the high-frequency recordings from Kraken, a
cryptocurrency exchange and professional trading
platform that aims to bring Bitcoin and other
cryptocurrencies into the mainstream, the multiscale
cross-correlations involving the Bitcoin (BTC),
Ethereum (ETH), Euro (EUR) and US dollar (USD) are
studied over the period between 1 July 2016 and 31
December 2018. It is shown that the multiscaling
characteristics of the exchange rate fluctuations
related to the cryptocurrency market approach those of
the Forex. This, in particular, applies to the BTC/ETH
exchange rate, whose Hurst exponent by the end of 2018
started approaching the value of 0.5, which is
characteristic of the mature world markets.
Furthermore, the BTC/ETH direct exchange rate has
already developed multifractality, which manifests
itself via broad singularity spectra. A particularly
significant result is that the measures applied for
detecting cross-correlations between the dynamics of
the BTC/ETH and EUR/USD exchange rates do not show any
noticeable relationships. This could be taken as an
indication that the cryptocurrency market has begun
decoupling itself from the Forex.",
acknowledgement = ack-nhfb,
journal-URL = "https://www.mdpi.com/journal/futureinternet",
remark = "Special Issue Blockchain Theory and Its
Applications.",
}
@Article{Dyakonov:2019:WWU,
author = "M. Dyakonov",
title = "When will useful quantum computers be constructed?
{Not} in the foreseeable future, this physicist argues.
{Here}'s why: The case against: Quantum computing",
journal = j-IEEE-SPECTRUM,
volume = "56",
number = "3",
pages = "24--29",
month = mar,
year = "2019",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2019.8651931",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "artificial intelligence; Computers; cryptography; drug
discovery; encryption; IBM notes; Internet; Logic
gates; Microsoft; quantum computing; Quantum computing;
Quantum mechanics; Qubit; Transistors; useful quantum
computers",
}
@Article{El-Hadedy:2019:RPR,
author = "Mohamed El-Hadedy and Amit Kulkarni and Dirk
Stroobandt and Kevin Skadron",
title = "{Reco-Pi}: a reconfigurable Cryptoprocessor for $ \pi
$-Cipher",
journal = j-J-PAR-DIST-COMP,
volume = "133",
number = "??",
pages = "420--431",
month = nov,
year = "2019",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Fri Sep 13 10:25:21 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731517301636",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Elrabaa:2019:PPP,
author = "Muhammad E. S. Elrabaa and Mohamed A. Al-Asli and
Marwan H. Abu-Amara",
title = "A Protection and Pay-per-use Licensing Scheme for
On-cloud {FPGA} Circuit {IPs}",
journal = j-TRETS,
volume = "12",
number = "3",
pages = "13:1--13:??",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3329861",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Sat Oct 19 17:43:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3329861",
abstract = "Using security primitives, a novel scheme for
licensing hardware intellectual properties (HWIPs) on
Field Programmable Gate Arrays (FPGAs) in public clouds
is proposed. The proposed scheme enforces a pay-per-use
model, allows HWIP's installation only on specific
on-cloud FPGAs, and efficiently protects the HWIPs from
being cloned, reverse engineered, or used without the
owner's authorization by any party, including a cloud
insider. It also provides protection for the users'
designs integrated with the HWIP on the same FPGA. This
enables cloud tenants to license HWIPs in the cloud
from the HWIP vendors at a relatively low price based
on usage instead of paying the expensive unlimited HWIP
license fee. The scheme includes a protocol for FPGA
authentication, HWIP secure decryption, and usage by
the clients without the need for the HWIP vendor to be
involved or divulge their secret keys. A complete
prototype test-bed implementation showed that the
proposed scheme is very feasible with relatively low
resource utilization. Experiments also showed that a
HWIP could be licensed and set up in the on-cloud FPGA
in 0.9s. This is 15 times faster than setting up the
same HWIP from outside the cloud, which takes about 14s
based on the average global Internet speed.",
acknowledgement = ack-nhfb,
articleno = "13",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
}
@Article{Emura:2019:PPA,
author = "Keita Emura and Hayato Kimura and Toshihiro Ohigashi
and Tatsuya Suzuki",
title = "Privacy-Preserving Aggregation of Time-Series Data
with Public Verifiability from Simple Assumptions and
Its Implementations",
journal = j-COMP-J,
volume = "62",
number = "4",
pages = "614--630",
month = apr,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy135",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Apr 2 12:10:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/4/614/5263983",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Erbagci:2019:SHE,
author = "Burak Erbagci and Nail Etkin Can Akkaya and Mudit
Bhargava and Rachel Dondero and Ken Mai",
title = "Secure hardware-entangled field programmable gate
arrays",
journal = j-J-PAR-DIST-COMP,
volume = "131",
number = "??",
pages = "81--96",
month = sep,
year = "2019",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2019.04.002",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Mon Jun 10 07:36:16 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731519302618",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Ermoshina:2019:SRC,
author = "Ksenia Ermoshina and Francesca Musiani",
title = "``{Standardising} by running code'': the {Signal}
protocol and {\em de facto\/} standardisation in
end-to-end encrypted messaging",
journal = j-INTERNET-HIST,
volume = "3",
number = "3--4",
pages = "343--363",
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1080/24701475.2019.1654697",
ISSN = "2470-1483",
ISSN-L = "2470-1483",
bibdate = "Tue Aug 29 08:11:04 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/internet-hist.bib",
URL = "http://www.tandfonline.com/doi/full/10.1080/24701475.2019.1654697",
acknowledgement = ack-nhfb,
ajournal = "Internet Hist.",
fjournal = "Internet Histories",
journal-URL = "https://www.tandfonline.com/loi/rint20",
}
@Article{Esiner:2019:TFA,
author = "Ertem Esiner and Anwitaman Datta",
title = "Two-factor authentication for trusted third party free
dispersed storage",
journal = j-FUT-GEN-COMP-SYS,
volume = "90",
number = "??",
pages = "291--306",
month = jan,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2018.08.001",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Sep 18 14:07:59 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17322859",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Faal:2019:MVE,
author = "Hossein Teimoori Faal",
title = "A Multiset Version of Even-Odd Permutations Identity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "5",
pages = "683--691",
month = aug,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500163",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/S0129054119500163",
abstract = "In this paper, we present a multiset analogue of the
even-odd permutations identity in the context of
combinatorics of words. The multiset version is indeed
equivalent to the coin arrangements lemma which is a
key lemma in Sherman's proof of Feynman's conjecture
about combinatorial solution of Ising model in
statistical physics. Here, we give a bijective proof
which is based on the standard factorization of a
Lyndon word.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fairley:2019:EWC,
author = "P. Fairley",
title = "{Ethereum} will cut back its absurd energy use",
journal = j-IEEE-SPECTRUM,
volume = "56",
number = "1",
pages = "29--32",
month = jan,
year = "2019",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2019.8594790",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 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/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Bitcoin; Blockchain; cryptocurrencies; Cryptocurrency;
Data mining; energy consumption; energy footprint;
energy use; energy waste; environmental economics;
Ethereum; Exoskeletons; Opprobrium; Robots; Smart
contracts; societal benefits",
}
@Article{Fan:2019:OVG,
author = "Hua Fan and Wojciech Golab",
title = "{Ocean Vista}: gossip-based visibility control for
speedy geo-distributed transactions",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "12",
number = "11",
pages = "1471--1484",
month = jul,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.14778/3342263.3342627",
ISSN = "2150-8097",
bibdate = "Wed Oct 2 06:49:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Providing ACID transactions under conflicts across
globally distributed data is the Everest of transaction
processing protocols. Transaction processing in this
scenario is particularly costly due to the high latency
of cross-continent network links, which inflates
concurrency control and data replication overheads. To
mitigate the problem, we introduce Ocean Vista --- a
novel distributed protocol that guarantees strict
serializability. We observe that concurrency control
and replication address different aspects of resolving
the visibility of transactions, and we address both
concerns using a multi-version protocol that tracks
visibility using version watermarks and arrives at
correct visibility decisions using efficient gossip.
Gossiping the watermarks enables asynchronous
transaction processing and acknowledging transaction
visibility in batches in the concurrency control and
replication protocols, which improves efficiency under
high cross-datacenter network delays. In particular,
Ocean Vista can process conflicting transactions in
parallel, and supports efficient write-quorum /
read-one access using one round trip in the common
case. We demonstrate experimentally in a
multi-data-center cloud environment that our design
outperforms a leading distributed transaction
processing engine (TAPIR) more than 10-fold in terms of
peak throughput, albeit at the cost of additional
latency for gossip. The latency penalty is generally
bounded by one wide area network (WAN) round trip time
(RTT), and in the best case (i.e., under light load)
our system nearly breaks even with TAPIR by committing
transactions in around one WAN RTT.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fang:2019:PPO,
author = "Hongyu Fang and Sai Santosh Dayapule and Fan Yao and
Milo{\v{s}} Doroslova{\v{c}}ki and Guru Venkataramani",
title = "{PrODACT}: Prefetch-Obfuscator to Defend Against Cache
Timing Channels",
journal = j-INT-J-PARALLEL-PROG,
volume = "47",
number = "4",
pages = "571--594",
month = aug,
year = "2019",
CODEN = "IJPPE5",
DOI = "https://doi.org/10.1007/s10766-018-0609-3",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
ISSN-L = "0885-7458",
bibdate = "Fri Oct 11 08:37:52 MDT 2019",
bibsource = "http://link.springer.com/journal/10766/47/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Faz-Hernandez:2019:HPI,
author = "Armando Faz-Hern{\'a}ndez and Julio L{\'o}pez and
Ricardo Dahab",
title = "High-performance Implementation of Elliptic Curve
Cryptography Using Vector Instructions",
journal = j-TOMS,
volume = "45",
number = "3",
pages = "25:1--25:??",
month = jul,
year = "2019",
CODEN = "ACMSCU",
DOI = "https://doi.org/10.1145/3309759",
ISSN = "0098-3500 (print), 1557-7295 (electronic)",
ISSN-L = "0098-3500",
bibdate = "Wed Jul 31 08:06:08 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toms.bib",
URL = "https://dl.acm.org/citation.cfm?id=3309759",
abstract = "Elliptic curve cryptosystems are considered an
efficient alternative to conventional systems such as
DSA and RSA. Recently, Montgomery and Edwards elliptic
curves have been used to implement cryptosystems. In
particular, the elliptic curves Curve25519 and Curve448
were used for instantiating Diffie--Hellman protocols
named X25519 and X448. Mapping these curves to twisted
Edwards curves allowed deriving two new signature
instances, called Ed25519 and Ed448, of the Edwards
Digital Signature Algorithm. In this work, we focus on
the secure and efficient software implementation of
these algorithms using SIMD parallel processing. We
present software techniques that target the Intel AVX2
vector instruction set for accelerating prime field
arithmetic and elliptic curve operations. Our
contributions result in a high-performance software
library for AVX2-ready processors. For example, our
library computes digital signatures 19\% (for Ed25519)
and 29\% (for Ed448) faster than previous optimized
implementations. Also, our library improves by 10\% and
20\% the execution time of X25519 and X448,
respectively.",
acknowledgement = ack-nhfb,
articleno = "25",
fjournal = "ACM Transactions on Mathematical Software (TOMS)",
journal-URL = "http://dl.acm.org/pub.cfm?id=J782",
}
@Article{Feigenbaum:2019:PSE,
author = "Joan Feigenbaum",
title = "Privacy and security: Encryption and surveillance",
journal = j-CACM,
volume = "62",
number = "5",
pages = "27--29",
month = may,
year = "2019",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Apr 27 18:22:12 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://cacm.acm.org/magazines/2019/5/236419/fulltext",
abstract = "Why the law-enforcement access question will not just
go away.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Feng:2019:SHO,
author = "J. Feng and L. T. Yang and G. Dai and W. Wang and D.
Zou",
title = "A Secure High-Order {Lanczos}-Based Orthogonal Tensor
{SVD} for Big Data Reduction in Cloud Environment",
journal = j-IEEE-TRANS-BIG-DATA,
volume = "5",
number = "3",
pages = "355--367",
month = sep,
year = "2019",
DOI = "https://doi.org/10.1109/TBDATA.2018.2803841",
ISSN = "2332-7790",
ISSN-L = "2332-7790",
bibdate = "Tue Oct 29 11:08:44 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "Big Data; big data applications; big data reduction;
big data techniques; Cloud computing; cloud computing;
Computational complexity; Cryptography; cyber
forensics; Cyber security; cyber security applications;
data reduction; data security; digital forensics;
garbled tensor; high-order big data reduction;
high-order data; high-order lanczos method; high-order
lanczos-based orthogonal tensor SVD algorithm; matrix
data; orthogonal tensor SVD; outsourcing; Protocols;
secure orthogonal tensor SVD method; singular value
decomposition; Tensile stress; tensors",
}
@Article{Ferretti:2019:FBS,
author = "Luca Ferretti and Mirco Marchetti and Michele
Colajanni",
title = "Fog-based Secure Communications for Low-power {IoT}
Devices",
journal = j-TOIT,
volume = "19",
number = "2",
pages = "27:1--27:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3284554",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Sat Sep 21 07:34:10 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3284554",
abstract = "Designing secure, scalable, and resilient IoT networks
is a challenging task because of resource-constrained
devices and no guarantees of reliable network
connectivity. Fog computing improves the resiliency of
IoT, but its security model assumes that fog nodes are
fully trusted. We relax this latter constraint by
proposing a solution that guarantees confidentiality of
messages exchanged through semi-honest fog nodes thanks
to a lightweight proxy re-encryption scheme. We
demonstrate the feasibility of the solution by applying
it to IoT networks of low-power devices through
experiments on microcontrollers and ARM-based
architectures.",
acknowledgement = ack-nhfb,
articleno = "27",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
}
@Article{Fomichev:2019:PZI,
author = "Mikhail Fomichev and Max Maass and Lars Almon and
Alejandro Molina and Matthias Hollick",
title = "Perils of Zero-Interaction Security in the {Internet
of Things}",
journal = j-IMWUT,
volume = "3",
number = "1",
pages = "1--38",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3314397",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:37:08 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3314397",
abstract = "The Internet of Things (IoT) demands authentication
systems which can provide both security and usability.
Recent research utilizes the rich sensing capabilities
of smart devices to build security schemes operating
without human interaction, such as \ldots{}",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Fotiadis:2019:TRF,
author = "Georgios Fotiadis and Elisavet Konstantinou",
title = "{TNFS} resistant families of pairing-friendly elliptic
curves",
journal = j-THEOR-COMP-SCI,
volume = "800",
number = "??",
pages = "73--89",
day = "31",
month = dec,
year = "2019",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Nov 19 07:57:39 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397519306462",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Fotiou:2019:NBS,
author = "Nikos Fotiou and George C. Polyzos",
title = "Name-Based Security for Information-Centric Networking
Architectures",
journal = j-FUTURE-INTERNET,
volume = "11",
number = "11",
pages = "232",
day = "01",
month = nov,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi11110232",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:08 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/11/11/232",
abstract = "Information-Centric Networking (ICN) is an emerging
communication paradigm built around content names.
Securing ICN using named-based security is, therefore,
a natural choice. For this paper, we designed and
evaluated name-based security solutions that satisfy
security requirements that are particular to ICN
architectures. In order to achieve our goal, we
leverage identity-based encryption, identity-based
proxy re-encryption, and the emerging paradigm of
decentralized identifiers. Our solutions support
outsourcing content storage, content integrity
protection and content authentication, and provenance
verification, as well as access control. We show that
our solutions have tolerable storage and computation
overhead, thus proving their feasibility.",
acknowledgement = ack-nhfb,
remark = "Special Issue Information-Centric Networking (ICN).",
}
@Article{Franken:2019:ECP,
author = "G. Franken and T. {Van Goethem} and W. Joosen",
title = "Exposing Cookie Policy Flaws Through an Extensive
Evaluation of Browsers and Their Extensions",
journal = j-IEEE-SEC-PRIV,
volume = "17",
number = "4",
pages = "25--34",
month = jul # "\slash " # aug,
year = "2019",
DOI = "https://doi.org/10.1109/MSEC.2019.2909710",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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; browser users incentive; Browsers;
cookie policy flaws; data privacy; extensions;
Internet; Law; online abuses; online front-ends;
Privacy; third-party cookie policies; user privacy",
}
@Article{Fyodorov:2019:SGM,
author = "Yan V. Fyodorov",
title = "A Spin Glass Model for Reconstructing Nonlinearly
Encrypted Signals Corrupted by Noise",
journal = j-J-STAT-PHYS,
volume = "175",
number = "5",
pages = "789--818",
month = jun,
year = "2019",
CODEN = "JSTPSB",
DOI = "https://doi.org/10.1007/s10955-018-02217-9",
ISSN = "0022-4715 (print), 1572-9613 (electronic)",
ISSN-L = "0022-4715",
bibdate = "Fri Sep 6 12:43:52 MDT 2019",
bibsource = "http://link.springer.com/journal/10955/175/5;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jstatphys2010.bib",
URL = "http://link.springer.com/content/pdf/10.1007/s10955-018-02217-9.pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Statistical Physics",
journal-URL = "http://link.springer.com/journal/10955",
}
@Article{Gallin:2019:GFP,
author = "G. Gallin and A. Tisserand",
title = "Generation of Finely-Pipelined {GF($P$P)} Multipliers
for Flexible Curve Based Cryptography on {FPGAs}",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "11",
pages = "1612--1622",
month = nov,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2019.2920352",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Oct 29 11:08:44 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "arithmetic operator generation; Clocks; Computer
architecture; Cryptography; elliptic curve
cryptography; Field programmable gate arrays; Hardware;
Modular arithmetic; Montgomery multiplication;
Pipelines; Tools",
}
@Article{Gao:2019:EUE,
author = "Yang Gao and Wei Wang and Vir V. Phoha and Wei Sun and
Zhanpeng Jin",
title = "{EarEcho}: Using Ear Canal Echo for Wearable
Authentication",
journal = j-IMWUT,
volume = "3",
number = "3",
pages = "1--24",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3351239",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:37:13 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3351239",
abstract = "Smart wearable devices have recently become one of the
major technological trends and been widely adopted by
the general public. Wireless earphones, in particular,
have seen a skyrocketing growth due to its great
usability and convenience. With the goal \ldots{}",
acknowledgement = ack-nhfb,
articleno = "81",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Gao:2019:LBD,
author = "Wen Gao and Liqun Chen and Yupu Hu and Christopher J.
P. Newton and Baocang Wang and Jiangshan Chen",
title = "Lattice-based deniable ring signatures",
journal = j-INT-J-INFO-SEC,
volume = "18",
number = "3",
pages = "355--370",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-018-0417-1",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Thu May 23 17:57:24 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib",
URL = "http://link.springer.com/article/10.1007/s10207-018-0417-1;
http://link.springer.com/content/pdf/10.1007/s10207-018-0417-1.pdf",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
}
@Article{Gao:2019:VQS,
author = "Pengfei Gao and Jun Zhang and Fu Song and Chao Wang",
title = "Verifying and Quantifying Side-channel Resistance of
Masked Software Implementations",
journal = j-TOSEM,
volume = "28",
number = "3",
pages = "16:1--16:??",
month = aug,
year = "2019",
CODEN = "ATSMER",
DOI = "https://doi.org/10.1145/3330392",
ISSN = "1049-331X (print), 1557-7392 (electronic)",
ISSN-L = "1049-331X",
bibdate = "Tue Oct 22 07:57:09 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosem.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3330392",
abstract = "Power side-channel attacks, capable of deducing secret
data using statistical analysis, have become a serious
threat. Random masking is a widely used countermeasure
for removing the statistical dependence between secret
data and side-channel information. Although there are
techniques for verifying whether a piece of software
code is perfectly masked, they are limited in accuracy
and scalability. To bridge this gap, we propose a
refinement-based method for verifying masking
countermeasures. Our method is more accurate than prior
type-inference-based approaches and more scalable than
prior model-counting-based approaches using SAT or SMT
solvers. Indeed, our method can be viewed as a gradual
refinement of a set of type-inference rules for
reasoning about distribution types. These rules are
kept abstract initially to allow fast deduction and
then made concrete when the abstract version is not
able to resolve the verification problem. We also
propose algorithms for quantifying the amount of
side-channel information leakage from a software
implementation using the notion of quantitative masking
strength. We have implemented our method in a software
tool and evaluated it on cryptographic benchmarks
including AES and MAC-Keccak. The experimental results
show that our method significantly outperforms
state-of-the-art techniques in terms of accuracy and
scalability.",
acknowledgement = ack-nhfb,
articleno = "16",
fjournal = "ACM Transactions on Software Engineering and
Methodology",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J790",
}
@Article{Genge:2019:ESA,
author = "B{\'e}la Genge and Piroska Haller and Adrian-Vasile
Duka",
title = "Engineering security-aware control applications for
data authentication in smart industrial cyber-physical
systems",
journal = j-FUT-GEN-COMP-SYS,
volume = "91",
number = "??",
pages = "206--222",
month = feb,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Feb 5 08:15:51 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X18303431",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Ghatak:2019:IBS,
author = "Debolina Ghatak and Bimal K. Roy",
title = "An Improved Bound for Security in an Identity
Disclosure Problem",
journal = j-INT-J-STAT-PROBAB,
volume = "8",
number = "3",
pages = "24--??",
month = "????",
year = "2019",
CODEN = "????",
ISSN = "1927-7032 (print), 1927-7040 (electronic)",
ISSN-L = "1927-7032",
bibdate = "Fri May 21 15:18:32 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjstatprobab.bib",
URL = "http://www.ccsenet.org/journal/index.php/ijsp/article/view/0/39033",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Statistics and Probability",
journal-URL = "http://www.ccsenet.org/journal/index.php/ijsp/issue/archive",
}
@Article{Ghosal:2019:NPP,
author = "Purnata Ghosal and B. V. Raghavendra Rao",
title = "A note on parameterized polynomial identity testing
using hitting set generators",
journal = j-INFO-PROC-LETT,
volume = "151",
number = "??",
pages = "Article 105839",
month = nov,
year = "2019",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Oct 16 08:35:44 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S002001901930122X",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Ghoshal:2019:RSC,
author = "Sucheta Ghoshal and Amy Bruckman",
title = "The Role of Social Computing Technologies in
Grassroots Movement Building",
journal = j-TOCHI,
volume = "26",
number = "3",
pages = "18:1--18:??",
month = jun,
year = "2019",
CODEN = "ATCIF4",
DOI = "https://doi.org/10.1145/3318140",
ISSN = "1073-0516 (print), 1557-7325 (electronic)",
ISSN-L = "1073-0516",
bibdate = "Tue Oct 22 08:21:01 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tochi.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3318140",
abstract = "Social movement organizing is becoming increasingly
dependent on communication technologies. How can
Computer-Supported Cooperative Work systems support
grassroots organizations in facilitating collective
action through democratic participation? In this
article, we study Science for the People-Atlanta, a
social movement organization dedicated to building a
grassroots movement around science activism. We used
action research, both participating in the organization
and studying it. We use the Freirean model of
participatory communication theory to unpack the
movement-building process of SftP-Atlanta. The Freirean
model provides a three-step, iterative process for
sustainable movement building: forming a collective
identity, moving toward collective action, and engaging
in reflexive dialog. We analyze both the perceived
strengths and weaknesses of their sociotechnical
practices in supporting the organization as they
iteratively go through the phases of the Freirean
model. Finally, we identify inclusivity,
privacy/security, and social translucence as three
values desirable for sociotechnical practices of
grassroots organizing.",
acknowledgement = ack-nhfb,
articleno = "18",
fjournal = "ACM Transactions on Computer-Human Interaction",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J756",
}
@Article{Gonzalez-Manzano:2019:LUR,
author = "Lorena Gonzalez-Manzano and Jose M. {De Fuentes} and
Arturo Ribagorda",
title = "Leveraging User-related {Internet of Things} for
Continuous Authentication: a Survey",
journal = j-COMP-SURV,
volume = "52",
number = "3",
pages = "53:1--53:??",
month = jul,
year = "2019",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3314023",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Aug 31 09:04:37 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3314023",
abstract = "Among all Internet of Things (IoT) devices, a subset
of them are related to users. Leveraging these
user-related IoT elements, it is possible to ensure the
identity of the user for a period of time, thus
avoiding impersonation. This need is known as
Continuous Authentication (CA). Since 2009, a plethora
of IoT-based CA academic research and industrial
contributions have been proposed. We offer a
comprehensive overview of 58 research papers regarding
the main components of such a CA system. The status of
the industry is studied as well, covering 32 market
contributions, research projects, and related
standards. Lessons learned, challenges, and open issues
to foster further research in this area are finally
presented.",
acknowledgement = ack-nhfb,
articleno = "53",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Gope:2019:LLA,
author = "Prosanta Gope",
title = "{LAAP}: Lightweight anonymous authentication protocol
for {D2D}-Aided fog computing paradigm",
journal = j-COMPUT-SECUR,
volume = "86",
number = "??",
pages = "223--237",
month = sep,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S016740481831160X",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Gottel:2019:SPE,
author = "Christian G{\"o}ttel and Rafael Pires and Isabelly
Rocha and S{\'e}bastien Vaucher and Pascal Felber and
Marcelo Pasin and Valerio Schiavoni",
title = "Security, Performance and Energy Trade-offs of
Hardware-assisted Memory Protection Mechanisms",
journal = "arXiv.org",
volume = "??",
number = "??",
pages = "1--11",
day = "26",
month = jun,
year = "2019",
bibdate = "Mon Oct 07 10:53:26 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://arxiv.org/pdf/1903.04203.pdf",
abstract = "The deployment of large-scale distributed systems,
e.g., publish--subscribe platforms, that operate over
sensitive data using the infrastructure of public cloud
providers, is nowadays heavily hindered by the surging
lack of trust toward the cloud operators. Although
purely software-based solutions exist to protect the
confidentiality of data and the processing itself, such
as homomorphic encryption schemes, their performance is
far from being practical under real-world
workloads.\par
The performance trade-offs of two novel
hardware-assisted memory protection mechanisms, namely
AMD SEV and Intel SGX --- currently available on the
market to tackle this problem, are described in this
practical experience.\par
Specifically, we implement and evaluate a
publish/subscribe use-case and evaluate the impact of
the memory protection mechanisms and the resulting
performance. This paper reports on the experience
gained while building this system, in particular when
having to cope with the technical limitations imposed
by SEV and SGX.\par
Several trade-offs that provide valuable insights in
terms of latency, throughput, processing time and
energy requirements are exhibited by means of micro-
and macro-benchmarks.",
acknowledgement = ack-nhfb,
}
@Article{Green:2019:RMC,
author = "Frederic Green",
title = "Review of {{\booktitle{Modern Cryptography and
Elliptic Curves, A Beginner's Guide}} by Thomas R.
Shemanske}",
journal = j-SIGACT,
volume = "50",
number = "2",
pages = "12--14",
month = jun,
year = "2019",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/3351452.3351457",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Oct 22 09:39:55 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
abstract = "The equation $ y^2 = x^3 + a x^2 + b x + c $ might
seem a little innocuous at first. However, studying the
sets of rational points $ (x; y) $ obeying this
equation has proven to be one of the most far-reaching
and fruitful areas of mathematics. For example, it led,
aided and abetted by much of the most powerful
mathematics of the past century, to Wiles' proof of
Fermat's Last Theorem. And furthermore, these so-called
``elliptic curves'' (the terminology having little to
do with ellipses) are actually useful. You can factor
numbers with them! And send secret messages!",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Green:2019:RNT,
author = "Frederic Green",
title = "Review of {{\booktitle{Number Theory: an Introduction
via the Density of Primes}}, second edition}",
journal = j-SIGACT,
volume = "50",
number = "1",
pages = "9--13",
month = mar,
year = "2019",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/3319627.3319630",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Oct 22 09:39:55 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
abstract = "There are probably at least as many different
approaches to number theory as there are books written
about it. Some broad distinctions include those taking
an historical versus (say) a purely modern approach,
with many gradations in between, or those that are
algebraically oriented (e.g., with an emphasis on
reciprocity laws, or questions that relate to algebraic
geometry), or still others that are more analytic. The
book under review is definitely in the latter category.
The ``message'' of the book is in the title, as primes
and their density are the principle concern. In
accordance with that theme, a highlight of the book is
a complete proof of the prime number theorem. However,
the theme and its variations are taken as springboards
to other important fields, including aspects of
algebraic number theory, as well as applications, such
as primality testing and cryptography.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Grondahl:2019:TAA,
author = "Tommi Gr{\"o}ndahl and N. Asokan",
title = "Text Analysis in Adversarial Settings: Does Deception
Leave a Stylistic Trace?",
journal = j-COMP-SURV,
volume = "52",
number = "3",
pages = "45:1--45:??",
month = jul,
year = "2019",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3310331",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Aug 31 09:04:37 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3310331",
abstract = "Textual deception constitutes a major problem for
online security. Many studies have argued that
deceptiveness leaves traces in writing style, which
could be detected using text classification techniques.
By conducting an extensive literature review of
existing empirical work, we demonstrate that while
certain linguistic features have been indicative of
deception in certain corpora, they fail to generalize
across divergent semantic domains. We suggest that
deceptiveness as such leaves no content-invariant
stylistic trace, and textual similarity measures
provide a superior means of classifying texts as
potentially deceptive. Additionally, we discuss forms
of deception beyond semantic content, focusing on
hiding author identity by writing style obfuscation.
Surveying the literature on both author identification
and obfuscation techniques, we conclude that current
style transformation methods fail to achieve reliable
obfuscation while simultaneously ensuring semantic
faithfulness to the original text. We propose that
future work in style transformation should pay
particular attention to disallowing semantically
drastic changes.",
acknowledgement = ack-nhfb,
articleno = "45",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Gu:2019:GRM,
author = "Z. Gu and S. Li",
title = "A Generalized {RNS} {Mclaughlin} Modular
Multiplication with Non-Coprime Moduli Sets",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "11",
pages = "1689--1696",
month = nov,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2019.2917433",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Oct 29 11:08:44 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Digital arithmetic; Elliptic curve cryptography;
Indexes; McLaughlin modular multiplication;
Microelectronics; Montgomery modular multiplication;
Performance evaluation; Residue number systems",
}
@Article{Guimaraes:2019:OIQ,
author = "Antonio Guimar{\~a}es and Diego F. Aranha and Edson
Borin",
title = "Optimized implementation of {QC--MDPC} code-based
cryptography",
journal = j-CCPE,
volume = "31",
number = "18",
pages = "e5089:1--e5089:??",
day = "25",
month = sep,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.5089",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:05 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "16 December 2018",
}
@Article{Gunleifsen:2019:PCD,
author = "H{\aa}kon Gunleifsen and Thomas Kemmerich and
Vasileios Gkioulos",
title = "A Proof-of-Concept Demonstration of Isolated and
Encrypted Service Function Chains",
journal = j-FUTURE-INTERNET,
volume = "11",
number = "9",
pages = "183",
day = "24",
month = aug,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi11090183",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:07 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/11/9/183",
abstract = "Contemporary Service Function Chaining (SFC), and the
requirements arising from privacy concerns, call for
the increasing integration of security features such as
encryption and isolation across Network Function
Virtualisation (NFV) domains. Therefore, suitable
adaptations of automation and encryption concepts for
the development of interconnected data centre
infrastructures are essential. Nevertheless, packet
isolation constraints related to the current NFV
infrastructure and SFC protocols, render current NFV
standards insecure. Accordingly, the goal of our work
was an experimental demonstration of a new SFC packet
forwarding standard that enables contemporary data
centres to overcome these constraints. This article
presents a comprehensive view of the developed
architecture, focusing on the elements that constitute
a new forwarding standard of encrypted SFC packets.
Through a Proof-of-Concept demonstration, we present
our closing experimental results of how the
architecture fulfils the requirements defined in our
use case.",
acknowledgement = ack-nhfb,
remark = "Section Network Virtualization and Edge/Fog
Computing.",
}
@Article{Guo:2019:EER,
author = "Y. Guo and X. Yuan and X. Wang and C. Wang and B. Li
and X. Jia",
title = "Enabling Encrypted Rich Queries in Distributed
Key--Value Stores",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "30",
number = "6",
pages = "1283--1297",
month = jun,
year = "2019",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2018.2885519",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Fri Aug 30 06:09:58 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.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 = "cloud computing; cloud services; cloud storage;
cryptography; data privacy; data values; distributed
data stores; Distributed databases; distributed
key-value stores; EncKV; encrypted data; encrypted
distributed indexes; encrypted key-value pairs;
Encrypted key-value store; encrypted rich queries;
Encryption; exact-match queries; Indexes;
order-revealing encryption; parallel processing;
Protocols; query processing; range-match queries;
searchable encryption; searchable symmetric encryption;
Servers; storage management",
}
@Article{Guo:2019:NBT,
author = "Qian Guo and Thomas Johansson",
title = "A new birthday-type algorithm for attacking the fresh
re-keying countermeasure",
journal = j-INFO-PROC-LETT,
volume = "146",
number = "??",
pages = "30--34",
month = jun,
year = "2019",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2019.02.005",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Mar 18 10:10:09 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019019300420",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Guo:2019:NTP,
author = "Hui Guo and Zhenfeng Zhang and Jing Xu and Ningyu An",
title = "Non-transferable Proxy Re-encryption",
journal = j-COMP-J,
volume = "62",
number = "4",
pages = "490--506",
month = apr,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy096",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Apr 2 12:10:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/4/490/5146175",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Gupta:2019:DRB,
author = "Sandeep Gupta and Attaullah Buriro and Bruno Crispo",
title = "{DriverAuth}: a risk-based multi-modal biometric-based
driver authentication scheme for ride-sharing
platforms",
journal = j-COMPUT-SECUR,
volume = "83",
number = "??",
pages = "122--139",
month = jun,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818310113",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Gupta:2019:LAU,
author = "Ankur Gupta and Meenakshi Tripathi and Tabish Jamil
Shaikh and Aakar Sharma",
title = "A lightweight anonymous user authentication and key
establishment scheme for wearable devices",
journal = j-COMP-NET-AMSTERDAM,
volume = "149",
number = "??",
pages = "29--42",
day = "11",
month = feb,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2018.11.021",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Tue Jan 22 16:29:25 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128618304389",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Gupta:2019:OIT,
author = "Peeyush Gupta and Yin Li and Sharad Mehrotra and Nisha
Panwar and Shantanu Sharma and Sumaya Almanee",
title = "{Obscure}: information-theoretic oblivious and
verifiable aggregation queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "12",
number = "9",
pages = "1030--1043",
month = may,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.14778/3329772.3329779",
ISSN = "2150-8097",
bibdate = "Wed Oct 2 06:49:01 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Despite extensive research on cryptography, secure and
efficient query processing over outsourced data remains
an open challenge. We develop communication-efficient
and information-theoretically secure algorithms for
privacy-preserving aggregation queries using
multi-party computation (MPC). Specifically, query
processing techniques over secret-shared data
outsourced by single or multiple database owners are
developed. These algorithms allow a user to execute
queries on the secret-shared database and also prevent
the network and the (adversarial) clouds to learn the
user's queries, results, or the database. We further
develop (non-mandatory) privacy-preserving result
verification algorithms that detect malicious
behaviors, and experimentally validate the efficiency
of our approach over large datasets, the size of which
prior approaches to secret-sharing or MPC systems have
not scaled to.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Hadlington:2019:ERW,
author = "Lee Hadlington and Masa Popovac and Helge Janicke and
Iryna Yevseyeva and Kevin Jones",
title = "Exploring the role of work identity and work locus of
control in information security awareness",
journal = j-COMPUT-SECUR,
volume = "81",
number = "??",
pages = "41--48",
month = mar,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:59 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818308897",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Hajiali:2019:PPA,
author = "Mahdi Hajiali and Maryam Amirmazlaghani and Hossain
Kordestani",
title = "Preventing phishing attacks using text and image
watermarking",
journal = j-CCPE,
volume = "31",
number = "13",
pages = "e5083:1--e5083:??",
day = "10",
month = jul,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.5083",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "18 November 2018",
}
@Article{Hajihassani:2019:FAI,
author = "O. Hajihassani and S. K. Monfared and S. H. Khasteh
and S. Gorgin",
title = "Fast {AES} Implementation: A High-Throughput Bitsliced
Approach",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "30",
number = "10",
pages = "2211--2222",
month = oct,
year = "2019",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2019.2911278",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Dec 19 09:20:35 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib;
https://www.math.utah.edu/pub/tex/bib/pvm.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds",
keywords = "AES; byte-wise operations; computing process;
cryptography; CTR; CUDA; CUDA-enabled GPU; Data models;
data representation; data representation scheme; ECB;
Encryption; encryption throughput; fast AES
implementation; GPU; Graphics processing units;
high-performance; high-throughput bitsliced AES
implementation; high-throughput bitsliced approach;
logic circuits; parallel architectures; parallelization
capability; parallelization unit; S-box logic circuit;
ShiftRows; Standards; substitute bytes stage; Table
lookup; Throughput",
}
@Article{Hall:2019:BIA,
author = "Calum C. Hall and Lynsay A. Shepherd and Natalie
Coull",
title = "{BlackWatch}: Increasing Attack Awareness within {Web}
Applications",
journal = j-FUTURE-INTERNET,
volume = "11",
number = "2",
pages = "44",
day = "15",
month = feb,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi11020044",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:04 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/11/2/44",
abstract = "Web applications are relied upon by many for the
services they provide. It is essential that
applications implement appropriate security measures to
prevent security incidents. Currently, web applications
focus resources towards the preventative side of
security. While prevention is an essential part of the
security process, developers must also implement a
level of attack awareness into their web applications.
Being able to detect when an attack is occurring
provides applications with the ability to execute
responses against malicious users in an attempt to slow
down or deter their attacks. This research seeks to
improve web application security by identifying
malicious behavior from within the context of web
applications using our tool BlackWatch. The tool is a
Python-based application which analyzes suspicious
events occurring within client web applications, with
the objective of identifying malicious patterns of
behavior. This approach avoids issues typically
encountered with traditional web application firewalls.
Based on the results from a preliminary study,
BlackWatch was effective at detecting attacks from both
authenticated and unauthenticated users. Furthermore,
user tests with developers indicated BlackWatch was
user-friendly, and was easy to integrate into existing
applications. Future work seeks to develop the
BlackWatch solution further for public release.",
acknowledgement = ack-nhfb,
}
@Article{Hamidi:2019:ADS,
author = "Hodjat Hamidi",
title = "An approach to develop the smart health using
{Internet of Things} and authentication based on
biometric technology",
journal = j-FUT-GEN-COMP-SYS,
volume = "91",
number = "??",
pages = "434--449",
month = feb,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Feb 5 08:15:51 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X18313517",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Hammad:2019:NTD,
author = "Mohamed Hammad and Shanzhuo Zhang and Kuanquan Wang",
title = "A novel two-dimensional {ECG} feature extraction and
classification algorithm based on convolution neural
network for human authentication",
journal = j-FUT-GEN-COMP-SYS,
volume = "101",
number = "??",
pages = "180--196",
month = dec,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.06.008",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:02 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18329923",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Hammad:2019:PSF,
author = "Mohamed Hammad and Kuanquan Wang",
title = "Parallel score fusion of {ECG} and fingerprint for
human authentication based on convolution neural
network",
journal = j-COMPUT-SECUR,
volume = "81",
number = "??",
pages = "107--122",
month = mar,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:59 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818308411",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Han:2019:ABI,
author = "Jinguang Han and Maoxuan Bei and Liqun Chen and Yang
Xiang and Jie Cao and Fuchun Guo and Weizhi Meng",
title = "Attribute-Based Information Flow Control",
journal = j-COMP-J,
volume = "62",
number = "8",
pages = "1214--1231",
month = aug,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz018",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Aug 19 07:31:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/8/1214/5488733",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Handa:2019:SES,
author = "Rohit Handa and C. Rama Krishna and Naveen Aggarwal",
title = "Searchable encryption: a survey on privacy-preserving
search schemes on encrypted outsourced data",
journal = j-CCPE,
volume = "31",
number = "17",
pages = "e5201:1--e5201:??",
day = "10",
month = sep,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.5201",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:05 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "02 April 2019",
}
@Article{Hanocka:2019:APS,
author = "Rana Hanocka and Noa Fish and Zhenhua Wang and Raja
Giryes and Shachar Fleishman and Daniel Cohen-Or",
title = "{ALIGNet}: Partial-Shape Agnostic Alignment via
Unsupervised Learning",
journal = j-TOG,
volume = "38",
number = "1",
pages = "1:1--1:??",
month = feb,
year = "2019",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/3267347",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Tue Oct 22 12:28:15 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3267347",
abstract = "The process of aligning a pair of shapes is a
fundamental operation in computer graphics. Traditional
approaches rely heavily on matching corresponding
points or features to guide the alignment, a paradigm
that falters when significant shape portions are
missing. These techniques generally do not incorporate
prior knowledge about expected shape characteristics,
which can help compensate for any misleading cues left
by inaccuracies exhibited in the input shapes. We
present an approach based on a deep neural network,
leveraging shape datasets to learn a shape-aware prior
for source-to-target alignment that is robust to shape
incompleteness. In the absence of ground truth
alignments for supervision, we train a network on the
task of shape alignment using incomplete shapes
generated from full shapes for self-supervision. Our
network, called ALIGNet, is trained to warp complete
source shapes to incomplete targets, as if the target
shapes were complete, thus essentially rendering the
alignment partial-shape agnostic. We aim for the
network to develop specialized expertise over the
common characteristics of the shapes in each dataset,
thereby achieving a higher-level understanding of the
expected shape space to which a local approach would be
oblivious. We constrain ALIGNet through an anisotropic
total variation identity regularization to promote
piecewise smooth deformation fields, facilitating both
partial-shape agnosticism and post-deformation
applications. We demonstrate that ALIGNet learns to
align geometrically distinct shapes and is able to
infer plausible mappings even when the target shape is
significantly incomplete. We show that our network
learns the common expected characteristics of shape
collections without over-fitting or memorization,
enabling it to produce plausible deformations on unseen
data during test time.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@Article{Hanzlik:2019:CPC,
author = "Lucjan Hanzlik and Kamil Kluczniak and Miros{\l}aw
Kuty{\l}owski",
title = "{CTRL-PACE}: Controlled Randomness for e-Passport
Password Authentication",
journal = j-FUND-INFO,
volume = "169",
number = "4",
pages = "295--330",
month = "????",
year = "2019",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2019-1849",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Wed Mar 24 12:51:47 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Hao:2019:IDP,
author = "Y. Hao and T. Isobe and L. Jiao and C. Li and W. Meier
and Y. Todo and Q. Wang",
title = "Improved Division Property Based Cube Attacks
Exploiting Algebraic Properties of {Superpoly}",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "10",
pages = "1470--1486",
month = oct,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2019.2909871",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Sep 12 13:33:25 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Acorn; Analytical models; Ciphers; Complexity theory;
Computational modeling; Correlation; Cube attack;
division property; grain-128a; kreyvium; milp;
TriviA-SC1/2; Trivium; Upper bound",
}
@Article{Harb:2019:FIE,
author = "Salah Harb and Moath Jarrah",
title = "{FPGA} Implementation of the {ECC} Over {$ {\rm
GF}(2^m) $} for Small Embedded Applications",
journal = j-TECS,
volume = "18",
number = "2",
pages = "17:1--17:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3310354",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:43 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3310354",
abstract = "In this article, we propose a compact elliptic curve
cryptographic core over GF($ 2^m$). The proposed
architecture is based on the Lopez-Dahab projective
point arithmetic operations. To achieve efficiency in
resources usage, an iterative method that uses a
ROM-based state machine is developed for the elliptic
curve cryptography (ECC) point doubling and addition
operations. The compact ECC core has been implemented
using Virtex FPGA devices. The number of the required
slices is 2,102 at 321MHz and 6,738 slices at 262MHz
for different GF($ 2^m$). Extensive experiments were
conducted to compare our solution to existing methods
in the literature. Our compact core consumes less area
than all previously proposed methods. It also provides
an excellent performance for scalar multiplication. In
addition, the ECC core is implemented in ASIC 0.18 $
\mu $ m CMOS technology, and the results show excellent
performance. Therefore, our proposed ECC core method
provides a balance in terms of speed, area, and power
consumption. This makes the proposed design the right
choice for cryptosystems in limited-resource devices
such as cell phones, IP cores of SoCs, and smart cards.
Moreover, side-channel attack resistance is implemented
to prevent power analysis.",
acknowledgement = ack-nhfb,
articleno = "17",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{UlHassan:2019:DPR,
author = "Muneeb {Ul Hassan} and Mubashir Husain Rehmani and
Ramamohanarao Kotagiri and Jiekui Zhang and Jinjun Chen",
title = "Differential privacy for renewable energy resources
based smart metering",
journal = j-J-PAR-DIST-COMP,
volume = "131",
number = "??",
pages = "69--80",
month = sep,
year = "2019",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2019.04.012",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Mon Jun 10 07:36:16 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731518309201",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Hejun:2019:OAI,
author = "Zhu Hejun and Zhu Liehuang",
title = "Online and automatic identification of encryption
network behaviors in big data environment",
journal = j-CCPE,
volume = "31",
number = "12",
pages = "e4849:1--e4849:??",
day = "25",
month = jun,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4849",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "25 October 2018",
}
@Article{Herardian:2019:SUC,
author = "R. Herardian",
title = "The Soft Underbelly of Cloud Security",
journal = j-IEEE-SEC-PRIV,
volume = "17",
number = "3",
pages = "90--93",
month = may # "\slash " # jun,
year = "2019",
DOI = "https://doi.org/10.1109/MSEC.2019.2904112",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "Cloud computing; Computer hacking; Computer security;
Encryption; Firewalls; Software tools",
}
@Article{Hibschman:2019:ISS,
author = "Joshua Hibschman and Darren Gergle and Eleanor
O'Rourke and Haoqi Zhang",
title = "{Isopleth}: Supporting Sensemaking of Professional
{Web} Applications to Create Readily Available Learning
Experiences",
journal = j-TOCHI,
volume = "26",
number = "3",
pages = "16:1--16:??",
month = jun,
year = "2019",
CODEN = "ATCIF4",
DOI = "https://doi.org/10.1145/3310274",
ISSN = "1073-0516 (print), 1557-7325 (electronic)",
ISSN-L = "1073-0516",
bibdate = "Tue Oct 22 08:21:01 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tochi.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3310274",
abstract = "Online resources can help novice developers learn
basic programming skills, but few resources support
progressing from writing working code to learning
professional web development practices. We address this
gap by advancing Readily Available Learning
Experiences, a conceptual approach for transforming all
professional web applications into opportunities for
authentic learning. This article presents Isopleth, a
web-based platform that helps learners make sense of
complex code constructs and hidden asynchronous
relationships in professional web code. Isopleth embeds
sensemaking scaffolds informed by the learning sciences
to (1) expose hidden functional and event-driven
relationships, (2) surface functionally related slices
of code, and (3) support learners manipulating the
provided code representations. To expose event-driven
relationships, Isopleth implements a novel technique
called Serialized Deanonymization to determine and
visualize asynchronous functional relationships. To
evaluate Isopleth, we conducted a case study across 12
professional websites and a user study with 14 junior
and senior developers. Results show that Isopleth's
sensemaking scaffolds helped to surface implementation
approaches in event binding, web application design,
and complex interactive features across a range of
complex professional web applications. Moreover,
Isopleth helped junior developers improve the accuracy
of their conceptual models of how features are
implemented by 31\% on average.",
acknowledgement = ack-nhfb,
articleno = "16",
fjournal = "ACM Transactions on Computer-Human Interaction",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J756",
}
@Article{Hiemenz:2019:DSS,
author = "Benedikt Hiemenz and Michel Kr{\"a}mer",
title = "Dynamic searchable symmetric encryption for storing
geospatial data in the cloud",
journal = j-INT-J-INFO-SEC,
volume = "18",
number = "3",
pages = "333--354",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-018-0414-4",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Thu May 23 17:57:24 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib",
URL = "http://link.springer.com/article/10.1007/s10207-018-0414-4",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
}
@Article{Hintze:2019:CUR,
author = "Daniel Hintze and Matthias F{\"u}ller and Sebastian
Scholz and Rainhard D. Findling and Muhammad Muaaz and
Philipp Kapfer and Eckhard Koch and Ren{\'e}
Mayrhofer",
title = "{CORMORANT}: Ubiquitous Risk-Aware Multi-Modal
Biometric Authentication across Mobile Devices",
journal = j-IMWUT,
volume = "3",
number = "3",
pages = "1--23",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3351243",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:37:13 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3351243",
abstract = "People own and carry an increasing number of
ubiquitous mobile devices, such as smartphones,
tablets, and notebooks. Being small and mobile, those
devices have a high propensity to become lost or
stolen. Since mobile devices provide access to their
\ldots{}",
acknowledgement = ack-nhfb,
articleno = "85",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Hisil:2019:KLF,
author = "Huseyin Hisil and Joost Renes",
title = "On {Kummer} Lines with Full Rational 2-torsion and
Their Usage in Cryptography",
journal = j-TOMS,
volume = "45",
number = "4",
pages = "39:1--39:17",
month = dec,
year = "2019",
CODEN = "ACMSCU",
DOI = "https://doi.org/10.1145/3361680",
ISSN = "0098-3500 (print), 1557-7295 (electronic)",
ISSN-L = "0098-3500",
bibdate = "Fri Dec 27 14:56:25 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/toms.bib",
URL = "https://dl.acm.org/citation.cfm?id=3361680",
abstract = "A paper by Karati and Sarkar at Asiacrypt'17 has
pointed out the potential for Kummer lines in genus 1,
by observing that their SIMD-friendly arithmetic is
competitive with the status quo. A more recent preprint
explores the connection with (twisted) Edwards curves.
In this article, we extend this work and significantly
simplify the treatment of Karati and Sarkar. We show
that their Kummer line is the x -line of a Montgomery
curve translated by a point of order two, and exhibit a
natural isomorphism to the y -line of a twisted Edwards
curve. Moreover, we show that the Kummer line presented
by Gaudry and Lubicz can be obtained via the action of
a point of order two on the y -line of an Edwards
curve. The maps connecting these curves and lines are
all very simple. As a result, a cryptographic
implementation can use the arithmetic that is optimal
for its instruction set at negligible cost.",
acknowledgement = ack-nhfb,
articleno = "39",
fjournal = "ACM Transactions on Mathematical Software (TOMS)",
journal-URL = "http://dl.acm.org/pub.cfm?id=J782",
}
@Article{Hodgson:2019:SSC,
author = "Roderick Hodgson",
title = "Solving the security challenges of {IoT} with public
key cryptography",
journal = j-NETWORK-SECURITY,
volume = "2019",
number = "1",
pages = "17--19",
month = jan,
year = "2019",
CODEN = "NTSCF5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Thu Sep 12 12:58:05 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S135348581930011X",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Hong:2019:MCP,
author = "Haibo Hong and Licheng Wang and Jun Shao and Jianhua
Yan and Haseeb Ahmad and Guiyi Wei and Mande Xie and
Yixian Yang",
title = "A Miniature {CCA} Public Key Encryption Scheme Based
on Non-abelian Factorization Problem in Finite Groups
of {Lie} Type",
journal = j-COMP-J,
volume = "62",
number = "12",
pages = "1840--1848",
month = dec,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz068",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Dec 23 06:38:51 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/12/1840/5627776",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Horsman:2019:CPE,
author = "G. Horsman",
title = "A Call for the Prohibition of Encryption: Panacea or
Problem?",
journal = j-IEEE-SEC-PRIV,
volume = "17",
number = "2",
pages = "59--66",
month = mar # "\slash " # apr,
year = "2019",
DOI = "https://doi.org/10.1109/MSEC.2018.2888776",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "cryptography; encrypted channels; encryption;
Encryption; evolved form; Organizations; Privacy;
Standards organizations; Surveillance; terror attack;
Terrorism; terrorism; western civilization",
}
@Article{Hosny:2019:RCI,
author = "Khalid M. Hosny and Mohamed M. Darwish",
title = "Resilient Color Image Watermarking Using Accurate
Quaternion Radial Substituted {Chebyshev} Moments",
journal = j-TOMM,
volume = "15",
number = "2",
pages = "46:1--46:??",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3325193",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Wed Oct 2 10:12:46 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3325193",
abstract = "In this work, a new quaternion-based method for color
image watermarking is proposed. In this method, a novel
set of quaternion radial substituted Chebyshev moments
(QRSCMs) is presented for robust geometrically
invariant image watermarking. An efficient
computational method is proposed for highly accurate,
fast, and numerically stable QRSCMs in polar
coordinates. The proposed watermarking method consists
of three stages. In the first stage, the Arnold
transform is used to improve the security of the
watermarking scheme by scrambling the binary watermark.
In the second stage, the proposed accurate and stable
QRSCMs of the host color image are computed. In the
third stage, the encrypted binary watermark is embedded
into the host image by employing the quantization
technique on selected-magnitude QRSCMs where the
watermarked color image is obtained by adding the
original host color image to the compensation image.
Then, the binary watermark can be extracted directly
without using the original image from the magnitudes of
QRSCMs. Numerical experiments are performed where the
performance of proposed method is compared with the
existing quaternion moment-based watermarking methods.
The comparison clearly shows that the proposed method
is very efficient in terms of the visual
imperceptibility capability and the robustness under
different attacks compared to the existing quaternion
moment-based watermarking algorithms.",
acknowledgement = ack-nhfb,
articleno = "46",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Hu:2019:AAA,
author = "Yupu Hu and Zhizhu Lian and Jiangshan Chen and Baocang
Wang and Shanshan Zhang",
title = "Algebraic Attacks Against Several Weak Variants of
{GVW 13 ABE}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "607--618",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S012905411940015X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012905411940015X",
abstract = "Attribute-based encryption (ABE) is an active research
area in the public-key cryptography. Among large amount
of ABE schemes, the scheme GVW 13 (STOC13) is an
well-known candidate for realizing ABE via lattice
mechanism, whose security relies on learning with
errors (LWE). This ABE scheme has very exquisite
structure, and its crucial component lies in using that
two-to-one recoding (TOR) algorithm. However, the main
shortcoming of GVW 13 is the use of the huge key-size.
Therefore, it encourages people to find out some more
simplified variants of GVW 13. In this paper, we first
propose three variants of GVW 13 for reducing the size
of secret key, which would be the feasible strategies
to improve GVW 13 with great possibility.
Unfortunately, we can still present three related
attacks against these three proposals under the same
collusion scenario, respectively.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Hu:2019:CAC,
author = "Chengyu Hu and Rupeng Yang and Pengtao Liu and Tong Li
and Fanyu Kong",
title = "A countermeasure against cryptographic key leakage in
cloud: public-key encryption with continuous leakage
and tampering resilience",
journal = j-J-SUPERCOMPUTING,
volume = "75",
number = "6",
pages = "3099--3122",
month = jun,
year = "2019",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-018-2534-z",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Oct 10 15:31:20 MDT 2019",
bibsource = "http://link.springer.com/journal/11227/75/6;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Huang:2019:AIA,
author = "Anna Huang and Dong Wang and Run Zhao and Qian Zhang",
title = "{Au-Id}: Automatic User Identification and
Authentication through the Motions Captured from
Sequential Human Activities Using {RFID}",
journal = j-IMWUT,
volume = "3",
number = "2",
pages = "1--26",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3328919",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:37:11 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3328919",
abstract = "The advancements of ambient intelligence and
ubiquitous computing are driving the unprecedented
development of smart spaces where enhanced services are
provided based on activity recognition. Meanwhile, user
identification, which can enable the \ldots{}",
acknowledgement = ack-nhfb,
articleno = "48",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Huang:2019:ILA,
author = "Bo-Yuan Huang and Hongce Zhang and Pramod Subramanyan
and Yakir Vizel and Aarti Gupta and Sharad Malik",
title = "Instruction-Level Abstraction {(ILA)}: a Uniform
Specification for System-on-Chip {(SoC)} Verification",
journal = j-TODAES,
volume = "24",
number = "1",
pages = "10:1--10:??",
month = jan,
year = "2019",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/3282444",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Mar 22 16:58:40 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "Modern Systems-on-Chip (SoC) designs are increasingly
heterogeneous and contain specialized semi-programmable
accelerators in addition to programmable processors. In
contrast to the pre-accelerator era, when the ISA
played an important role in verification by enabling a
clean separation of concerns between software and
hardware, verification of these ``accelerator-rich''
SoCs presents new challenges. From the perspective of
hardware designers, there is a lack of a common
framework for formal functional specification of
accelerator behavior. From the perspective of software
developers, there exists no unified framework for
reasoning about software/hardware interactions of
programs that interact with accelerators. This article
addresses these challenges by providing a formal
specification and high-level abstraction for
accelerator functional behavior. It formalizes the
concept of an Instruction Level Abstraction (ILA),
developed informally in our previous work, and shows
its application in modeling and verification of
accelerators. This formal ILA extends the familiar
notion of instructions to accelerators and provides a
uniform, modular, and hierarchical abstraction for
modeling software-visible behavior of both accelerators
and programmable processors. We demonstrate the
applicability of the ILA through several case studies
of accelerators (for image processing, machine
learning, and cryptography), and a general-purpose
processor (RISC-V). We show how the ILA model
facilitates equivalence checking between two ILAs, and
between an ILA and its hardware finite-state machine
(FSM) implementation. Further, this equivalence
checking supports accelerator upgrades using the notion
of ILA compatibility, similar to processor upgrades
using ISA compatibility.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Huber:2019:FCL,
author = "Manuel Huber and Julian Horsch and Junaid Ali and
Sascha Wessel",
title = "Freeze and Crypt: {Linux} kernel support for main
memory encryption",
journal = j-COMPUT-SECUR,
volume = "86",
number = "??",
pages = "420--436",
month = sep,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/linux.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818310435",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Hurrah:2019:DWF,
author = "Nasir N. Hurrah and Shabir A. Parah and Nazir A. Loan
and Javaid A. Sheikh and Mohammad Elhoseny and Khan
Muhammad",
title = "Dual watermarking framework for privacy protection and
content authentication of multimedia",
journal = j-FUT-GEN-COMP-SYS,
volume = "94",
number = "??",
pages = "654--673",
month = may,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2018.12.036",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18317096",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Hwang:2019:BBR,
author = "S. O. Hwang and A. Mehmood",
title = "Blockchain-Based Resource Syndicate",
journal = j-COMPUTER,
volume = "52",
number = "5",
pages = "58--66",
month = may,
year = "2019",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2018.2888773",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Thu Jun 27 10:30:21 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/computer2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
keywords = "automated structure; Blockchain; blockchain-based
resource syndicate; computational resources; consistent
replication; cryptocurrencies; data structures;
Encryption; financial transactions; Hash functions;
incorruptible distributed data structure; Internet;
meta data; multiple nodes; Peer-to-peer computing;
Receivers; Redundancy",
}
@Article{Hwang:2019:ELS,
author = "Min-Shiang Hwang and Cheng-Chi Lee and Shih-Ting Hsu",
title = "An {ElGamal}-like Secure Channel Free Public Key
Encryption with Keyword Search Scheme",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "2",
pages = "??--??",
month = feb,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500047",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 13 07:03:58 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "The idea of public key encryption with keyword search
(PEKS), proposed by Boneh et al., enables one to send a
trapdoor containing a encrypted keyword to query data
without revealing the keyword. In Boneh et al.'s
design, the trapdoor has to be transferred through a
secure channel, which is both costly and inefficient.
Baek et al. then proposed an efficient secure channel
free public key encryption scheme with keyword search
(SCF-PEKS). After that, vast amounts of research have
focused on the protection against the off-line keyword
guessing attack (OKGA) by enhancing the model. However,
most of the PEKS/SCF-PEKS schemes developed so far are
constructed by applying bilinear pairing and are
susceptible to off-line keyword guessing attacks. In
this paper, we propose a new SCF-PEKS scheme based on
the ElGamal cryptosystem. The proposed scheme is not
only secure against off-line keyword guessing attacks
but also improves the efficiency.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibrahim:2019:RAM,
author = "Tahir Musa Ibrahim and Shafi'i Muhammad Abdulhamid and
Ala Abdusalam Alarood and Haruna Chiroma and Mohammed
Ali Al-garadi and Nadim Rana and Amina Nuhu Muhammad
and Adamu Abubakar and Khalid Haruna and Lubna A.
Gabralla",
title = "Recent advances in mobile touch screen security
authentication methods: a systematic literature
review",
journal = j-COMPUT-SECUR,
volume = "85",
number = "??",
pages = "1--24",
month = aug,
year = "2019",
CODEN = "CPSEDU",
DOI = "https://doi.org/10.1016/j.cose.2019.04.008",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:01 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818305030",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Manual{Intel:2019:IAM,
author = "{Intel}",
title = "{Intel} Architecture Memory Encryption Technologies
Specification",
organization = "{Intel Corporation}",
address = "????",
edition = "336907-002US (Revision 1.2)",
month = apr,
year = "2019",
bibdate = "Mon Oct 07 10:23:54 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "https://software.intel.com/sites/default/files/managed/a5/16/Multi-Key-Total-Memory-Encryption-Spec.pdf",
abstract = "This document describes the memory encryption support
targeting future Intel processors. Note that Intel
platforms support many different types of memory and
not all SOC implementations will support this
capability for all types of memory. Initial
implementation is likely to focus on traditional DRAM
and NVRAM.\par
Total Memory Encryption (TME) --- provides the
capability to encrypt the entirety of the physical
memory of a system. This capability is typically
enabled in the very early stages of the boot process
with a small change to BIOS, and once configured and
locked, will encrypt all the data on external memory
buses of an SOC using the NIST standard AES-XTS
algorithm with 128-bit keys. The encryption key used
for TME uses a hardware random number generator
implemented in the Intel SOC, and the keys are not
accessible by software or by using external interfaces
to the Intel SOC. TME capability is intended to provide
protections of AES-XTS to external memory buses and
DIMMs. The architecture is flexible and will support
additional memory protection schemes in the future.
This capability, when enabled, is intended to support
(unmodified) existing system and application software.
Overall performance impact of this capability is likely
to be relatively small and is highly dependent on
workload.",
acknowledgement = ack-nhfb,
}
@Article{Jan:2019:PBM,
author = "Mian Ahmad Jan and Fazlullah Khan and Muhammad Alam
and Muhammad Usman",
title = "A payload-based mutual authentication scheme for
{Internet of Things}",
journal = j-FUT-GEN-COMP-SYS,
volume = "92",
number = "??",
pages = "1028--1039",
month = mar,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Feb 5 08:15:51 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17303898",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Jan:2019:SEE,
author = "Mian Ahmad Jan and Wenjing Zhang and Muhammad Usman
and Zhiyuan Tan and Fazlullah Khan and Entao Luo",
title = "{SmartEdge}: an end-to-end encryption framework for an
edge-enabled smart city application",
journal = j-J-NETW-COMPUT-APPL,
volume = "137",
number = "??",
pages = "1--10",
day = "1",
month = jul,
year = "2019",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2019.02.023",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:33 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804519300827",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Jannati:2019:SOR,
author = "Hoda Jannati and Ramtin Khosravi",
title = "On the security of one-round meeting location
determination protocol",
journal = j-INFO-PROC-LETT,
volume = "146",
number = "??",
pages = "35--38",
month = jun,
year = "2019",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2019.02.004",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Mar 18 10:10:09 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019019300274",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Jiang:2019:PPP,
author = "Wenbo Jiang and Hongwei Li and Guowen Xu and Mi Wen
and Guishan Dong and Xiaodong Lin",
title = "{PTAS}: Privacy-preserving Thin-client Authentication
Scheme in blockchain-based {PKI}",
journal = j-FUT-GEN-COMP-SYS,
volume = "96",
number = "??",
pages = "185--195",
month = jul,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.01.026",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:56 MDT 2019",
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/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18315097",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Jiang:2019:SSL,
author = "Yichen Jiang and Jenny Hamer and Chenghong Wang and
Xiaoqian Jiang and Miran Kim and Yongsoo Song and Yuhou
Xia and Noman Mohammed and Md Nazmus Sadat and Shuang
Wang",
title = "{SecureLR}: Secure Logistic Regression Model via a
Hybrid Cryptographic Protocol",
journal = j-TCBB,
volume = "16",
number = "1",
pages = "113--123",
month = jan,
year = "2019",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2018.2833463",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Mon Mar 11 18:45:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "Machine learning applications are intensively utilized
in various science fields, and increasingly the
biomedical and healthcare sector. Applying predictive
modeling to biomedical data introduces privacy and
security concerns requiring additional protection to
prevent accidental disclosure or leakage of sensitive
patient information. Significant advancements in secure
computing methods have emerged in recent years,
however, many of which require substantial
computational and/or communication overheads, which
might hinder their adoption in biomedical applications.
In this work, we propose SecureLR, a novel framework
allowing researchers to leverage both the computational
and storage capacity of Public Cloud Servers to conduct
learning and predictions on biomedical data without
compromising data security or efficiency. Our model
builds upon homomorphic encryption methodologies with
hardware-based security reinforcement through Software
Guard Extensions SGX, and our implementation
demonstrates a practical hybrid cryptographic solution
to address important concerns in conducting machine
learning with public clouds.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@Article{Jiao:2019:AMC,
author = "Y. Jiao and P. Wang and D. Niyato and K.
Suankaewmanee",
title = "Auction Mechanisms in Cloud\slash Fog Computing
Resource Allocation for Public Blockchain Networks",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "30",
number = "9",
pages = "1975--1989",
month = sep,
year = "2019",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2019.2900238",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Fri Aug 30 06:09:58 2019",
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/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 = "Approximation algorithms; auction; auction mechanism;
auction-based market model; block mining; Blockchain;
cloud computing; cloud/fog computing; computational
complexity; constant-demand bidding scheme;
cryptocurrencies; Cryptography; data mining;
decentralized data management applications;
decentralized secure data management platform;
distributed databases; electronic commerce; game
theory; mobile computing; multidemand bidding scheme;
Peer-to-peer computing; pricing; proof of work;
proof-of-work based consensus protocols; Protocols;
public blockchain networks; resource allocation;
Resource management; social welfare; Task analysis;
tendering",
}
@Article{Jin:2019:RPP,
author = "Hongyu Jin and Panos Papadimitratos",
title = "Resilient Privacy Protection for Location-Based
Services through Decentralization",
journal = j-TOPS,
volume = "22",
number = "4",
pages = "21:1--21:??",
month = dec,
year = "2019",
DOI = "https://doi.org/10.1145/3319401",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
ISSN-L = "2471-2566",
bibdate = "Wed Dec 18 14:55:10 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
URL = "https://dl.acm.org/citation.cfm?id=3319401",
abstract = "Location-Based Services (LBSs) provide valuable
services, with convenient features for mobile users.
However, the location and other information disclosed
through each query to the LBS erodes user privacy. This
is a concern especially because LBS providers can be
honest-but-curious, collecting queries and tracking
users' whereabouts and infer sensitive user data. This
motivated both centralized and decentralized location
privacy protection schemes for LBSs: anonymizing and
obfuscating LBS queries to not disclose exact
information, while still getting useful responses.
Decentralized schemes overcome disadvantages of
centralized schemes, eliminating anonymizers, and
enhancing users' control over sensitive information.
However, an insecure decentralized system could create
serious risks beyond private information leakage. More
so, attacking an improperly designed decentralized LBS
privacy protection scheme could be an effective and
low-cost step to breach user privacy. We address
exactly this problem, by proposing security
enhancements for mobile data sharing systems. We
protect user privacy while preserving accountability of
user activities, leveraging pseudonymous authentication
with mainstream cryptography. We show our scheme can be
deployed with off-the-shelf devices based on an
experimental evaluation of an implementation in a
static automotive testbed.",
acknowledgement = ack-nhfb,
articleno = "21",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{K:2019:IAM,
author = "Deepa K. and Radhamani G. and Vinod P. and Mohammad
Shojafar and Neeraj Kumar and Mauro Conti",
title = "Identification of {Android} malware using refined
system calls",
journal = j-CCPE,
volume = "31",
number = "20",
pages = "e5311:1--e5311:??",
day = "25",
month = oct,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.5311",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:06 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "09 May 2019",
}
@Article{Kabirirad:2019:HSG,
author = "Saeideh Kabirirad and Mahmood Fazlali and Ziba
Eslami",
title = "High-speed {GPU} implementation of a secret sharing
scheme based on cellular automata",
journal = j-J-SUPERCOMPUTING,
volume = "75",
number = "11",
pages = "7314--7336",
month = nov,
year = "2019",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-019-02910-w",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jul 25 07:17:52 MDT 2020",
bibsource = "http://link.springer.com/journal/11227/75/11;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Kalita:2019:NSM,
author = "Manashee Kalita and Themrichon Tuithung and Swanirbhar
Majumder",
title = "A New Steganography Method Using Integer Wavelet
Transform and Least Significant Bit Substitution",
journal = j-COMP-J,
volume = "62",
number = "11",
pages = "1639--1655",
month = nov,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz014",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Nov 30 05:41:04 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/11/1639/5369945",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Kammuller:2019:ATI,
author = "Florian Kamm{\"u}ller",
title = "Attack trees in {Isabelle} extended with probabilities
for quantum cryptography",
journal = j-COMPUT-SECUR,
volume = "87",
number = "??",
pages = "Article 101572",
month = nov,
year = "2019",
CODEN = "CPSEDU",
DOI = "https://doi.org/10.1016/j.cose.2019.101572",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Sat Jan 22 15:25:37 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S016740481930135X",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Kang:2019:NBK,
author = "Burong Kang and Xinyu Meng and Lei Zhang and Yinxia
Sun",
title = "Nonce-Based Key Agreement Protocol Against Bad
Randomness",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "619--633",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400161",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400161",
abstract = "Most of the existing cryptographic schemes, e.g., key
agreement protocol, call for good randomness.
Otherwise, the security of these cryptographic schemes
cannot be fully guaranteed. Nonce-based cryptosystem is
recently introduced to improve the security of public
key encryption and digital signature schemes by
ensuring security when randomness fails. In this paper,
we first investigate the security of key agreement
protocols when randomness fails. Then we define the
security model for nonce-based key agreement protocols
and propose a nonce-based key agreement protocol that
protects against bad randomness. The new protocol is
proven to be secure in our proposed security model.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Kara:2019:ALS,
author = "Orhun Kara and Muhammed F. Esgin",
title = "On Analysis of Lightweight Stream Ciphers with Keyed
Update",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "1",
pages = "99--110",
month = "????",
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2851239",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Dec 26 06:35:11 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8400392/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Kilgallin:2019:FRK,
author = "Jonathan Kilgallin and Ross Vasko",
editor = "{IEEE}",
booktitle = "{First IEEE International Conference on Trust, Privacy
and Security in Intelligent Systems and Applications
(TPS-ISA): 12--14 December 2019}",
title = "Factoring {RSA} keys in the {IoT} era",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "184--189",
year = "2019",
bibdate = "Fri Jul 29 08:02:15 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://ieeexplore.ieee.org/document/9014350",
abstract = "RSA keys are at risk of compromise when using improper
random number generation. Many weak keys can
efficiently be discovered and subsequently compromised
by finding reused prime factors in a large data set. We
collect and analyze 75 million RSA certificates from
the Internet, and find that 1 in 172 keys share a
factor with another. In contrast, only 5 of 100 million
certificates found in a sample from Certificate
Transparency logs are compromised by the same
technique. The discrepancy in rates of compromise is
overwhelmingly due to IoT devices exposed to the
Internet, which may be subject to design constraints
and limited entropy. The widespread susceptibility of
these IoT devices poses a potential risk to the public
due to their presence in sensitive settings. We
conclude that device manufacturers must ensure their
devices have access to sufficient entropy and adhere to
best practices in cryptography to protect consumers.",
acknowledgement = ack-nhfb,
}
@Article{Kim:2019:AAI,
author = "Jihye Kim and Jiwon Lee and Hankyung Ko and Donghwan
Oh and Semin Han and Gwonho Jeong and Hyunok Oh",
title = "{AuthCropper}: Authenticated Image Cropper for Privacy
Preserving Surveillance Systems",
journal = j-TECS,
volume = "18",
number = "5s",
pages = "62:1--62:??",
month = oct,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3358195",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:44 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3358195",
abstract = "As surveillance systems are popular, the privacy of
the recorded video becomes more important. On the other
hand, the authenticity of video images should be
guaranteed when used as evidence in court. It is
challenging to satisfy both (personal) privacy and
authenticity of a video simultaneously, since the
privacy requires modifications (e.g., partial
deletions) of an original video image while the
authenticity does not allow any modifications of the
original image. This paper proposes a novel method to
convert an encryption scheme to support partial
decryption with a constant number of keys and construct
a privacy-aware authentication scheme by combining with
a signature scheme. The security of our proposed scheme
is implied by the security of the underlying encryption
and signature schemes. Experimental results show that
the proposed scheme can handle the UHD video stream
with more than 17 fps on a real embedded system, which
validates the practicality of the proposed scheme.",
acknowledgement = ack-nhfb,
articleno = "62",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Kim:2019:IED,
author = "Jungwon Kim and Jeffrey S. Vetter",
title = "Implementing efficient data compression and encryption
in a persistent key--value store for {HPC}",
journal = j-IJHPCA,
volume = "33",
number = "6",
pages = "1098--1112",
day = "1",
month = nov,
year = "2019",
CODEN = "IHPCFL",
DOI = "https://doi.org/10.1177/1094342019847264",
ISSN = "1094-3420 (print), 1741-2846 (electronic)",
ISSN-L = "1094-3420",
bibdate = "Wed Oct 9 14:35:54 MDT 2019",
bibsource = "http://hpc.sagepub.com/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijsa.bib",
URL = "https://journals.sagepub.com/doi/full/10.1177/1094342019847264",
acknowledgement = ack-nhfb,
fjournal = "International Journal of High Performance Computing
Applications",
journal-URL = "https://journals.sagepub.com/home/hpc",
}
@Article{Kolsch:2019:SBP,
author = "Johannes K{\"o}lsch and Christopher Heinz and Axel
Ratzke and Christoph Grimm",
title = "Simulation-Based Performance Validation of Homomorphic
Encryption Algorithms in the {Internet of Things}",
journal = j-FUTURE-INTERNET,
volume = "11",
number = "10",
pages = "218",
day = "22",
month = oct,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi11100218",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:08 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/11/10/218",
abstract = "IoT systems consist of Hardware/Software systems
(e.g., sensors) that are embedded in a physical world,
networked and that interact with complex software
platforms. The validation of such systems is a
challenge and currently mostly done by prototypes. This
paper presents the virtual environment for simulation,
emulation and validation of an IoT platform and its
semantic model in real life scenarios. It is based on a
decentralized, bottom up approach that offers
interoperability of IoT devices and the value-added
services they want to use across different domains. The
framework is demonstrated by a comprehensive case
study. The example consists of the complete IoT ``Smart
Energy'' use case with focus on data privacy by
homomorphic encryption. The performance of the network
is compared while using partially homomorphic
encryption, fully homomorphic encryption and no
encryption at all.As a major result, we found that our
framework is capable of simulating big IoT networks and
the overhead introduced by homomorphic encryption is
feasible for VICINITY.",
acknowledgement = ack-nhfb,
remark = "Special Issue Security and Reliability of
IoT---Selected Papers from SecRIoT 2019.",
}
@Article{Kompara:2019:REM,
author = "Marko Kompara and SK Hafizul Islam and Marko
H{\"o}lbl",
title = "A robust and efficient mutual authentication and key
agreement scheme with untraceability for {WBANs}",
journal = j-COMP-NET-AMSTERDAM,
volume = "148",
number = "??",
pages = "196--213",
day = "15",
month = jan,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2018.11.016",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Tue Jan 22 16:29:25 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128618303955",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Korac:2019:FMU,
author = "Dragan Kora{\'c} and Dejan Simi{\'c}",
title = "Fishbone model and universal authentication framework
for evaluation of multifactor authentication in mobile
environment",
journal = j-COMPUT-SECUR,
volume = "85",
number = "??",
pages = "313--332",
month = aug,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:01 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818307375",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Kostic:2019:UNV,
author = "Dusan Kostic and Shay Gueron",
title = "Using the New {VPMADD} Instructions for the New Post
Quantum Key Encapsulation Mechanism {SIKE}",
crossref = "Takagi:2019:ISC",
pages = "215--218",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1109/ARITH.2019.00050",
bibdate = "Fri Jan 31 08:18:07 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "This paper demonstrates the use of new processor
instructions VPMADD, intended to appear in the coming
generation of Intel processors (codename ``Cannon
Lake''), in order to accelerate the newly proposed key
encapsulation mechanism (KEM) named SIKE. SIKE is one
of the submissions to the NIST standardization process
on post-quantum cryptography, and is based on
pseudo-random walks in supersingular isogeny graphs.
While very small keys are the main advantage of SIKE,
its extreme computational intensiveness makes it one of
the slowest KEM proposals. Performance optimizations
are needed. We address here the ``Level 1'' parameters
that target 64-bit quantum security, and deemed
sufficient for the NIST standardization effort. Thus,
we focus on SIKE503 that operates over Fp2 with a
503-bit prime p. These short operands pose a
significant challenge on using VPMADD effectively. We
demonstrate several optimization methods to accelerate
Fp, Fp2, and the elliptic curve arithmetic, and predict
a potential speedup by a factor of 1.72x.",
acknowledgement = ack-nhfb,
keywords = "ARITH-26; codename CannonLake; Computer architecture;
Encapsulation; extreme computational intensiveness;
Intel processors; KEM proposals; key encapsulation
mechanism; NIST; NIST standardization effort; NIST
standardization process; Optimization; post quantum key
encapsulation mechanism SIKE; post-quantum
cryptography; processor instructions VPMADD; Proposals;
pseudorandom walks; Quantum computing; quantum
cryptography; quantum security; Registers; SIKE503;
supersingular isogeny graphs; VPMADD instructions;
VPMADD processor instructions, software optimization,
post quantum cryptography, supersingular isogeny",
}
@Article{Kumar:2019:SSH,
author = "Chanchal Kumar and Mohammad Najmud Doja",
title = "A Secure Structure for Hiding Information in a
Cryptosystem based on Machine-learning Techniques and
Content-based Optimization using Portfolio Selection
Data",
journal = j-SCPE,
volume = "20",
number = "1",
pages = "161--180",
month = "????",
year = "2019",
CODEN = "????",
ISSN = "1895-1767",
ISSN-L = "1895-1767",
bibdate = "Thu Oct 3 07:39:16 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/scpe.bib",
URL = "https://www.scpe.org/index.php/scpe/article/view/1488",
acknowledgement = ack-nhfb,
fjournal = "Scalable Computing: Practice and Experience",
journal-URL = "http://www.scpe.org/",
}
@Article{Lai:2019:NIB,
author = "Qiqi Lai and Bo Yang and Zhe Xia and Yannan Li and
Yuan Chen and Zhenlong Li",
title = "Novel Identity-Based Hash Proof System with Compact
Master Public Key from Lattices in the Standard Model",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "589--606",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400148",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400148",
abstract = "As the progress of quantum computers, it is desired to
propose many more efficient cryptographic constructions
with post-quantum security. In the literatures, almost
all cryptographic schemes and protocols can be
explained and constructed modularly from certain
cryptographic primitives, among which an Identity-Based
Hash Proof System (IB-HPS) is one of the most basic and
important primitives. Therefore, we can utilize IB-HPSs
with post-quantum security to present several types of
post-quantum secure schemes and protocols. Up until
now, all known IB-HPSs with post-quantum security are
instantiated based on latticed-based assumptions.
However, all these lattice-based IB-HPSs are either in
the random oracle model or not efficient enough in the
standard model. Hence, it should be of great
significance to construct more efficient IB-HPSs from
lattices in the standard model. In this paper, we
propose a new smooth IB-HPS with anonymity based on the
Learning with Errors (LWE) assumption in the standard
model. This new construction is mainly inspired by a
classical identity-based encryption scheme based on LWE
due to Agreawal et al. in Eurocrypt 2010. And our
innovation is to employ the algorithm SampleGaussian
introduced by Gentry et al. and the property of random
lattice to simulate the identity secret key with
respect to the challenge identity. Compared with other
existing IB-HPSs in the standard model, our master
public key is quite compact. As a result, our
construction has much lower overheads on computation
and storage.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Le:2019:ADF,
author = "D. Le and S. L. Yeo and K. Khoo",
title = "Algebraic Differential Fault Analysis on {SIMON} Block
Cipher",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "11",
pages = "1561--1572",
month = nov,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2019.2926081",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Oct 29 11:08:44 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "algebraic differential fault attacks; algebraic
techniques; Ciphers; Circuit faults; fault attacks;
Gr{\"o}bner basis; Hardware; Lightweight block ciphers;
Mathematical model; Performance evaluation; Registers;
SAT solver",
}
@Article{Lee:2019:CSS,
author = "Kwangsu Lee and Dong Hoon Lee and Jong Hwan Park and
Moti Yung",
title = "{CCA} Security for Self-Updatable Encryption:
Protecting Cloud Data When Clients Read\slash Write
Ciphertexts",
journal = j-COMP-J,
volume = "62",
number = "4",
pages = "545--562",
month = apr,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy122",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Apr 2 12:10:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/4/545/5239643",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Lee:2019:TES,
author = "Wai-Kong Lee and Bok-Min Goi and Raphael C.-W. Phan",
title = "Terabit encryption in a second: Performance evaluation
of block ciphers in {GPU} with {Kepler}, {Maxwell}, and
{Pascal} architectures",
journal = j-CCPE,
volume = "31",
number = "11",
pages = "e5048:1--e5048:??",
day = "10",
month = jun,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.5048",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "29 October 2018",
}
@Article{Lee:2019:VCS,
author = "Kyuin Lee and Neil Klingensmith and Suman Banerjee and
Younghyun Kim",
title = "{VoltKey}: Continuous Secret Key Generation Based on
Power Line Noise for Zero-Involvement Pairing and
Authentication",
journal = j-IMWUT,
volume = "3",
number = "3",
pages = "1--26",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3351251",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:37:13 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3351251",
abstract = "The explosive proliferation of Internet-of-Things
(IoT) ecosystem fuels the needs for a mechanism for the
user to easily and securely interconnect multiple
heterogeneous devices with minimal involvement.
However, the current paradigm of context-unaware
\ldots{}",
acknowledgement = ack-nhfb,
articleno = "93",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Li:2019:APA,
author = "JiLiang Li and WeiGuo Zhang and Vivek Dabra and
Kim-Kwang Raymond Choo and Saru Kumari and Dieter
Hogrefe",
title = "{AEP-PPA}: an anonymous, efficient and provably-secure
privacy-preserving authentication protocol for mobile
services in smart cities",
journal = j-J-NETW-COMPUT-APPL,
volume = "134",
number = "??",
pages = "52--61",
day = "15",
month = may,
year = "2019",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2019.02.003",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:32 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804519300475",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Li:2019:ESM,
author = "Xingxin Li and Youwen Zhu and Jian Wang and Ji Zhang",
title = "Efficient and secure multi-dimensional geometric range
query over encrypted data in cloud",
journal = j-J-PAR-DIST-COMP,
volume = "131",
number = "??",
pages = "44--54",
month = sep,
year = "2019",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2019.04.015",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Mon Jun 10 07:36:16 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731518306294",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Li:2019:IID,
author = "Rongjia Li and Chenhui Jin and Ruya Fan",
title = "Improved Integral Distinguishers on Compression
Function of {GOST R} Hash Function",
journal = j-COMP-J,
volume = "62",
number = "4",
pages = "535--544",
month = apr,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy123",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Apr 2 12:10:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://academic.oup.com/comjnl/article/62/4/535/5224765",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Li:2019:PSA,
author = "Xiong Li and Fan Wu and Saru Kumari and Lili Xu and
Arun Kumar Sangaiah and Kim-Kwang Raymond Choo",
title = "A provably secure and anonymous message authentication
scheme for smart grids",
journal = j-J-PAR-DIST-COMP,
volume = "132",
number = "??",
pages = "242--249",
month = oct,
year = "2019",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2017.11.008",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Fri Sep 13 10:25:20 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731517303064",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Li:2019:TFA,
author = "Wenting Li and Ping Wang",
title = "Two-factor authentication in industrial
{Internet-of-Things}: Attacks, evaluation and new
construction",
journal = j-FUT-GEN-COMP-SYS,
volume = "101",
number = "??",
pages = "694--708",
month = dec,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.06.020",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:02 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19307642",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Li:2019:VCM,
author = "Jing Li and Licheng Wang and Lihua Wang and Xianmin
Wang and Zhengan Huang and Jin Li",
title = "Verifiable {Chebyshev} maps-based chaotic encryption
schemes with outsourcing computations in the
cloud\slash fog scenarios",
journal = j-CCPE,
volume = "31",
number = "22",
pages = "e4523:1--e4523:??",
day = "25",
month = nov,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4523",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Wed Mar 31 07:52:10 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "25 June 2018",
}
@Article{Liao:2019:ESO,
author = "W. Liao and C. Luo and S. Salinas and P. Li",
title = "Efficient Secure Outsourcing of Large-Scale Convex
Separable Programming for Big Data",
journal = j-IEEE-TRANS-BIG-DATA,
volume = "5",
number = "3",
pages = "368--378",
month = sep,
year = "2019",
DOI = "https://doi.org/10.1109/TBDATA.2017.2787198",
ISSN = "2332-7790",
ISSN-L = "2332-7790",
bibdate = "Tue Oct 29 11:08:44 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "Amazon Elastic cloud computing platform; Big Data; big
data; big data applications; chosen-plaintext attack;
cloud computing; Cloud computing; Companies;
computational complexity; computing resources;
confidential data; Convex separable programming; convex
separable programming problems; cryptography; data
analysis; data privacy; data security and privacy;
efficient secure outsourcing scheme; Encryption;
large-scale convex separable programming; large-scale
data analytics; Outsourcing; outsourcing; Programming;
time savings; vector transformation schemes; vectors",
}
@Article{Libert:2019:ZKA,
author = "Beno{\^\i}t Libert and San Ling and Fabrice Mouhartem
and Khoa Nguyen and Huaxiong Wang",
title = "Zero-knowledge arguments for matrix-vector relations
and lattice-based group encryption",
journal = j-THEOR-COMP-SCI,
volume = "759",
number = "??",
pages = "72--97",
day = "8",
month = feb,
year = "2019",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2019.01.003",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Jan 18 05:48:39 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397519300167",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Lin:2019:CCA,
author = "Xi-Jun Lin and Lin Sun and Haipeng Qu and He-Qun
Xian",
title = "Cryptanalysis of a Compact Anonymous {HIBE} with
Constant Size Private Keys",
journal = j-COMP-J,
volume = "62",
number = "8",
pages = "1087--1091",
month = aug,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy130",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Aug 19 07:31:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/8/1087/5253748",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Ling:2019:SAR,
author = "San Ling and Khoa Nguyen and Huaxiong Wang and
Juanyang Zhang",
title = "Server-Aided Revocable Predicate Encryption:
Formalization and Lattice-Based Instantiation",
journal = j-COMP-J,
volume = "62",
number = "12",
pages = "1849--1862",
month = dec,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz079",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Dec 23 06:38:51 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/12/1849/5628022",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Liu:2019:DVP,
author = "Y. Liu and M. F. Ezerman and H. Wang",
title = "Double verification protocol via secret sharing for
low-cost {RFID} tags",
journal = j-FUT-GEN-COMP-SYS,
volume = "90",
number = "??",
pages = "118--128",
month = jan,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2018.07.004",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Sep 18 14:07:59 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17323518",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Liu:2019:EEA,
author = "Peng Liu and Shunbin Li and Qingyuan Ding",
title = "An Energy-Efficient Accelerator Based on Hybrid
{CPU--FPGA} Devices for Password Recovery",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "2",
pages = "170--181",
month = feb,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2868191",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Feb 4 19:28:55 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8453825/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Liu:2019:ICA,
author = "Hanqiu Liu and Chenhui Jin",
title = "An Improvement of the {CS} Attack to {DSC} Cipher",
journal = j-COMP-J,
volume = "62",
number = "8",
pages = "1158--1165",
month = aug,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz037",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Aug 19 07:31:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/8/1158/5476715",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Liu:2019:IEU,
author = "Hongjun Liu and Yingqian Zhang and Abdurahman Kadir
and Yanqiu Xu",
title = "Image encryption using complex hyper chaotic system by
injecting impulse into parameters",
journal = j-APPL-MATH-COMP,
volume = "360",
number = "??",
pages = "83--93",
day = "1",
month = nov,
year = "2019",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Sep 6 09:21:24 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2015.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0096300319303807",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Liu:2019:IMM,
author = "Ya Liu and Yifan Shi and Dawu Gu and Zhiqiang Zeng and
Fengyu Zhao and Wei Li and Zhiqiang Liu and Yang Bao",
title = "Improved Meet-in-the-Middle Attacks on Reduced-Round
{Kiasu-BC} and {Joltik-BC}",
journal = j-COMP-J,
volume = "62",
number = "12",
pages = "1761--1776",
month = dec,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz059",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Dec 23 06:38:51 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/12/1761/5525447",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Liu:2019:OMM,
author = "W. Liu and J. Ni and Z. Liu and C. Liu and M. O.
Neill",
title = "Optimized Modular Multiplication for Supersingular
Isogeny {Diffie--Hellman}",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "8",
pages = "1249--1255",
month = aug,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2019.2899847",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 11 09:46:20 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Computers; Elliptic curve cryptography; Hardware;
modular multiplication; Post-quantum cryptography;
Quantum computing; Software; Software algorithms;
supersingular isogeny Diffie--Hellman (SIDH)",
}
@Article{Liu:2019:RAS,
author = "Xin Liu and Ruisheng Zhang and Mingqi Zhao",
title = "A robust authentication scheme with dynamic password
for wireless body area networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "161",
number = "??",
pages = "220--234",
day = "9",
month = oct,
year = "2019",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Oct 14 17:19:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128618309885",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@Article{Liu:2019:SBC,
author = "Jian Liu and Wenting Li and Ghassan O. Karame and N.
Asokan",
title = "Scalable {Byzantine} Consensus via Hardware-Assisted
Secret Sharing",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "1",
pages = "139--151",
month = "????",
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2860009",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Dec 26 06:35:11 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8419336/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Liu:2019:TTR,
author = "Zhenhua Liu and Shuhong Duan and Peilin Zhou and
Baocang Wang",
title = "Traceable-then-revocable ciphertext-policy
attribute-based encryption scheme",
journal = j-FUT-GEN-COMP-SYS,
volume = "93",
number = "??",
pages = "903--913",
month = apr,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Feb 5 08:15:52 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17320964",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Liu:2019:XBL,
author = "Weiqiang Liu and Lei Zhang and Zhengran Zhang and
Chongyan Gu and Chenghua Wang and Maire O'neill and
Fabrizio Lombardi",
title = "{XOR}-Based Low-Cost Reconfigurable {PUFs} for {IoT}
Security",
journal = j-TECS,
volume = "18",
number = "3",
pages = "25:1--25:??",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3274666",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:43 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3274666",
abstract = "With the rapid development of the Internet of Things
(IoT), security has attracted considerable interest.
Conventional security solutions that have been proposed
for the Internet based on classical cryptography cannot
be applied to IoT nodes as they are typically
resource-constrained. A physical unclonable function
(PUF) is a hardware-based security primitive and can be
used to generate a key online or uniquely identify an
integrated circuit (IC) by extracting its internal
random differences using so-called challenge-response
pairs (CRPs). It is regarded as a promising low-cost
solution for IoT security. A logic reconfigurable PUF
(RPUF) is highly efficient in terms of hardware cost.
This article first presents a new classification for
RPUFs, namely circuit-based RPUF (C-RPUF) and
algorithm-based RPUF (A-RPUF); two Exclusive OR
(XOR)-based RPUF circuits (an XOR-based reconfigurable
bistable ring PUF (XRBR PUF) and an XOR-based
reconfigurable ring oscillator PUF (XRRO PUF)) are
proposed. Both the XRBR and XRRO PUFs are implemented
on Xilinx Spartan-6 field-programmable gate arrays
(FPGAs). The implementation results are compared with
previous PUF designs and show good uniqueness and
reliability. Compared to conventional PUF designs, the
most significant advantage of the proposed designs is
that they are highly efficient in terms of hardware
cost. Moreover, the XRRO PUF is the most efficient
design when compared with previous RPUFs. Also, both
the proposed XRRO and XRBR PUFs require only 12.5\% of
the hardware resources of previous bitstable ring PUFs
and reconfigurable RO PUFs, respectively, to generate a
1-bit response. This confirms that the proposed XRBR
and XRRO PUFs are very efficient designs with good
uniqueness and reliability.",
acknowledgement = ack-nhfb,
articleno = "25",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{LoIacono:2019:NGR,
author = "Luigi {Lo Iacono} and Hoai Viet Nguyen and Peter Leo
Gorski",
title = "On the Need for a General {REST}-Security Framework",
journal = j-FUTURE-INTERNET,
volume = "11",
number = "3",
pages = "56",
day = "27",
month = feb,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi11030056",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:05 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/11/3/56",
abstract = "Contemporary software is inherently distributed. The
principles guiding the design of such software have
been mainly manifested by the service-oriented
architecture (SOA) concept. In a SOA, applications are
orchestrated by software services generally operated by
distinct entities. Due to the latter fact, service
security has been of importance in such systems ever
since. A dominant protocol for implementing SOA-based
systems is SOAP, which comes with a well-elaborated
security framework. As an alternative to SOAP, the
architectural style representational state transfer
(REST) is gaining traction as a simple, lightweight and
flexible guideline for designing distributed service
systems that scale at large. This paper starts by
introducing the basic constraints representing REST.
Based on these foundations, the focus is afterwards
drawn on the security needs of REST-based service
systems. The limitations of transport-oriented
protection means are emphasized and the demand for
specific message-oriented safeguards is assessed. The
paper then reviews the current activities in respect to
REST-security and finds that the available schemes are
mostly HTTP-centered and very heterogeneous. More
importantly, all of the analyzed schemes contain
vulnerabilities. The paper contributes a methodology on
how to establish REST-security as a general security
framework for protecting REST-based service systems of
any kind by consistent and comprehensive protection
means. First adoptions of the introduced approach are
presented in relation to REST message authentication
with instantiations for REST-ful HTTP (web/cloud
services) and REST-ful constraint application protocol
(CoAP) (internet of things (IoT) services).",
acknowledgement = ack-nhfb,
remark = "Special Issue 10th Anniversary Feature Papers.",
}
@Article{Luo:2019:SCT,
author = "Chao Luo and Yunsi Fei and David Kaeli",
title = "Side-channel Timing Attack of {RSA} on a {GPU}",
journal = j-TACO,
volume = "16",
number = "3",
pages = "32:1--32:??",
month = aug,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3341729",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Sat Oct 12 15:27:40 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3341729",
abstract = "To increase computation throughput, general purpose
Graphics Processing Units (GPUs) have been leveraged to
accelerate computationally intensive workloads. GPUs
have been used as cryptographic engines, improving
encryption/decryption throughput and leveraging the
GPU's Single Instruction Multiple Thread (SIMT) model.
RSA is a widely used public-key cipher and has been
ported onto GPUs for signing and decrypting large
files. Although performance has been significantly
improved, the security of RSA on GPUs is vulnerable to
side-channel timing attacks and is an exposure
overlooked in previous studies. GPUs tend to be
naturally resilient to side-channel attacks, given that
they execute a large number of concurrent threads,
performing many RSA operations on different data in
parallel. Given the degree of parallel execution on a
GPU, there will be a significant amount of noise
introduced into the timing channel given the thousands
of concurrent threads executing concurrently. In this
work, we build a timing model to capture the parallel
characteristics of an RSA public-key cipher implemented
on a GPU. We consider optimizations that include using
Montgomery multiplication and sliding-window
exponentiation to implement cryptographic operations.
Our timing model considers the challenges of parallel
execution, complications that do not occur in
single-threaded computing platforms. Based on our
timing model, we launch successful timing attacks on
RSA running on a GPU, extracting the private key of
RSA. We also present an effective error detection and
correction mechanism. Our results demonstrate that GPU
acceleration of RSA is vulnerable to side-channel
timing attacks. We propose several countermeasures to
defend against this class of attacks.",
acknowledgement = ack-nhfb,
articleno = "32",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Lyu:2019:SPP,
author = "Lin Lyu and Shengli Liu and Dawu Gu",
title = "Structure-preserving public-key encryption with
leakage-resilient {CCA} security",
journal = j-THEOR-COMP-SCI,
volume = "795",
number = "??",
pages = "57--80",
day = "26",
month = nov,
year = "2019",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Oct 16 07:39:37 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S030439751930386X",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Ma:2019:PFC,
author = "Ruijun Ma and Haifeng Hu and Weixuan Wang and Jia Xu
and Zhengming Li",
title = "Photorealistic Face Completion with Semantic Parsing
and Face Identity-Preserving Features",
journal = j-TOMM,
volume = "15",
number = "1",
pages = "28:1--28:??",
month = feb,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3300940",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Wed Oct 2 10:12:46 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3300940",
abstract = "Tremendous progress on deep learning has shown
exciting potential for a variety of face completion
tasks. However, most learning-based methods are limited
to handle general or structure specified face images
(e.g., well-aligned faces). In this article, we propose
a novel face completion algorithm, called Learning and
Preserving Face Completion Network (LP-FCN), which
simultaneously parses face images and extracts face
identity-preserving (FIP) features. By tackling these
two tasks in a mutually boosting way, the LP-FCN can
guide an identity preserving inference and ensure pixel
faithfulness of completed faces. In addition, we adopt
a global discriminator and a local discriminator to
distinguish real images from synthesized ones. By
training with a combined identity preserving, semantic
parsing and adversarial loss, the LP-FCN encourages the
completion results to be semantically valid and
visually consistent for more complicated image
completion tasks. Experiments show that our approach
obtains similar visual quality, but achieves better
performance on unaligned faces completion and fine
detailed synthesis against the state-of-the-art
methods.",
acknowledgement = ack-nhfb,
articleno = "28",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Ma:2019:TOP,
author = "Ziqiang Ma and Quanwei Cai and Jingqiang Lin and Bo
Luo and Jiwu Jing",
title = "Towards the optimal performance of integrating {Warm
and Delay} against remote cache timing side channels on
block ciphers",
journal = j-J-COMP-SECUR,
volume = "27",
number = "5",
pages = "547--580",
month = "????",
year = "2019",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-191296",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Mon Sep 23 05:47:24 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Mainardi:2019:PRA,
author = "Nicholas Mainardi and Alessandro Barenghi and Gerardo
Pelosi",
title = "Plaintext recovery attacks against linearly
decryptable fully homomorphic encryption schemes",
journal = j-COMPUT-SECUR,
volume = "87",
number = "??",
pages = "Article 101587",
month = nov,
year = "2019",
CODEN = "CPSEDU",
DOI = "https://doi.org/10.1016/j.cose.2019.101587",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Sat Jan 22 15:25:37 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404819301403",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Marino:2019:ACN,
author = "Francesco Marino and Corrado Moiso and Matteo
Petracca",
title = "Automatic contract negotiation, service discovery and
mutual authentication solutions: a survey on the
enabling technologies of the forthcoming {IoT}
ecosystems",
journal = j-COMP-NET-AMSTERDAM,
volume = "148",
number = "??",
pages = "176--195",
day = "15",
month = jan,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2018.11.011",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Tue Jan 22 16:29:25 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1389128618312167",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286/",
}
@InProceedings{Martins:2019:HHR,
author = "Paulo Martins and Jeremy Marrez and Jean-Claude Bajard
and Leonel Sousa",
title = "{HyPoRes}: An Hybrid Representation System for {ECC}",
crossref = "Takagi:2019:ISC",
pages = "207--214",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1109/ARITH.2019.00049",
bibdate = "Fri Jan 31 08:18:07 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "The Residue Number System (RNS) is a numeral
representation enabling for more efficient addition and
multiplication implementations. However, due its
non-positional nature, modular reductions, required for
example by Elliptic Curve (EC) Cryptography (ECC),
become costlier. Traditional approaches to RNS modular
reduction resort to the Montgomery algorithm,
underpinned by large basis extensions. Recently,
Hybrid-Positional Residue Number Systems (HPRs) have
been proposed, providing a trade-off between the
efficiency of RNS and the flexibility of positional
number representations. Numbers are represented in a
positional representation with the coefficients
represented in RNS. By crafting primes of a special
form, the complexity of reductions modulo those primes
is mitigated, relying on extensions of smaller bases.
Due to the need of crafting special primes, this
approach is not directly extensible to group operations
over currently standardised elliptic curves. In this
paper, the Hybrid-Polynomial Residue Number System
(HyPoRes) is proposed, enabling for improved modular
reductions for any prime. Experimental results show
that the modular reduction of HyPoRes, although at most
1.4 times slower than HPR for HPR-crafted primes, is up
to 1.4 times faster than a generic RNS approach for
primes of ECC standards.",
acknowledgement = ack-nhfb,
keywords = "ARITH-26; Art; Complexity theory; Dynamic range; ECC
standards; Elliptic Curve Cryp-tography; Elliptic curve
cryptography; elliptic curve cryptography; Elliptic
curves; generic RNS approach; HPR-crafted primes;
hybrid representation system; hybrid-polynomial residue
number system; hybrid-positional residue number
systems; HyPoRes; improved modular reductions;
Lattices; Modular Arithmetic; Montgomery algorithm;
multiplication implementations; polynomials; positional
number representations; public key cryptography;
Residue Number System; residue number systems; RNS
modular reduction",
}
@Article{Matthiessen:2019:RCM,
author = "Dana Matthiessen",
title = "The rise of cryptographic metaphors in {Boyle} and
their use for the mechanical philosophy",
journal = j-STUD-HIST-PHILOS-SCI,
volume = "73",
number = "??",
pages = "8--21",
month = feb,
year = "2019",
CODEN = "SHPSB5",
DOI = "https://doi.org/10.1016/j.shpsa.2018.07.002",
ISSN = "0039-3681 (print), 1879-2510 (electronic)",
ISSN-L = "0039-3681",
bibdate = "Mon Mar 25 06:29:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/shps-a.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0039368117302522",
acknowledgement = ack-nhfb,
fjournal = "Studies in History and Philosophy of Science Part A",
journal-URL = "http://www.sciencedirect.com/science/journal/00393681",
}
@InProceedings{Matula:2019:PCG,
author = "David W. Matula and Zizhen Chen",
title = "Precise and Concise Graphical Representation of the
Natural Numbers",
crossref = "Takagi:2019:ISC",
pages = "100--103",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1109/ARITH.2019.00027",
bibdate = "Fri Jan 31 08:18:07 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "A graphical number representation system based on the
formal logic foundation of a recursively defined
function is presented. The function exposes a
one-to-one correspondence between the natural numbers
and the set of rooted trees. Secondly, a relation
between pairs of natural numbers is shown to partition
the integers into disjoint finite sets each visualized
as a tree in the forest of all finite trees. This
relation encapsulates in visual form the natural
structure and distribution of primes in a manner not
previously investigated. These representations allow
arithmeticians to visually experience natural numbers
in a 2D graphical layout. This form is free of cultural
choices such as the number of symbols in an alphabet
and/or one-dimensional symbol strings. The fundamental
nature of these mappings is argued to be accessible to
a creative mind independent of formal schooling. This
short note includes examples illustrating the
simplicity of the constructions.",
acknowledgement = ack-nhfb,
keywords = "2D graphical layout; ARITH-26; Computer science;
disjoint finite sets; finite trees; Forestry; formal
logic foundation; graphical number representation
system; graphical representation; Labeling; natural
numbers; natural structure; number fonts;
one-dimensional symbol strings; one-to-one
correspondence; prime factorization; prime number
function; recursive function; recursive functions;
recursively defined function; rooted trees; trees
(mathematics); Two dimensional displays; Vegetation;
Visualization",
}
@Article{Mefenza:2019:CSA,
author = "Thierry Mefenza and Damien Vergnaud",
title = "Cryptanalysis of Server-Aided {RSA} Protocols with
Private-Key Splitting",
journal = j-COMP-J,
volume = "62",
number = "8",
pages = "1194--1213",
month = aug,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz040",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Aug 19 07:31:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/8/1194/5488732",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Meng:2019:ESF,
author = "Weizhi Meng and Liqiu Zhu and Wenjuan Li and Jinguang
Han and Yan Li",
title = "Enhancing the security of {FinTech} applications with
map-based graphical password authentication",
journal = j-FUT-GEN-COMP-SYS,
volume = "101",
number = "??",
pages = "1018--1027",
month = dec,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.07.038",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:02 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19302882",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Meng:2019:SDD,
author = "Wenjuan Meng and Jianhua Ge and Tao Jiang",
title = "Secure Data Deduplication with Reliable Data Deletion
in Cloud",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "551--570",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400124",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400124",
abstract = "A cloud storage system which incorporates the deletion
and deduplication functionalities will have both
security and efficiency advantages over exiting
solutions which provide only one of them. However, the
security models of secure data deletion and data
deduplication functionalities are not compatible with
each other, which will cause security and efficiency
vulnerability under coercive adversaries. To solve
these security and efficiency challenges, we define and
construct a scheme, whose security relies on the proper
erasure of keys in the wrapped key tree and periodical
update of the deduplication encryption keys. Moreover,
we enhance the efficiency of the proposed scheme by
introducing incremental data update, where only the
changed part is encrypted/decrypted and
uploaded/downloaded in data updating. Further security
analysis shows that the proposed scheme is secure
against coercive attack. Finally, the practical
implementation shows that our scheme is performance
efficient in computation, storage and communication for
both the cloud storage server and users.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Mhenni:2019:DSA,
author = "Abir Mhenni and Estelle Cherrier and Christophe
Rosenberger and Najoua Essoukri {Ben Amara}",
title = "Double serial adaptation mechanism for keystroke
dynamics authentication based on a single password",
journal = j-COMPUT-SECUR,
volume = "83",
number = "??",
pages = "151--166",
month = jun,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818306059",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Miao:2019:PPT,
author = "Chenglin Miao and Wenjun Jiang and Lu Su and Yaliang
Li and Suxin Guo and Zhan Qin and Houping Xiao and Jing
Gao and Kui Ren",
title = "Privacy-Preserving Truth Discovery in Crowd Sensing
Systems",
journal = j-TOSN,
volume = "15",
number = "1",
pages = "9:1--9:??",
month = feb,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3277505",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Wed Oct 2 09:20:25 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3277505",
abstract = "The recent proliferation of human-carried mobile
devices has given rise to the crowd sensing systems.
However, the sensory data provided by individual
participants are usually not reliable. To better
utilize such sensory data, the topic of truth
discovery, whose goal is to estimate user quality and
infer reliable aggregated results through quality-aware
data aggregation, has drawn significant attention.
Though able to improve aggregation accuracy, existing
truth discovery approaches fail to address the privacy
concerns of individual users. In this article, we
propose a novel privacy-preserving truth discovery
(PPTD) framework, which can protect not only users'
sensory data but also their reliability scores derived
by the truth discovery approaches. The key idea of the
proposed framework is to perform weighted aggregation
on users' encrypted data using a homomorphic
cryptosystem, which can guarantee both high accuracy
and strong privacy protection. In order to deal with
large-scale data, we also propose to parallelize PPTD
with MapReduce framework. Additionally, we design an
incremental PPTD scheme for the scenarios where the
sensory data are collected in a streaming manner.
Extensive experiments based on two real-world crowd
sensing systems demonstrate that the proposed framework
can generate accurate aggregated results while
protecting users' private information.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Misoczki:2019:TPS,
author = "R. Misoczki and S. Gulley and V. Gopal and M. G. Dixon
and H. Vrsalovic and W. K. Feghali",
title = "Toward Postquantum Security for Embedded Cores",
journal = j-IEEE-MICRO,
volume = "39",
number = "4",
pages = "17--26",
month = jul # "\slash " # aug,
year = "2019",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/MM.2019.2920203",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu Jul 25 15:29:43 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "Digital signatures; Microcontrollers; NIST; Public
key; Task analysis",
}
@Article{Moghimi:2019:MFD,
author = "Ahmad Moghimi and Jan Wichelmann and Thomas Eisenbarth
and Berk Sunar",
title = "{MemJam}: a False Dependency Attack Against
Constant-Time Crypto Implementations",
journal = j-INT-J-PARALLEL-PROG,
volume = "47",
number = "4",
pages = "538--570",
month = aug,
year = "2019",
CODEN = "IJPPE5",
DOI = "https://doi.org/10.1007/s10766-018-0611-9",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
ISSN-L = "0885-7458",
bibdate = "Fri Oct 11 08:37:52 MDT 2019",
bibsource = "http://link.springer.com/journal/10766/47/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Morawiecki:2019:MS,
author = "Pawe{\l} Morawiecki",
title = "Malicious {SHA-3}",
journal = j-FUND-INFO,
volume = "169",
number = "4",
pages = "331--343",
month = "????",
year = "2019",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2019-1850",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Wed Mar 24 12:51:47 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Moriai:2019:PPD,
author = "Shiho Moriai",
title = "Privacy-Preserving Deep Learning via Additively
Homomorphic Encryption",
crossref = "Takagi:2019:ISC",
pages = "198--198",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1109/ARITH.2019.00047",
bibdate = "Fri Jan 31 08:18:07 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "We aim at creating a society where we can resolve
various social challenges by incorporating the
innovations of the fourth industrial revolution (e.g.
IoT, big data, AI, robot, and the sharing economy) into
every industry and social life. By doing so the society
of the future will be one in which new values and
services are created continuously, making people's
lives more conformable and sustainable. This is Society
5.0, a super-smart society. Security and privacy are
key issues to be addressed to realize Society 5.0.
Privacy-preserving data analytics will play an
important role. In this talk we show our recent works
on privacy-preserving data analytics such as
privacy-preserving logistic regression and
privacy-preserving deep learning. Finally, we show our
ongoing research project under JST CREST AI . In this
project we are developing privacy-preserving financial
data analytics systems that can detect fraud with high
security and accuracy. To validate the systems, we will
perform demonstration tests with several financial
institutions and solve the problems necessary for their
implementation in the real world.",
acknowledgement = ack-nhfb,
keywords = "additively homomorphic encryption; ARITH-26; Big Data;
data analysis; Data analysis; data privacy; Deep
learning; Digital arithmetic; Encryption; financial
data processing; financial institutions; fourth
industrial revolution; fraud; Information and
communication technology; IoT; JST CREST AI; neural
nets; privacy issues; privacy-preserving deep learning;
privacy-preserving financial data analytics systems;
privacy-preserving logistic regression; regression
analysis; social challenges; social life; social
sciences computing; Society 5.0; super-smart society",
}
@Article{Mukherjee:2019:EBV,
author = "Sankar Mukherjee and Daya Sagar Gupta and G. P.
Biswas",
title = "An efficient and batch verifiable conditional
privacy-preserving authentication scheme for {VANETs}
using lattice",
journal = j-COMPUTING,
volume = "101",
number = "12",
pages = "1763--1788",
month = dec,
year = "2019",
CODEN = "CMPTA2",
DOI = "https://doi.org/10.1007/s00607-018-0689-3",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
bibdate = "Tue May 12 18:02:14 MDT 2020",
bibsource = "http://link.springer.com/journal/607/101/12;
https://www.math.utah.edu/pub/tex/bib/computing.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computing",
journal-URL = "http://link.springer.com/journal/607",
}
@Article{Nagaraj:2019:RCC,
author = "S. V. Nagaraj",
title = "Review of {{\booktitle{Codes, Cryptology and Curves
with Computer Algebra}}}",
journal = j-SIGACT,
volume = "50",
number = "1",
pages = "14--16",
month = mar,
year = "2019",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/3319627.3319631",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Oct 22 09:39:55 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
abstract = "Codes, cryptology and curves are widely used today for
secure as well as reliable communication. This book
aims to introduce these topics to students of computer
science, mathematics and physics at the masters level.
It also looks at the application of computer algebra
for solving related problems. It consists of twelve
chapters contributed by four authors and published by
Cambridge University Press. The book is also available
in hardback and e-book formats, the price / ISBN being
US\$160 / 978-0-521-81711-0, and US \$52 /
978-1-108-54782-6, respectively.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Najafi:2019:VRS,
author = "Aniseh Najafi and Hamid Haj Seyyed Javadi and Majid
Bayat",
title = "Verifiable ranked search over encrypted data with
forward and backward privacy",
journal = j-FUT-GEN-COMP-SYS,
volume = "101",
number = "??",
pages = "410--419",
month = dec,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.06.018",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:02 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18323318",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Namasudra:2019:IAB,
author = "Suyel Namasudra",
title = "An improved attribute-based encryption technique
towards the data security in cloud computing",
journal = j-CCPE,
volume = "31",
number = "3",
pages = "e4364:1--e4364:??",
day = "10",
month = feb,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4364",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Thu Mar 28 08:07:55 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "08 December 2017",
}
@Article{Nejatollahi:2019:PQL,
author = "Hamid Nejatollahi and Nikil Dutt and Sandip Ray and
Francesco Regazzoni and Indranil Banerjee and Rosario
Cammarota",
title = "Post-Quantum Lattice-Based Cryptography
Implementations: a Survey",
journal = j-COMP-SURV,
volume = "51",
number = "6",
pages = "129:1--129:??",
month = feb,
year = "2019",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3292548",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Aug 31 09:04:36 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3292548",
abstract = "The advent of quantum computing threatens to break
many classical cryptographic schemes, leading to
innovations in public key cryptography that focus on
post-quantum cryptography primitives and protocols
resistant to quantum computing threats. Lattice-based
cryptography is a promising post-quantum cryptography
family, both in terms of foundational properties as
well as in its application to both traditional and
emerging security problems such as encryption, digital
signature, key exchange, and homomorphic encryption.
While such techniques provide guarantees, in theory,
their realization on contemporary computing platforms
requires careful design choices and tradeoffs to manage
both the diversity of computing platforms (e.g.,
high-performance to resource constrained), as well as
the agility for deployment in the face of emerging and
changing standards. In this work, we survey trends in
lattice-based cryptographic schemes, some recent
fundamental proposals for the use of lattices in
computer security, challenges for their implementation
in software and hardware, and emerging needs for their
adoption. The survey means to be informative about the
math to allow the reader to focus on the mechanics of
the computation ultimately needed for mapping schemes
on existing hardware or synthesizing part or all of a
scheme on special-purpose hardware.",
acknowledgement = ack-nhfb,
articleno = "129",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Norta:2019:SFB,
author = "Alex Norta and Raimundas Matulevicius and Benjamin
Leiding",
title = "Safeguarding a formalized Blockchain-enabled
identity-authentication protocol by applying security
risk-oriented patterns",
journal = j-COMPUT-SECUR,
volume = "86",
number = "??",
pages = "253--269",
month = sep,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818302670",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Odelu:2019:EPP,
author = "Vanga Odelu and Sourav Saha and Rajendra Prasath and
Lakshminarayana Sadineni and Mauro Conti and Minho Jo",
title = "Efficient privacy preserving device authentication in
{WBANs} for industrial e-health applications",
journal = j-COMPUT-SECUR,
volume = "83",
number = "??",
pages = "300--312",
month = jun,
year = "2019",
CODEN = "CPSEDU",
DOI = "https://doi.org/10.1016/j.cose.2019.03.002",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818308204",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Ohtake:2019:OSA,
author = "Go Ohtake and Reihaneh Safavi-Naini and Liang Feng
Zhang",
title = "Outsourcing scheme of {ABE} encryption secure against
malicious adversary",
journal = j-COMPUT-SECUR,
volume = "86",
number = "??",
pages = "437--452",
month = sep,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404819300525",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Or-Meir:2019:DMA,
author = "Ori Or-Meir and Nir Nissim and Yuval Elovici and Lior
Rokach",
title = "Dynamic Malware Analysis in the Modern Era --- a State
of the Art Survey",
journal = j-COMP-SURV,
volume = "52",
number = "5",
pages = "88:1--88:??",
month = oct,
year = "2019",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3329786",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Tue Oct 29 09:52:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3329786",
abstract = "Although malicious software (malware) has been around
since the early days of computers, the sophistication
and innovation of malware has increased over the years.
In particular, the latest crop of ransomware has drawn
attention to the dangers of malicious software, which
can cause harm to private users as well as
corporations, public services (hospitals and
transportation systems), governments, and security
institutions. To protect these institutions and the
public from malware attacks, malicious activity must be
detected as early as possible, preferably before it
conducts its harmful acts. However, it is not always
easy to know what to look for-especially when dealing
with new and unknown malware that has never been seen.
Analyzing a suspicious file by static or dynamic
analysis methods can provide relevant and valuable
information regarding a file's impact on the hosting
system and help determine whether the file is malicious
or not, based on the method's predefined rules. While
various techniques (e.g., code obfuscation, dynamic
code loading, encryption, and packing) can be used by
malware writers to evade static analysis (including
signature-based anti-virus tools), dynamic analysis is
robust to these techniques and can provide greater
understanding regarding the analyzed file and
consequently can lead to better detection capabilities.
Although dynamic analysis is more robust than static
analysis, existing dynamic analysis tools and
techniques are imperfect, and there is no single tool
that can cover all aspects of malware behavior. The
most recent comprehensive survey performed in this area
was published in 2012. Since that time, the computing
environment has changed dramatically with new types of
malware (ransomware, cryptominers), new analysis
methods (volatile memory forensics, side-channel
analysis), new computing environments (cloud computing,
IoT devices), new machine-learning algorithms, and
more. The goal of this survey is to provide a
comprehensive and up-to-date overview of existing
methods used to dynamically analyze malware, which
includes a description of each method, its strengths
and weaknesses, and its resilience against malware
evasion techniques. In addition, we include an overview
of prominent studies presenting the usage of
machine-learning methods to enhance dynamic malware
analysis capabilities aimed at detection,
classification, and categorization.",
acknowledgement = ack-nhfb,
articleno = "88",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Ortiz-Martin:2019:FAI,
author = "Lara Ortiz-Martin and Pablo Picazo-Sanchez and Pedro
Peris-Lopez and Juan Tapiador and Gerardo Schneider",
title = "Feasibility analysis of Inter-Pulse Intervals based
solutions for cryptographic token generation by two
electrocardiogram sensors",
journal = j-FUT-GEN-COMP-SYS,
volume = "96",
number = "??",
pages = "283--296",
month = jul,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18330784",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Ostad-Sharif:2019:TPS,
author = "Arezou Ostad-Sharif and Hamed Arshad and Morteza
Nikooghadam and Dariush Abbasinezhad-Mood",
title = "Three party secure data transmission in {IoT} networks
through design of a lightweight authenticated key
agreement scheme",
journal = j-FUT-GEN-COMP-SYS,
volume = "100",
number = "??",
pages = "882--892",
month = nov,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.04.019",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:01 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18309452",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Pankhuri:2019:PBM,
author = "Pankhuri and Akash Sinha and Gulshan Shrivastava and
Prabhat Kumar",
title = "A Pattern-Based Multi-Factor Authentication System",
journal = j-SCPE,
volume = "20",
number = "1",
pages = "101--112",
month = "????",
year = "2019",
CODEN = "????",
ISSN = "1895-1767",
ISSN-L = "1895-1767",
bibdate = "Thu Oct 3 07:39:16 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/scpe.bib",
URL = "https://www.scpe.org/index.php/scpe/article/view/1460",
acknowledgement = ack-nhfb,
fjournal = "Scalable Computing: Practice and Experience",
journal-URL = "http://www.scpe.org/",
}
@Article{Parrilla:2019:ECC,
author = "Luis Parrilla and Jos{\'e} A. {\'A}lvarez-Bermejo and
Encarnaci{\'o}n Castillo and Juan A. L{\'o}pez-Ramos
and Diego P. Morales-Santos and Antonio Garc{\'{\i}}a",
title = "Elliptic Curve Cryptography hardware accelerator for
high-performance secure servers",
journal = j-J-SUPERCOMPUTING,
volume = "75",
number = "3",
pages = "1107--1122",
month = mar,
year = "2019",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-018-2317-6",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Oct 10 15:31:18 MDT 2019",
bibsource = "http://link.springer.com/journal/11227/75/3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Patranabis:2019:SCS,
author = "S. Patranabis and N. Datta and D. Jap and J. Breier
and S. Bhasin and D. Mukhopadhyay",
title = "{SCADFA}: Combined {SCA + DFA} Attacks on Block
Ciphers with Practical Validations",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "10",
pages = "1498--1510",
month = oct,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2019.2913644",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Sep 12 13:33:25 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "bit-permutation; Ciphers; combined attacks;
Correlation; DFA; DPA; fault attacks; GIFT; Hardware;
Internet of Things; Light emitting diodes; optimal
diffusion; PRESENT; Resistance; side-channel analysis",
}
@Article{Paul:2019:RCS,
author = "J. D. Paul",
title = "Re-creating the {Sigsaly} quantizer: This 1943
analog-to-digital converter gave the {Allies} an
unbreakable scrambler --- [Resources]",
journal = j-IEEE-SPECTRUM,
volume = "56",
number = "2",
pages = "16--17",
month = feb,
year = "2019",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2019.8635806",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "analog-to-digital converter; anode current; audio
coding; audio signal processing; audio spectrum;
band-scrambled U.S. radiotelephone conferences; Bell
Telephone Laboratories; cryptography; digital media
technologies; digital technology; digitized voice;
electronic tube; five-tap logarithmic resistor divider
ladder; German intelligence; history; NSA journals;
one-time random digital encryption key; PCM; pulse code
modulation; pulse-code modulation; quantisation
(signal); radiotelephony; SIGSALY quantizer; speech
coding; speech parameters; spread spectrum
communication; thyratrons; U.S. National Security
Agency; unbreakable speech scrambler; vocoders;
VT-109-2051 thyratrons; World War II; WWII SIGSALY
technician",
}
@Article{Peng:2019:EDI,
author = "Su Peng and Fucai Zhou and Jin Li and Qiang Wang and
Zifeng Xu",
title = "Efficient, dynamic and identity-based {Remote Data
Integrity Checking} for multiple replicas",
journal = j-J-NETW-COMPUT-APPL,
volume = "134",
number = "??",
pages = "72--88",
day = "15",
month = may,
year = "2019",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:32 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804519300657",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Peng:2019:GCS,
author = "Liqiang Peng and Atsushi Takayasu",
title = "Generalized cryptanalysis of small {CRT}-exponent
{RSA}",
journal = j-THEOR-COMP-SCI,
volume = "795",
number = "??",
pages = "432--458",
day = "26",
month = nov,
year = "2019",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Oct 16 07:39:37 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397519304669",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Pennino:2019:PIS,
author = "Diego Pennino and Maurizio Pizzonia and Federico
Griscioli",
title = "Pipeline-integrity: Scaling the use of authenticated
data structures up to the cloud",
journal = j-FUT-GEN-COMP-SYS,
volume = "100",
number = "??",
pages = "618--647",
month = nov,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.05.018",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:01 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18328048",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Perez-Resa:2019:SSE,
author = "A. P{\'e}rez-Resa and M. Garcia-Bosque and C.
S{\'a}nchez-Azqueta and S. Celma",
title = "Self-Synchronized Encryption for Physical Layer in
{10Gbps} Optical Links",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "6",
pages = "899--911",
month = jun,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2890259",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 11 09:46:20 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "bit rate 10 Gbit/s; Ciphers; cryptography; Encoding;
encrypted optical link; Encryption; Ethernet; feedback;
field programmable gate array; field programmable gate
arrays; Format Preserving Encryption; FPE block cipher;
FPGA; Indistinguishability under Chosen-Plaintext
Attack; Optical communications; Optical fiber
communication; Physical layer; physical layer; pipeline
statistical cipher feedback; security analysis;
self-synchronous encryption; Statistical Cipher
Feedback; symmetric stream cipher; synchronisation;
Synchronization; synchronized Encryption; Throughput",
}
@Article{Perkovic:2019:LVL,
author = "Toni Perkovi{\'c} and Mario Cagalj and Tonko
Kovacevi{\'c}",
title = "{LISA}: Visible light based initialization and {SMS}
based authentication of constrained {IoT} devices",
journal = j-FUT-GEN-COMP-SYS,
volume = "97",
number = "??",
pages = "105--118",
month = aug,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18321083",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Perumal:2019:SDE,
author = "Kaliram Perumal and Suganthi Muthusamy and Gowrison
Gengavel",
title = "Sparse data encoder and decoder to improve security in
video steganography",
journal = j-CCPE,
volume = "31",
number = "14",
pages = "e4971:1--e4971:??",
day = "25",
month = jul,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4971",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "27 December 2018",
}
@Article{Pham:2019:SSS,
author = "Hoang Pham and Jason Woodworth and Mohsen Amini
Salehi",
title = "Survey on secure search over encrypted data on the
cloud",
journal = j-CCPE,
volume = "31",
number = "17",
pages = "e5284:1--e5284:??",
day = "10",
month = sep,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.5284",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:05 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "07 April 2019",
}
@Article{Pisani:2019:ABS,
author = "Paulo Henrique Pisani and Abir Mhenni and Romain Giot
and Estelle Cherrier and Norman Poh and Andr{\'e}
Carlos Ponce de Leon {Ferreira de Carvalho} and
Christophe Rosenberger and Najoua Essoukri {Ben
Amara}",
title = "Adaptive Biometric Systems: Review and Perspectives",
journal = j-COMP-SURV,
volume = "52",
number = "5",
pages = "102:1--102:??",
month = oct,
year = "2019",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3344255",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Tue Oct 29 09:52:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3344255",
abstract = "With the widespread of computing and mobile devices,
authentication using biometrics has received greater
attention. Although biometric systems usually provide
good solutions, the recognition performance tends to be
affected over time due to changing conditions and aging
of biometric data, which results in intra-class
variability. Adaptive biometric systems, which adapt
the biometric reference over time, have been proposed
to deal with such intra-class variability. This article
provides the most up-to-date and complete discussion on
adaptive biometrics systems we are aware of, including
formalization, terminology, sources or variations that
motivates the use of adaptation, adaptation strategies,
evaluation methodology, and open challenges. This field
of research is sometimes referred to as template
update.",
acknowledgement = ack-nhfb,
articleno = "102",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Pja:2019:SSG,
author = "Alphonse Pja and Venkatramana Reddy Y",
title = "Scalable and secure group key agreement for wireless
ad-hoc networks by extending {RSA} scheme",
journal = j-CCPE,
volume = "31",
number = "14",
pages = "e4969:1--e4969:??",
day = "25",
month = jul,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4969",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "26 November 2018",
}
@Article{Poddar:2019:AED,
author = "Rishabh Poddar and Tobias Boelter and Raluca Ada
Popa",
title = "{Arx}: an encrypted database using semantically secure
encryption",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "12",
number = "11",
pages = "1664--1678",
month = jul,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.14778/3342263.3342641",
ISSN = "2150-8097",
bibdate = "Wed Oct 2 06:49:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "In recent years, encrypted databases have emerged as a
promising direction that provides data confidentiality
without sacrificing functionality: queries are executed
on encrypted data. However, many practical proposals
rely on a set of weak encryption schemes that have been
shown to leak sensitive data. In this paper, we propose
Arx, a practical and functionally rich database system
that encrypts the data only with semantically secure
encryption schemes. We show that Arx supports real
applications such as ShareLaTeX with a modest
performance overhead.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Puthal:2019:SAL,
author = "Deepak Puthal and Rajiv Ranjan and Ashish Nanda and
Priyadarsi Nanda and Prem Prakash Jayaraman and Albert
Y. Zomaya",
title = "Secure authentication and load balancing of
distributed edge datacenters",
journal = j-J-PAR-DIST-COMP,
volume = "124",
number = "??",
pages = "60--69",
month = feb,
year = "2019",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2018.10.007",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Mon Jan 7 07:58:40 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S074373151830741X",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Puthal:2019:SSE,
author = "D. Puthal and X. Wu and N. Surya and R. Ranjan and J.
Chen",
title = "{SEEN}: A Selective Encryption Method to Ensure
Confidentiality for Big Sensing Data Streams",
journal = j-IEEE-TRANS-BIG-DATA,
volume = "5",
number = "3",
pages = "379--392",
month = sep,
year = "2019",
DOI = "https://doi.org/10.1109/TBDATA.2017.2702172",
ISSN = "2332-7790",
ISSN-L = "2332-7790",
bibdate = "Tue Oct 29 11:08:44 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "Big Data; big data; Big data; Big data stream; big
sensing data streams; critical applications;
cryptography; data confidentiality; data integrity;
data security; Data Stream Manager; decision-making;
Encryption; high data trustworthiness; multilevel data
confidentiality; Real-time systems; resource
constrained sensing devices; selective encryption;
selective encryption method; self-organizing wireless
sensor networks; sensed data types; Sensors; smart
health; telecommunication security; wireless sensor
networks",
}
@Article{Qiu:2019:CPT,
author = "Jian Qiu and Hengjian Li and Chuan Zhao",
title = "Cancelable palmprint templates based on random
measurement and noise data for security and
privacy-preserving authentication",
journal = j-COMPUT-SECUR,
volume = "82",
number = "??",
pages = "1--14",
month = may,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:59 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818306618",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Queiroz:2019:WBF,
author = "Jordan S. Queiroz and Eduardo L. Feitosa",
title = "A {Web} Browser Fingerprinting Method Based on the
{Web} Audio {API}",
journal = j-COMP-J,
volume = "62",
number = "8",
pages = "1106--1120",
month = aug,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy146",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Aug 19 07:31:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/8/1106/5298776",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Rahulamathavan:2019:PPI,
author = "Y. Rahulamathavan and K. R. Sutharsini and I. G. Ray
and R. Lu and M. Rajarajan",
title = "Privacy-Preserving {iVector}-Based Speaker
Verification",
journal = j-IEEE-ACM-TASLP,
volume = "27",
number = "3",
pages = "496--506",
month = mar,
year = "2019",
DOI = "https://doi.org/10.1109/TASLP.2018.2882731",
ISSN = "2329-9290",
bibdate = "Sat Aug 3 09:10:28 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "authentication; Bioinformatics; Cryptography; Data
privacy; data privacy; Feature extraction; iVector;
iVector-based voice verification technique; linear
discriminant analysis; linear discriminant analysis
techniques; Privacy; privacy-preserving iVector-based
speaker verification; privacy-preserving voice
verification; random domain; randomized domain;
security; Servers; speaker recognition; speech; voice
print",
}
@Article{Rao:2019:HPR,
author = "Fang-Yu Rao and Jianneng Cao and Elisa Bertino and
Murat Kantarcioglu",
title = "Hybrid Private Record Linkage: Separating
Differentially Private Synopses from Matching Records",
journal = j-TOPS,
volume = "22",
number = "3",
pages = "15:1--15:??",
month = jul,
year = "2019",
DOI = "https://doi.org/10.1145/3318462",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
bibdate = "Sat Sep 21 08:26:25 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
URL = "https://dl.acm.org/citation.cfm?id=3318462",
abstract = "Private record linkage protocols allow multiple
parties to exchange matching records, which refer to
the same entities or have similar values, while keeping
the non-matching ones secret. Conventional protocols
are based on computationally expensive cryptographic
primitives and therefore do not scale. To address these
scalability issues, hybrid protocols have been proposed
that combine differential privacy techniques with
secure multiparty computation techniques. However, a
drawback of such protocols is that they disclose to the
parties both the matching records and the
differentially private synopses of the datasets
involved in the linkage. Consequently, differential
privacy is no longer always satisfied. To address this
issue, we propose a novel framework that separates the
private synopses from the matching records. The two
parties do not access the synopses directly, but still
use them to efficiently link records. We theoretically
prove the security of our framework under the
state-of-the-art privacy notion of differential privacy
for record linkage (DPRL). In addition, we develop a
simple but effective strategy for releasing private
synopses. Extensive experimental results show that our
framework is superior to the existing methods in terms
of efficiency.",
acknowledgement = ack-nhfb,
articleno = "15",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Rastegari:2019:ECS,
author = "Parvin Rastegari and Willy Susilo and Mohammad
Dakhlalian",
title = "Efficient Certificateless Signcryption in the Standard
Model: Revisiting {Luo} and {Wan}'s Scheme from
Wireless Personal Communications (2018)",
journal = j-COMP-J,
volume = "62",
number = "8",
pages = "1178--1193",
month = aug,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz041",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Aug 19 07:31:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/8/1178/5485598",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Raz:2019:FLR,
author = "Ran Raz",
title = "Fast Learning Requires Good Memory: a Time-Space Lower
Bound for Parity Learning",
journal = j-J-ACM,
volume = "66",
number = "1",
pages = "3:1--3:??",
month = jan,
year = "2019",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/3186563",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
bibdate = "Wed Oct 23 06:51:05 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "We prove that any algorithm for learning parities
requires either a memory of quadratic size or an
exponential number of samples. This proves a recent
conjecture of Steinhardt et al. (2016) and shows that
for some learning problems, a large storage space is
crucial. More formally, in the problem of parity
learning, an unknown string x \in {0,1}$^n$ was chosen
uniformly at random. A learner tries to learn x from a
stream of samples (a$_1$, b$_1$), (a$_2$, b$_2$)
\ldots{}, where each a$_t$ is uniformly distributed
over {0,1}$^n$ and b$_t$ is the inner product of a$_t$
and x, modulo 2. We show that any algorithm for parity
learning that uses less than n$^2$ /25 bits of memory
requires an exponential number of samples. Previously,
there was no non-trivial lower bound on the number of
samples needed for any learning problem, even if the
allowed memory size is O (n) (where n is the space
needed to store one sample). We also give an
application of our result in the field of
bounded-storage cryptography. We show an encryption
scheme that requires a private key of length n, as well
as time complexity of n per encryption/decryption of
each bit, and is provably and unconditionally secure as
long as the attacker uses less than n$^2$ /25 memory
bits and the scheme is used at most an exponential
number of times. Previous works on bounded-storage
cryptography assumed that the memory size used by the
attacker is at most linear in the time needed for
encryption/decryption.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Resende:2019:BMI,
author = "Jo{\~a}o S. Resende and Patr{\'\i}cia R. Sousa and
Rolando Martins and Lu{\'\i}s Antunes",
title = "Breaking {MPC} implementations through compression",
journal = j-INT-J-INFO-SEC,
volume = "18",
number = "4",
pages = "505--518",
month = aug,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-018-0424-2",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Sat Jul 13 14:23:17 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer.com/article/10.1007/s10207-018-0424-2",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
keywords = "multiparty computation (MPC) [a sub-field of
cryptography with the goal of creating methods for
parties to jointly compute a function over their inputs
while keeping those inputs private]",
}
@Article{Reyhani-Masoleh:2019:NMI,
author = "A. Reyhani-Masoleh and H. El-Razouk and A. Monfared",
title = "New Multiplicative Inverse Architectures Using
{Gaussian} Normal Basis",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "7",
pages = "991--1006",
month = jul,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2859941",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 11 09:46:20 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "application specific integrated circuits; arithmetic
operations; binary fields; classic inversion scheme;
classic-based addition chains; classical-interleaved
architecture; classical-interleaved inverter; CMOS
integrated circuits; Computer architecture;
cryptography; Digit-level multiplier; digital
arithmetic; field inversion; field programmable gate
arrays; finite field; FSISM; FSISM processor;
fully-serial-in square-multiply processor; Galois
fields; Gaussian normal basis; Gaussian processes;
hybrid-double multiplication; input registers;
inversion architecture; inversion architectures;
Inverters; invertors; Itoh-Tsujii algorithm; latency;
Logic gates; multiplication cycle; multiplicative
inverse architectures; multiplying circuits; NIST;
Propagation delay; size 65.0 nm; ternary Itoh-Tsujii
algorithm",
}
@Article{Rezaeibagha:2019:EMC,
author = "Fatemeh Rezaeibagha and Yi Mu",
title = "Efficient Micropayment of Cryptocurrency from
Blockchains",
journal = j-COMP-J,
volume = "62",
number = "4",
pages = "507--517",
month = apr,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy105",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Apr 2 12:10:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/4/507/5155318",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Rezaeibagha:2019:PSB,
author = "Fatemeh Rezaeibagha and Yi Mu and Shiwei Zhang and
Xiaofen Wang",
title = "Provably Secure (Broadcast) Homomorphic Signcryption",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "511--529",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400100",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400100",
abstract = "Signcryption has drawn a lot of attention due to its
useful applications in many areas, in particular for
applications where the computation and communication
resources are constrained, for example, for lightweight
devices. The traditional signcryption scheme does not
support the homomorphic property. Recent work by
Rezaeibagha et al. (Provsec 2017) offered a provably
secure homomorphic signcryption scheme, in which for
the first time, provided a scheme provably secure under
some restriction. In this paper, we show that the
homomorphic signcryption can be extended to provably
secure broadcast signcryption scheme. We allow the
broadcasted signcrypted data items to be aggregated
without requiring decryption that is a desirable
feature in distributed environments.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Riazi:2019:DLP,
author = "M. S. Riazi and B. {Darvish Rouani} and F.
Koushanfar",
title = "Deep Learning on Private Data",
journal = j-IEEE-SEC-PRIV,
volume = "17",
number = "6",
pages = "54--63",
month = nov,
year = "2019",
DOI = "https://doi.org/10.1109/MSEC.2019.2935666",
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/cryptography2010.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 = "Computational modeling; cryptographic methodologies;
Cryptography; cryptography; Data models; data privacy;
deep neural networks; inference; inference mechanisms;
learning (artificial intelligence); Logic gates; neural
nets; Neural networks; privacy-preserving deep
learning; private data; Servers; user logs",
}
@InProceedings{Rohloff:2019:CAR,
author = "Kurt Rohloff",
title = "Computer Arithmetic Research to Accelerate
Privacy-Protecting Encrypted Computing Such as
Homomorphic Encryption",
crossref = "Takagi:2019:ISC",
pages = "197--197",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1109/ARITH.2019.00046",
bibdate = "Fri Jan 31 08:18:07 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "One of the first major breakthroughs of computer
science in the 21st century has been the discovery and
practical demonstration of encrypted computing
technologies such as Fully Homomorphic Encryption
(FHE). Encrypted computing technologies allow sensitive
data to be encrypted such that arbitrary programs can
be securely run over the encrypted data where the
output, when decrypted, is equivalent to the result of
running the original algorithm on the unencrypted data.
In this talk we focus on the use of and potential for
computer arithmetic research to enable more practical
encrypted computing, such as to accelerate advanced
encryption implementations on custom hardware. These
technologies are ground-breaking in their ability for
privacy-preserving data science on sensitive data sets
with minimal costs in terms of engineering effort,
power, compute resources, etc. \ldots{}. We discuss
theory, design, algorithmic, hardware, software
engineering and systems research that is enabling
applications of encrypted computing in regulated data
industries, such as in medical and financial domains.
We use our work using accelerating the PALISADE
open-source homomorphic encryption software library for
practical applications in case studies.",
acknowledgement = ack-nhfb,
keywords = "Acceleration; advanced encryption implementations;
ARITH-26; computer arithmetic research; computer
science; Computer science; Computers; cryptography;
data privacy; Digital arithmetic; encrypted computing
technologies; encrypted data; Encryption; fully
homomorphic encryption; Hardware; PALISADE open-source
homomorphic encryption software library;
privacy-preserving data science; privacy-protecting
encrypted computing; public domain software; regulated
data industries; sensitive data sets; software
engineering; software libraries; unencrypted data",
}
@Article{Romashchenko:2019:OCM,
author = "Andrei Romashchenko and Marius Zimand",
title = "An Operational Characterization of Mutual Information
in Algorithmic Information Theory",
journal = j-J-ACM,
volume = "66",
number = "5",
pages = "38:1--38:??",
month = sep,
year = "2019",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/3356867",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Wed Oct 23 06:51:07 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3356867",
abstract = "We show that the mutual information, in the sense of
Kolmogorov complexity, of any pair of strings x and y
is equal, up to logarithmic precision, to the length of
the longest shared secret key that two parties-one
having x and the complexity profile of the pair and the
other one having y and the complexity profile of the
pair-can establish via a probabilistic protocol with
interaction on a public channel. For l > 2, the longest
shared secret that can be established from a tuple of
strings (x$_1$, \ldots{}, x$_l$) by l parties-each one
having one component of the tuple and the complexity
profile of the tuple-is equal, up to logarithmic
precision, to the complexity of the tuple minus the
minimum communication necessary for distributing the
tuple to all parties. We establish the communication
complexity of secret key agreement protocols that
produce a secret key of maximal length for protocols
with public randomness. We also show that if the
communication complexity drops below the established
threshold, then only very short secret keys can be
obtained.",
acknowledgement = ack-nhfb,
articleno = "38",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Ruoti:2019:JJT,
author = "S. Ruoti and K. Seamons",
title = "{Johnny}'s Journey Toward Usable Secure Email",
journal = j-IEEE-SEC-PRIV,
volume = "17",
number = "6",
pages = "72--76",
month = nov,
year = "2019",
DOI = "https://doi.org/10.1109/MSEC.2019.2933683",
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/cryptography2010.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; Electronic mail; electronic mail;
Encryption; Servers; Usability; usable key management;
usable secure email; usable-security community",
}
@Article{Sadat:2019:SSG,
author = "Md Nazmus Sadat and Md Momin {Al Aziz} and Noman
Mohammed and Feng Chen and Xiaoqian Jiang and Shuang
Wang",
title = "{SAFETY: Secure gwAs in Federated Environment through
a hYbrid Solution}",
journal = j-TCBB,
volume = "16",
number = "1",
pages = "93--102",
month = jan,
year = "2019",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2018.2829760",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Mon Mar 11 18:45:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "Recent studies demonstrate that effective healthcare
can benefit from using the human genomic information.
Consequently, many institutions are using statistical
analysis of genomic data, which are mostly based on
genome-wide association studies GWAS. GWAS analyze
genome sequence variations in order to identify genetic
risk factors for diseases. These studies often require
pooling data from different sources together in order
to unravel statistical patterns, and relationships
between genetic variants and diseases. Here, the
primary challenge is to fulfill one major objective:
accessing multiple genomic data repositories for
collaborative research in a privacy-preserving manner.
Due to the privacy concerns regarding the genomic data,
multi-jurisdictional laws and policies of cross-border
genomic data sharing are enforced among different
countries. In this article, we present SAFETY, a hybrid
framework, which can securely perform GWAS on federated
genomic datasets using homomorphic encryption and
recently introduced secure hardware component of Intel
Software Guard Extensions to ensure high efficiency and
privacy at the same time. Different experimental
settings show the efficacy and applicability of such
hybrid framework in secure conduction of GWAS. To the
best of our knowledge, this hybrid use of homomorphic
encryption along with Intel SGX is not proposed to this
date. SAFETY is up to 4.82 times faster than the best
existing secure computation technique.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@Article{Sakellariou:2019:HEK,
author = "Georgios Sakellariou and Anastasios Gounaris",
title = "Homomorphically encrypted $k$-means on cloud-hosted
servers with low client-side load",
journal = j-COMPUTING,
volume = "101",
number = "12",
pages = "1813--1836",
month = dec,
year = "2019",
CODEN = "CMPTA2",
DOI = "https://doi.org/10.1007/s00607-019-00711-w",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
bibdate = "Tue May 12 18:02:14 MDT 2020",
bibsource = "http://link.springer.com/journal/607/101/12;
https://www.math.utah.edu/pub/tex/bib/computing.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computing",
journal-URL = "http://link.springer.com/journal/607",
}
@Article{Sandor:2019:EDM,
author = "Voundi Koe Arthur Sandor and Yaping Lin and Xiehua Li
and Feng Lin and Shiwen Zhang",
title = "Efficient decentralized multi-authority attribute
based encryption for mobile cloud data storage",
journal = j-J-NETW-COMPUT-APPL,
volume = "129",
number = "??",
pages = "25--36",
day = "1",
month = mar,
year = "2019",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:30 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804519300037",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Saracevic:2019:NAS,
author = "Muzafer Saracevi{\'c} and Sasa Adamovi{\'c} and
Vladislav Miskovic and Nemanja Macek and Marko Sarac",
title = "A novel approach to steganography based on the
properties of {Catalan} numbers and {Dyck} words",
journal = j-FUT-GEN-COMP-SYS,
volume = "100",
number = "??",
pages = "186--197",
month = nov,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.05.010",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:01 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19300184",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Sartakhti:2019:CPL,
author = "Javad Salimi Sartakhti and Saeed Jalili",
title = "On the computational power of the light: a plan for
breaking {Data Encryption Standard}",
journal = j-THEOR-COMP-SCI,
volume = "773",
number = "??",
pages = "71--78",
day = "14",
month = jun,
year = "2019",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2018.08.015",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Jun 15 10:14:21 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397518305310",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Schneier:2019:CPI,
author = "B. Schneier",
title = "Cybersecurity for the Public Interest",
journal = j-IEEE-SEC-PRIV,
volume = "17",
number = "1",
pages = "84--83",
month = jan # "\slash " # feb,
year = "2019",
DOI = "https://doi.org/10.1109/MSEC.2018.2889891",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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; cybersecurity;
Ethics; government policies; Government policies;
policy ramifications; public interest; Public policy;
security of data; Social factors; Social implications
of technology; Technology",
}
@Article{Scholl:2019:SIE,
author = "Travis Scholl",
title = "Super-Isolated Elliptic Curves and {Abelian} Surfaces
in Cryptography",
journal = j-EXP-MATH,
volume = "28",
number = "4",
pages = "385--397",
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1080/10586458.2017.1412371",
ISSN = "1058-6458 (print), 1944-950X (electronic)",
ISSN-L = "1058-6458",
bibdate = "Fri Dec 13 06:44:38 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/expmath.bib;
http://www.tandfonline.com/toc/uexm20/28/4",
URL = "http://www.tandfonline.com/doi/full/10.1080/10586458.2017.1412371",
acknowledgement = ack-nhfb,
fjournal = "Experimental Mathematics",
journal-URL = "http://www.tandfonline.com/loi/uexm20",
onlinedate = "03 Jan 2018",
}
@Article{Sethumadhavan:2019:SA,
author = "S. Sethumadhavan and M. Tiwari",
title = "Secure Architectures",
journal = j-IEEE-MICRO,
volume = "39",
number = "4",
pages = "6--7",
month = jul # "\slash " # aug,
year = "2019",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/MM.2019.2925152",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu Jul 25 15:29:43 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "Computer architecture; Computer security; Conferences;
Cryptography; Hardware; Software",
}
@Article{Sgantzos:2019:AII,
author = "Konstantinos Sgantzos and Ian Grigg",
title = "Artificial Intelligence Implementations on the
Blockchain. {Use} Cases and Future Applications",
journal = j-FUTURE-INTERNET,
volume = "11",
number = "8",
pages = "170",
day = "02",
month = aug,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi11080170",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:07 MST 2019",
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/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/11/8/170",
abstract = "An exemplary paradigm of how an AI can be a disruptive
technological paragon via the utilization of blockchain
comes straight from the world of deep learning. Data
scientists have long struggled to maintain the quality
of a dataset for machine learning by an AI entity.
Datasets can be very expensive to purchase, as,
depending on both the proper selection of the elements
and the homogeneity of the data contained within,
constructing and maintaining the integrity of a dataset
is difficult. Blockchain as a highly secure storage
medium presents a technological quantum leap in
maintaining data integrity. Furthermore, blockchain's
immutability constructs a fruitful environment for
creating high quality, permanent and growing datasets
for deep learning. The combination of AI and blockchain
could impact fields like Internet of things (IoT),
identity, financial markets, civil governance, smart
cities, small communities, supply chains, personalized
medicine and other fields, and thereby deliver benefits
to many people.",
acknowledgement = ack-nhfb,
remark = "Special Issue Blockchain: Current Challenges and
Future Prospects/Applications.",
}
@Article{Sha:2019:CED,
author = "Le-Tian Sha and Fu Xiao and Hai-Ping Huang and Yu Chen
and Ru-Chuan Wang",
title = "Catching Escapers: a Detection Method for Advanced
Persistent Escapers in Industry {Internet of Things}
Based on Identity-based Broadcast Encryption {(IBBE)}",
journal = j-TECS,
volume = "18",
number = "3",
pages = "29:1--29:??",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3319615",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:43 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3319615",
abstract = "As the Industry 4.0 or Internet of Things (IoT) era
begins, security plays a key role in the Industry
Internet of Things (IIoT) due to various threats, which
include escape or Distributed Denial of Service (DDoS)
attackers in the virtualization layer and vulnerability
exploiters in the device layer. A successful cross-VM
escape attack in the virtualization layer combined with
cross-layer penetration in the device layer, which we
define as an Advanced Persistent Escaper (APE), poses a
great threat. Therefore, the development of detection
and rejection methods for APEs across multiple layers
in IIoT is an open issue. To the best of our knowledge,
less effective methods are established, especially for
vulnerability exploitation in the virtualization layer
and backdoor leverage in the device layer. On the basis
of this, we propose Escaper Cops (EscaperCOP), a
detection method for cross-VM escapers in the
virtualization layer and cross-layer penetrators in the
device layer. In particular, a new detection method for
guest-to-host escapers is proposed for the
virtualization layer. Finally, a novel encryption
method based on Identity-based Broadcast Encryption
(IBBE) is proposed to protect the critical components
in EscaperCOP, detection library, and control command
library. To verify our method, experimental tests are
performed for a large number of APEs in an IIoT
framework. The test results have demonstrated the
proposed method is effective with an acceptable level
of detection ratio.",
acknowledgement = ack-nhfb,
articleno = "29",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Shah:2019:PCB,
author = "Mohsin Shah and Weiming Zhang and Honggang Hu and
Nenghai Yu",
title = "{Paillier} Cryptosystem based Mean Value Computation
for Encrypted Domain Image Processing Operations",
journal = j-TOMM,
volume = "15",
number = "3",
pages = "76:1--76:??",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3325194",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Wed Oct 2 10:12:47 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3325194",
abstract = "Due to its large storage facility and high-end
computing capability, cloud computing has received
great attention as a huge amount of personal multimedia
data and computationally expensive tasks can be
outsourced to the cloud. However, the cloud being
third-party semi-trusted, is prone to information
leakage, raising privacy risks. Signal processing in
the encrypted domain has emerged as a new research
paradigm on privacy-preserving processing over
outsourced data by semi-trusted cloud. In this article,
we propose a solution for non-integer mean value
computation in the homomorphic encrypted domain without
any interactive protocol between the client and the
service provider. Using the proposed solution, various
image processing operations, such as local smoothing
filter, un-sharp masking, and histogram equalization,
can be performed in the encrypted domain at the cloud
server without any privacy concerns. Our experimental
results from standard test images reveal that these
image processing operations can be performed without
pre-processing, without client-server interactive
protocol, and without any error between the encrypted
domain and the plain domain.",
acknowledgement = ack-nhfb,
articleno = "76",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{ShanmugaPriya:2019:PAS,
author = "S. ShanmugaPriya and A. Valarmathi and D. Yuvaraj",
title = "The personal authentication service and security
enhancement for optimal strong password",
journal = j-CCPE,
volume = "31",
number = "14",
pages = "e5009:1--e5009:??",
day = "25",
month = jul,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.5009",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "29 November 2018",
}
@Article{Sherman:2019:OVB,
author = "A. T. Sherman and F. Javani and H. Zhang and E.
Golaszewski",
title = "On the Origins and Variations of Blockchain
Technologies",
journal = j-IEEE-SEC-PRIV,
volume = "17",
number = "1",
pages = "72--77",
month = jan # "\slash " # feb,
year = "2019",
DOI = "https://doi.org/10.1109/MSEC.2019.2893730",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
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/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
journal-URL = "https://publications.computer.org/security-and-privacy/",
keywords = "Bitcoin; Blockchain; blockchain technologies;
blockchain variation; Computer security; cryptography;
Fault tolerant systems; financial data processing;
Smart contracts",
}
@Article{Sherman:2019:PBL,
author = "A. T. Sherman and P. A. H. Peterson and E. Golaszewski
and E. LaFemina and E. Goldschen and M. Khan and L.
Mundy and M. Rather and B. Solis and W. Tete and E.
Valdez and B. Weber and D. Doyle and C. O'Brien and L.
Oliva and J. Roundy and J. Suess",
title = "Project-Based Learning Inspires Cybersecurity
Students: A Scholarship-for-Service Research Study",
journal = j-IEEE-SEC-PRIV,
volume = "17",
number = "3",
pages = "82--88",
month = may # "\slash " # jun,
year = "2019",
DOI = "https://doi.org/10.1109/MSEC.2019.2900595",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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; Firewalls
(computing); Internet; Servers; Task analysis",
}
@Article{Shi:2019:LWW,
author = "Y. Shi and W. Wei and H. Fan and M. H. Au and X. Luo",
title = "A Light-Weight White-Box Encryption Scheme for
Securing Distributed Embedded Devices",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "10",
pages = "1411--1427",
month = oct,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2019.2907847",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Sep 12 13:33:25 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Ciphers; Distributed databases; Distributed embedded
devices; Elliptic curve cryptography; Encryption; Fans;
light-weight; symmetric encryption algorithms;
white-box attack contexts; white-box cryptography",
}
@Article{Shibu:2019:ARR,
author = "N. V. Shibu and P. Malathi",
title = "Accurate and reliable reversible data hiding using
sequential encoding techniques",
journal = j-CCPE,
volume = "31",
number = "14",
pages = "e4979:1--e4979:??",
day = "25",
month = jul,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4979",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "29 November 2018",
}
@Article{Shokri:2019:ESS,
author = "Madeh Shokri and Meghdad Mirabi",
title = "An efficient stream structure for broadcasting the
encrypted {XML} data in mobile wireless broadcast
channels",
journal = j-J-SUPERCOMPUTING,
volume = "75",
number = "11",
pages = "7147--7173",
month = nov,
year = "2019",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-019-02920-8",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jul 25 07:17:52 MDT 2020",
bibsource = "http://link.springer.com/journal/11227/75/11;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{shree:2019:ERC,
author = "S. Raja shree and A. Chilambu Chelvan and M. Rajesh",
title = "An efficient {RSA} cryptosystem by applying cuckoo
search optimization algorithm",
journal = j-CCPE,
volume = "31",
number = "12",
pages = "e4845:1--e4845:??",
day = "25",
month = jun,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4845",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "25 October 2018",
}
@Article{Shuai:2019:AAS,
author = "Mengxia Shuai and Nenghai Yu and Hongxia Wang and Ling
Xiong",
title = "Anonymous authentication scheme for smart home
environment with provable security",
journal = j-COMPUT-SECUR,
volume = "86",
number = "??",
pages = "132--146",
month = sep,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818313701",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Siegel:2019:UOC,
author = "J. E. Siegel and S. Sarma",
title = "Using Open Channels to Trigger the Invited, Unintended
Consequences of the {Internet of Things}",
journal = j-IEEE-SEC-PRIV,
volume = "17",
number = "3",
pages = "49--55",
month = may # "\slash " # jun,
year = "2019",
DOI = "https://doi.org/10.1109/MSEC.2019.2901430",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "Air gaps; Biometrics (access control); contextual
monitoring; device speakers; Internet of Things;
Internet of Things air gap; meta data; mobile
computing; Object recognition; open channels; Security;
source metadata embedding; speaker recognition;
two-factor authentication; voice assistants; Webcams",
}
@Article{Singh:2019:SID,
author = "J. Singh and J. Cobbe",
title = "The Security Implications of Data Subject Rights",
journal = j-IEEE-SEC-PRIV,
volume = "17",
number = "6",
pages = "21--30",
month = nov,
year = "2019",
DOI = "https://doi.org/10.1109/MSEC.2019.2914614",
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/cryptography2010.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; Data protection; data protection; data
protection regulations; data subject rights;
fulfillment processes; individuals rights; Law;
legislation; organizational processes; Process control;
security implications; technical infrastructure",
}
@Article{Smith-Creasey:2019:NWI,
author = "Max Smith-Creasey and Muttukrishnan Rajarajan",
title = "A novel word-independent gesture-typing continuous
authentication scheme for mobile devices",
journal = j-COMPUT-SECUR,
volume = "83",
number = "??",
pages = "140--150",
month = jun,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818306552",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{SoltaniPanah:2019:CDG,
author = "A. {Soltani Panah} and A. Yavari and R. {van Schyndel}
and D. Georgakopoulos and X. Yi",
title = "Context-Driven Granular Disclosure Control for
{Internet of Things} Applications",
journal = j-IEEE-TRANS-BIG-DATA,
volume = "5",
number = "3",
pages = "408--422",
month = sep,
year = "2019",
DOI = "https://doi.org/10.1109/TBDATA.2017.2737463",
ISSN = "2332-7790",
ISSN-L = "2332-7790",
bibdate = "Tue Oct 29 11:08:44 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransbigdata.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Big Data",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6687317",
keywords = "Authorization; context; context-driven disclosure
policies; context-driven granular disclosure control;
data handling; data lifecycle; Data models; data
obfuscation; data privacy; Data privacy; data stream
watermarking techniques; data utility; digital
watermark; Internet of Things; IoT data collection; IoT
environments; multigranular obfuscation; Privacy;
privacy enforcement; Privacy preservation; privacy
preservation techniques; pseudorandom numbers; security
of data; technology revolution; Watermarking",
}
@Article{Staples:2019:SAB,
author = "J. Staples and C. Endicott and L. Krause and P. Pal
and P. Samouelian and R. Schantz and A. Wellman",
title = "A Semi-Autonomic Bytecode Repair Framework",
journal = j-IEEE-SOFTWARE,
volume = "36",
number = "2",
pages = "97--102",
month = mar # "\slash " # apr,
year = "2019",
CODEN = "IESOEG",
DOI = "https://doi.org/10.1109/MS.2018.2886829",
ISSN = "0740-7459 (print), 1937-4194 (electronic)",
ISSN-L = "0740-7459",
bibdate = "Fri Aug 2 09:25:48 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "Cryptography; Ecosystems; Java; Java virtual machine
languages; Maintenance engineering; SABRE;
semiautonomic bytecode repair engine framework;
Servers; Software development; Software maintenance",
}
@Article{Stiles:2019:HSB,
author = "D. Stiles",
title = "The Hardware Security Behind {Azure Sphere}",
journal = j-IEEE-MICRO,
volume = "39",
number = "2",
pages = "20--28",
month = mar # "\slash " # apr,
year = "2019",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/MM.2019.2898633",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu Mar 21 10:04:13 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "authentication; computer security; computer viruses;
microcontrollers; real-time systems",
}
@Article{Subramanian:2019:SAF,
author = "Nalini Subramanian and J. Andrews",
title = "Strong authentication framework using statistical
approach for cloud environments",
journal = j-CCPE,
volume = "31",
number = "12",
pages = "e4870:1--e4870:??",
day = "25",
month = jun,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4870",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "25 October 2018",
}
@Article{Sujitha:2019:HSP,
author = "V. Sujitha and D. Chitra",
title = "Highly secure palmprint based biometric template using
fuzzy vault",
journal = j-CCPE,
volume = "31",
number = "12",
pages = "e4513:1--e4513:??",
day = "25",
month = jun,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4513",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "27 May 2018",
}
@Article{Sundararajan:2019:SMC,
author = "Aditya Sundararajan and Arif I. Sarwat and Alexander
Pons",
title = "A Survey on Modality Characteristics, Performance
Evaluation Metrics, and Security for Traditional and
Wearable Biometric Systems",
journal = j-COMP-SURV,
volume = "52",
number = "2",
pages = "39:1--39:??",
month = may,
year = "2019",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3309550",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Aug 31 09:04:37 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3309550",
abstract = "Biometric research is directed increasingly toward
Wearable Biometric Systems (WBS) for user
authentication and identification. However, prior to
engaging in WBS research, how their operational
dynamics and design considerations differ from those of
Traditional Biometric Systems (TBS) must be understood.
While the current literature is cognizant of those
differences, there is no effective work that summarizes
the factors where TBS and WBS differ, namely, their
modality characteristics, performance, security, and
privacy. To bridge the gap, this article accordingly
reviews and compares the key characteristics of
modalities, contrasts the metrics used to evaluate
system performance, and highlights the divergence in
critical vulnerabilities, attacks, and defenses for TBS
and WBS. It further discusses how these factors affect
the design considerations for WBS, the open challenges,
and future directions of research in these areas. In
doing so, the article provides a big-picture overview
of the important avenues of challenges and potential
solutions that researchers entering the field should be
aware of. Hence, this survey aims to be a starting
point for researchers in comprehending the fundamental
differences between TBS and WBS before understanding
the core challenges associated with WBS and its
design.",
acknowledgement = ack-nhfb,
articleno = "39",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Syed:2019:TGB,
author = "Zahid Syed and Jordan Helmick and Sean Banerjee and
Bojan Cukic",
title = "Touch gesture-based authentication on mobile devices:
the effects of user posture, device size,
configuration, and inter-session variability",
journal = j-J-SYST-SOFTW,
volume = "149",
number = "??",
pages = "158--173",
month = mar,
year = "2019",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2018.11.017",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed Jan 23 16:35:05 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121218302516",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Takayasu:2019:PKE,
author = "Atsushi Takayasu and Noboru Kunihiro",
title = "Partial key exposure attacks on {RSA}: Achieving the
{Boneh--Durfee} bound",
journal = j-THEOR-COMP-SCI,
volume = "761",
number = "??",
pages = "51--77",
day = "21",
month = feb,
year = "2019",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2018.08.021",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Jan 29 15:19:47 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397518305371",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Taylor:2019:DST,
author = "Adrian Taylor",
title = "Decrypting {SSL} traffic: best practices for security,
compliance and productivity",
journal = j-NETWORK-SECURITY,
volume = "2019",
number = "8",
pages = "17--19",
month = aug,
year = "2019",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(19)30098-4",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Thu Sep 12 12:58:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485819300984",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Testa:2019:SFE,
author = "Rafael Luiz Testa and Cl{\'e}ber Gimenez Corr{\^e}a
and Ariane Machado-Lima and F{\'a}tima L. S. Nunes",
title = "Synthesis of Facial Expressions in Photographs:
Characteristics, Approaches, and Challenges",
journal = j-COMP-SURV,
volume = "51",
number = "6",
pages = "124:1--124:??",
month = feb,
year = "2019",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3292652",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Aug 31 09:04:36 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3292652",
abstract = "The synthesis of facial expressions has applications
in areas such as interactive games, biometrics systems,
and training of people with disorders, among others.
Although this is an area relatively well explored in
the literature, there are no recent studies proposing
to systematize an overview of research in the area.
This systematic review analyzes the approaches to the
synthesis of facial expressions in photographs, as well
as important aspects of the synthesis process, such as
preprocessing techniques, databases, and evaluation
metrics. Forty-eight studies from three different
scientific databases were analyzed. From these studies,
we established an overview of the process, including
all the stages used to synthesize expressions in facial
images. We also analyze important aspects involved in
these stages such as methods and techniques of each
stage, databases, and evaluation metrics. We observed
that machine learning approaches are the most widely
used to synthesize expressions. Landmark
identification, deformation, mapping, fusion, and
training are common tasks considered in the approaches.
We also found that few studies used metrics to evaluate
the results, and most studies used public databases.
Although the studies analyzed generated consistent and
realistic results while preserving the identity of the
subject, there are still research themes to be
exploited.",
acknowledgement = ack-nhfb,
articleno = "124",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Toth:2019:SSD,
author = "K. C. Toth and A. Anderson-Priddy",
title = "Self-Sovereign Digital Identity: A Paradigm Shift for
Identity",
journal = j-IEEE-SEC-PRIV,
volume = "17",
number = "3",
pages = "17--27",
month = may # "\slash " # jun,
year = "2019",
DOI = "https://doi.org/10.1109/MSEC.2018.2888782",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Fri Aug 2 08:20:27 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "Data models; Data privacy; Digital systems; Password;
Privacy; Protocols",
}
@Article{Tseng:2019:AMR,
author = "Yi-Fan Tseng and Chun-I Fan and Cheng-Wei Sung",
title = "On the Anonymity of Multi-Receiver Identity-Based
Encryption Based on {Fujisaki--Okamoto}
Transformation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "493--509",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400094",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400094",
abstract = "In 2010, Fan et al. first introduced the concept of
anonymous multi-receiver identity-based encryption
(AMRIBE). They used the concept of Fujisaki Okamoto
transformation (F.O. transformation) to support their
proof in random oracle models. Recently, many works on
this topic have been proposed. Most of them adopted
Fujisaki Okamoto transformation to achieve the
indistinguishability of encryptions under multi-ID,
chosen-ciphertext attacks (IND-MID-CCA) security.
However, we find out that these schemes do not gain
anonymity against insider attacks. In this manuscript,
we use a sequence of games to prove that any AMRIBE
scheme will fail to gain anonymity under
chosen-ciphertext attacks and chosen-plaintext attacks
if the IND-MID-CCA security is proven using Fujisaki
Okamoto transformation.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Turan:2019:CFF,
author = "Furkan Turan and Ingrid Verbauwhede",
title = "Compact and Flexible {FPGA} Implementation of
{Ed25519} and {X25519}",
journal = j-TECS,
volume = "18",
number = "3",
pages = "24:1--24:??",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3312742",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:43 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3312742",
abstract = "This article describes a field-programmable gate array
(FPGA) cryptographic architecture, which combines the
elliptic curve--based Ed25519 digital signature
algorithm and the X25519 key establishment scheme in a
single module. Cryptographically, these are
high-security elliptic curve cryptography algorithms
with short key sizes and impressive execution times in
software. Our goal is to provide a lightweight FPGA
module that enables them on resource-constrained
devices, specifically for Internet of Things (IoT)
applications. In addition, we aim at extensibility with
customisable countermeasures against timing and
differential power analysis side-channel attacks and
fault-injection attacks. For the former, we offer a
choice between time-optimised versus constant-time
execution, with or without Z -coordinate randomisation
and base-point blinding; and for the latter, we offer
enabling or disabling default-case statements in the
Finite State Machine (FSM) descriptions. To obtain
compactness and at the same time fast execution times,
we make maximum use of the Digital Signal Processing
(DSP) slices on the FPGA. We designed a single
arithmetic unit that is flexible to support operations
with two moduli and non-modulus arithmetic. In
addition, our design benefits in-place memory
management and the local storage of inputs into DSP
slices' pipeline registers and takes advantage of
distributed memory. These eliminate a memory access
bottleneck. The flexibility is offered by a micro-code
supported instruction-set architecture. Our design
targets 7-Series Xilinx FPGAs and is prototyped on a
Zynq System-on-Chip (SoC). The base design combining
Ed25519 and X25519 in a single module, and its
implementation requires only around 11.1K Lookup Tables
(LUTs), 2.6K registers, and 16 DSP slices. Also, it
achieves performance of 1.6ms for a signature
generation and 3.6ms for a signature verification for a
1024-bit message with an 82MHz clock. Moreover, the
design can be optimised only for X25519, which gives
the most compact FPGA implementation compared to
previously published X25519 implementations.",
acknowledgement = ack-nhfb,
articleno = "24",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Ueno:2019:TBP,
author = "R. Ueno and M. Suzuki and N. Homma",
title = "Tackling Biased {PUFs} Through Biased Masking: a
Debiasing Method for Efficient Fuzzy Extractor",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "7",
pages = "1091--1104",
month = jul,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2019.2897996",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 11 09:46:20 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "added noise; artificial noise; biased mask; biased
masking; biased physically unclonable functions; biased
PUFs; bit-parallel; BM-based debiasing; BM-based FE;
conventional code-offset FE; conventional
debiasing-based FEs; cryptography; Cryptography;
debiasing; debiasing method; Decoding; efficiency 20.0
percent; efficiency 60.0 percent; efficient fuzzy
extractor design; Entropy; entropy; entropy leak; error
correction codes; Error correction codes; fuzzy
extractor; fuzzy set theory; Generators; Iron;
nonnegligible biases; Physically unclonable function
(PUF); PUF noise; random number generation; random
number generator; Reliability; secure key generation",
}
@Article{Valente:2019:SSA,
author = "J. Valente and M. A. Wynn and A. A. Cardenas",
title = "Stealing, Spying, and Abusing: Consequences of Attacks
on {Internet of Things} Devices",
journal = j-IEEE-SEC-PRIV,
volume = "17",
number = "5",
pages = "10--21",
month = sep # "\slash " # oct,
year = "2019",
DOI = "https://doi.org/10.1109/MSEC.2019.2924167",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Sep 17 17:34:33 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 security;
Cryptography; Drones; Internet of Things; Privacy; Risk
management",
}
@Article{Vazirani:2019:FDI,
author = "Umesh Vazirani and Thomas Vidick",
title = "Fully device independent quantum key distribution",
journal = j-CACM,
volume = "62",
number = "4",
pages = "133--133",
month = apr,
year = "2019",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Mar 30 10:22:08 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://cacm.acm.org/magazines/2019/4/235624/fulltext",
abstract = "Quantum cryptography promises levels of security that
are impossible to attain in a classical world. Can this
security be guaranteed to classical users of a quantum
protocol, who may not even trust the quantum devices
used to implement the protocol? This central question
dates back to the early 1990s when the challenge of
achieving Device-Independent Quantum Key Distribution
(DIQKD) was first formulated. We answer the challenge
by rigorously proving the device-independent security
of an entanglement-based protocol building on Ekert's
original proposal for quantum key distribution. The
proof of security builds on techniques from the
classical theory of pseudo-randomness to achieve a new
quantitative understanding of the non-local nature of
quantum correlations.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Vgena:2019:TAL,
author = "Katerina Vgena and Angeliki Kitsiou and Christos
Kalloniatis and Dimitris Kavroudakis and Stefanos
Gritzalis",
title = "Toward Addressing Location Privacy Issues: New
Affiliations with Social and Location Attributes",
journal = j-FUTURE-INTERNET,
volume = "11",
number = "11",
pages = "234",
day = "01",
month = nov,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi11110234",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:08 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/11/11/234",
abstract = "Nowadays, location-sharing applications (LSA) within
social media enable users to share their location
information at different levels of precision. Users on
their side are willing to disclose this kind of
information in order to represent themselves in a
socially acceptable online way. However, they express
privacy concerns regarding potential malware
location-sharing applications, since users' geolocation
information can provide affiliations with their social
identity attributes that enable the specification of
their behavioral normativity, leading to sensitive
information disclosure and privacy leaks. This paper,
after a systematic review on previous social and
privacy location research, explores the overlapping of
these fields in identifying users' social attributes
through examining location attributes while online, and
proposes a targeted set of location privacy attributes
related to users' socio-spatial characteristics within
social media.",
acknowledgement = ack-nhfb,
remark = "Collection Featured Reviews of Future Internet
Research.",
}
@Article{Vijayarajan:2019:BKB,
author = "R. Vijayarajan and P. Gnanasivam and R. Avudaiammal",
title = "Bio-Key Based {AES} for Personalized Image
Cryptography",
journal = j-COMP-J,
volume = "62",
number = "11",
pages = "1695--1705",
month = nov,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz030",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Nov 30 05:41:04 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/11/1695/5436925",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Vo:2019:ISA,
author = "Tri Hoang Vo and Woldemar Fuhrmann and Klaus-Peter
Fischer-Hellmann and Steven Furnell",
title = "Identity-as-a-Service: An Adaptive Security
Infrastructure and Privacy-Preserving User Identity for
the Cloud Environment",
journal = j-FUTURE-INTERNET,
volume = "11",
number = "5",
pages = "116",
day = "15",
month = may,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi11050116",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:06 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/11/5/116",
abstract = "In recent years, enterprise applications have begun to
migrate from a local hosting to a cloud provider and
may have established a business-to-business
relationship with each other manually. Adaptation of
existing applications requires substantial
implementation changes in individual architectural
components. On the other hand, users may store their
Personal Identifiable Information (PII) in the cloud
environment so that cloud services may access and use
it on demand. Even if cloud services specify their
privacy policies, we cannot guarantee that they follow
their policies and will not (accidentally) transfer PII
to another party. In this paper, we present
Identity-as-a-Service (IDaaS) as a trusted Identity and
Access Management with two requirements: Firstly, IDaaS
adapts trust between cloud services on demand. We move
the trust relationship and identity propagation out of
the application implementation and model them as a
security topology. When the business comes up with a
new e-commerce scenario, IDaaS uses the security
topology to adapt a platform-specific security
infrastructure for the given business scenario at
runtime. Secondly, we protect the confidentiality of
PII in federated security domains. We propose our
Purpose-based Encryption to protect the disclosure of
PII from intermediary entities in a business
transaction and from untrusted hosts. Our solution is
compliant with the General Data Protection Regulation
and involves the least user interaction to prevent
identity theft via the human link. The implementation
can be easily adapted to existing Identity Management
systems, and the performance is fast.",
acknowledgement = ack-nhfb,
remark = "Special Issue Security and Privacy in Information and
Communication Systems.",
}
@Article{Voris:2019:AAU,
author = "Jonathan Voris and Yingbo Song and Malek {Ben Salem}
and Shlomo Hershkop and Salvatore Stolfo",
title = "Active authentication using file system decoys and
user behavior modeling: results of a large scale
study",
journal = j-COMPUT-SECUR,
volume = "87",
number = "??",
pages = "Article 101412",
month = nov,
year = "2019",
CODEN = "CPSEDU",
DOI = "https://doi.org/10.1016/j.cose.2018.07.021",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Sat Jan 22 15:25:37 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818311258",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Voulgaris:2019:BTI,
author = "Spyros Voulgaris and Nikos Fotiou and Vasilios A.
Siris and George C. Polyzos and Mikael Jaatinen and
Yannis Oikonomidis",
title = "Blockchain Technology for Intelligent Environments",
journal = j-FUTURE-INTERNET,
volume = "11",
number = "10",
pages = "213",
day = "11",
month = oct,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi11100213",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:08 MST 2019",
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/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/11/10/213",
abstract = "In the last few years, we have been witnessing the
convergence of the physical with the digital world. The
Internet of Things (IoT) is progressing at a fast pace,
and IoT devices are becoming pervasive in our physical
environments, bringing the vision of Intelligent
Environments closer to reality. At the same time, the
newly-introduced blockchain technology is offering for
the first time ever cryptographically proven trust
based on a set of mutually untrusted nodes. Blockchain
technology thus has the potential to become a key
component of many IoT systems, offering them an
unprecedented level of accountability, transparency,
and reliability. This paper first lays out the
principles on which blockchain systems are operating,
along with descriptions of the most noteworthy
blockchain implementations. It then presents a number
of systems through which blockchains may interact with
external systems and third-party data sources. Finally,
it provides a survey of the state-of-the-art
blockchain-based systems targeting IoT applications.",
acknowledgement = ack-nhfb,
remark = "Collection Featured Reviews of Future Internet
Research.",
}
@Article{Wang:2019:CPB,
author = "Licheng Wang and Xiaoying Shen and Jing Li and Jun
Shao and Yixian Yang",
title = "Cryptographic primitives in blockchains",
journal = j-J-NETW-COMPUT-APPL,
volume = "127",
number = "??",
pages = "43--58",
day = "1",
month = feb,
year = "2019",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:29 MDT 2019",
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/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S108480451830362X",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Wang:2019:CSS,
author = "Xu An Wang and Fatos Xhafa and Jianfeng Ma and Zhiheng
Zheng",
title = "Controlled secure social cloud data sharing based on a
novel identity based proxy re-encryption plus scheme",
journal = j-J-PAR-DIST-COMP,
volume = "130",
number = "??",
pages = "153--165",
month = aug,
year = "2019",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2019.03.018",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Mon May 20 18:06:40 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731519302345",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Wang:2019:FTSa,
author = "Leimin Wang and Tiandu Dong and Ming-Feng Ge",
title = "Finite-time synchronization of memristor chaotic
systems and its application in image encryption",
journal = j-APPL-MATH-COMP,
volume = "347",
number = "??",
pages = "293--305",
day = "15",
month = apr,
year = "2019",
CODEN = "AMHCBQ",
DOI = "https://doi.org/10.1016/j.amc.2018.11.017",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Dec 21 17:54:09 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2015.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300318309901",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Wang:2019:IFT,
author = "Gaoli Wang and Zhenfu Cao and Xiaolei Dong",
title = "Improved Fault-Tolerant Aggregate Signatures",
journal = j-COMP-J,
volume = "62",
number = "4",
pages = "481--489",
month = apr,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy108",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Apr 2 12:10:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/4/481/5139676",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Wang:2019:MBN,
author = "Qian Wang and Chenhui Jin",
title = "A Method to Bound the Number of Active {S}-Boxes for a
Kind of {AES}-Like Structure",
journal = j-COMP-J,
volume = "62",
number = "8",
pages = "1121--1131",
month = aug,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxz006",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Aug 19 07:31:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/8/1121/5319150",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Wang:2019:NTB,
author = "Chen Wang and Lu Xiao and Jian Shen and Rui Huang",
title = "Neighborhood trustworthiness-based vehicle-to-vehicle
authentication scheme for vehicular ad hoc networks",
journal = j-CCPE,
volume = "31",
number = "21",
pages = "e4643:1--e4643:??",
day = "10",
month = nov,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4643",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Wed Mar 31 07:52:09 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "25 May 2018",
}
@Article{Wang:2019:RSI,
author = "Ping Wang and Xing He and Yushu Zhang and Wenying Wen
and Ming Li",
title = "A robust and secure image sharing scheme with personal
identity information embedded",
journal = j-COMPUT-SECUR,
volume = "85",
number = "??",
pages = "107--121",
month = aug,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:47:01 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404819300914",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Wang:2019:SFE,
author = "Xiaofen Wang and Hong-Ning Dai and Ke Zhang",
title = "Secure and flexible economic data sharing protocol
based on {ID}-based dynamic exclusive broadcast
encryption in economic system",
journal = j-FUT-GEN-COMP-SYS,
volume = "99",
number = "??",
pages = "177--185",
month = oct,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18316145",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Wazid:2019:DSK,
author = "Mohammad Wazid and Ashok Kumar Das and Neeraj Kumar
and Athanasios V. Vasilakos",
title = "Design of secure key management and user
authentication scheme for fog computing services",
journal = j-FUT-GEN-COMP-SYS,
volume = "91",
number = "??",
pages = "475--492",
month = feb,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Feb 5 08:15:51 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X18303959",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Wei:2019:VFA,
author = "Shih-En Wei and Jason Saragih and Tomas Simon and Adam
W. Harley and Stephen Lombardi and Michal Perdoch and
Alexander Hypes and Dawei Wang and Hernan Badino and
Yaser Sheikh",
title = "{VR} facial animation via multiview image
translation",
journal = j-TOG,
volume = "38",
number = "4",
pages = "67:1--67:??",
month = jul,
year = "2019",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/3306346.3323030",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Tue Oct 22 12:28:16 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
abstract = "A key promise of Virtual Reality (VR) is the
possibility of remote social interaction that is more
immersive than any prior telecommunication media.
However, existing social VR experiences are mediated by
inauthentic digital representations of the user (i.e.,
stylized avatars). These stylized representations have
limited the adoption of social VR applications in
precisely those cases where immersion is most necessary
(e.g., professional interactions and intimate
conversations). In this work, we present a
bidirectional system that can animate avatar heads of
both users' full likeness using consumer-friendly
headset mounted cameras (HMC). There are two main
challenges in doing this: unaccommodating camera views
and the image-to-avatar domain gap. We address both
challenges by leveraging constraints imposed by
multiview geometry to establish precise image-to-avatar
correspondence, which are then used to learn an
end-to-end model for real-time tracking. We present
designs for a training HMC, aimed at data-collection
and model building, and a tracking HMC for use during
interactions in VR. Correspondence between the avatar
and the HMC-acquired images are automatically found
through self-supervised multiview image translation,
which does not require manual annotation or one-to-one
correspondence between domains. We evaluate the system
on a variety of users and demonstrate significant
improvements over prior work.",
acknowledgement = ack-nhfb,
articleno = "67",
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@Article{Woo:2019:UEM,
author = "Simon S. Woo and Ron Artstein and Elsi Kaiser and Xiao
Le and Jelena Mirkovic",
title = "Using Episodic Memory for User Authentication",
journal = j-TOPS,
volume = "22",
number = "2",
pages = "11:1--11:??",
month = apr,
year = "2019",
DOI = "https://doi.org/10.1145/3308992",
ISSN = "2471-2566 (print), 2471-2574 (electronic)",
bibdate = "Sat Sep 21 08:26:25 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tops.bib",
URL = "https://dl.acm.org/citation.cfm?id=3308992",
abstract = "Passwords are widely used for user authentication, but
they are often difficult for a user to recall, easily
cracked by automated programs, and heavily reused.
Security questions are also used for secondary
authentication. They are more memorable than passwords,
because the question serves as a hint to the user, but
they are very easily guessed. We propose a new
authentication mechanism, called ``life-experience
passwords (LEPs).'' Sitting somewhere between passwords
and security questions, an LEP consists of several
facts about a user-chosen life event-such as a trip, a
graduation, a wedding, and so on. At LEP creation, the
system extracts these facts from the user's input and
transforms them into questions and answers. At
authentication, the system prompts the user with
questions and matches the answers with the stored ones.
We show that question choice and design make LEPs much
more secure than security questions and passwords,
while the question-answer format promotes low password
reuse and high recall. Specifically, we find that: (1)
LEPs are 10 9 --10 14 $ \times $ stronger than an
ideal, randomized, eight-character password; (2) LEPs
are up to 3 $ \times $ more memorable than passwords
and on par with security questions; and (3) LEPs are
reused half as often as passwords. While both LEPs and
security questions use personal experiences for
authentication, LEPs use several questions that are
closely tailored to each user. This increases LEP
security against guessing attacks. In our evaluation,
only 0.7\% of LEPs were guessed by casual friends, and
9.5\% by family members or close friends-roughly half
of the security question guessing rate. On the
downside, LEPs take around 5 $ \times $ longer to input
than passwords. So, these qualities make LEPs suitable
for multi-factor authentication at high-value servers,
such as financial or sensitive work servers, where
stronger authentication strength is needed.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Privacy and Security (TOPS)",
journal-URL = "http://dl.acm.org/citation.cfm?id=J1547",
}
@Article{Woodworth:2019:SSS,
author = "Jason W. Woodworth and Mohsen Amini Salehi",
title = "{S3BD}: Secure semantic search over encrypted big data
in the cloud",
journal = j-CCPE,
volume = "31",
number = "11",
pages = "e5050:1--e5050:??",
day = "10",
month = jun,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.5050",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "11 December 2018",
}
@Article{Wu:2019:PFI,
author = "Libing Wu and Yubo Zhang and Kim-Kwang Raymond Choo
and Debiao He",
title = "Pairing-Free Identity-Based Encryption with Authorized
Equality Test in Online Social Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "647--664",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400185",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400185",
abstract = "Online social networking applications have become more
and more popular in the advance of the technological
age. Much of our personal information has been
disclosed in social networking activities and
privacy-preserving still remains a research challenge
in social network. Public key encryption scheme with
equality test(PKEET), which is an extension of public
key encryption with keyword search (PEKS), seems to be
a solution. PKEET enables the tester to check whether
two given ciphertexts are derived from the same
plaintext. Recently, Zhu et al. proposed a pairing-free
public key encryption scheme with equality test based
on the traditional public key cryptosystem. However, it
suffers from certificates management issue. In this
paper, we propose a pairing-free identity-based
encryption scheme with authorized equality
test(PF-IBEAET). The PF-IBEAET scheme also provides
fine-grained authorizations. We prove that the scheme
is one way secure against chosen identity and chosen
ciphertext attack (OW-ID-CCA) and indistinguishable
against chosen-identity and chosen-ciphertext attack
(IND-ID-CCA) in the random oracle model (ROM).
Performance analysis shows that the scheme achieves a
better performance than similar schemes.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Wu:2019:VFS,
author = "Zhiqiang Wu and Kenli Li",
title = "{VBTree}: forward secure conjunctive queries over
encrypted data for cloud computing",
journal = j-VLDB-J,
volume = "28",
number = "1",
pages = "25--46",
month = feb,
year = "2019",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-018-0517-6",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Tue Feb 5 08:07:20 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/vldbj.bib",
abstract = "This paper concerns the fundamental problem of
processing conjunctive keyword queries over an
outsourced data table on untrusted public clouds in a
privacy-preserving manner. The data table can be
properly implemented with tree-based searchable
symmetric encryption schemes, such as the known Keyword
Red---Black tree and the Indistinguishable Bloom-filter
Tree in ICDE'17. However, as for these trees, there
still exist many limitations to support sub-linear time
updates. One of the reasons is that their tree branches
are directly exposed to the cloud. To achieve efficient
conjunctive queries while supporting dynamic updates,
we introduce a novel tree data structure called virtual
binary tree (VBTree). Our key design is to organize
indexing elements into the VBTree in a top-down
fashion, without storing any tree branches and tree
nodes. The tree only exists in a logical view, and all
of the elements are actually stored in a hash table. To
achieve forward privacy, which is discussed by Bost in
CCS'16, we also propose a storage mechanism called
version control repository (VCR), to record and control
versions of keywords and queries. VCR has a smaller
client-side storage compared to other forward-private
schemes. With our proposed approach, data elements can
be quickly searched while the index can be privately
updated. The security of the VBTree is formally proved
under the IND-CKA2 model. We test our scheme on a real
e-mail dataset and a user location dataset. The testing
results demonstrate its high efficiency and scalability
in both searching and updating processes.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
}
@Article{Xiao:2019:NEA,
author = "C. Xiao and L. Zhang and W. Liu and L. Cheng and P. Li
and Y. Pan and N. Bergmann",
title = "{NV-eCryptfs}: Accelerating Enterprise-Level
Cryptographic File System with Non-Volatile Memory",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "9",
pages = "1338--1352",
month = sep,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2889691",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Aug 30 05:58:40 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Acceleration; asynchronous I/O; Big Data; big data;
cloud computing; cryptography; data block resides; data
transmitting; eCryptfs; Encryption; enterprise-level
cryptographic file system; EXT4; Hardware; hardware
acceleration; hardware accelerators; I-O requests;
lookup operations; noncrypto file system; nonvolatile
memory; Nonvolatile memory; NV-eCryptfs; NVM; NVM
management; parallel cryptographic operations;
Performance evaluation; QAT; Software; software stack;
storage devices; storage management; table lookup;
time-consuming encryption operations",
}
@Article{Xiong:2019:PPH,
author = "Hu Xiong and Yanan Zhao and Li Peng and Hao Zhang and
Kuo-Hui Yeh",
title = "Partially policy-hidden attribute-based broadcast
encryption with secure delegation in edge computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "97",
number = "??",
pages = "453--461",
month = aug,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19300172",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Xu:2019:DAB,
author = "Qian Xu and Chengxiang Tan and Wenye Zhu and Ya Xiao
and Zhijie Fan and Fujia Cheng",
title = "Decentralized attribute-based conjunctive keyword
search scheme with online\slash offline encryption and
outsource decryption for cloud computing",
journal = j-FUT-GEN-COMP-SYS,
volume = "97",
number = "??",
pages = "306--326",
month = aug,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.02.067",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18329613",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Xu:2019:LAM,
author = "Zisang Xu and Cheng Xu and Haixian Chen and Fang
Yang",
title = "A lightweight anonymous mutual authentication and key
agreement scheme for {WBAN}",
journal = j-CCPE,
volume = "31",
number = "14",
pages = "e5295:1--e5295:??",
day = "25",
month = jul,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.5295",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Oct 12 11:00:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "06 May 2019",
}
@Article{Xu:2019:SIC,
author = "Shengmin Xu and Guomin Yang and Yi Mu and Ximeng Liu",
title = "A secure {IoT} cloud storage system with fine-grained
access control and decryption key exposure resistance",
journal = j-FUT-GEN-COMP-SYS,
volume = "97",
number = "??",
pages = "284--294",
month = aug,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18320922",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Xu:2019:TPT,
author = "Lingling Xu and Jin Li and Xiaofeng Chen and Wanhua Li
and Shaohua Tang and Hao-Tian Wu",
title = "{Tc-PEDCKS}: Towards time controlled public key
encryption with delegatable conjunctive keyword search
for {Internet of Things}",
journal = j-J-NETW-COMPUT-APPL,
volume = "128",
number = "??",
pages = "11--20",
day = "15",
month = feb,
year = "2019",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2018.12.003",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:29 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518303850",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Xue:2019:SEA,
author = "Kaiping Xue and Peixuan He and Xiang Zhang and Qiudong
Xia and David S. L. Wei and Hao Yue and Feng Wu",
title = "A Secure, Efficient, and Accountable Edge-Based Access
Control Framework for Information Centric Networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "27",
number = "3",
pages = "1220--1233",
month = jun,
year = "2019",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2019.2914189",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 2 08:29:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Information centric networking ICN has been regarded
as an ideal architecture for the next-generation
network to handle users' increasing demand for content
delivery with in-network cache. While making better use
of network resources and providing better service
delivery, an effective access control mechanism is
needed due to the widely disseminated contents.
However, in the existing solutions, making
cache-enabled routers or content providers authenticate
users' requests causes high computation overhead and
unnecessary delay. Also, the straightforward
utilization of advanced encryption algorithms makes the
system vulnerable to DoS attacks. Besides, privacy
protection and service accountability are rarely taken
into account in this scenario. In this paper, we
propose SEAF, a secure, efficient, and accountable
edge-based access control framework for ICN, in which
authentication is performed at the network edge to
block unauthorized requests at the very beginning. We
adopt group signature to achieve anonymous
authentication and use hash chain technique to reduce
greatly the overhead when users make continuous
requests for the same file. At the same time, we
provide an efficient revocation method to make our
framework more robust. Furthermore, the content
providers can affirm the service amount received from
the network and extract feedback information from the
signatures and hash chains. By formal security analysis
and the comparison with related works, we show that
SEAF achieves the expected security goals and possesses
more useful features. The experimental results also
demonstrate that our design is efficient for routers
and content providers and bring in only slight delay
for users' content retrieval.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Yaacoubi:2019:REM,
author = "Omar Yaacoubi",
title = "The rise of encrypted malware",
journal = j-NETWORK-SECURITY,
volume = "2019",
number = "5",
pages = "6--9",
month = may,
year = "2019",
CODEN = "NTSCF5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Thu Sep 12 12:58:13 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485819300595",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Yan:2019:HDS,
author = "Z. Yan and L. Zhang and W. DING and Q. Zheng",
title = "Heterogeneous Data Storage Management with
Deduplication in Cloud Computing",
journal = j-IEEE-TRANS-BIG-DATA,
volume = "5",
number = "3",
pages = "393--407",
month = sep,
year = "2019",
DOI = "https://doi.org/10.1109/TBDATA.2017.2701352",
ISSN = "2332-7790",
ISSN-L = "2332-7790",
bibdate = "Tue Oct 29 11:08:44 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "access control; Access control; access control;
authorisation; Big data; cloud computing; Cloud
computing; cloud servers; cloud storage; cloud users;
cryptography; Data deduplication; data owners; data
privacy; data sensitivity; data sharing; deduplication
management; encrypted data storage; Encryption;
heterogeneous data storage management; Memory; multiple
Cloud Service Providers; outsourcing; security
analysis; storage management",
}
@Article{Yan:2019:IFF,
author = "Hongyang Yan and Yu Wang and Chunfu Jia and Jin Li and
Yang Xiang and Witold Pedrycz",
title = "{IoT-FBAC}: Function-based access control scheme using
identity-based encryption in {IoT}",
journal = j-FUT-GEN-COMP-SYS,
volume = "95",
number = "??",
pages = "344--353",
month = jun,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2018.12.061",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1830997X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Yang:2019:ISO,
author = "Haining Yang and Jiameng Sun and Jing Qin and Jixin
Ma",
title = "An improved scheme for outsourced computation with
attribute-based encryption",
journal = j-CCPE,
volume = "31",
number = "21",
pages = "e4833:1--e4833:??",
day = "10",
month = nov,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4833",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Wed Mar 31 07:52:09 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "15 October 2018",
}
@Article{Yang:2019:NAK,
author = "Zheng Yang and Junyu Lai and Yingbing Sun and Jianying
Zhou",
title = "A Novel Authenticated Key Agreement Protocol With
Dynamic Credential for {WSNs}",
journal = j-TOSN,
volume = "15",
number = "2",
pages = "22:1--22:??",
month = apr,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3303704",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Wed Oct 2 09:20:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3303704",
abstract = "Public key cryptographic primitive (e.g., the famous
Diffie--Hellman key agreement, or public key
encryption) has recently been used as a standard
building block in authenticated key agreement (AKA)
constructions for wireless sensor networks (WSNs) to
provide perfect forward secrecy (PFS), where the
expensive cryptographic operation (i.e., exponentiation
calculation) is involved. However, realizing such
complex computation on resource-constrained wireless
sensors is inefficient and even impossible on some
devices. In this work, we introduce a new AKA scheme
with PFS for WSNs without using any public key
cryptographic primitive. To achieve PFS, we rely on a
new dynamic one-time authentication credential that is
regularly updated in each session. In particular, each
value of the authentication credential is wisely
associated with at most one session key that enables us
to fulfill the security goal of PFS. Furthermore, the
proposed scheme enables the principals to identify
whether they have been impersonated previously. We
highlight that our scheme can be very efficiently
implemented on sensors since only hash function and XOR
operation are required.",
acknowledgement = ack-nhfb,
articleno = "22",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Yang:2019:NPP,
author = "Xu Yang and Xun Yi and Ibrahim Khalil and Hui Cui and
Xuechao Yang and Surya Nepal and Xinyi Huang and Yali
Zeng",
title = "A new privacy-preserving authentication protocol for
anonymous web browsing",
journal = j-CCPE,
volume = "31",
number = "21",
pages = "e4706:1--e4706:??",
day = "10",
month = nov,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4706",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Wed Mar 31 07:52:09 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "05 September 2018",
}
@Article{Yang:2019:SCC,
author = "Haomiao Yang and Xiaofen Wang and Chun Yang and Xin
Cong and You Zhang",
title = "Securing content-centric networks with content-based
encryption",
journal = j-J-NETW-COMPUT-APPL,
volume = "128",
number = "??",
pages = "21--32",
day = "15",
month = feb,
year = "2019",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:29 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518303874",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Yao:2019:ACC,
author = "Zhongyuan Yao and Yi Mu",
title = "{ACE} with Compact Ciphertext Size and Decentralized
Sanitizers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "531--549",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400112",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400112",
abstract = "We present an access control encryption (ACE) scheme
which enjoys advantages over previous works in several
aspects. Our scheme ensures not only compact ciphertext
size but also small size of keys installed in each user
in the ACE system. Besides, to the best of our
knowledge, our scheme is the first implementation of
ACE with decentralized sanitizers. Comparing to ACE
constructions with only one sanitizer, our scheme is
more secure and reliable since it does not suffer from
the single point failure. Considering the security of
our scheme, we present two models catering to the
no-read rule and no-write rule security requirements
respectively. Additionally, our extended no-write rule
model allows the corruption of some sanitizers in the
ACE system and thus is stronger than the one for
schemes with only one sanitizer. We prove the security
of our scheme under the two models.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Yao:2019:CTC,
author = "Fan Yao and Milo{\v{s}} Doroslova{\v{c}}ki and Guru
Venkataramani",
title = "Covert Timing Channels Exploiting Cache Coherence
Hardware: Characterization and Defense",
journal = j-INT-J-PARALLEL-PROG,
volume = "47",
number = "4",
pages = "595--620",
month = aug,
year = "2019",
CODEN = "IJPPE5",
DOI = "https://doi.org/10.1007/s10766-018-0608-4",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
ISSN-L = "0885-7458",
bibdate = "Fri Oct 11 08:37:52 MDT 2019",
bibsource = "http://link.springer.com/journal/10766/47/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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{Yao:2019:RSA,
author = "Jiaying Yao and Zhigeng Han and Muhammad Sohail and
Liangmin Wang",
title = "A Robust Security Architecture for {SDN}-Based {5G}
Networks",
journal = j-FUTURE-INTERNET,
volume = "11",
number = "4",
pages = "85",
day = "28",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi11040085",
ISSN = "1999-5903",
bibdate = "Thu Nov 21 16:51:05 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/11/4/85",
abstract = "5G is the latest generation of cellular mobile
communications. Due to its significant advantage in
high data rate, reduced latency and massive device
connectivity, the 5G network plays a vital role in
today's commercial telecommunications networks.
However, the 5G network also faces some challenges when
used in practice. This is because it consists of
various diverse ingredients, termed heterogeneity. The
heterogeneity of the 5G network has two consequences:
first, it prevents us to use this technology in a
uniform way, preventing the wide use of 5G technology;
second, it complicates the structure of the 5G network,
making it hard to monitor what is going on in a 5G
network. To break through this limitation, researchers
have worked in this field and design their own
protocol, in which software-defined networking (SDN) is
one key design concept. By separating control and data
plane, SDN can make the 5G network functional and
programmable, such that we can handle the heterogeneity
in traditional 5G networks. In light of this, we say
that SDN-5G network is attractive, but its advantages
are not free. The intelligence centralization used in
SDN has its own drawbacks when it comes to security. To
break through this limitation, we propose a robust
security architecture for SDN-based 5G Networks. To
find the illegal request from malicious attackers, we
add extra cryptographic authentication, termed
synchronize secret. The basic idea of our scheme is
leveraging preload secrets to differ attacks from
regular network communications. The simulation results
indicate that our work can completely handle the
security problem from SDN with a low disconnect rate of
0.01\%, which is much better than that from state of
the art.",
acknowledgement = ack-nhfb,
remark = "Special Issue Software Defined Networking (SDN) and
Network Function Virtualization (NFV).",
}
@Article{Ye:2019:NCA,
author = "T. Ye and Y. Wei and W. Meier",
title = "A New Cube Attack on {MORUS} by Using Division
Property",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "12",
pages = "1731--1740",
month = dec,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2019.2929137",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Nov 7 11:20:24 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Authenticated encryption algorithm; Boolean functions;
cube attack; division property; Encryption; mixed
integer linear programming; MORUS; Software algorithms;
Time complexity; time complexity",
}
@Article{Yin:2019:SCM,
author = "Hui Yin and Zheng Qin and Jixin Zhang and Lu Ou and
Fangmin Li and Keqin Li",
title = "Secure conjunctive multi-keyword ranked search over
encrypted cloud data for multiple data owners",
journal = j-FUT-GEN-COMP-SYS,
volume = "100",
number = "??",
pages = "689--700",
month = nov,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.05.001",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:01 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17321192",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Ying:2019:LRU,
author = "Bidi Ying and Amiya Nayak",
title = "Lightweight remote user authentication protocol for
multi-server {$5$G} networks using self-certified
public key cryptography",
journal = j-J-NETW-COMPUT-APPL,
volume = "131",
number = "??",
pages = "66--74",
day = "1",
month = apr,
year = "2019",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:30 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804519300256",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Yu:2019:PSI,
author = "Yong Yu and Guomin Yang and Huaxiong Wang",
title = "Preface: Special Issue Cryptography and Provable
Security",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "489--492",
month = jun,
year = "2019",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054119020027",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119020027",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Zajac:2019:HEM,
author = "Pavol Zajac",
title = "Hybrid Encryption from {McEliece} Cryptosystem with
Pseudo-random Error Vector",
journal = j-FUND-INFO,
volume = "169",
number = "4",
pages = "345--360",
month = "????",
year = "2019",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2019-1851",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Wed Mar 24 12:51:47 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Zanon:2019:FKC,
author = "G. H. M. Zanon and M. A. Simplicio and G. C. C. F.
Pereira and J. Doliskani and P. S. L. M. Barreto",
title = "Faster Key Compression for Isogeny-Based
Cryptosystems",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "5",
pages = "688--701",
month = may,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2878829",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 11 09:46:20 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "decompression; Diffie-Hellman key exchange; Elliptic
curve cryptography; elliptic curve cryptography;
Elliptic curves; Generators; isogeny-based
cryptosystems; key compression; Libraries;
Pohlig-Hellman algorithm; Post-quantum cryptography;
post-quantum proposals; public-key compression; quantum
cryptography; Runtime; supersingular elliptic curves;
supersingular isogeny-based cryptography",
}
@Article{Zeng:2019:PKE,
author = "Ming Zeng and Jie Chen and Kai Zhang and Haifeng
Qian",
title = "Public key encryption with equality test via hash
proof system",
journal = j-THEOR-COMP-SCI,
volume = "795",
number = "??",
pages = "20--35",
day = "26",
month = nov,
year = "2019",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Oct 16 07:39:37 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397519303822",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Zeng:2019:SAE,
author = "Ming Zeng and Kai Zhang and Haifeng Qian and Xiaofeng
Chen and Jie Chen",
title = "A Searchable Asymmetric Encryption Scheme with Support
for {Boolean} Queries for Cloud Applications",
journal = j-COMP-J,
volume = "62",
number = "4",
pages = "563--578",
month = apr,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy134",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Apr 2 12:10:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/4/563/5253754",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Zhang:2019:CCF,
author = "X. Zhang and Y. Lao",
title = "On the Construction of Composite Finite Fields for
Hardware Obfuscation",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "9",
pages = "1353--1364",
month = sep,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2019.2901483",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Aug 30 05:58:40 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "algorithmic modifications; architectural level;
circuit-level techniques; composite finite fields;
Composite finite fields; Computer architecture;
cryptography; Cryptography; cryptography algorithms;
data paths; Decoding; error correction codes;
error-correcting codes; error-correcting coding; Finite
element analysis; finite field arithmetic; finite field
constructions; Hardware; hardware obfuscation; hardware
obfuscation scheme; independent obfuscation key; Logic
gates; primitive element representations; Reed-Solomon
codes; Signal processing algorithms",
}
@Article{Zhang:2019:EPK,
author = "Kai Zhang and Jie Chen and Hyung Tae Lee and Haifeng
Qian and Huaxiong Wang",
title = "Efficient public key encryption with equality test in
the standard model",
journal = j-THEOR-COMP-SCI,
volume = "755",
number = "??",
pages = "65--80",
day = "10",
month = jan,
year = "2019",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2018.06.048",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Dec 26 06:11:40 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S030439751830464X",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Zhang:2019:LAS,
author = "Liping Zhang and Lanchao Zhao and Shuijun Yin and
Chi-Hung Chi and Ran Liu and Yixin Zhang",
title = "A lightweight authentication scheme with privacy
protection for smart grid communications",
journal = j-FUT-GEN-COMP-SYS,
volume = "100",
number = "??",
pages = "770--778",
month = nov,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.05.069",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:01 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19310398",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Zhang:2019:LRH,
author = "Yinghui Zhang and Menglei Yang and Dong Zheng and
Tiantian Zhang and Rui Guo and Fang Ren",
title = "Leakage-Resilient Hierarchical Identity-Based
Encryption with Recipient Anonymity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "5",
pages = "665--681",
month = aug,
year = "2019",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054119400197",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.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/S0129054119400197",
abstract = "As a promising public key cryptographic primitive,
hierarchical identity-based encryption (HIBE)
introduces key delegation mechanisms into
identity-based encryption. However, key leakage and
recipient anonymity issues have not been adequately
addressed in HIBE. Hence, direct applications of
traditional HIBE schemes will violate data security and
abuse users privacy in practice. In this paper, we
propose an anonymous unbounded hierarchical
identity-based encryption scheme, which achieves
bounded leakage resilience and the hierarchy depth is
not limited. Our security proofs based on the dual
system encryption technique show that the proposed
scheme is capable of resisting key leakage and it
realizes recipient anonymity in the standard model. In
addition, leakage resilience analysis indicates that
our scheme allows the leakage rate of approximate 1/3
no matter the hierarchy depth of identities. Finally,
performance comparisons show the practicability of our
scheme. In particular, the secret key of our
construction is of a fixed-length.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:2019:MAA,
author = "Xiao Zhang and Faguo Wu and Wang Yao and Zhao Wang and
Wenhua Wang",
title = "Multi-authority attribute-based encryption scheme with
constant-size ciphertexts and user revocation",
journal = j-CCPE,
volume = "31",
number = "21",
pages = "e4678:1--e4678:??",
day = "10",
month = nov,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4678",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Wed Mar 31 07:52:09 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "05 September 2018",
}
@Article{Zhang:2019:REU,
author = "Jun Zhang and Rui Hou and Wei Song and Sally A. Mckee
and Zhen Jia and Chen Zheng and Mingyu Chen and Lixin
Zhang and Dan Meng",
title = "{RAGuard}: an Efficient and User-Transparent Hardware
Mechanism against {ROP} Attacks",
journal = j-TACO,
volume = "15",
number = "4",
pages = "50:1--50:??",
month = jan,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3280852",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Tue Jan 8 17:20:00 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3280852",
abstract = "Control-flow integrity (CFI) is a general method for
preventing code-reuse attacks, which utilize benign
code sequences to achieve arbitrary code execution. CFI
ensures that the execution of a program follows the
edges of its predefined static Control-Flow Graph: any
deviation that constitutes a CFI violation terminates
the application. Despite decades of research effort,
there are still several implementation challenges in
efficiently protecting the control flow of function
returns (Return-Oriented Programming attacks). The set
of valid return addresses of frequently called
functions can be large and thus an attacker could bend
the backward-edge CFI by modifying an indirect branch
target to another within the valid return set. This
article proposes RAGuard, an efficient and
user-transparent hardware-based approach to prevent
Return-Oriented Programming attacks. RAGuard binds a
message authentication code (MAC) to each return
address to protect its integrity. To guarantee the
security of the MAC and reduce runtime overhead:
RAGuard (1) computes the MAC by encrypting the
signature of a return address with AES-128, (2)
develops a key management module based on a Physical
Unclonable Function (PUF) and a True Random Number
Generator (TRNG), and (3) uses a dedicated register to
reduce MACs' load and store operations of leaf
functions. We have evaluated our mechanism based on the
open-source LEON3 processor and the results show that
RAGuard incurs acceptable performance overhead and
occupies reasonable area.",
acknowledgement = ack-nhfb,
articleno = "50",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Zhang:2019:SPB,
author = "Rui Zhang and Rui Xue and Ling Liu",
title = "Security and Privacy on Blockchain",
journal = j-COMP-SURV,
volume = "52",
number = "3",
pages = "51:1--51:??",
month = jul,
year = "2019",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3316481",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Aug 31 09:04:37 MDT 2019",
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/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3316481",
abstract = "Blockchain offers an innovative approach to storing
information, executing transactions, performing
functions, and establishing trust in an open
environment. Many consider blockchain as a technology
breakthrough for cryptography and cybersecurity, with
use cases ranging from globally deployed cryptocurrency
systems like Bitcoin, to smart contracts, smart grids
over the Internet of Things, and so forth. Although
blockchain has received growing interests in both
academia and industry in the recent years, the security
and privacy of blockchains continue to be at the center
of the debate when deploying blockchain in different
applications. This article presents a comprehensive
overview of the security and privacy of blockchain. To
facilitate the discussion, we first introduce the
notion of blockchains and its utility in the context of
Bitcoin-like online transactions. Then, we describe the
basic security properties that are supported as the
essential requirements and building blocks for
Bitcoin-like cryptocurrency systems, followed by
presenting the additional security and privacy
properties that are desired in many blockchain
applications. Finally, we review the security and
privacy techniques for achieving these security
properties in blockchain-based systems, including
representative consensus algorithms, hash chained
storage, mixing protocols, anonymous signatures,
non-interactive zero-knowledge proof, and so forth. We
conjecture that this survey can help readers to gain an
in-depth understanding of the security and privacy of
blockchain with respect to concept, attributes,
techniques, and systems.",
acknowledgement = ack-nhfb,
articleno = "51",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Zhao:2019:LRC,
author = "Yi Zhao and Yong Yu and Bo Yang",
title = "Leakage Resilient {CCA} Security in Stronger Model:
Branch Hidden {ABO-LTFs} and Their Applications",
journal = j-COMP-J,
volume = "62",
number = "4",
pages = "631--640",
month = apr,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy138",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Apr 2 12:10:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/4/631/5272751",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Zhou:2019:CLR,
author = "Yanwei Zhou and Bo Yang and Hongxia Hou and Lina Zhang
and Tao Wang and Mingxiao Hu",
title = "Continuous Leakage-Resilient Identity-Based Encryption
with Tight Security",
journal = j-COMP-J,
volume = "62",
number = "8",
pages = "1092--1105",
month = aug,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy144",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Aug 19 07:31:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://academic.oup.com/comjnl/article/62/8/1092/5288324",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Zhou:2019:GCC,
author = "Yanwei Zhou and Bo Yang and Yi Mu",
title = "The generic construction of continuous
leakage-resilient identity-based cryptosystems",
journal = j-THEOR-COMP-SCI,
volume = "772",
number = "??",
pages = "1--45",
day = "7",
month = jun,
year = "2019",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2018.11.019",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Jun 15 10:14:20 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397518307096",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Zhou:2019:LCP,
author = "Lu Zhou and Chunhua Su and Kuo-Hui Yeh",
title = "A Lightweight Cryptographic Protocol with
Certificateless Signature for the {Internet of
Things}",
journal = j-TECS,
volume = "18",
number = "3",
pages = "28:1--28:??",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3301306",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:43 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3301306",
abstract = "The universality of smart-devices has brought rapid
development and the significant advancement of
ubiquitous applications for the Internet of Things
(IoT). Designing new types of IoT-compatible
cryptographic protocols has become a more popular way
to secure IoT-based applications. Significant attention
has been dedicated to the challenge of implementing a
lightweight and secure cryptographic protocol for IoT
devices. In this study, we propose a lightweight
cryptographic protocol integrating certificateless
signature and bilinear pairing crypto-primitives. In
the proposed protocol, we elegantly refine the
processes to account for computation-limited IoT
devices during security operations. Rigorous security
analyses are conducted to guarantee the robustness of
the proposed cryptographic protocol. In addition, we
demonstrate a thorough performance evaluation, where an
IoT-based test-bed, i.e., the Raspberry PI, is
simulated as the underlying platform of the
implementation of our proposed cryptographic protocol.
The results show the practicability of the proposed
protocol.",
acknowledgement = ack-nhfb,
articleno = "28",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Zhou:2019:LIB,
author = "Lu Zhou and Xiong Li and Kuo-Hui Yeh and Chunhua Su
and Wayne Chiu",
title = "Lightweight {IoT}-based authentication scheme in cloud
computing circumstance",
journal = j-FUT-GEN-COMP-SYS,
volume = "91",
number = "??",
pages = "244--251",
month = feb,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Feb 5 08:15:51 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167739X18307878",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Zhou:2019:LIN,
author = "Lu Zhou and Chunhua Su and Zhi Hu and Sokjoon Lee and
Hwajeong Seo",
title = "Lightweight Implementations of {NIST} P-256 and {SM2
ECC} on $8$-bit Resource-Constraint Embedded Device",
journal = j-TECS,
volume = "18",
number = "3",
pages = "23:1--23:??",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3236010",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:43 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3236010",
abstract = "Elliptic Curve Cryptography (ECC) now is one of the
most important approach to instantiate asymmetric
encryption and signature schemes, which has been
extensively exploited to protect the security of
cyber-physical systems. With the advent of the Internet
of Things (IoT), a great deal of constrained devices
may require software implementations of ECC operations.
Under this circumstances, the SM2, a set of public key
cryptographic algorithms based on elliptic curves
published by Chinese Commercial Cryptography
Administration Office, was standardized at ISO in 2017
to enhance the cyber-security. However, few research
works on the implementation of SM2 for constrained
devices have been conducted. In this work, we fill this
gap and propose our efficient, secure, and compact
implementation of scalar multiplication on a 256-bit
elliptic curve recommended by the SM2, as well as a
comparison implementation of scalar multiplication on
the same bit-length elliptic curve recommended by NIST.
We re-design some existent techniques to fit the
low-end IoT platform, namely 8-bit AVR processors, and
our implementations evaluated on the desired platform
show that the SM2 algorithms have competitive
efficiency and security with NIST, which would work
well to secure the IoT world.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Zhou:2019:SAN,
author = "Lu Zhou and Jiageng Chen and Yidan Zhang and Chunhua
Su and Marino Anthony James",
title = "Security analysis and new models on the intelligent
symmetric key encryption",
journal = j-COMPUT-SECUR,
volume = "80",
number = "??",
pages = "14--24",
month = jan,
year = "2019",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:58 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404818309647",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@Article{Zhu:2019:ICR,
author = "Youwen Zhu and Yue Zhang and Xingxin Li and Hongyang
Yan and Jing Li",
title = "Improved collusion-resisting secure nearest neighbor
query over encrypted data in cloud",
journal = j-CCPE,
volume = "31",
number = "21",
pages = "e4681:1--e4681:??",
day = "10",
month = nov,
year = "2019",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4681",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Wed Mar 31 07:52:09 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.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 = "25 May 2018",
}
@Article{Zidaric:2019:HOA,
author = "Nusa Zidaric and Mark Aagaard and Guang Gong",
title = "Hardware Optimizations and Analysis for the {WG-16}
Cipher with Tower Field Arithmetic",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "1",
pages = "67--82",
month = "????",
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2854757",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Dec 26 06:35:11 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "https://ieeexplore.ieee.org/document/8409309/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Zuo:2019:WDH,
author = "P. Zuo and Y. Hua and M. Zhao and W. Zhou and Y. Guo",
title = "Write Deduplication and Hash Mode Encryption for
Secure Nonvolatile Main Memory",
journal = j-IEEE-MICRO,
volume = "39",
number = "1",
pages = "44--51",
month = jan # "\slash " # feb,
year = "2019",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/MM.2018.2886176",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu Mar 21 10:04:13 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.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",
keywords = "encryption; metadata; nonvolatile memory; parallel
processing; system performance",
}
@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{Bana:2020:VMC,
author = "Gergei Bana and Rohit Chadha and Ajay Kumar Eeralla
and Mitsuhiro Okada",
title = "Verification Methods for the Computationally Complete
Symbolic Attacker Based on Indistinguishability",
journal = j-TOCL,
volume = "21",
number = "1",
pages = "2:1--2:44",
month = jan,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3343508",
ISSN = "1529-3785 (print), 1557-945X (electronic)",
ISSN-L = "1529-3785",
bibdate = "Wed Oct 23 06:27:14 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tocl.bib",
abstract = "In recent years, a new approach has been developed for
verifying security protocols with the aim of combining
the benefits of symbolic attackers and the benefits of
unconditional soundness: the technique of the
computationally complete symbolic attacker of Bana and
Comon (BC) [8]. In this article, we argue that the real
breakthrough of this technique is the recent
introduction of its version for indistinguishability
[9], because, with the extensions we introduce here,
for the first time, there is a computationally sound
symbolic technique that is syntactically strikingly
simple, to which translating standard computational
security notions is a straightforward matter, and that
can be effectively used for verification of not only
equivalence properties but trace properties of
protocols as well. We first fully develop the core
elements of this newer version by introducing several
new axioms. We illustrate the power and the diverse use
of the introduced axioms on simple examples first. We
introduce an axiom expressing the Decisional
Diffie--Hellman property. We analyze the
Diffie--Hellman key exchange, both in its simplest form
and an authenticated version as well. We provide
computationally sound verification of real-or-random
secrecy of the Diffie--Hellman key exchange protocol
for multiple sessions, without any restrictions on the
computational implementation other than the DDH
assumption. We also show authentication for a
simplified version of the station-to-station protocol
using UF-CMA assumption for digital signatures.
Finally, we axiomatize IND-CPA, IND-CCA1, and IND-CCA2
security properties and illustrate their usage. We have
formalized the axiomatic system in an interactive
theorem prover, Coq, and have machine-checked the
proofs of various auxiliary theorems and security
properties of Diffie--Hellman and station-to-station
protocol.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Computational Logic",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J773",
}
@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{Chretien:2020:TMF,
author = "R{\'e}my Chr{\'e}tien and V{\'e}ronique Cortier and
Antoine Dallon and St{\'e}phanie Delaune",
title = "Typing Messages for Free in Security Protocols",
journal = j-TOCL,
volume = "21",
number = "1",
pages = "1:1--1:52",
month = jan,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3343507",
ISSN = "1529-3785 (print), 1557-945X (electronic)",
ISSN-L = "1529-3785",
bibdate = "Wed Oct 23 06:27:14 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/tocl.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3343507",
abstract = "Security properties of cryptographic protocols are
typically expressed as reachability or equivalence
properties. Secrecy and authentication are examples of
reachability properties, while privacy properties such
as untraceability, vote secrecy, or anonymity are
generally expressed as behavioral equivalence in a
process algebra that models security protocols. Our
main contribution is to reduce the search space for
attacks for reachability as well as equivalence
properties. Specifically, we show that if there is an
attack then there is one that is well-typed. Our result
holds for a large class of typing systems, a family of
equational theories that encompasses all standard
primitives, and protocols without else branches. For
many standard protocols, we deduce that it is
sufficient to look for attacks that follow the format
of the messages expected in an honest execution,
therefore considerably reducing the search space.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Computational Logic",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J773",
}
@Book{Copeland:2006:CSB,
editor = "B. Jack Copeland",
booktitle = "{Colossus}: the secrets of {Bletchley Park}'s
codebreaking computers",
title = "{Colossus}: the secrets of {Bletchley Park}'s
codebreaking computers",
publisher = pub-OXFORD,
address = pub-OXFORD:adr,
pages = "xvi + 462 + 16",
year = "2006",
ISBN = "0-19-284055-X (hardcover), 0-19-957814-1 (paperback)",
ISBN-13 = "978-0-19-284055-4 (hardcover), 978-0-19-957814-6
(paperback)",
LCCN = "D810.C88 C66 2006",
bibdate = "Tue Jun 26 07:56:07 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
library.ox.ac.uk:210/ADVANCE",
URL = "http://www.colossus-computer.com/",
acknowledgement = ack-nhfb,
subject = "Lorenz cipher system; World War, 1939--1945;
Cryptography; Electronic intelligence; Great Britain;
History; Germany; Computers",
tableofcontents = "A brief history of cryptography from Caesar to
Bletchley Park / Simon Singh \\
How it began: Bletchley Park goes to war / Michael
Smith \\
The German Tunny machine / Jack Copeland \\
Colossus, codebreaking, and the digital age / Stephen
Budiansky \\
Machine against machine / Jack Copeland \\
D-Day at Bletchley Park / Thomas H. Flowers \\
Intercept! / Jack Copeland \\
Colossus / Thomas H. Flowers \\
Colossus and the rise of the modern computer / Jack
Copeland \\
The PC user's guide to Colossus / Benjamin Wells \\
Of men and machines / Brian Randell \\
The Colossus rebuild / Tony Sale \\
Mr. Newman's section / Jack Copeland, with Catherine
Caughey \ldots{} [et al.] \\
Max Newman: mathematician, codebreaker, and computer
pioneer / William Newman \\
Living with Fish: breaking Tunny in the Newmanry and
the Testery / Peter Hilton \\
From Hut 8 to the Newmanry / Irving John ``Jack'' Good
\\
Codebreaking and Colossus / Donald Michie \\
Major Tester's section / Jerry Roberts \\
Setter and breaker / Roy Jenkins \\
An ATS girl in the Testery / Helen Currie \\
The Testery and the breaking of Fish / Peter Edgerley
\\
Dollis Hill at war / Jack Copeland, with David Bolam
\ldots{} [et al.] \\
The British Tunny machine / Gil Hayward \\
How Colossus was built and operated: one of its
engineers reveals its secrets / Harry Fensom \\
Bletchley Park's Sturgeon: the Fish that laid no eggs /
Frode Weierud \\
German teleprinter traffic and Swedish wartime
intelligence / Craig McKay",
}
@Proceedings{Abdalla:2010:PCL,
editor = "Michel Abdalla and Paulo S. L. M. Barreto",
booktitle = "{Progress in cryptology --- Latincrypt 2010: first
international conference on cryptology and information
security in Latin America, Puebla, Mexico, August
8--11, 2010, proceedings}",
title = "{Progress in cryptology --- Latincrypt 2010: first
international conference on cryptology and information
security in Latin America, Puebla, Mexico, August
8--11, 2010, proceedings}",
volume = "6212",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2010",
ISBN = "3-642-14711-9 (softcover)",
ISBN-13 = "978-3-642-14711-1 (softcover)",
LCCN = "????",
bibdate = "Mon Jan 10 18:27:32 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Lecture notes in computer science",
acknowledgement = ack-nhfb,
}
@Proceedings{Abe:2010:ACA,
editor = "Masayuki Abe",
booktitle = "{Advances in cryptology --- Asiacrypt 2010: 16th
international conference on the theory and application
of cryptology and information security, Singapore,
December 5--9, 2010. Proceedings}",
title = "{Advances in cryptology --- Asiacrypt 2010: 16th
international conference on the theory and application
of cryptology and information security, Singapore,
December 5--9, 2010. Proceedings}",
volume = "6477",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2010",
ISBN = "3-642-17372-1 (softcover)",
ISBN-13 = "978-3-642-17372-1 (softcover)",
LCCN = "????",
bibdate = "Mon Jan 10 18:24:44 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Lecture notes in computer science",
acknowledgement = ack-nhfb,
}
@Proceedings{ACM:2010:PAI,
editor = "{ACM}",
booktitle = "{Proceedings of the 2010 ACM International Symposium
on Theory of Computing: June 5--8, 2010, Cambridge, MA,
USA}",
title = "{Proceedings of the 2010 ACM International Symposium
on Theory of Computing: June 5--8, 2010, Cambridge, MA,
USA}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xiv + 797",
year = "2010",
ISBN = "1-60558-817-2",
ISBN-13 = "978-1-60558-817-9",
LCCN = "QA 76.6 .A152 2010",
bibdate = "Wed Sep 1 10:37:53 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.gbv.de:20011/gvk",
URL = "http://www.gbv.de/dms/tib-ub-hannover/63314455x.",
acknowledgement = ack-nhfb,
remark = "42nd annual STOC meeting.",
}
@Proceedings{Anonymous:2010:NDS,
editor = "Anonymous",
booktitle = "{17th Annual Network and Distributed System Symposium,
NDSS '10, The Dana on Misson Bay, San Diego,
California. February 28--March 3, 2010}",
title = "{17th Annual Network and Distributed System Symposium,
NDSS '10, The Dana on Misson Bay, San Diego,
California. February 28--March 3, 2010}",
publisher = "Internet Society",
address = "Reston, VA, USA",
pages = "????",
year = "2010",
ISBN = "1-891562-29-0, 1-891562-30-4",
ISBN-13 = "978-1-891562-29-7, 978-1-891562-30-3",
LCCN = "????",
bibdate = "Fri Mar 13 09:39:28 MDT 2015",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://www.isoc.org/isoc/conferences/ndss/10/proceedings.shtml",
acknowledgement = ack-nhfb,
}
@Book{Atallah:2010:ATC,
editor = "Mikhail J. Atallah and Marina Blanton",
booktitle = "Algorithms and theory of computation handbook. Special
topics and techniques",
title = "Algorithms and theory of computation handbook. Special
topics and techniques",
volume = "2",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
edition = "Second",
pages = "????",
year = "2010",
ISBN = "1-58488-820-2",
ISBN-13 = "978-1-58488-820-8",
LCCN = "QA76.9.A43 A433 2010",
bibdate = "Sat May 14 09:19:32 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Chapman and Hall/CRC applied algorithms and data
structures series",
URL = "http://www.crcnetbase.com/isbn/9781584888208",
acknowledgement = ack-nhfb,
subject = "computer algorithms; computer science; computational
complexity",
tableofcontents = "I. Front Matter Chapter 1. Computational Geometry I
/ D. T. Lee \\
Chapter 2. Computational Geometry II / D. T. Lee \\
Chapter 3. Computational Topology / Afra Zomorodian \\
Chapter 4. Robot Algorithms / Konstantinos Tsianos, Dan
Halperin, Lydia Kavraki, Jean-Claude Latombe \\
Chapter 5. Vision and Image Processing Algorithms /
Concettina Guerra \\
Chapter 6. Graph Drawing Algorithms / Peter Eades,
Carsten Gutwenger, Seok-Hee Hong, Petra Mutzel \\
Chapter 7. Algorithmics in Intensity-Modulated
Radiation Therapy / Danny Z. Chen, Chao Wang \\
Chapter 8. VLSI Layout Algorithms / Andrea S. LaPaugh
\\
Chapter 9. Cryptographic Foundations / Yvo Desmedt \\
Chapter 10. Encryption Schemes / Yvo Desmedt \\
Chapter 11. Cryptanalysis / Samuel S. Wagstaff, Jr. \\
Chapter 12. Crypto Topics and Applications I / Jennifer
Seberry, Chris Charnes, Josef Pieprzyk, Rei
Safavi-Naini \\
Chapter 13. Crypto Topics and Applications II /
Jennifer Seberry, Chris Charnes, Josef Pieprzyk, Rei
Safavi-Naini \\
Chapter 14. Secure Multiparty Computation / Keith B.
Frikken \\
Chapter 15. Voting Schemes / Berry Schoenmakers \\
Chapter 16. Auction Protocols / Vincent Conitzer \\
Chapter 17. Pseudorandom Sequences and Stream Ciphers /
Andrew Klapper \\
Chapter 18. Theory of Privacy and Anonymity / Valentina
Ciriani, Sabrina De Capitani di Vimercati, Sara
Foresti, Pierangela Samarati \\
Chapter 19. Database Theory / Nicole Schweikardt,
Thomas Schwentick, Luc Segoufin \\
Chapter 20. Scheduling Algorithms / David Karger, Cliff
Stein, Joel Wein \\
Chapter 21. Computational Game Theory / Paul G.
Spirakis, Panagiota N. Panagopoulou \\
Chapter 22. Arti cial Intelligence Search Algorithms /
Richard E. Korf \\
Chapter 23. Algorithmic Aspects of Natural Language
Processing / Mark-Jan Nederhof, Giorgio Satta \\
Chapter 24. Algorithmic Techniques for Regular Networks
of Processors / Russ Miller, Quentin F. Stout \\
Chapter 25. Parallel Algorithms / Guy E. Blelloch,
Bruce M. Maggs \\
Chapter 26. Self-Stabilizing Algorithms / S{\'e}bastien
Tixeuil \\
Chapter 27. Theory of Communication Networks / Gopal
Pandurangan, Maleq Khan \\
Chapter 28. Network Algorithmics / George Varghese \\
Chapter 29. Algorithmic Issues in Grid Computing / Yves
Robert, Fr{\'e}d{\'e}ric Vivien \\
Chapter 30. Uncheatable Grid Computing / Wenliang Du,
Mummoorthy Murugesan, Jing Jia \\
Chapter 31. DNA Computing / Lila Kari, Kalpana
Mahalingam \\
Chapter 32. Computational Systems Biology / T. M.
Murali, Srinivas Aluru \\
Chapter 33. Pricing Algorithms for Financial
Derivatives / Ruppa K. Thulasiram, Parimala
Thulasiraman",
}
@Proceedings{Bao:2010:ISC,
editor = "Feng Bao and Moti Yung and Dongdai Lin",
booktitle = "{Information security and cryptology: 5th
international conference, INSCRYPT 2009, Beijing,
China, December 12--15, 2009. revised selected
papers}",
title = "{Information security and cryptology: 5th
international conference, INSCRYPT 2009, Beijing,
China, December 12--15, 2009. revised selected
papers}",
volume = "6151",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2010",
ISBN = "3-642-16341-6 (softcover)",
ISBN-13 = "978-3-642-16341-8 (softcover)",
LCCN = "????",
bibdate = "Mon Jan 10 18:26:08 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Lecture notes in computer science",
acknowledgement = ack-nhfb,
}
@Proceedings{Bernstein:2010:PCA,
editor = "Daniel J. Bernstein and Tanja Lange",
booktitle = "{Progress in cryptology --- Africacrypt 2010: third
international conference on cryptology in Africa,
Stellenbosch, South Africa, May 3--6, 2010.
proceedings}",
title = "{Progress in cryptology --- Africacrypt 2010: third
international conference on cryptology in Africa,
Stellenbosch, South Africa, May 3--6, 2010.
proceedings}",
volume = "6055",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2010",
ISBN = "3-642-12677-4 (softcover)",
ISBN-13 = "978-3-642-12677-2 (softcover)",
LCCN = "????",
bibdate = "Mon Jan 10 18:26:50 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Lecture notes in computer science",
acknowledgement = ack-nhfb,
}
@Proceedings{Chaudhuri:2010:PIC,
editor = "Pranay Chaudhuri and Sukumar Ghosh and Raj Kumar Buyya
and Jian-Nong Cao and Oeepak Oahiya",
booktitle = "{Proceedings of the 2010 1st International Conference
on Parallel Distributed and Grid Computing (PDGC),
Jaypee University of Information Technology Waknaghat,
Solan, HP, India, 28--30 October, 2010}",
title = "{Proceedings of the 2010 1st International Conference
on Parallel Distributed and Grid Computing (PDGC),
Jaypee University of Information Technology Waknaghat,
Solan, HP, India, 28--30 October, 2010}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
bookpages = "xiii + 382",
pages = "xiii + 382",
year = "2010",
ISBN = "1-4244-7675-5",
ISBN-13 = "978-1-4244-7675-6",
LCCN = "????",
bibdate = "Thu Apr 21 10:51:00 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Book{Copeland:2010:CSB,
editor = "B. Jack Copeland",
booktitle = "{Colossus}: the secrets of {Bletchley Park}'s
codebreaking computers",
title = "{Colossus}: the secrets of {Bletchley Park}'s
codebreaking computers",
publisher = pub-OXFORD,
address = pub-OXFORD:adr,
pages = "xvi + 462 + 16",
year = "2010",
ISBN = "0-19-284055-X (hardcover), 0-19-957814-1 (paperback)",
ISBN-13 = "978-0-19-284055-4 (hardcover), 978-0-19-957814-6
(paperback)",
LCCN = "D810.C88 C66 2010",
bibdate = "Mon Mar 12 13:35:02 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
library.ox.ac.uk:210/ADVANCE",
URL = "http://www.colossus-computer.com/",
acknowledgement = ack-nhfb,
remark = "Originally published: 2006.",
subject = "Lorenz cipher system; World War, 1939--1945;
Cryptography; Electronic intelligence; Great Britain;
History; Germany; Computers",
tableofcontents = "A brief history of cryptography from Caesar to
Bletchley Park / Simon Singh \\
How it began: Bletchley Park goes to war / Michael
Smith \\
The German Tunny machine / Jack Copeland \\
Colossus, codebreaking, and the digital age / Stephen
Budiansky \\
Machine against machine / Jack Copeland \\
D-Day at Bletchley Park / Thomas H. Flowers \\
Intercept! / Jack Copeland \\
Colossus / Thomas H. Flowers \\
Colossus and the rise of the modern computer / Jack
Copeland \\
The PC user's guide to Colossus / Benjamin Wells \\
Of men and machines / Brian Randell \\
The Colossus rebuild / Tony Sale \\
Mr. Newman's section / Jack Copeland, with Catherine
Caughey \ldots{} [et al.] \\
Max Newman: mathematician, codebreaker, and computer
pioneer / William Newman \\
Living with Fish: breaking Tunny in the Newmanry and
the Testery / Peter Hilton \\
From Hut 8 to the Newmanry / Irving John ``Jack'' Good
\\
Codebreaking and Colossus / Donald Michie \\
Major Tester's section / Jerry Roberts \\
Setter and breaker / Roy Jenkins \\
An ATS girl in the Testery / Helen Currie \\
The Testery and the breaking of Fish / Peter Edgerley
\\
Dollis Hill at war / Jack Copeland, with David Bolam
\ldots{} [et al.] \\
The British Tunny machine / Gil Hayward \\
How Colossus was built and operated: one of its
engineers reveals its secrets / Harry Fensom \\
Bletchley Park's Sturgeon: the Fish that laid no eggs /
Frode Weierud \\
German teleprinter traffic and Swedish wartime
intelligence / Craig McKay",
}
@Book{Dent:2010:PS,
editor = "Alexander W. Dent and Yuliang Zheng and Moti Yung",
booktitle = "Practical Signcryption",
title = "Practical Signcryption",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xviii + 274",
year = "2010",
DOI = "https://doi.org/10.1007/978-3-540-89411-7",
ISBN = "1-282-98107-2, 3-540-89411-X (e-book), 3-540-89409-8
(e-book)",
ISBN-13 = "978-1-282-98107-2, 978-3-540-89411-7 (e-book),
978-3-540-89409-4 (e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.A25 P735 2010",
bibdate = "Sat Jun 10 08:34:52 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/978-3-540-89411-7",
acknowledgement = ack-nhfb,
remark = "Versement en lot. In Springer Link (Monographies
{\'e}lectroniques).",
subject = "Data encryption (Computer science); Cryptography;
Computer science; Chiffrement (Informatique);
Cryptographie; Cryptography; Data encryption (Computer
science); Cryptage; Cryptographie (Informatique);
S{\'e}curit{\'e} des donn{\'e}es; Signature
num{\'e}rique.",
tableofcontents = "1 Introduction / Yuliang Zheng / / 1 \\
1.1 Historical Development of Signcryption / 1 \\
1.1.1 Coded Modulation / 1 \\
1.1.2 Musings on Blending / 2 \\
1.1.3 Signcryption / 5 \\
1.1.4 Provably Secure Signcryption / 7 \\
1.2 Extensions, Standardization, and Future Research
Directions / 8 \\
1.3 Notation and Security Notions / 9 \\
1.3.1 Algorithms and Assignment / 10 \\
1.3.2 Signature Schemes / 11 \\
1.3.3 Public Key Encryption / 14 \\
1.3.4 Symmetric Encryption / 16 \\
1.3.5 Message Authentication Codes / 18 \\
Part I Security Models for Signcryption \\
2 Security for Signcryption: The Two-User Model / Jee
Hea An and Tal Rabin / / 21 \\
2.1 Introduction / 21 \\
2.2 Definition of Signcryption in the Two-User Setting
/ 23 \\
2.2.1 Two Security Notions in the Two-User Setting / 23
\\
2.2.2 Discussions on the Security Notions / 28 \\
2.3 Generic Compositions of Signature and Encryption /
30 \\
2.3.1 Construction / 30 \\
2.3.2 Security of the Parallel Composition Method / 31
\\
2.3.3 Security of the Sequential Composition Methods /
32 \\
2.4 Multi-user Setting / 39 \\
2.4.1 Syntax / 39 \\
2.4.2 Security / 40 \\
2.4.3 Extending Signcryption / 40 \\
3 Security for Signcryption: The Multi-User Model /
Joonsang Baek and Ron Steinfeld / / 43 \\
3.1 Introduction / 43 \\
3.2 The BSZ Model / 44 \\
3.2.1 Confidentiality of Signcryption in the Multi-User
BSZ Model / 44 \\
3.2.2 Unforgeability of Signcryption in the Multi-User
BSZ Model / 47 \\
3.2.3 Further Discussions on the Multi-User BSZ Model /
50 \\
3.3 Example: The Security of Zheng's Signcryption
Scheme in the BSZ Model / 51 \\
Part II Signcryption Schemes \\
4 Signcryption Schemes Based on the Diffie-Hellnian
Problem / Paulo S. L. M. Barreto, Beno{\^\i}t Libert,
Noel McCullagh, and Jean-Jacques Quisquater / / 57 \\
4.1 Introduction / 57 \\
4.2 Diffie-Hellman Problems / 58 \\
4.3 Zheng's Construction and Its Variants / 59 \\
4.3.1 Zheng's Original Scheme / 59 \\
4.3.2 The Bao-Deng Modification / 62 \\
4.3.3 A Modification with Public Verifiability / 62 \\
4.4 An Encrypt-then-Sign Composition / 63 \\
4.5 A Scheme with Unforgeability Based on Factoring /
64 \\
4.6 Schemes with Non-repudiation / 66 \\
4.6.1 A DSA-Based Construction / 66 \\
4.6.2 A Scheme Built on Schnorr's Signature Scheme / 67
\\
4.7 The CM Scheme / 68 \\
5 Signcryption Schemes Based on Bilinear Maps / Paulo
S.L.M. Barreto, Beno{\^\i}t Libert, Noel McCullagh, and
Jean-Jacques Quisquater / / 71 \\
5.1 Introduction / 71 \\
5.2 Bilinear Map Groups / 72 \\
5.3 Assumptions / 73 \\
5.4 Signcryption for Anonymous Communications / 74 \\
5.4.1 Message Privacy / 75 \\
5.4.2 Ciphertext Unforgeability and Signature
Unforgeability / 76 \\
5.4.3 Anonymity / 77 \\
5.5 A Tightly Secure Scheme / 78 \\
5.5.1 The Scheme / 78 \\
5.5.2 Efficiency / 79 \\
5.5.3 Security / 80 \\
5.6 A Scheme with Short Detachable Signatures / 86 \\
5.6.1 Efficiency / 88 \\
5.6.2 Anonymous Communications / 88 \\
5.6.3 Security / 89 \\
6. Signcryption Schemes Based on the RSA Problem /
Alexander W. Dent and John Malone-Lee / / 99 \\
6.1 Introduction / 99 \\
6.2 The RSA Transform / 100 \\
6.3 Dedicated RSA-Based Signcryption Schemes / 101 \\
6.4 Signcryption from Padding Schemes / 102 \\
6.4.1 Trapdoor Permutations / 102 \\
6.4.2 Extractable Commitments / 102 \\
6.4.3 Padding-Based Signcryption Schemes / 104 \\
6.4.4 Proof Intuition / 109 \\
6.5 Signcryption Based on RSA-TBOS / 110 \\
6.5.1 The TBOS Construction / 110 \\
6.5.2 Security Proof for the TBOS Signcryption Scheme /
112 \\
Part III Construction Techniques \\
7 Hybrid Signcryption / Tor E. Bj{\o}rstad / / 121 \\
7.1 Background / 121 \\
7.1.1 A Brief Word on Notation / 123 \\
7.2 Preliminaries / 123 \\
7.2.1 The Hybrid Framework / 123 \\
7.2.2 Security Criteria for Data Encapsulation
Mechanisms / 125 \\
7.3 Hybrid Signcryption with Outsider Security / 126
\\
7.3.1 An Outsider-Secure Signcryption KEM / 126 \\
7.3.2 Security Criteria for Outsider-Secure
Signcryption KEMs / 127 \\
7.3.3 Security of the SKEM + DEM Construction / 130 \\
7.3.4 Outsider-Secure Hybrid Signcryption in Practice /
133 \\
7.4 Hybrid Signcryption with Insider Security / 136 \\
7.4.1 From Outsider to Insider Security / 136 \\
7.4.2 Signcryption Tag-KEMs / 138 \\
7.4.3 Security Criteria for Signcryption Tag-KEMs / 140
\\
7.4.4 Security of the SCTK+DEM Construction / 143 \\
7.4.5 Insider-Secure Hybrid Signcryption in Practice /
146 \\
8 Concealment and Its Applications to Authenticated
Encryption / Yevgeniy Dodis / / 149 \\
8.1 Introduction / 149 \\
8.1.1 Domain Extension of Authenticated Encryption /
150 \\
8.1.2 Remotely Keyed Authenticated Encryption / 152 \\
8.2 Definition of Concealment / 155 \\
8.2.1 Syntax / 155 \\
8.2.2 Security of Concealment / 156 \\
8.2.3 Relaxed Concealments / 157 \\
8.2.4 Super-Relaxed Concealments / 157 \\
8.2.5 Comparison to Commitment / 157 \\
8.3 Constructing Concealment Schemes / 158 \\
8.3.1 Achieving Hiding / 158 \\
8.3.2 Achieving Binding / 159 \\
8.3.3 Necessity of Assumptions / 162 \\
8.4 Applications to Authenticated Encryption / 163 \\
8.4.1 Definition of Authenticated Encryption / 164 \\
8.4.2 Authenticated Encryption of Long Messages / 166
\\
8.4.3 Remotely Keyed Authenticated Encryption / 169 \\
9 Parallel Signcryption / Josef Pieprzyk and David
Pointcheval / / 175 \\
9.1 Introduction / 175 \\
9.2 Concept of Parallel Signcryption / 175 \\
9.3 Overview of Constructions / 176 \\
9.4 Generic Parallel Signcryption / 178 \\
9.4.1 Description of the Scheme / 178 \\
9.4.2 Security Analysis / 180 \\
9.5 Optimal Parallel Signcryption / 185 \\
9.5.1 Description of the Scheme / 185 \\
9.5.2 Security Analysis / 187 \\
Part IV Extensions of Signcryption \\
10 Identity-Based Signcryption / Xavier Boyen / / 195
\\
10.1 Introduction / 195 \\
10.1.1 Identity-Based Cryptography / 195 \\
10.1.2 Advantages and Disadvantages / 197 \\
10.2.3 From IBE to Signcryption / 199 \\
10.1.4 Specifying an IBSC System / 200 \\
10.1.5 Concrete IBSC from Pairings / 201 \\
10.2 The Identity-Based Signcryption Primitive / 202
\\
10.3 Security Definitions / 203 \\
10.3.1 Message Confidentiality / 206 \\
10.3.2 Signature Non-repudiation / 207 \\
10.3.3 Ciphertext Unlinkability / 208 \\
10.3.4 Ciphertext Authentication / 209 \\
10.3.5 Ciphertext Anonymity / 210 \\
10.4 A Concrete IBSC Scheme / 211 \\
10.4.1 The Boneh-Franklin Framework / 211 \\
10.4.2 Fully Secure IBSC Construction / 212 \\
10.4.3 A Performance/Security Trade-Off / 215 \\
10.4.4 Signcrypting for Multiple Recipients / 215 \\
11 Key Establishment Using Signcryption Techniques /
Alexander W. Dent / / 217 \\
11.1 Introduction / 217 \\
11.2 Formal Security Models for Key Establishment / 219
\\
11.2.1 Motivation / 219 \\
11.2.2 Sessions / 220 \\
11.2.3 The Formal Security Model / 221 \\
11.2.4 Entity Authentication / 223 \\
11.2.5 Forward Secrecy / 224 \\
11.2.6 Key Compromise Impersonation Attacks / 224 \\
11.2.7 Notation / 224 \\
11.3 Key Transport / 225 \\
11.4 Key Establishment Based on Zheng's Signcryption
Scheme / 226 \\
11.5 Key Agreement Based on Signcryption KEMs / 227 \\
11.5.1 Key Agreement Based on Signcryption KEMs / 229
\\
11.5.2 Key Agreement Based on Signcryption Tag-KEMs /
230 \\
11.5.3 Security Proof for the Bj{\o}rstad--Dent
Protocol / 232 \\
11.6 Key Establishment Based on Timestamps / 239 \\
12 Applications of Signcryption / Yang Cui and Goichiro
Hanaoka / / 241 \\
12.1 Application Fields of Signcryption / 241 \\
12.2 Example Applications of Signcryption / 242 \\
12.2.1 Secure Multicasting Over the Internet / 243 \\
12.2.2 Authenticated Key Recovery / 246 \\
12.2.3 Secure ATM Networks / 248 \\
12.2.4 Secure Routing for Mobile Ad Hoc Networks / 249
\\
12.2.5 Encrypted and Authenticated E-mail by Firewalls
/ 251 \\
12.2.6 Signcryption in Secure VoIP / 252 \\
12.2.7 Applications to Electronic Payment / 253 \\
References / 257 \\
Index / 269",
xxpages = "xviii + 278",
}
@Proceedings{Gilbert:2010:ACE,
editor = "Henri Gilbert",
booktitle = "{Advances in cryptology --- Eurocrypt 2010: 29th
annual international conference on the theory and
applications of cryptographic techniques, Monaco, May
30--June 3, 2010. Proceedings}",
title = "{Advances in cryptology --- Eurocrypt 2010: 29th
annual international conference on the theory and
applications of cryptographic techniques, Monaco, May
30--June 3, 2010. Proceedings}",
volume = "6110",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2010",
ISBN = "3-642-13189-1 (softcover)",
ISBN-13 = "978-3-642-13189-9 (softcover)",
LCCN = "????",
bibdate = "Mon Jan 10 18:25:26 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Lecture notes in computer science",
acknowledgement = ack-nhfb,
}
@Proceedings{Gollmann:2010:SCR,
editor = "Dieter Gollmann and Jean-Louis Lanet and Julien
Iguchi-Cartigny",
booktitle = "{Smart card research and advanced application: 9th
IFIP WG 8.8/11.2 International Conference, CARDIS 2010,
Passau, Germany, April 14--16, 2010: proceedings}",
title = "{Smart card research and advanced application: 9th
IFIP WG 8.8/11.2 International Conference, CARDIS 2010,
Passau, Germany, April 14--16, 2010: proceedings}",
volume = "6035",
publisher = "Springer",
address = "Berlin, Germany",
pages = "x + 237",
year = "2010",
ISBN = "3-642-12509-3 (paperback)",
ISBN-13 = "978-3-642-12509-6 (paperback)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK7895.S62 C36 2010",
bibdate = "Thu Feb 10 12:50:59 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
acknowledgement = ack-nhfb,
meetingname = "CARDIS (Conference) (9th: 2010: Passau, Germany)",
subject = "Smart cards; Congresses",
}
@Proceedings{Gong:2010:PCI,
editor = "Guang Gong and Kishan Chand Gupta",
booktitle = "{Progress in cryptology --- Indocrypt 2010: 11th
international conference on cryptology in India,
Hyderabad, India, December 12--15, 2010. Proceedings}",
title = "{Progress in cryptology --- Indocrypt 2010: 11th
international conference on cryptology in India,
Hyderabad, India, December 12--15, 2010. Proceedings}",
volume = "6498",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2010",
ISBN = "3-642-17400-0 (softcover)",
ISBN-13 = "978-3-642-17400-1 (softcover)",
LCCN = "????",
bibdate = "Mon Jan 10 18:27:11 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Lecture notes in computer science",
acknowledgement = ack-nhfb,
}
@Proceedings{Heng:2010:CNS,
editor = "Swee-Huay Heng and Rebecca N. Wright and Bok-Min Goi",
booktitle = "{Cryptology and network security: 9th international
conference, CANS 2010, Kuala Lumpur, Malaysia, December
12--14, 2010. Proceedings}",
title = "{Cryptology and network security: 9th international
conference, CANS 2010, Kuala Lumpur, Malaysia, December
12--14, 2010. Proceedings}",
volume = "6467",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2010",
ISBN = "3-642-17618-6 (softcover)",
ISBN-13 = "978-3-642-17618-0 (softcover)",
LCCN = "????",
bibdate = "Mon Jan 10 18:25:47 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Lecture notes in computer science",
acknowledgement = ack-nhfb,
}
@Proceedings{IEEE:2010:PIA,
editor = "{IEEE}",
booktitle = "{Proceedings: 2010 IEEE 51st Annual Symposium on
Foundations of Computer Science: 23--26 October 2010,
Las Vegas, Nevada, USA}",
title = "{Proceedings: 2010 IEEE 51st Annual Symposium on
Foundations of Computer Science: 23--26 October 2010,
Las Vegas, Nevada, USA}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xvi + 826",
year = "2010",
ISBN = "1-4244-8525-8",
ISBN-13 = "978-1-4244-8525-3",
LCCN = "????",
bibdate = "Thu Apr 12 09:08:49 MDT 2012",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/focs2010.bib",
note = "IEEE Computer Society Order Number P4244.",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=5669376",
acknowledgement = ack-nhfb,
meetingname = "Symposium on Foundations of Computer Science (51st:
2010: Las Vegas, Nev.)",
subject = "Electronic data processing; Congresses; Machine
theory",
}
@Book{Kollmitzer:2010:AQC,
editor = "Christian Kollmitzer and M. (Mario) Pivk",
booktitle = "Applied Quantum Cryptography",
title = "Applied Quantum Cryptography",
volume = "797",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 214",
year = "2010",
DOI = "https://doi.org/10.1007/978-3-642-04831-9",
ISBN = "3-642-04829-3 (hardcover), 3-642-04831-5 (e-book)",
ISBN-13 = "978-3-642-04829-6 (hardcover), 978-3-642-04831-9
(e-book)",
LCCN = "TK5102.94 .A68 2010",
bibdate = "Wed Jun 3 09:04:53 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Lecture notes in physics",
acknowledgement = ack-nhfb,
subject = "Data encryption (Computer science); Cryptography;
Quantenkryptologie.",
tableofcontents = "Introduction / C. Kollmitzer \\
Preliminaries / M. Pivk \\
Quantum key distribution / M. Pivk \\
Adaptive cascade / S. Rass, C. Kollmitzer \\
Attack strategies on QKD protocols / S. Schauer \\
QKD systems / M. Suda \\
Statistical analysis of QKD networks in real-life
environment / K. Lessiak, J. Pilz \\
QKD networks based on Q3P / O. Maurhart \\
Quantum-cryptographic networks from a prototype to the
citizen / P. Schartner, C. Kollmitzer \\
The ring of trust model / C. Kollmitzer, C.
Moesslacher",
}
@Proceedings{Lee:2010:ISC,
editor = "Donghoon Lee and Seokhie Hong",
booktitle = "{Information, security and cryptology -- ICISC 2009:
12th international conference, Seoul, Korea, December
2--4, 2009, revised selected papers}",
title = "{Information, security and cryptology -- ICISC 2009:
12th international conference, Seoul, Korea, December
2--4, 2009, revised selected papers}",
volume = "5984",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2010",
ISBN = "3-642-14422-5 (softcover)",
ISBN-13 = "978-3-642-14422-6 (softcover)",
LCCN = "????",
bibdate = "Mon Jan 10 18:26:29 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Lecture notes in computer science",
acknowledgement = ack-nhfb,
}
@Proceedings{Nguyen:2010:LAS,
editor = "Phong Quang Nguyen and Brigitte Vall{\'e}e",
booktitle = "The {LLL} Algorithm: Survey and Applications",
title = "The {LLL} Algorithm: Survey and Applications",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 496",
year = "2010",
DOI = "https://doi.org/10.1007/978-3-642-02295-1",
ISBN = "3-642-02294-4 (hardcover), 3-642-02295-2 (e-book)",
ISBN-13 = "978-3-642-02294-4 (hardcover), 978-3-642-02295-1
(e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA9.58 .L55 2010; QA76",
MRclass = "*11-06, 11T71, 11Y16, 11Y50, 94A60",
bibdate = "Sat Jun 10 08:34:55 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.gbv.de:20011/gvk",
note = "Conference in honour of the 25th birthday of the
Lenstra--Lenstra--Lovasz Lattice Reduction Algorithm,
LLL, Caen, France.",
series = "Information Security and Cryptography",
abstract = "The LLL algorithm is a polynomial-time lattice
reduction algorithm, named after its inventors, Arjen
Lenstra, Hendrik Lenstra and L{\'a}szl{\'o} Lov{\'a}sz.
The algorithm has revolutionized computational aspects
of the geometry of numbers since its introduction in
1982, leading to breakthroughs in fields as diverse as
computer algebra, cryptology and algorithmic number
theory. This book consists of 15 survey chapters on
computational aspects of Euclidean lattices and their
main applications. Topics covered include polynomial
factorization, lattice reduction algorithms,
applications in number theory, integer programming,
provable security, lattice-based cryptography and
complexity. The authors include many detailed
motivations, explanations and examples, and the
contributions are largely self-contained. The book will
be of value to a wide range of researchers and graduate
students working in related fields of theoretical
computer science and mathematics.",
acknowledgement = ack-nhfb,
subject = "Computer science; Data structures (Computer science);
Computer software; Computational complexity;
Algorithms; Number theory; Mathematical optimization;
Data Structures, Cryptology and Information Theory;
Algorithm Analysis and Problem Complexity; Discrete
Mathematics in Computer Science; Optimization;
Algorithms; Computational complexity; Computer science;
Computer software; Data structures (Computer science);
Mathematical optimization; Number theory.",
tableofcontents = "The history of the LLL algorithm / Ionica Smeets
\\
Hermite's constant and lattice algorithms / Phong Q.
Nguyen \\
Probabilistic analyses of lattice reduction algorithms
/ Brigitte Vall{\'e}e and Antonio Vera \\
Progress on LLL and lattice reduction / Claus Peter
Schnorr \\
Floating-point LLL: theoretical and practical aspects /
Damien Stehl{\'e} \\
LLL: a tool for effective diophantine approximation /
Guillaume Hanrot \\
Selected applications of LLL in number theory / Denis
Simon \\
The van Hoeij algorithm for factoring polynomials /
J{\"u}rgen Kl{\"u}ners \\
The LLL algorithm and integer programming / Karen
Aardal and Friedrich Eisenbrand \\
Using LLL-reduction for solving RSA and factorization
problems / Alexander May \\
Practical lattice-based cryptography: NTRUEncrypt and
NTRUSign / Jeff Hoffstein, Nick Howgrave-Graham, Jill
Pipher, and William Whyte \\
The geometry of provable security: some proofs of
security in which lattices make a surprise appearance /
Craig Gentry \\
Cryptographic functions from worst-case complexity
assumptions / Daniele Micciancio \\
Inapproximability results for computational problems on
lattices / Subhash Khot \\
On the complexity of lattice problems with polynomial
approximation factors / Oded Regev",
}
@Proceedings{Pieprzyk:2010:TCC,
editor = "Josef Pieprzyk",
booktitle = "{Topics in cryptology --- CT-RSA 2010: the 10th
cryptographers' track at the RSA conference 2010, San
Francisco, CA, USA, March 1--5, 2010. Proceedings}",
title = "{Topics in cryptology --- CT-RSA 2010: the 10th
cryptographers' track at the RSA conference 2010, San
Francisco, CA, USA, March 1--5, 2010. Proceedings}",
volume = "5985",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2010",
ISBN = "3-642-11924-7 (softcover)",
ISBN-13 = "978-3-642-11924-8 (softcover)",
LCCN = "????",
bibdate = "Mon Jan 10 18:27:53 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Lecture notes in computer science",
acknowledgement = ack-nhfb,
}
@Proceedings{Rabin:2010:ACC,
editor = "Tal Rabin",
booktitle = "{Advances in cryptology --- Crypto 2010: 30th annual
cryptology conference, Santa Barbara, CA, USA, August
15--19, 2010. Proceedings}",
title = "{Advances in cryptology --- Crypto 2010: 30th annual
cryptology conference, Santa Barbara, CA, USA, August
15--19, 2010. Proceedings}",
volume = "6223",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2010",
ISBN = "3-642-14622-8 (softcover)",
ISBN-13 = "978-3-642-14622-0 (softcover)",
LCCN = "????",
bibdate = "Mon Jan 10 18:25:05 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Lecture notes in computer science",
acknowledgement = ack-nhfb,
}
@Proceedings{Sendrier:2010:PQC,
editor = "Nicolas Sendrier",
booktitle = "{Post-Quantum Cryptography: Third International
Workshop, PQCrypto 2010, Darmstadt, Germany, May
25--28, 2010. Proceedings}",
title = "{Post-Quantum Cryptography: Third International
Workshop, PQCrypto 2010, Darmstadt, Germany, May
25--28, 2010. Proceedings}",
volume = "6061",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 240",
year = "2010",
DOI = "https://doi.org/10.1007/978-3-642-12929-2",
ISBN = "3-642-12928-5",
ISBN-13 = "978-3-642-12928-5",
LCCN = "QA76.9.A25 2010",
bibdate = "Thu Apr 21 17:24:28 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.bibsys.no:2100/BIBSYS",
series = ser-LNCS,
acknowledgement = ack-nhfb,
subject = "Data protection; Computer science; Computer software;
Information Systems; Operating systems (Computers);
Computer Communication Networks; Data encryption
(Computer science)",
}
@Proceedings{Watt:2010:IPI,
editor = "Stephen M. Watt",
booktitle = "{ISSAC 2010: Proceedings of the 2010 International
Symposium on Symbolic and Algebraic Computation, July
25--28, 2010, Munich, Germany}",
title = "{ISSAC 2010: Proceedings of the 2010 International
Symposium on Symbolic and Algebraic Computation, July
25--28, 2010, Munich, Germany}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xiv + 363",
year = "2010",
ISBN = "1-4503-0150-9",
ISBN-13 = "978-1-4503-0150-3",
LCCN = "QA76.95 .I59 2010",
bibdate = "Fri Jun 17 08:11:01 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Yang:2010:PII,
editor = "Yixian Yang",
booktitle = "{Proceedings 2010 IEEE International Conference on
Information Theory and Information Security: December
17--19, 2010, Beijing, China}",
title = "{Proceedings 2010 IEEE International Conference on
Information Theory and Information Security: December
17--19, 2010, Beijing, China}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "various",
year = "2010",
ISBN = "1-4244-6942-2",
ISBN-13 = "978-1-4244-6942-0",
LCCN = "QA76.9.A25",
bibdate = "Fri Mar 13 10:55:54 MDT 2015",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=5680738",
acknowledgement = ack-nhfb,
meetingname = "International Conference on Information Theory and
Information Security (2010: Beijing, China)",
subject = "Data protection; Congresses; Information retrieval;
Information theory; Data protection; Information
retrieval; Information theory",
}
@Proceedings{ACM:2011:PAI,
editor = "{ACM}",
booktitle = "{Proceedings of the 2011 ACM International Symposium
on Theory of Computing: June 6--8, 2011, San Jose, CA,
USA}",
title = "{Proceedings of the 2011 ACM International Symposium
on Theory of Computing: June 6--8, 2011, San Jose, CA,
USA}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xxx + 822 (est.)",
year = "2011",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Wed Sep 1 10:37:53 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.gbv.de:20011/gvk",
URL = "http://www.gbv.de/dms/tib-ub-hannover/63314455x.",
acknowledgement = ack-nhfb,
remark = "43rd annual STOC meeting.",
}
@Proceedings{Anonymous:2011:AIS,
editor = "Anonymous",
booktitle = "{ACIS international symposium on cryptography, and
network security, data mining and knowledge discovery,
e-commerce and its applications, and embedded
systems}",
title = "{ACIS international symposium on cryptography, and
network security, data mining and knowledge discovery,
e-commerce and its applications, and embedded
systems}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "????",
year = "2011",
ISBN = "0-7695-4332-4",
ISBN-13 = "978-0-7695-4332-1",
LCCN = "????",
bibdate = "Mon Jan 10 18:22:05 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
}
@Proceedings{Bernstein:2011:PCI,
editor = "Daniel J. Bernstein and Sanjit Chatterjee",
booktitle = "{Progress in Cryptology --- INDOCRYPT 2011: 12th
International Conference on Cryptology in India,
Chennai, India, December 11--14. Proceedings}",
title = "{Progress in Cryptology --- INDOCRYPT 2011: 12th
International Conference on Cryptology in India,
Chennai, India, December 11--14. Proceedings}",
volume = "7107",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25577-9",
ISBN = "3-642-25577-9",
ISBN-13 = "978-3-642-25577-9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri May 25 08:11:05 MDT 2012",
bibsource = "http://link.springer-ny.com/link/service/series/0558/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-25577-9",
acknowledgement = ack-nhfb,
}
@Proceedings{Chen:2011:CCI,
editor = "Liqun Chen",
booktitle = "{Cryptography and Coding: 13th IMA International
Conference, IMACC 2011, Oxford, UK, December 12--15.
Proceedings}",
title = "{Cryptography and Coding: 13th IMA International
Conference, IMACC 2011, Oxford, UK, December 12--15.
Proceedings}",
volume = "7089",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25515-1",
ISBN = "3-642-25515-9",
ISBN-13 = "978-3-642-25515-1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri May 25 08:11:05 MDT 2012",
bibsource = "http://link.springer-ny.com/link/service/series/0558/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-25515-1",
acknowledgement = ack-nhfb,
}
@Proceedings{IEEE:2011:ICI,
editor = "{IEEE}",
booktitle = "{International Conference on Intelligent Computation
Technology and Automation (ICICTA), 2011: 28--29 March
2011, Shenzhen, Guangdong, China; proceedings}",
title = "{International Conference on Intelligent Computation
Technology and Automation (ICICTA), 2011: 28--29 March
2011, Shenzhen, Guangdong, China; proceedings}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "????",
year = "2011",
ISBN = "0-7695-4353-7, 1-61284-289-5",
ISBN-13 = "978-0-7695-4353-6, 978-1-61284-289-9",
LCCN = "????",
bibdate = "Fri Mar 13 08:02:36 MDT 2015",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=5750113",
acknowledgement = ack-nhfb,
}
@Proceedings{IEEE:2011:PIA,
editor = "{IEEE}",
booktitle = "{Proceedings: 2011 IEEE 52nd Annual IEEE Symposium on
Foundations of Computer Science: 22--25 October 2011,
Palm Springs, California, USA}",
title = "{Proceedings: 2011 IEEE 52nd Annual IEEE Symposium on
Foundations of Computer Science: 22--25 October 2011,
Palm Springs, California, USA}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "????",
year = "2011",
DOI = "https://doi.org/10.1109/FOCS.2011.100",
ISBN = "1-4577-1843-X",
ISBN-13 = "978-1-4577-1843-4",
LCCN = "????",
bibdate = "Thu Apr 12 09:11:22 MDT 2012",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/focs2010.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Kiayias:2011:TCC,
editor = "Aggelos Kiayias",
booktitle = "{Topics in cryptology --- CT-RSA 2011: the
cryptographers' track at the RSA conference 2011, San
Francisco, CA, USA, February 14--18, 2011.
proceedings}",
title = "{Topics in cryptology --- CT-RSA 2011: the
cryptographers' track at the RSA conference 2011, San
Francisco, CA, USA, February 14--18, 2011.
proceedings}",
volume = "6558",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2011",
ISBN = "3-642-19073-1",
ISBN-13 = "978-3-642-19073-5",
LCCN = "????",
bibdate = "Mon Jan 10 18:16:07 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Lecture notes in computer science",
acknowledgement = ack-nhfb,
}
@Proceedings{Lathrop:2011:SPI,
editor = "Scott Lathrop and Jim Costa and William Kramer",
booktitle = "{SC'11: Proceedings of 2011 International Conference
for High Performance Computing, Networking, Storage and
Analysis, Seattle, WA, November 12--18 2011}",
title = "{SC'11: Proceedings of 2011 International Conference
for High Performance Computing, Networking, Storage and
Analysis, Seattle, WA, November 12--18 2011}",
publisher = pub-ACM # " and " # pub-IEEE,
address = pub-ACM:adr # " and " # pub-IEEE:adr,
pages = "866",
year = "2011",
ISBN = "1-4503-0771-X",
ISBN-13 = "978-1-4503-0771-0",
LCCN = "????",
bibdate = "Fri Dec 16 11:11:35 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/supercomputing2011.bib",
acknowledgement = ack-nhfb,
xxeditor = "{ACM}",
}
@Proceedings{Lee:2011:ACA,
editor = "Dong Hoon Lee and Xiaoyun Wang",
booktitle = "{Advances in Cryptology --- ASIACRYPT 2011: 17th
International Conference on the Theory and Application
of Cryptology and Information Security, Seoul, South
Korea, December 4--8. Proceedings}",
title = "{Advances in Cryptology --- ASIACRYPT 2011: 17th
International Conference on the Theory and Application
of Cryptology and Information Security, Seoul, South
Korea, December 4--8. Proceedings}",
volume = "7073",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25384-3",
ISBN = "3-642-25384-9",
ISBN-13 = "978-3-642-25384-3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri May 25 08:11:05 MDT 2012",
bibsource = "http://link.springer-ny.com/link/service/series/0558/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-25384-3",
acknowledgement = ack-nhfb,
}
@Proceedings{Lin:2011:CNS,
editor = "Dongdai Lin and Gene Tsudik and Xiaoyun Wang",
booktitle = "{Cryptology and Network Security: 10th International
Conference, CANS 2011, Sanya, China, December 10--12.
Proceedings}",
title = "{Cryptology and Network Security: 10th International
Conference, CANS 2011, Sanya, China, December 10--12.
Proceedings}",
volume = "7092",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25512-0",
ISBN = "3-642-25512-4",
ISBN-13 = "978-3-642-25512-0",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri May 25 08:11:05 MDT 2012",
bibsource = "http://link.springer-ny.com/link/service/series/0558/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-25512-0",
acknowledgement = ack-nhfb,
}
@Proceedings{vanDam:2011:TQC,
editor = "Wim van Dam and Vivian M. Kendon and Simone Severini",
booktitle = "{Theory of quantum computation, communication, and
cryptography: 5th conference, TQC 2010, Leeds, UK,
April 13--15, 2010, revised selected papers}",
title = "{Theory of quantum computation, communication, and
cryptography: 5th conference, TQC 2010, Leeds, UK,
April 13--15, 2010, revised selected papers}",
volume = "6519",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2011",
ISBN = "3-642-18072-8 (softcover)",
ISBN-13 = "978-3-642-18072-9 (softcover)",
LCCN = "????",
bibdate = "Mon Jan 10 18:22:26 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Lecture notes in computer science",
acknowledgement = ack-nhfb,
}
@Book{vanTilborg:2011:ECS,
editor = "Henk C. A. van Tilborg and Sushil Jajodia",
booktitle = "Encyclopedia of Cryptography and Security",
title = "Encyclopedia of Cryptography and Security",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Second",
pages = "xl + 1416",
year = "2011",
DOI = "https://doi.org/10.1007/978-1-4419-5906-5",
ISBN = "1-4419-5905-X (print), 1-4419-5906-8 (e-book)",
ISBN-13 = "978-1-4419-5905-8 (print), 978-1-4419-5906-5
(e-book)",
LCCN = "????",
bibdate = "Wed Dec 21 07:37:32 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Yang:2011:PQC,
editor = "Bo-Yin Yang",
booktitle = "{Post-Quantum Cryptography: 4th International
Workshop, PQCrypto 2011, Taipei, Taiwan, November 29
--- December 2, 2011. Proceedings}",
title = "{Post-Quantum Cryptography: 4th International
Workshop, PQCrypto 2011, Taipei, Taiwan, November 29
--- December 2, 2011. Proceedings}",
volume = "7071",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2011",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25404-8",
ISBN = "3-642-25404-7",
ISBN-13 = "978-3-642-25404-8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri May 25 08:11:05 MDT 2012",
bibsource = "http://link.springer-ny.com/link/service/series/0558/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2011.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-25404-8",
acknowledgement = ack-nhfb,
}
@Proceedings{Cramer:2012:TCT,
editor = "Ronald Cramer",
booktitle = "{Theory of Cryptography: 9th Theory of Cryptography
Conference, TCC 2012, Taormina, Sicily, Italy, March
19--21. Proceedings}",
title = "{Theory of Cryptography: 9th Theory of Cryptography
Conference, TCC 2012, Taormina, Sicily, Italy, March
19--21. Proceedings}",
volume = "7194",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28913-2",
ISBN = "3-642-28913-4",
ISBN-13 = "978-3-642-28913-2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri May 25 08:11:01 MDT 2012",
bibsource = "http://link.springer-ny.com/link/service/series/0558/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-28913-2",
acknowledgement = ack-nhfb,
}
@Proceedings{Danezis:2012:FCDa,
editor = "George Danezis and Sven Dietrich and Kazue Sako",
booktitle = "{Financial Cryptography and Data Security: FC 2011
Workshops, RLCPS and WECSR 2011, Rodney Bay, St. Lucia,
February 28 --- March 4, 2011, Revised Selected
Papers}",
title = "{Financial Cryptography and Data Security: FC 2011
Workshops, RLCPS and WECSR 2011, Rodney Bay, St. Lucia,
February 28 --- March 4, 2011, Revised Selected
Papers}",
volume = "7126",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29888-2",
ISBN = "3-642-29888-5",
ISBN-13 = "978-3-642-29888-2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri May 25 08:10:59 MDT 2012",
bibsource = "http://link.springer-ny.com/link/service/series/0558/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-29888-2",
acknowledgement = ack-nhfb,
}
@Proceedings{Danezis:2012:FCDb,
editor = "George Danezis",
booktitle = "{Financial Cryptography and Data Security: 15th
International Conference, FC 2011, Gros Islet, St.
Lucia, February 28 --- March 4, 2011, Revised Selected
Papers}",
title = "{Financial Cryptography and Data Security: 15th
International Conference, FC 2011, Gros Islet, St.
Lucia, February 28 --- March 4, 2011, Revised Selected
Papers}",
volume = "7035",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27575-3",
ISBN = "3-642-27575-3",
ISBN-13 = "978-3-642-27575-3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri May 25 08:11:03 MDT 2012",
bibsource = "http://link.springer-ny.com/link/service/series/0558/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-27575-3",
acknowledgement = ack-nhfb,
}
@Proceedings{Dunkelman:2012:TCC,
editor = "Orr Dunkelman",
booktitle = "{Topics in Cryptology --- CT-RSA 2012: The
Cryptographers' Track at the RSA Conference 2012, San
Francisco, CA, USA, February 27 --- March 2, 2012.
Proceedings}",
title = "{Topics in Cryptology --- CT-RSA 2012: The
Cryptographers' Track at the RSA Conference 2012, San
Francisco, CA, USA, February 27 --- March 2, 2012.
Proceedings}",
volume = "7178",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27953-9",
ISBN = "3-642-27953-8",
ISBN-13 = "978-3-642-27953-9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri May 25 08:11:02 MDT 2012",
bibsource = "http://link.springer-ny.com/link/service/series/0558/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-27953-9",
acknowledgement = ack-nhfb,
}
@Proceedings{Fischlin:2012:PKC,
editor = "Marc Fischlin and Johannes Buchmann and Mark Manulis",
booktitle = "{Public Key Cryptography --- PKC 2012: 15th
International Conference on Practice and Theory in
Public Key Cryptography, Darmstadt, Germany, May
21--23. Proceedings}",
title = "{Public Key Cryptography --- PKC 2012: 15th
International Conference on Practice and Theory in
Public Key Cryptography, Darmstadt, Germany, May
21--23. Proceedings}",
volume = "7293",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-30056-1",
ISBN = "3-642-30056-1",
ISBN-13 = "978-3-642-30056-1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri May 25 08:10:59 MDT 2012",
bibsource = "http://link.springer-ny.com/link/service/series/0558/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-30056-1",
acknowledgement = ack-nhfb,
}
@Book{Good:2012:BTC,
editor = "Irving John Good and Donald Michie and G. (Geoffrey)
Timms and James A. Reeds and Whitfield Diffie and
Judith Veronica Field",
booktitle = "Breaking teleprinter ciphers at {Bletchley Park}:
general report on {Tunny} with emphasis on statistical
methods (1945)",
title = "Breaking teleprinter ciphers at {Bletchley Park}:
general report on {Tunny} with emphasis on statistical
methods (1945)",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "cxi + 673",
year = "2012",
DOI = "https://doi.org/10.1002/9781119061601",
ISBN = "0-470-46589-1 (hardcover)",
ISBN-13 = "978-0-470-46589-9 (hardcover)",
LCCN = "D810.C88 G66 2015",
bibdate = "Sat Aug 15 15:59:55 MDT 2020",
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/cryptography2010.bib",
abstract = "This detailed technical account of breaking Tunny is
an edition of a report written in 1945, with extensive
modern commentary Breaking Teleprinter Ciphers at
Bletchley Park gives the full text of the General
Report on Tunny (GRT) of 1945, making clear how the
ideas, notation and the specially designed machines
that were used differ from what was generally accepted
in 1945, and, where a modern reader might be misled,
from what is understood now. The editors of this book
clarify the sometimes slightly strange language of the
GRT and explain the text within a variety of contexts
in several separate historical story lines, some only
implicit in the GRT itself. The first story, told by
the authors of the GRT, describes how, using specially
designed machines, including from 1944 the
``Colossus'', the British broke the enciphered
teleprinter messages sent by the highest command levels
of the Germany Army. The cipher machines the Germans
used were the Lorenz SZ 40 series, called ``Tunny'' by
the British. The second story shows how the use of
then-unfashionable Bayesian methods in statistics
proved to be essential to the British success. The
third story describes a significant stage in the
invention of the modern digital computer. This story is
connected with Alan Turing's 1936 paper on the theory
of computability, which is nowadays seen as a starting
point for the development of the modern digital
computer. This book includes: Over 200 pages of
commentary, biographies, glossaries, and essays related
to the text of the General Report on Tunny. The
complete text of the original GRT, covering the general
theory of Tunny breaking and of numerous refinements
appropriate to special-case situations. All the
examples of original worksheets and printouts, showing
the Tunny-breaking process in action, that appear in
the GRT The main purpose of this book is to present the
actual words of the GRT for use by readers with a
serious interest in the history of cryptography,
computing, or mathematics.",
acknowledgement = ack-nhfb,
subject = "Cryptography; Great Britain; History; 20th century;
World War, 1939-1945; Electronic intelligence;
Cryptography.; Electronic intelligence.; Bletchley Park
(Milton Keynes, England); England; Milton Keynes;
Bletchley Park",
tableofcontents = "Preface / xiii \\
Editorial Notes / xiv \\
Notes on Vocabulary / xiv \\
List of Abbreviations / xv \\
Cryptanalytic Significance of the Analysis of Tunny, by
Whitfield Diffie / xvii \\
Editors' Introduction, by Whitfield Diffie and J. V.
Field / xxv \\
Statistics at Bletchley Park, by S. L. Zabell / lxxv
\\
Biographies of Authors / ciii \\
Notes on the Editors of the Present Volume / cvii \\
List of Figures / cix \\
General Report on Tunny, with emphasis on statistical
methods / 1 \\
Part 0: Preface \\
01: Preface / 3 \\
Part 1: Introduction \\
11: German Tunny / 6 \\
12: Cryptographic Aspects / 22 \\
13: Machines / 32 \\
14: Organisation / 35 \\
15: Some Historical Notes / 39 \\
Part 2: Methods of Solution \\
21: Some Probability Techniques / 43 \\
22: Statistical Foundations / 50 \\
23: Machine Setting / 80 \\
24: Rectangling / 110 \\
25: Chi-Breaking from Cipher / 139 \\
26: Wheel-Breaking from Key / 185 \\
27: Cribs / 219 \\
28: Language Methods / 237 \\
Part 3: Organisation \\
31: Mr Newman's Section / 262 \\
32: Organisation of the Testery / 267 \\
33: Knockholt / 268 \\
34: Registration and Circulation / 269 \\
35: Tapemaking and Checking / 271 \\
36: Chi-Breaking from Cipher / 275 \\
37: Machine Setting Organisation / 277 \\
38: Wheel-Breaking from Key, Organisation / 280 \\
39: Language Methods / 282 \\
Part 4: Early Methods and History \\
41: The First Break / 284 \\
42: Early Hand Methods / 290 \\
43: Testery Methods 1942--1944 / 298 \\
44: Hand Statistical Methods / 305 \\
Part 5: Machines \\
51: Introductory / 309 \\
52: Development of Robinson and Colossus / 312 \\
53: Colossus / 316 \\
54: Robinson / 336 \\
55: Specialized Counting Machines / 346 \\
56: Copying Machines / 350 \\
57: Simple machines / 361 \\
58: Photographs / 362 \\
Part 6: Raw Materials \\
61: Raw Materials \\
Production, with Plans of Tunny Links / 381 \\
Part 7: References \\
71: Glossary and Index / 387 \\
72: Notation / 435 \\
73: Bibliography / 441 \\
74: Chronology / 444 \\
Part 8: Conclusions \\
81: Conclusions / 452 \\
Part 9: Appendices \\
91: The 5202 Machine / 456 \\
92: Recovery of Motor Patterns from De-chi / 471 \\
93: Thrasher / 482 \\
94: Research into the QEP System / 484 \\
95: Mechanical Flags / 488 \\
Appendix A: Transmission of Teleprinter Signals, by J.
A. Reeds / 495 \\
Appendix B: Activities at Knockholt, by J. A. Reeds /
503 \\
Appendix C: The 5202 Machine, by J. A. Reeds / 530 \\
Appendix D: Initial Conception of Colossus, by J. A.
Reeds / 535 \\
Appendix E: List of Scanned Exhibits / 540 \\
Supplementary Glossary / 542 \\
Biographical Notes / 547 \\
Notes / 561 \\
Bibliography / 624 \\
Index / 645",
}
@Book{Joye:2012:FAC,
editor = "Marc Joye and Michael Tunstall",
booktitle = "Fault Analysis in Cryptography",
title = "Fault Analysis in Cryptography",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvi + 354 + 98",
year = "2012",
DOI = "https://doi.org/10.1007/978-3-642-29656-7",
ISBN = "3-642-29655-6, 3-642-29656-4 (e-book)",
ISBN-13 = "978-3-642-29655-0, 978-3-642-29656-7 (e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.A25 F38 2012; QA76.9.D35",
bibdate = "Sat Jun 10 08:35:17 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/978-3-642-29656-7",
abstract = "In the 1970s researchers noticed that radioactive
particles produced by elements naturally present in
packaging material could cause bits to flip in
sensitive areas of electronic chips. Research into the
effect of cosmic rays on semiconductors, an area of
particular interest in the aerospace industry, led to
methods of hardening electronic devices designed for
harsh environments. Ultimately various mechanisms for
fault creation and propagation were discovered, and in
particular it was noted that many cryptographic
algorithms succumb to so-called fault attacks.
Preventing fault attacks without sacrificing
performance is nontrivial and this is the subject of
this book. Part I deals with side-channel analysis and
its relevance to fault attacks. The chapters in Part II
cover fault analysis in secret key cryptography, with
chapters on block ciphers, fault analysis of DES and
AES, countermeasures for symmetric-key ciphers, and
countermeasures against attacks on AES. Part III deals
with fault analysis in public key cryptography, with
chapters dedicated to classical RSA and RSA-CRT
implementations, elliptic curve cryptosystems and
countermeasures using fault detection, devices
resilient to fault injection attacks, lattice-based
fault attacks on signatures, and fault attacks on
pairing-based cryptography. Part IV examines fault
attacks on stream ciphers and how faults interact with
countermeasures used to prevent power analysis attacks.
Finally, Part V contains chapters that explain how
fault attacks are implemented, with chapters on fault
injection technologies for microprocessors, and fault
injection and key retrieval experiments on a widely
used evaluation board. This is the first book on this
topic and will be of interest to researchers and
practitioners engaged with cryptographic engineering.",
acknowledgement = ack-nhfb,
subject = "Computer science; Computer hardware; Data structures
(Computer science); Computer engineering; Data
Structures, Cryptology and Information Theory;
Electrical Engineering; Fehleranalyse; Advanced
Encryption Standard; Data Encryption Standard;
Public-Key-Kryptosystem; Kryptoanalyse; Hardware;
Datenstruktur; Computer engineering; Computer
input-output equipment; Computer science; Data
structures (Computer science)",
tableofcontents = "Part 1: Introductory Material \\
Side-Channel Analysis and Its Relevance to Fault
Attacks / Elisabeth Oswald and Fran{\c{c}}ois-Xavier
Standaert \\
Part 2: Fault Analysis in Secret Key Cryptography \\
Attacking Block Ciphers / Christophe Clavier \\
Differential Fault Analysis of DES / Matthieu Rivain
\\
Differential Fault Analysis of the Advanced Encryption
Standard / Christophe Giraud \\
Countermeasures for Symmetric Key Ciphers /
J{\"o}rn-Marc Schmidt and Marcel Medwed \\
On Countermeasures Against Fault Attacks on the
Advanced Encryption Standard / Kaouthar Bousselam,
Giorgio Di Natale, Marie-Lise Flottes and Bruno
Rouzeyre \\
Part 3: Fault Analysis in Public Key Cryptography \\
A Survey of Differential Fault Analysis Against
Classical RSA Implementations / Alexandre Berzati,
C{\'e}cile Canovas-Dumas and Louis Goubin \\
Fault Attacks Against RSA-CRT Implementation / Chong
Hee Kim and Jean-Jacques Quisquater \\
Fault Attacks on Elliptic Curve Cryptosystems /
Abdulaziz Alkhoraidly, Agust{\'i}n Dom{\'i}nguez-Oviedo
and M. Anwar Hasan \\
On Countermeasures Against Fault Attacks on Elliptic
Curve Cryptography Using Fault Detection / Arash Hariri
and Arash Reyhani-Masoleh \\
Design of Cryptographic Devices Resilient to Fault
Injection Attacks Using Nonlinear Robust Codes /
Kahraman D. Akdemir, Zhen Wang, Mark Karpovsky and Berk
Sunar \\
Lattice-Based Fault Attacks on Signatures / Phong Q.
Nguyen and Mehdi Tibouchi \\
Fault Attacks on Pairing-Based Cryptography / Nadia El
Mrabet, Dan Page and Frederik Vercauteren \\
Part 4: Miscellaneous \\
Fault Attacks on Stream Ciphers / Alessandro Barenghi
and Elena Trichina \\
Interaction Between Fault Attack Countermeasures and
the Resistance Against Power Analysis Attacks /
Francesco Regazzoni, Luca Breveglieri, Paolo Ienne and
Israel Koren \\
Part 5: Implementing Fault Attacks \\
Injection Technologies for Fault Attacks on
Microprocessors / Alessandro Barenghi, Guido M.
Bertoni, Luca Breveglieri, Mauro Pelliccioli and
Gerardo Pelosi \\
Global Faults on Cryptographic Circuits / Sylvain
Guilley and Jean-Luc Danger \\
Fault Injection and Key Retrieval Experiments on an
Evaluation Board / Junko Takahashi, Toshinori Fukunaga,
Shigeto Gomisawa, Yang Li and Kazuo Sakiyama, et al",
}
@Book{Ludge:2012:NLD,
editor = "Kathy L{\"u}dge",
booktitle = "Nonlinear laser dynamics: from quantum dots to
cryptography",
title = "Nonlinear laser dynamics: from quantum dots to
cryptography",
publisher = "Wiley-VCH",
address = "Weinheim",
pages = "xx + 387",
year = "2012",
ISBN = "3-527-41100-3 (hardcover), 3-527-63984-5 (ePDF),
3-527-63982-9 (oBook), 3-527-63983-7 (ePub),
3-527-63985-3 (Mobi)",
ISBN-13 = "978-3-527-41100-9 (hardcover), 978-3-527-63984-7
(ePDF), 978-3-527-63982-3 (oBook), 978-3-527-63983-0
(ePub), 978-3-527-63985-4 (Mobi)",
LCCN = "QC688 .N66 2012; QC689.55.S45 N665 2012",
bibdate = "Thu Mar 13 14:48:15 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "References in nonlinear dynamics and complexity",
URL = "http://www.loc.gov/catdir/enhancements/fy1403/2012360633-b.html;
http://www.loc.gov/catdir/enhancements/fy1403/2012360633-d.html;
http://www.loc.gov/catdir/enhancements/fy1403/2012360633-t.html",
acknowledgement = ack-nhfb,
subject = "Lasers; Nonlinear optics; Semiconductor lasers",
tableofcontents = "Prefix \\
List of Contributors \\
Part I: Nanostructured Devices \\
Modeling quantum-dot-based devices / Kathy Ludge \\
Exploiting noise and polarization bistability in
vertical-cavity surface emitting lasers for fast pulse
generation and logic operations / Jordi Zamora-Munt and
Cristina Masoller \\
Mode competition driving laser nonlinear dynamics /
Marc Sciamanna \\
Quantum cascade laser: an emerging technology / Andreas
Wacker \\
Controlling charge domain dynamics in superlattices \\
Mark T. Greenaway, Alexander G. Balanov, and T. Mark
Fromhold \\
Part II: Coupled Laser Device \\
Quantum dot laser tolerance to optical feedback /
Christian Otto, Kathy L{\"u}dge, Evgeniy Viktorov, and
Thomas Erneux \\
Bifurcation study of a semiconductor laser with
saturable absorber and delayed optical feedback / Bernd
Krauskopf and Jamie J. Walker \\
Modeling of passively mode-locked semiconductor lasers
/ Andrei G. Vladimirov, Dmitrii Rachinskii and Matthias
Wolfrum \\
Dynamical and synchronization properties of
delay-coupled lasers / Cristina M. Gonzalez, Miguel C.
Soriano, M. Carme Torrent, Jordi Garcia-Ojalvo, and
Ingo Fischer \\
Complex networks based on coupled two-mode lasers /
Andreas Amann \\
Part III: Synchronization and Cryptography \\
Noise synchronization and stochastic bifurcations in
lasers / Sebastian M. Wieczorek \\
Emergence of one-and two-cluster states in populations
of globally pulse-coupled oscillators / Leonhard Lucken
and Serhiy Yanchuk \\
Broadband chaos / Kristine E. Callan, Lucas Illing, and
Daniel J. Gauthier \\
Synchronization of chaotic networks and secure
communication / Ido Kanter and Wolfgang Kinzel \\
Desultory dynamics in diode-lasers: drift, diffusion,
and delay / K. Alan Shore \\
Index",
}
@Proceedings{Miri:2012:SAC,
editor = "Ali Miri and Serge Vaudenay",
booktitle = "{Selected Areas in Cryptography: 18th International
Workshop, SAC 2011, Toronto, ON, Canada, August 11--12,
Revised Selected Papers}",
title = "{Selected Areas in Cryptography: 18th International
Workshop, SAC 2011, Toronto, ON, Canada, August 11--12,
Revised Selected Papers}",
volume = "7118",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28495-3",
ISBN = "3-642-28495-7",
ISBN-13 = "978-3-642-28495-3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri May 25 08:11:02 MDT 2012",
bibsource = "http://link.springer-ny.com/link/service/series/0558/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-28495-3",
acknowledgement = ack-nhfb,
}
@Book{Naccache:2012:CST,
editor = "David Naccache",
booktitle = "{Cryptography and Security: From Theory to
Applications: Essays Dedicated to Jean-Jacques
Quisquater on the Occasion of His 65th Birthday}",
title = "{Cryptography and Security: From Theory to
Applications: Essays Dedicated to Jean-Jacques
Quisquater on the Occasion of His 65th Birthday}",
volume = "6805",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28367-3",
ISBN = "3-642-28367-5",
ISBN-13 = "978-3-642-28367-3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri May 25 08:11:02 MDT 2012",
bibsource = "http://link.springer-ny.com/link/service/series/0558/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-28367-3",
acknowledgement = ack-nhfb,
}
@Proceedings{Pointcheval:2012:ACE,
editor = "David Pointcheval and Thomas Johansson",
booktitle = "{Advances in Cryptology --- EUROCRYPT 2012: 31st
Annual International Conference on the Theory and
Applications of Cryptographic Techniques, Cambridge,
UK, April 15--19. Proceedings}",
title = "{Advances in Cryptology --- EUROCRYPT 2012: 31st
Annual International Conference on the Theory and
Applications of Cryptographic Techniques, Cambridge,
UK, April 15--19. Proceedings}",
volume = "7237",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29010-7",
ISBN = "3-642-29010-8",
ISBN-13 = "978-3-642-29010-7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri May 25 08:11:00 MDT 2012",
bibsource = "http://link.springer-ny.com/link/service/series/0558/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-29010-7",
acknowledgement = ack-nhfb,
}
@Proceedings{IEEE:2013:PIS,
editor = "{IEEE}",
booktitle = "{Proceedings of the 21st IEEE Symposium on Computer
Arithmetic, Austin, Texas, USA, 8--10 April 2013}",
title = "{Proceedings of the 21st IEEE Symposium on Computer
Arithmetic, Austin, Texas, USA, 8--10 April 2013}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xvi + 229",
year = "2013",
ISBN = "0-7695-4957-8",
ISBN-13 = "978-0-7695-4957-6",
ISSN = "1063-6889",
LCCN = "QA76.9.C62 S95 2013",
bibdate = "Sat Aug 01 08:03:11 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = ack-nhfb,
keywords = "computer arithmetic units; correctness proofs;
cryptography; domain specific designs; error analysis;
exascale computing; floating point arithmetic;
floating-point error analysis; formal verification;
function approximation; modular arithmetic; theorem
proving; verification",
}
@Proceedings{Sahai:2013:TCT,
editor = "Amit Sahai",
booktitle = "{Theory of cryptography: 10th Theory of Cryptography
Conference, TCC 2013, Tokyo, Japan, March 3--6, 2013:
proceedings}",
title = "{Theory of cryptography: 10th Theory of Cryptography
Conference, TCC 2013, Tokyo, Japan, March 3--6, 2013:
proceedings}",
volume = "7785",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 724",
year = "2013",
DOI = "https://doi.org/10.1007/978-3-642-36594-2",
ISBN = "3-642-36594-9 (paperback), 3-642-36593-0 (e-book)",
ISBN-13 = "978-3-642-36594-2 (paperback), 978-3-642-36593-5
(e-book)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
LCCN = "QA76.9.A25 T473 2013",
bibdate = "Thu Aug 21 08:27:18 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.loc.gov/catdir/enhancements/fy1310/2013931230-d.html;
http://www.loc.gov/catdir/enhancements/fy1310/2013931230-t.html;
http://www.springerlink.com/content/978-3-642-36594-2",
acknowledgement = ack-nhfb,
meetingname = "Theory of Cryptography Conference (10th: 2013: Tokyo,
Japan)",
remark = "International conference proceedings.",
series-URL = "http://link.springer.com/bookseries/558",
subject = "Data encryption (Computer science); Congresses",
}
@Book{Sencar:2013:DIF,
editor = "Husrev T. Sencar and Nasir D. Memon",
booktitle = "Digital image forensics: there is more to a picture
than meets the eye",
title = "Digital image forensics: there is more to a picture
than meets the eye",
publisher = pub-SV,
address = pub-SV:adr,
pages = "viii + 370",
year = "2013",
DOI = "https://doi.org/10.1007/978-1-4614-0757-7",
ISBN = "1-4614-0757-5 (ebook)",
ISBN-13 = "978-1-4614-0757-7 (ebook), 978-1-4614-0756-0",
LCCN = "TA1637 .D54 2013",
bibdate = "Fri Aug 15 13:56:00 MDT 2014",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://site.ebrary.com/id/10589376",
abstract = "Photographic imagery has come a long way from the
pinhole cameras of the nineteenth century. Digital
imagery, and its applications, develops in tandem with
contemporary society's sophisticated literacy of this
subtle medium. This book examines the ways in which
digital images have become ever more ubiquitous as
legal and medical evidence, just as they have become
our primary source of news and have replaced
paper-based financial documentation.Crucially, the
contributions also analyze the very profound problems
which have arisen alongside the digital image, issues
of veracity and progeny that demand systematic and
detailed response: It looks real, but is it? What
camera captured it? Has it been doctored or subtly
altered? Attempting to provide answers to these
slippery issues, the book covers how digital images are
created, processed and stored before moving on to set
out the latest techniques for forensically examining
images, and finally addressing practical issues such as
courtroom admissibility. In an environment where even
novice users can alter digital media, this
authoritative publication will do much so stabilize
public trust in these real, yet vastly flexible, images
of the world around us.",
acknowledgement = ack-nhfb,
subject = "Image processing; Digital techniques; Computer crimes;
Investigation; COMPUTERS / Image Processing; COMPUTERS
/ Digital Media / Graphics Applications; PHOTOGRAPHY /
Techniques / Digital; TECHNOLOGY and ENGINEERING /
Imaging Systems; Investigation;! Digital techniques.",
tableofcontents = "Part 1: Background on Digital Images \\
Digital Camera Image Formation: Introduction and
Hardware / James E. Adams Jr. and Bruce Pillman \\
Digital Camera Image Formation: Processing and Storage
/ Aaron Deever, Mrityunjay Kumar and Bruce Pillman \\
Digital Image Formats / Khalid Sayood \\
Searching and Extracting Digital Image Evidence /
Qiming Li \\
Part 2: Techniques Attributing an Image to Its Source
\\
Image and Video Source Class Identification / Alex C.
Kot and Hong Cao \\
Sensor Defects in Digital Image Forensic / Jessica
Fridrich \\
Source Attribution Based on Physical Defects in Light
Path / Ahmet Emir Dirik \\
Part 3: Techniques Verifying the Integrity and
Authenticity of Image Evidence \\
Natural Image Statistics in Digital Image Forensics /
Siwei Lyu \\
Detecting Doctored Images / Micah K. Johnson \\
Discrimination of Computer Synthesized or Recaptured
Images from Real Images / Tian-Tsong Ng and Shih-Fu
Chang \\
Part 4: Digital Image Forensics in Practice \\
Courtroom Considerations in Digital Image Forensics /
Rebecca Mercuri \\
Counter-Forensics: Attacking Image Forensics / Rainer
B{\"o}hme and Matthias Kirchner",
}
@Proceedings{Joux:2014:SAC,
editor = "Antoine Joux and Amr Youssef",
booktitle = "{Selected areas in cryptography --- SAC 2014: 21st
International Conference, Montr{\'e}al, QC, Canada,
August 14--15, 2014: revised selected papers}",
title = "{Selected areas in cryptography --- SAC 2014: 21st
International Conference, Montr{\'e}al, QC, Canada,
August 14--15, 2014: revised selected papers}",
volume = "8781",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 379",
year = "2014",
ISBN = "3-319-13050-1 (print), 3-319-13051-X (e-book)",
ISBN-13 = "978-3-319-13050-7 (print), 978-3-319-13051-4
(e-book)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
LCCN = "QA76.9.A25",
bibdate = "Fri Mar 13 08:23:12 MDT 2015",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
series = "Lecture notes in computer science: LNCS sublibrary. SL
4, Security and cryptology",
abstract = "This book constitutes the proceedings of the 21st
International Conference on Selected Areas in
Cryptography, SAC 2014, held in Montreal, QC, Canada,
in August 2014. The 22 papers presented in this volume
were carefully reviewed and selected from 103
submissions. There are four areas covered at each SAC
conference. The three permanent areas are: design and
analysis of symmetric key primitives and cryptosystems,
including block and stream ciphers, hash function, MAC
algorithms, cryptographic permutations, and
authenticated encryption schemes; efficient
implementations of symmetric and public key algorithms;
mathematical and algorithmic aspects of applied
cryptology. This year, the fourth area for SAC 2014 is:
algorithms for cryptography, cryptanalysis and their
complexity analysis.",
acknowledgement = ack-nhfb,
meetingname = "SAC 2014 (2014 : Montreal, Qu{\'e}bec)",
subject = "Computer science; Data protection; Data encryption
(Computer science); Coding theory; Computer software",
}
@Book{Lane:2014:PBD,
editor = "Julia I. Lane and Victoria Stodden and Stefan Bender
and Helen Nissenbaum",
booktitle = "Privacy, big data, and the public good: frameworks for
engagement",
title = "Privacy, big data, and the public good: frameworks for
engagement",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "xix + 322",
year = "2014",
ISBN = "1-107-06735-9 (hardcover), 1-107-63768-6 (paperback)",
ISBN-13 = "978-1-107-06735-6 (hardcover), 978-1-107-63768-9
(paperback)",
LCCN = "JC596 .P747 2015",
bibdate = "Sat Jun 28 10:20:29 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/internet2010.bib;
z3950.loc.gov:7090/Voyager",
abstract = "Massive amounts of data on human beings can now be
analyzed. Pragmatic purposes abound, including selling
goods and services, winning political campaigns, and
identifying possible terrorists. Yet 'big data' can
also be harnessed to serve the public good: scientists
can use big data to do research that improves the lives
of human beings, improves government services, and
reduces taxpayer costs. In order to achieve this goal,
researchers must have access to this data - raising
important privacy questions. What are the ethical and
legal requirements? What are the rules of engagement?
What are the best ways to provide access while also
protecting confidentiality? Are there reasonable
mechanisms to compensate citizens for privacy loss? The
goal of this book is to answer some of these questions.
The book's authors paint an intellectual landscape that
includes legal, economic, and statistical frameworks.
The authors also identify new practical approaches that
simultaneously maximize the utility of data access
while minimizing information risk.",
acknowledgement = ack-nhfb,
subject = "privacy, right of; research; moral and ethical
aspects; big data; social aspects; common good",
tableofcontents = "Part I. Conceptual Framework: Editors' introduction
/ Julia Lane, Victoria Stodden, Stefan Bender and Helen
Nissenbaum \\
1. Monitoring, datafication, and consent: legal
approaches to privacy in the big data context /
Katherine J. Strandburg \\
2. Big data's end run around anonymity and consent /
Solon Barocas and Helen Nissenbaum \\
3. The economics and behavioral economics of privacy /
Alessandro Acquisti \\
4. The legal and regulatory framework: what do the
rules say about data analysis? / Paul Ohm \\
5. Enabling reproducibility in big data research:
balancing confidentiality and scientific transparency /
Victoria Stodden \\
Part II. Practical Framework: Editors' introduction /
Julia Lane, Victoria Stodden, Stefan Bender and Helen
Nissenbaum \\
6. The value of big data for urban science / Steven E.
Koonin and Michael J. Holland \\
7. The new role of cities in creating value / Robert
Goerge \\
8. A European perspective / Peter Elias \\
9. Institutional controls: the new deal on data /
Daniel Greenwood, Arkadiusz Stopczynski, Brian Sweatt,
Thomas Hardjono and Alex Pentland \\
10. The operational framework: engineered controls /
Carl Landwehr \\
11. Portable approaches to informed consent and open
data / John Wilbanks \\
Part III. Statistical Framework: Editors' introduction
/ Julia Lane, Victoria Stodden, Stefan Bender and Helen
Nissenbaum \\
12. Extracting information from big data / Frauke
Kreuter and Roger Peng \\
13. Using statistics to protect privacy / Alan F. Karr
and Jerome P. Reiter \\
14. Differential privacy: a cryptographic approach to
private data analysis / Cynthia Dwork",
}
@Proceedings{Lindell:2014:TCT,
editor = "Yehuda Lindell",
booktitle = "{Theory of cryptography: 11th Theory of Cryptography
Conference, TCC 2014, San Diego, CA, USA, February
24--26, 2014 proceedings}",
title = "{Theory of cryptography: 11th Theory of Cryptography
Conference, TCC 2014, San Diego, CA, USA, February
24--26, 2014 proceedings}",
volume = "8349",
publisher = pub-SV,
address = pub-SV:adr,
pages = "738",
year = "2014",
DOI = "https://doi.org/10.1007/978-3-642-54242-8",
ISBN = "3-642-54241-7 (paperback), 3-642-54242-5 (ebk.)",
ISBN-13 = "978-3-642-54241-1 (paperback), 978-3-642-54242-8
(ebk.)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
LCCN = "QA76.9.A25 T473 2014",
bibdate = "Thu Aug 21 08:27:20 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2013a.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-54242-8",
abstract = "This book constitutes the refereed proceedings of the
11th Theory of Cryptography Conference, TCC 2014, held
in San Diego, CA, USA, in February 2014. The 30 revised
full papers presented were carefully reviewed and
selected from 90 submissions. The papers are organized
in topical sections on obfuscation, applications of
obfuscation, zero knowledge, black-box separations,
secure computation, coding and cryptographic
applications, leakage, encryption, hardware-aided
secure protocols, and encryption and signatures.",
acknowledgement = ack-nhfb,
meetingname = "Theory of Cryptography Conference (11th: 2014: San
Diego, Calif.)",
remark = "International conference proceedings.",
series-URL = "http://link.springer.com/bookseries/558",
subject = "Data encryption (Computer science); Congresses",
}
@Proceedings{IEEE:2015:ISS,
editor = "{IEEE}",
booktitle = "{2015 IEEE Symposium on Security and Privacy (SP 2015)
San Jose, California, USA, 18--20 May 2015}",
title = "{2015 IEEE Symposium on Security and Privacy (SP 2015)
San Jose, California, USA, 18--20 May 2015}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xix + 952",
year = "2015",
ISBN = "1-4673-6949-7 (print), 1-4673-6950-0 (e-book)",
ISBN-13 = "978-1-4673-6949-7, 978-1-4673-6950-3 (e-book)",
ISSN = "1081-6011 (print), 2375-1207 (electronic)",
ISSN-L = "1081-6011",
LCCN = "QA76.9.A25",
bibdate = "Mon Feb 10 08:59:08 MST 2020",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.gbv.de/dms/tib-ub-hannover/836112652.pdf",
acknowledgement = ack-nhfb,
}
@Proceedings{Montuschi:2016:ISC,
editor = "Paolo Montuschi and Michael Schulte and Javier Hormigo
and Stuart Oberman and Nathalie Revol",
booktitle = "{2016 IEEE 23nd Symposium on Computer Arithmetic
(ARITH 2016), Santa Clara, California, USA, 10--13 July
2016}",
title = "{2016 IEEE 23nd Symposium on Computer Arithmetic
(ARITH 2016), Santa Clara, California, USA, 10--13 July
2016}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xxi + 182",
year = "2016",
ISBN = "1-5090-1615-5",
ISBN-13 = "978-1-5090-1615-0",
ISSN = "1063-6889",
LCCN = "QA76.9.C62 S95 2016",
bibdate = "Fri Dec 16 15:16:45 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/mathcw.bib",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=7562813",
acknowledgement = ack-nhfb,
keywords = "computer arithmetic units; correctness proofs;
cryptography; domain specific designs; error analysis;
exascale computing; floating point arithmetic;
floating-point error analysis; formal verification;
function approximation; modular arithmetic; theorem
proving; verification",
}
@Book{Ryan:2016:NCE,
editor = "Peter Y. A. Ryan and David Naccache and Jean-Jacques
Quisquater",
booktitle = "The New Codebreakers: essays dedicated to {David Kahn}
on the occasion of his 85th birthday",
title = "The New Codebreakers: essays dedicated to {David Kahn}
on the occasion of his 85th birthday",
volume = "9100",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 551",
year = "2016",
DOI = "https://doi.org/10.1007/978-3-662-49301-4",
ISBN = "3-662-49300-4 (paperback); 3-662-49301-2 (e-book)",
ISBN-13 = "978-3-662-49300-7 (paperback); 978-3-662-49301-4
(e-book)",
LCCN = "QA76.9.A25",
bibdate = "Fri Jul 29 08:49:32 MDT 2022",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = ser-LNCS,
URL = "http://link.springer.com/book/10.1007/978-3-662-49301-4",
acknowledgement = ack-nhfb,
subject = "Criptografia; Reculls d'escrits; Seguretat
inform{\'y}atica; Criptografia.; Seguretat
inform{\'y}atica.; Reculls d'escrits.",
tableofcontents = "Front Matter / i--xiv \\
History \\
Front Matter / 1--1 \\
Mary of Guise's Enciphered Letters / Val{\'e}rie
Nachef, Jacques Patarin, Armel Dubois-Nayt / 3--24 \\
About Professionalisation in the Intelligence
Community: The French Cryptologists (ca 1870 ca 1945) /
S{\'e}bastien-Yves Laurent / 25--33 \\
Myths and Legends of the History of Cryptology / Sophie
de Lastours / 34--39 \\
Vernam, Mauborgne, and Friedman: The One-Time Pad and
the Index of Coincidence / Steven M. Bellovin / 40--66
\\
Technology --- Past, Present, Future \\
Front Matter / 67--67 \\
The Fall of a Tiny Star / Flavio D. Garcia, Bart Jacobs
/ 69--87 \\
Post-Quantum Cryptography: State of the Art / Johannes
A. Buchmann, Denis Butin, Florian G{\"o}pfert, Albrecht
Petzoldt / 88--108 \\
What is the Future of Cryptography? / Yvo Desmedt /
109--122 \\
Efficient Cryptographic Implementations / Front Matter
/ 123--123 \\
Bitsliced High-Performance AES-ECB on GPUs / Rone Kwei
Lim, Linda Ruth Petzold, {\c{C}}etin Kaya Ko{\c{c}} /
125--133 \\
Buying AES Design Resistance with Speed and Energy /
Rodrigo Portella do Canto, Roman Korkikian, David
Naccache / 134--147 \\
Double-Speed Barrett Moduli / R{\'e}mi G{\'e}raud,
Diana Maimu , David Naccache / 148--158 \\
Treachery and Perfidy \\
Front Matter / 159--159 \\
Failure is Also an Option / Antoine Amarilli, Marc
Beunardeau, R{\'e}mi G{\'e}raud, David Naccache /
161--165 \\
How to (Carefully) Breach a Service Contract? /
C{\'e}line Chevalier, Damien Gaumont, David Naccache,
Rodrigo Portella Do Canto / 166--173 \\
Information Security \\
Front Matter / 175--175 \\
SpoofKiller: You Can Teach People How to Pay, but Not
How to Pay Attention \\
Markus Jakobsson, Hossein Siadati / 177--194 \\
Cyber-Physical Systems Security \\
Dieter Gollmann, Marina Krotofil / 195--204 \\
Information Security \\
Practical Techniques Building on Encryption for
Protecting and Managing Data in the Cloud \\
Sabrina De Capitani di Vimercati, Sara Foresti,
Giovanni Livraga, Pierangela Samarati / 205--239 \\
Cryptanalysis \\
Front Matter / 241--241 \\
Cryptography as an Attack Technology: Proving the
RSA\slash Factoring Kleptographic Attack / Adam Young,
Moti Yung / 243--255 \\
Dual EC: A Standardized Back Door / Daniel J.
Bernstein, Tanja Lange, Ruben Niederhagen / 256--281
\\
An Improved Differential Attack on Full GOST / Nicolas
T. Courtois / 282--303 \\
Cryptographic Hash Functions and Expander Graphs: The
End of the Story? / Christophe Petit, Jean-Jacques
Quisquater / 304--311 \\
Side-Channel Attacks \\
Front Matter / 313--313 \\
Polynomial Evaluation and Side Channel Analysis /
Claude Carlet, Emmanuel Prouff / 315--341 \\
Photonic Power Firewalls / Jean-Max Dutertre,
Amir-Pasha Mirbaha, David Naccache, Assia Tria /
342--354 \\
A Heuristic Approach to Assist Side Channel Analysis of
the Data Encryption Standard / Christophe Clavier,
Djamal Rebaine / 355--373 \\
Improving the Big Mac Attack on Elliptic Curve
Cryptography / Jean-Luc Danger, Sylvain Guilley,
Philippe Hoogvorst, C{\'e}dric Murdica, David Naccache
/ 374--386 \\
Randomness \\
Front Matter / 387--387 \\
Randomness Testing: Result Interpretation and Speed /
Marek S{\'y}s, Vashek Maty{\'a} / 389--395 \\
A Fully-Digital Chaos-Based Random Bit Generator /
Marco Bucci, Raimondo Luzzi / 396--414 \\
Embedded System Security \\
Front Matter / 415--415 \\
Secure Application Execution in Mobile Devices / Mehari
G. Msgna, Houda Ferradi, Raja Naeem Akram, Konstantinos
Markantonakis / 417--438 \\
Hardware-Enforced Protection Against Buffer Overflow
Using Masked Program Counter / Jean-Luc Danger, Sylvain
Guilley, Thibault Porteboeuf, Florian Praden,
Micha{\"e}l Timbert / 439--454 \\
Public-Key Cryptography \\
Front Matter / 455--455 \\
Hierarchical Identities from Group Signatures and
Pseudonymous Signatures / Julien Bringer, Herv{\'e}
Chabanne, Roch Lescuyer, Alain Patey / 457--469 \\
Secure ElGamal-Type Cryptosystems Without Message
Encoding / Marc Joye / 470--478 \\
Public-Key Cryptography \\
Safe-Errors on SPA Protected Implementations with the
Atomicity Technique / Pierre-Alain Fouque, Sylvain
Guilley, C{\'e}dric Murdica, David Naccache / 479--493
\\
Models and Protocols \\
Front Matter / 495--495 \\
Clever Arbiters Versus Malicious Adversaries / Serge
Vaudenay / 497--517 \\
Security Analysis of the Modular Enhanced Symmetric
Role Authentication (mERA) Protocol /
Jean-S{\'e}bastien Coron / 518--542 \\
Crypto Santa / Peter Y. A. Ryan / 543--549 \\
Back Matter / 551--551",
}
@Book{Lindell:2017:TFC,
editor = "Yehuda Lindell",
booktitle = "Tutorials on the Foundations of Cryptography:
Dedicated to {Oded Goldreich}",
title = "Tutorials on the Foundations of Cryptography:
Dedicated to {Oded Goldreich}",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xv + 450",
year = "2017",
DOI = "https://doi.org/10.1007/978-3-319-57048-8",
ISBN = "3-319-57047-1, 3-319-57048-X (e-book)",
ISBN-13 = "978-3-319-57047-1, 978-3-319-57048-8 (e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.A25 T84 2017",
bibdate = "Sat Jun 10 08:34:38 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/978-3-319-57048-8",
abstract = "This is a graduate textbook of advanced tutorials on
the theory of cryptography and computational
complexity. In particular, the chapters explain aspects
of garbled circuits, public-key cryptography,
pseudorandom functions, one-way functions, homomorphic
encryption, the simulation proof technique, and the
complexity of differential privacy. Most chapters
progress methodically through motivations, foundations,
definitions, major results, issues surrounding
feasibility, surveys of recent developments, and
suggestions for further study. This book honors
Professor Oded Goldreich, a pioneering scientist,
educator, and mentor. Oded was instrumental in laying
down the foundations of cryptography, and he inspired
the contributing authors, Benny Applebaum, Boaz Barak,
Andrej Bogdanov, Iftach Haitner, Shai Halevi, Yehuda
Lindell, Alon Rosen, and Salil Vadhan, themselves
leading researchers on the theory of cryptography and
computational complexity. The book is appropriate for
graduate tutorials and seminars, and for self-study by
experienced researchers, assuming prior knowledge of
the theory of cryptography.",
acknowledgement = ack-nhfb,
subject = "Data encryption (Computer science); Data encryption
(Computer science); Computer Science; Data Structures,
Cryptology and Information Theory; Theory of
Computation",
tableofcontents = "Front Matter / i--xv \\
Garbled Circuits as Randomized Encodings of Functions:
a Primer / Benny Applebaum / 1--44 \\
The Complexity of Public-Key Cryptography / Boaz Barak
/ 45--77 \\
Pseudorandom Functions: Three Decades Later / Andrej
Bogdanov, Alon Rosen / 79--158 \\
The Many Entropies in One-Way Functions / Iftach
Haitner, Salil Vadhan / 159--217 \\
Homomorphic Encryption / Shai Halevi / 219--276 \\
How to Simulate It A Tutorial on the Simulation Proof
Technique / Yehuda Lindell / 277--346 \\
The Complexity of Differential Privacy / Salil Vadhan /
347--450",
}
@Proceedings{Tenca:2018:PIS,
editor = "Alexandre Tenca and Naofumi Takagi",
booktitle = "Proceedings of the {25th International Symposium on
Computer Arithmetic, 25--27 June 2018 Amherst, MA,
USA}",
title = "Proceedings of the {25th International Symposium on
Computer Arithmetic, 25--27 June 2018 Amherst, MA,
USA}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "17 + 152",
month = jun,
year = "2018",
DOI = "https://doi.org/10.1109/ARITH.2018.8464697",
ISBN = "1-5386-2612-8 (USB), 1-5386-2665-9",
ISBN-13 = "978-1-5386-2612-2 (USB), 978-1-5386-2613-9,
978-1-5386-2665-8",
ISSN = "2576-2265",
LCCN = "QA76.9.C62",
bibdate = "Fri Jan 31 08:05:31 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "IEEE catalog number CFP18121-USB.",
abstract = "Presents the title page of the proceedings record.",
acknowledgement = ack-nhfb,
subject = "ARITH-25; Computer arithmetic; Congresses; Computer
programming; Floating-point arithmetic; Computer
arithmetic and logic units",
}
@Book{Goldreich:2019:PSF,
editor = "Oded Goldreich",
booktitle = "Providing Sound Foundations for Cryptography: On the
Work of {Shafi Goldwasser} and {Silvio Micali}",
title = "Providing Sound Foundations for Cryptography: On the
Work of {Shafi Goldwasser} and {Silvio Micali}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xxxv + 800",
month = oct,
year = "2019",
DOI = "https://doi.org/10.1145/3335741",
ISBN = "1-4503-7266-X (hardcover), 1-4503-7266-X (paperback),
1-4503-7267-8 (e-pub)",
ISBN-13 = "978-1-4503-7266-4 (hardcover), 978-1-4503-7266-4
(paperback), 978-1-4503-7267-1 (e-pub)",
ISSN = "2374-6777",
LCCN = "TK5102.94 .P767 2019",
bibdate = "Wed Apr 28 13:29:16 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/acm-turing-awards.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
abstract = "Cryptography is concerned with the construction of
schemes that withstand any abuse. A cryptographic
scheme is constructed so as to maintain a desired
functionality, even under malicious attempts aimed at
making it deviate from its prescribed behavior. The
design of cryptographic systems must be based on firm
foundations, whereas ad hoc approaches and heuristics
are a very dangerous way to go. These foundations were
developed mostly in the 1980s, in works that are all
co-authored by Shafi Goldwasser and/or Silvio Micali.
These works have transformed cryptography from an
engineering discipline, lacking sound theoretical
foundations, into a scientific field possessing a
well-founded theory, which influences practice as well
as contributes to other areas of theoretical computer
science. This book celebrates these works, which were
the basis for bestowing the 2012 A. M. Turing Award
upon Shafi Goldwasser and Silvio Micali. A significant
portion of this book reproduces some of these works,
and another portion consists of scientific perspectives
by some of their former students. The highlight of the
book is provided by a few chapters that allow the
readers to meet Shafi and Silvio in person. These
include interviews with them, their biographies and
their Turing Award lectures.",
acknowledgement = ack-nhfb,
subject = "Computer scientists; United States; Biography; Israel;
Italy; Cryptography; Data processing; Electronic data
processing; Distributed processing; Computer
algorithms; Computer algorithms.; Computer scientists.;
Cryptography.; Data processing.; Distributed
processing.",
tableofcontents = "part I. Biographies, interviews, and award
lectures. 1. A story behind every problem: a brief
biography of Shafi Goldwasser \\
2. One obsession at a time: a brief biography of Silvio
Micali \\
3. An interview with Shafi Goldwasser \\
4. An interview with Silvio Micali \\
5. The cryptographic lens: Shafi Goldwasser's Turing
Lecture \\
6. Proofs, according to Silvio: Silvio Micali's Turing
Lecture \\
Part II. Original papers \\
7. Probabilistic encryption and how to play mental
poker keeping secret all partial information / Shafi
Goldwasser, Silvio Micali \\
8. The knowledge complexity of interactive
proof-systems (extended abstract) / Shafi Goldwasser,
Silvio Micali, Chales Rackoff \\
9. How to generate cryptographically strong sequences
of pseudo random bits / Manuel Blum, Silvio Micali \\
10. How to construct random functions (extended
abstract) / Oded Goldreich, Shafi Goldwasser, Silvio
Micali \\
11. A ``paradoxical'' solution to the signature problem
/ Shafi Goldwasser, Silvio Micali, Ronald L. Rivest \\
12. Proofs that yield nothing but their validity and a
methodology of cryptographic protocol design (extended
abstract) / Oded Goldreich, Silvio Micali, Avi
Wigderson \\
13. How to play any mental game, or a completeness
theorem for protocols with honest majority (extended
abstract) / Oded Goldreich, Silvio Micali, Avi
Wigderson \\
14. Non-interactive zero-knowledge and its applications
(extended abstract) / Manuel Blum, Paul Feldman, Silvio
Micali \\
15. Completeness theorems for non-cryptographic
fault-tolerant distributed computation (extended
abstract) / Michael Ben-Or, Shafi Goldwasser, Avi
Wigderson \\
16. Multi-prover interactive proofs: how to remove
intractability assumptions / Michael Ben-Or, Shafi
Goldwasser, Joe Kilian, Avi Wigderson \\
part III. Perspectives \\
17. On the foundations of cryptography / Oded Goldreich
\\
18. On the impact of cryptography on complexity theory
/ Oded Goldreich \\
19. On some noncryptographic works of Goldwasser and
Micali / Oded Goldreich \\
20. Fundamentals of fully homomorphic encryption /
Zvika Brakerski \\
21. Interactive proofs for lattice problems / Daniele
Micciancio \\
22. Following a tangent of proofs / Johan H{\^e}astad
\\
23. A tutorial on concurrent zero-knowledge / Rafael
Pass \\
24. Doubly efficient interactive proofs / Guy Rothblem
\\
25. Computational entropy / Salil Vadhan \\
26. A survey of leakage-resilient cryptography / Yael
Tauman Kalai and Leonid Reyzin",
}
@Proceedings{Takagi:2019:ISC,
editor = "Naofumi Takagi and Sylvie Boldo and Martin
Langhammer",
booktitle = "{2019 IEEE 26th Symposium on Computer Arithmetic
ARITH-26 (2019), Kyoto, Japan, 10--12 June 2019}",
title = "{2019 IEEE 26th Symposium on Computer Arithmetic
ARITH-26 (2019), Kyoto, Japan, 10--12 June 2019}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "15 + 220",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1109/ARITH.2019.00001",
ISBN = "1-72813-366-1",
ISBN-13 = "978-1-72813-366-9",
ISSN = "1063-6889",
ISSN-L = "1063-6889",
bibdate = "Fri Jan 31 08:18:07 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "Presents the title page of the proceedings record.",
acknowledgement = ack-nhfb,
keywords = "ARITH-26",
}
