%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "1.127",
%%% date = "14 May 2013",
%%% time = "16:15:15 MDT",
%%% filename = "cryptography2010.bib",
%%% address = "University of Utah
%%% Department of Mathematics, 110 LCB
%%% 155 S 1400 E RM 233
%%% Salt Lake City, UT 84112-0090
%%% USA",
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 581 4148",
%%% URL = "http://www.math.utah.edu/~beebe",
%%% checksum = "65486 23672 97801 1073807",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "bibliography; BibTeX; Blowfish; cipher;
%%% Clipper; code breaking; cracking;
%%% cryptanalysis; crypto; cryptobytes;
%%% cryptography; cryptology; cryptosystem; data
%%% encryption algorithm; decryption; DES;
%%% Diffie; digital signature; encryption;
%%% Hellmann; International Data Encryption
%%% Algorithm (IDEA); Kahn; Kerberos; key escrow;
%%% kleptography; PGP; Pretty Good Privacy;
%%% Rivest; RSA; Schneier; Smart Card;
%%% steganography; Twofish; Zimmermann",
%%% license = "public domain",
%%% supported = "yes",
%%% docstring = "This is bibliography of publications on
%%% cryptography and related subjects, covering
%%% publications for the decade 2010--2019. The
%%% companion file, cryptography.bib, covers
%%% 1606--1999, and cryptography2000.bib covers
%%% 2000-2009.
%%%
%%% Counterpane Systems maintains a Web site at
%%%
%%% http://www.counterpane.com/
%%% http://www.counterpane.com/publish.html
%%%
%%% with a substantial number of their technical
%%% reports and articles available in electronic
%%% form.
%%%
%%% The International Association for Cryptologic
%%% Research (IACR) is a ``non-profit scientific
%%% organization whose primary purpose is to
%%% further research in cryptology and related
%%% fields''. It has a World-Wide Web site at
%%%
%%% http://www.iacr.org/index.html
%%%
%%% IACR publishes an email newsletter thrice
%%% yearly. Back issues are available starting
%%% with Volume 15, Number 1, Fall 1998 at the
%%% above site. It also supports a distinguished
%%% lecture series
%%%
%%% http://www.iacr.org/publications/dl/
%%%
%%% and a preprint server
%%%
%%% http://www.iacr.org/publications/preprint.html
%%%
%%% The Cryptography and Security Group at the
%%% Department of Computer Science and
%%% Engineering of the University of California
%%% at San Diego supports a World-Wide Web site,
%%% called the Theory of Cryptography Library, at
%%%
%%% http://philby.ucsd.edu/cryptolib/
%%%
%%% There is another site with cryptographic
%%% miscellanea and news articles at
%%%
%%% http://cryptome.org/
%%%
%%% There is an archive of the cryptography
%%% mailing list at
%%%
%%% http://www.mail-archive.com/cryptography%40wasabisystems.com/
%%%
%%% All of the cited references from all of the
%%% articles in the online journal CryptoBytes
%%% are also included, with referencedin key
%%% values recording the source of citations.
%%%
%%% However, publications in the journals
%%%
%%% * Cryptologia,
%%% * Designs, Codes, and Cryptography,
%%% * Journal of Cryptology,
%%% * Journal of Discrete Mathematical
%%% Sciences and Cryptography
%%%
%%% are generally excluded, unless they are
%%% cross-referenced by other entries in this
%%% bibliography, because they are covered in
%%% separate companion bibliographies,
%%% cryptologia.bib, designscodescryptogr.bib,
%%% jcryptology.bib, and jdiscrmathscicrypto.bib.
%%%
%%% At version 1.127, the year coverage looked
%%% like this:
%%%
%%% 2002 ( 2) 2006 ( 1) 2010 ( 203)
%%% 2003 ( 1) 2007 ( 1) 2011 ( 179)
%%% 2004 ( 0) 2008 ( 3) 2012 ( 455)
%%% 2005 ( 0) 2009 ( 1) 2013 ( 41)
%%%
%%% Article: 742
%%% Book: 45
%%% InBook: 10
%%% InProceedings: 33
%%% Manual: 1
%%% MastersThesis: 1
%%% Misc: 1
%%% PhdThesis: 5
%%% Proceedings: 35
%%% TechReport: 14
%%%
%%% Total entries: 887
%%%
%%% There is a hypertext bibliography of
%%% classical cryptography at
%%%
%%% http://ourworld.compuserve.com/homepages/crypto/BIB1XX.HTM
%%%
%%% CIPHER, the Electronic Newsletter of the
%%% Technical Committee on Security and Privacy,
%%% A Technical Committee of the Computer Society
%%% of the IEEE, is available on the World-Wide
%%% Web at
%%%
%%% http://www.itd.nrl.navy.mil/ITD/5540/ieee/cipher
%%%
%%% with pointers to all back issues (1994--1998).
%%%
%%% ``CRYPTO-GRAM is a free monthly newsletter
%%% providing summaries, analyses, insights, and
%%% commentaries on cryptography and computer
%%% security. To subscribe, visit
%%%
%%% http://www.counterpane.com/crypto-gram.html
%%%
%%% or send a blank message to
%%%
%%% crypto-gram-subscribe at chaparraltree.com
%%%
%%% Back issues are available on
%%%
%%% http://www.counterpane.com''
%%%
%%% CRYPTO-GRAM is a good source of news of
%%% recent developments in the field, and
%%% contains many interesting essays on aspects
%%% of cryptography.
%%%
%%% There is a Web site on steganography at
%%%
%%% http://www.cl.cam.ac.uk/~fapp2/steganography/
%%%
%%% In this bibliography, entries are sorted
%%% first by ascending year, and within each
%%% year, alphabetically by author or editor,
%%% and then, if necessary, by the 3-letter
%%% abbreviation at the end of the BibTeX
%%% citation tag, using the bibsort -byyear
%%% utility. Year order has been chosen to
%%% make it easier to identify the most recent
%%% work.
%%%
%%% The checksum field above contains a CRC-16
%%% checksum as the first value, followed by the
%%% equivalent of the standard UNIX wc (word
%%% count) utility output of lines, words, and
%%% characters. This is produced by Robert
%%% Solovay's checksum utility.",
%%% }
%%% ====================================================================
@Preamble{
"\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"
# "\hyphenation{ }"
}
%%% ====================================================================
%%% Acknowledgement abbreviations:
@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|http://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|"}
%%% ====================================================================
%%% Institution abbreviations:
@String{inst-COUNTERPANE-INTERNET-SECURITY = "Counterpane Internet Security"}
@String{inst-COUNTERPANE-INTERNET-SECURITY:adr = "3031 Tisch Way, Suite 100PE,
San Jose, CA 95128, USA"}
@String{inst-COUNTERPANE-SYSTEMS = "Counterpane Systems"}
@String{inst-COUNTERPANE-SYSTEMS:adr = "101 East Minnehaha Parkway, Minneapolis,
MN 55419"}
@String{inst-UTAH-MATH = "University of Utah, Department of Mathematics"}
@String{inst-UTAH-MATH:adr = "Salt Lake City, UT 84112-0090, USA"}
%%% ====================================================================
%%% Journal abbreviations:
@String{j-ACM-COMM-COMP-ALGEBRA = "ACM Communications in Computer Algebra"}
@String{j-ALGORITHMICA = "Algorithmica"}
@String{j-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-SCI = "British Journal for the History of Science"}
@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-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-COMP-ARCH-NEWS = "ACM SIGARCH Computer Architecture News"}
@String{j-COMP-J = "The Computer Journal"}
@String{j-COMP-MATH-APPL = "Computers and Mathematics with
Applications"}
@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-SECUR-J = "Computer Security Journal"}
@String{j-COMPUTER = "Computer"}
@String{j-COMPUTERS-AND-GRAPHICS = "Computers and Graphics"}
@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-FUT-GEN-COMP-SYS = "Future Generation Computer Systems"}
@String{j-IBM-JRD = "IBM Journal of Research and Development"}
@String{j-IEEE-ANN-HIST-COMPUT = "IEEE Annals of the History of Computing"}
@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-COMPUT = "IEEE Transactions on Computers"}
@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-VIS-COMPUT-GRAPH = "IEEE Transactions on Visualization
and Computer Graphics"}
@String{j-IJHPCA = "The International Journal of High
Performance Computing Applications"}
@String{j-INF-COMPUT = "Information and Computation"}
@String{j-INFO-PROC-LETT = "Information Processing Letters"}
@String{j-INFORMATIK-SPEKTRUM = "Informatik Spektrum"}
@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-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-PARALLEL-PROG = "International Journal of Parallel
Programming"}
@String{j-INT-J-PAR-EMER-DIST-SYS = "International Journal of Parallel, Emergent
and Distributed Systems: IJPEDS"}
@String{j-INT-J-SYST-SCI = "International Journal of Systems Science"}
@String{j-INTELL-NATL-SECUR = "Intelligence and National Security"}
@String{j-J-ACM = "Journal of the ACM"}
@String{j-J-COMP-SCI-TECH = "Journal of computer science and technology"}
@String{j-J-INFO-SCI-ENG = "Journal of Information Science and
Engineering"}
@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-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-JETC = "ACM Journal on Emerging Technologies
in Computing Systems (JETC)"}
@String{j-LECT-NOTES-COMP-SCI = "Lecture Notes in Computer Science"}
@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-MATHEMATIKA = "Mathematika"}
@String{j-NAMS = "Notices of the American Mathematical
Society"}
@String{j-NETWORK-WORLD = "Network World"}
@String{j-OBZORNIK-MAT-FIZ = "Dru{\\v{s}}tvo Matematikov, Fizikov in
Astronomov SRS. Obzornik za Matematiko in
Fiziko"}
@String{j-OPER-SYS-REV = "Operating Systems Review"}
@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-REV-A = "Physical Review A (Atomic, Molecular, and
Optical Physics)"}
@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-REV-SCI-INSTRUM = "Review of Scientific Instruments"}
@String{j-SCI-COMPUT-PROGRAM = "Science of Computer Programming"}
@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-REVIEW = "SIAM Review"}
@String{j-SIGACT = "ACM SIGACT News"}
@String{j-SIGCSE = "SIGCSE Bulletin (ACM Special Interest Group
on Computer Science Education)"}
@String{j-SIGPLAN = "ACM SIG{\-}PLAN Notices"}
@String{j-SIGSAM = "SIGSAM Bulletin (ACM Special Interest Group
on Symbolic and Algebraic Manipulation)"}
@String{j-SPE = "Soft\-ware\emdash Prac\-tice and Experience"}
@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-TCBB = "IEEE/ACM Transactions on Computational
Biology and Bioinformatics"}
@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-TISSEC = "ACM Transactions on Information and System
Security"}
@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-TOMS = "ACM Transactions on Mathematical Software"}
@String{j-TOPLAS = "ACM Transactions on Programming
Languages and Systems"}
@String{j-TOS = "ACM Transactions on Storage"}
@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-VLDB-J = "VLDB Journal: Very Large Data Bases"}
%%% ====================================================================
%%% Publisher abbreviations:
@String{pub-A-K-PETERS = "A. K. Peters, Ltd."}
@String{pub-A-K-PETERS:adr = "Wellesley, MA, USA"}
@String{pub-ACADEMIC = "Academic Press"}
@String{pub-ACADEMIC:adr = "New York, NY, USA"}
@String{pub-ACM = "ACM Press"}
@String{pub-ACM:adr = "New York, NY 10036, USA"}
@String{pub-AMS = "American Mathematical Society"}
@String{pub-AMS:adr = "Providence, RI, USA"}
@String{pub-ANCHOR = "Anchor Press/Doubleday"}
@String{pub-ANCHOR:adr = "Garden City, NY, USA"}
@String{pub-ANSI = "American National Standards Institute"}
@String{pub-ANSI:adr = "1430 Broadway, New York, NY 10018, USA"}
@String{pub-APRESS = "Apress"}
@String{pub-APRESS:adr = "Berkeley, CA, USA"}
@String{pub-ARTECH = "Artech House Inc."}
@String{pub-ARTECH:adr = "Norwood, MA, USA"}
@String{pub-AW = "Ad{\-d}i{\-s}on-Wes{\-l}ey"}
@String{pub-AW:adr = "Reading, MA, USA"}
@String{pub-BANTAM = "Bantam Doubleday Dell Publishing Group Inc."}
@String{pub-BANTAM:adr = "666 Fifth Avenue, New York, NY 10130, USA"}
@String{pub-BASIC-BOOKS = "Basic Books"}
@String{pub-BASIC-BOOKS:adr = "New York, NY, USA"}
@String{pub-BIRKHAUSER = "Birkh{\"a}user Verlag"}
@String{pub-BIRKHAUSER:adr = "Basel, Switzerland"}
@String{pub-BUTTERWORTH-HEINEMANN = "Butterworth-Heinemann"}
@String{pub-BUTTERWORTH-HEINEMANN:adr = "Boston, MA, USA"}
@String{pub-CAMBRIDGE = "Cambridge University Press"}
@String{pub-CAMBRIDGE:adr = "Cambridge, UK"}
@String{pub-CHAPMAN-HALL-CRC = "Chapman and Hall/CRC"}
@String{pub-CHAPMAN-HALL-CRC:adr = "Boca Raton, FL, USA"}
@String{pub-CISCO = "Cisco Press"}
@String{pub-CISCO:adr = "Indianapolis, IN, USA"}
@String{pub-CLARENDON-PRESS = "Clarendon Press"}
@String{pub-CLARENDON-PRESS:adr = "Oxford, UK"}
@String{pub-COPERNICUS = "Copernicus (a division of Springer-Verlag
New York, Inc.)"}
@String{pub-COPERNICUS:adr = "175 Fifth Avenue, New York, NY 10010, USA"}
@String{pub-CRC = "CRC Press"}
@String{pub-CRC:adr = "2000 N.W. Corporate Blvd., Boca Raton,
FL 33431-9868, USA"}
@String{pub-DEKKER = "Marcel Dekker, Inc."}
@String{pub-DEKKER:adr = "New York, NY, USA"}
@String{pub-DP = "Digital Press"}
@String{pub-DP:adr = "12 Crosby Drive, Bedford, MA 01730, USA"}
@String{pub-DOUBLEDAY = "Doubleday"}
@String{pub-DOUBLEDAY:adr = "New York, NY, USA"}
@String{pub-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-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-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-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"}
%%% ====================================================================
%%% Series abbreviations:
@String{ser-LNAI = "Lecture Notes in Artificial Intelligence"}
@String{ser-LNCS = "Lecture Notes in Computer Science"}
@String{ser-LNMATH = "Lecture Notes in Mathematics"}
@String{ser-PROJECT-GUTENBERG = "Project Gutenberg"}
@String{ser-SIGPLAN = "ACM SIG{\-}PLAN Notices"}
%%% ====================================================================
%%% Bibliography entries, sorted by year, and then by citation label:
@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",
ISBN = "3-540-42278-1 (hardcover)",
ISBN-13 = "978-3-540-42278-5 (hardcover)",
LCCN = "QA76.9.A25 D447 2002",
bibdate = "Thu Mar 22 12:26:35 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
price = "US\$49.95",
series = "Information security and cryptography.",
acknowledgement = ack-nhfb,
subject = "Computer security; Cryptography; Computer networks;
Security measures",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@Book{Delfs:2007:ICP,
author = "Hans Delfs and Helmut Knebl",
title = "Introduction to Cryptography: Principles and
Applications",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Second",
pages = "xvi + 367",
year = "2007",
ISBN = "3-540-49243-7 (hardcover)",
ISBN-13 = "978-3-540-49243-6 (hardcover)",
LCCN = "QA76.9.A25 D447 2007",
bibdate = "Thu Mar 22 12:38:28 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "X-9218-2100-8",
acknowledgement = ack-nhfb,
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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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{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 = "http://doi.acm.org/10.1145/1671954.1671956",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
bibdate = "Tue Mar 16 18:53:23 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
http://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",
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",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://doi.acm.org/10.1145/1734213.1734220",
ISSN = "0004-5411",
bibdate = "Thu Apr 29 13:26:36 MDT 2010",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/pagerank.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.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",
keywords = "Advogato; Axiomatic approach; e-Bay reputation system;
epinions.com; manipulation; MoleTrust; OpenPGP;
PageRank; ranking systems; social networks",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://www.sciencedirect.com/science/journal/0167739X;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://doi.acm.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 = "http://portal.acm.org/;
http://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)",
keywords = "authenticated encryption; bitstream security; FPGA;
replay attack; security protocol; system downgrade",
}
@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 = "library.ox.ac.uk:210/ADVANCE;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
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",
}
@TechReport{Beebe:2010:BPCb,
author = "Nelson H. F. Beebe",
title = "A Bibliography of Publications on Cryptography:
2010--2019",
institution = inst-UTAH-MATH,
address = inst-UTAH-MATH:adr,
pages = "2",
day = "22",
month = feb,
year = "2010",
bibdate = "Tue Mar 16 13:01:26 2010",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.math.utah.edu/pub/tex/bib/index-table-c.html#cryptography2010",
acknowledgement = ack-nhfb,
}
@TechReport{Beebe:2010:BPCd,
author = "Nelson H. F. Beebe",
title = "A Bibliography of Publications on Cryptography:
1990--1999",
institution = inst-UTAH-MATH,
address = inst-UTAH-MATH:adr,
pages = "293",
day = "22",
month = may,
year = "2010",
bibdate = "Tue Sep 14 08:35:22 2010",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.math.utah.edu/pub/tex/bib/index-table-c.html#cryptography1990",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
}
@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 = "http://dx.doi.org/10.1145/1880022.1880025",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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 = "http://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 = "http://dx.doi.org/10.1109/FOCS.2010.55",
bibdate = "Thu Apr 12 09:34:12 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.doi.org/10.1002/spe.974",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
bibdate = "Tue Jun 21 17:09:48 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
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 = "http://dx.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 = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5255226",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
}
@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 = "z3950.gbv.de:20011/gvk;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Springer-Lehrbuch",
URL = "http://www.springerlink.com/content/j5g004;
http://www.springer.com/mathematics/numbers/book/978-3-642-11185-3",
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 = "http://doi.acm.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 = "http://portal.acm.org/;
http://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 = "http://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;
http://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,
}
@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 = "http://doi.acm.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/;
http://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",
}
@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 = "http://dx.doi.org/10.1109/MSP.2010.124",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
bibdate = "Tue Jul 27 16:38:19 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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)",
bibdate = "Mon Feb 22 15:35:29 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.ams.org/notices/201003/",
acknowledgement = ack-nhfb,
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 = "http://dx.doi.org/10.1109/DCC.2010.77",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.doi.org/10.1007/978-3-642-12510-2_5",
bibdate = "Thu Feb 10 12:53:16 2011",
bibsource = "http://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 = "http://dx.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 = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453339",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
}
@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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://www.sciencedirect.com/science/journal/00200190;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
}
@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 = "http://www.sciencedirect.com/science/journal/03043975;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
}
@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 = "http://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 = "http://doi.acm.org/10.1145/1805974.1805978",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Wed Jul 28 14:57:15 MDT 2010",
bibsource = "http://portal.acm.org/;
http://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",
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 = "http://dx.doi.org/10.1201/9781584888215-c18",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "http://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",
bibdate = "Tue Mar 16 08:57:57 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tocl/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
articleno = "9",
}
@InBook{Conitzer:2010:AP,
author = "Vincent Conitzer",
title = "Auction Protocols",
crossref = "Atallah:2010:ATC",
chapter = "16",
pages = "1--19",
year = "2010",
DOI = "http://dx.doi.org/10.1201/9781584888215-c16",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.crcnetbase.com/doi/abs/10.1201/9781584888215-c16",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.doi.org/10.1109/MSP.2010.193",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
bibdate = "Wed Dec 15 15:02:36 2010",
bibsource = "http://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 = "http://doi.acm.org/10.1145/1735886.1735891",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
bibdate = "Wed Apr 28 13:44:08 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://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",
keywords = "Data outsourcing; encryption policy; privacy",
}
@Book{Dent:2010:PS,
editor = "Alexander W. Dent and Yuliang Zheng and Moti Yung",
title = "Practical Signcryption",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xviii + 274",
year = "2010",
ISBN = "3-540-89409-8 (hardcover)",
ISBN-13 = "978-3-540-89409-4 (hardcover)",
LCCN = "QA76.9.A25 P735 2010",
bibdate = "Mon Mar 12 12:29:41 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
series = "Information security and cryptography",
acknowledgement = ack-nhfb,
}
@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)",
bibdate = "Tue Nov 23 11:41:53 MST 2010",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "Linux Journal",
}
@InBook{Desmedt:2010:CF,
author = "Yvo Desmedt",
title = "Cryptographic Foundations",
crossref = "Atallah:2010:ATC",
chapter = "9",
pages = "1--15",
year = "2010",
DOI = "http://dx.doi.org/10.1201/9781584888215-c9",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "http://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 = "http://dx.doi.org/10.1201/9781584888215-c10",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "http://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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
}
@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 = "http://dx.doi.org/10.1109/FOCS.2010.56",
bibdate = "Thu Apr 12 09:34:12 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://doi.acm.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
articleno = "3",
}
@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;
http://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",
}
@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 = "http://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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
}
@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 = "http://dx.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 = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5396332",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
}
@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 = "http://dx.doi.org/10.1145/1837934.1837984",
bibdate = "Fri Jun 17 08:06:37 MDT 2011",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://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;
z3950.loc.gov:7090/Voyager;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.skein-hash.info/sites/default/files/skein1.3.pdf;
http://en.wikipedia.org/wiki/Skein_(hash_function)",
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{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)",
bibdate = "Mon Feb 22 15:35:29 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.ams.org/notices/201003/",
acknowledgement = ack-nhfb,
}
@InBook{Frikken:2010:SMC,
author = "Keith B. Frikken",
title = "Secure Multiparty Computation",
crossref = "Atallah:2010:ATC",
chapter = "14",
pages = "1--16",
year = "2010",
DOI = "http://dx.doi.org/10.1201/9781584888215-c14",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "http://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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Katz:2008:IMC}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
}
@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 = "http://doi.acm.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/;
http://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,
}
@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 = "http://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 = "http://dx.doi.org/10.1109/FOCS.2010.65",
bibdate = "Thu Apr 12 09:34:12 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.doi.org/10.1109/MMUL.2010.14",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
bibdate = "Thu May 13 11:33:52 2010",
bibsource = "http://www.computer.org/multimedia/archives.htm;
http://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 = "http://portal.acm.org/;
http://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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.jucs.org/jucs_16_21/watermarking_techniques_for_relational",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.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 = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5416683",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
}
@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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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",
year = "2010",
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",
LCCN = "Z103 .H39 2010eb",
bibdate = "Fri Mar 23 10:32:15 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/sigact.bib;
jenson.stanford.edu:2210/unicorn",
series = "Information security and cryptography: texts and
monographs",
acknowledgement = ack-nhfb,
subject = "Cryptography",
tableofcontents = "Part 1. Introduction and definitions \\
Part 2. General constructions \\
Part 3. Specific constructions",
}
@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 = "http://doi.acm.org/10.1145/1671954.1671960",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
bibdate = "Tue Mar 16 18:53:23 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
http://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",
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-6031-89-X",
ISBN-13 = "978-952-6031-89-7",
ISSN = "1797-5050",
bibdate = "Thu May 12 06:49:36 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "Dissertations in information and computer science",
acknowledgement = ack-nhfb,
keywords = "multidimensional cryptanalysis; Matsui's algorithm;
linear cryptanalysis; block cipher stream cipher",
}
@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 = "z3950.loc.gov:7090/Voyager;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
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",
}
@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 = "z3950.loc.gov:7090/Voyager;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
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 = "http://doi.acm.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 = "http://portal.acm.org/;
http://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)",
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 = "http://doi.acm.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 = "http://portal.acm.org/;
http://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)",
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{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",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.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/;
http://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",
remark = "An earlier version of this work won Best Paper Award
at STOC'2010 (Symposium on the Theory of Computing):
see \url{http://dx.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",
bibdate = "Sat Apr 2 08:42:35 MDT 2011",
bibsource = "http://www.sciencedirect.com/science/journal/13891286;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
}
@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;
http://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,
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/reprint/53/5/616",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.doi.org/10.1109/PDGC.2010.5679887",
bibdate = "Thu Apr 21 10:40:48 2011",
bibsource = "http://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{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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "library.ox.ac.uk:210/ADVANCE;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
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 = "http://dx.doi.org/10.1145/1880022.1880023",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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)",
bibdate = "Thu Mar 31 12:46:30 MDT 2011",
bibsource = "http://www.sciencedirect.com/science/journal/00200190;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
}
@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",
bibdate = "Tue Sep 7 07:27:06 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.doi.org/10.5075/epfl-thesis-4755",
bibdate = "Fri May 13 06:33:43 2011",
bibsource = "http://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 = "http://dx.doi.org/10.1109/ICEIE.2010.5559670",
ISBN = "1424476798",
ISBN-13 = "978-1-4244-7679-4",
LCCN = "????",
bibdate = "Thu Apr 21 11:18:00 2011",
bibsource = "z3950.bibsys.no:2100/BIBSYS;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
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 = "http://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 = "http://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 = "http://dx.doi.org/10.1201/9781584888215-c17",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.crcnetbase.com/doi/abs/10.1201/9781584888215-c17",
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 = "http://doi.acm.org/10.1145/1814539.1814550",
ISSN = "1539-9087",
bibdate = "Mon Aug 30 15:29:45 MDT 2010",
bibsource = "http://portal.acm.org/;
http://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",
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)",
bibdate = "Mon Feb 22 15:35:29 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.ams.org/notices/201003/",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5313804",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
}
@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 = "http://dx.doi.org/10.1109/SOCDC.2010.5682906",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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;
http://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,
}
@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",
bibdate = "Mon Nov 1 11:40:41 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.doi.org/10.1145/1880022.1880026",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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",
bibdate = "Tue Sep 7 07:27:06 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://www.sciencedirect.com/science/journal/00200190;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
}
@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)",
bibdate = "Thu Mar 31 12:46:51 MDT 2011",
bibsource = "http://www.sciencedirect.com/science/journal/00200190;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
}
@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",
bibdate = "Tue Sep 7 07:27:06 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.doi.org/10.1145/1880022.1880031",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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)",
bibdate = "Thu Mar 31 12:46:52 MDT 2011",
bibsource = "http://www.sciencedirect.com/science/journal/00200190;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
}
@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)",
bibdate = "Thu Mar 31 12:46:33 MDT 2011",
bibsource = "http://www.sciencedirect.com/science/journal/00200190;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
}
@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 = "http://dx.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;
http://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,
}
@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",
bibdate = "Tue Sep 7 07:27:06 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.doi.org/10.1109/MSP.2010.56",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
bibdate = "Thu May 13 09:49:48 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://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",
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 = "http://doi.acm.org/10.1145/1698750.1698757",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Tue Mar 16 10:18:15 MDT 2010",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
articleno = "17",
}
@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 = "http://dx.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 = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5432161",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
}
@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",
bibdate = "Sat Apr 2 08:42:41 MDT 2011",
bibsource = "http://www.sciencedirect.com/science/journal/13891286;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
}
@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 = "http://dx.doi.org/10.1109/MSP.2010.111",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
bibdate = "Wed May 26 15:44:06 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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;
http://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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Hoffstein:2008:IMC}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
}
@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 = "http://doi.acm.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/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.doi.org/10.1109/MSP.2010.44",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
bibdate = "Thu May 13 09:49:48 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@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 = "http://dx.doi.org/10.1109/ICCDA.2010.5541188",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://www.sciencedirect.com/science/journal/03043975;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
}
@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 = "http://dx.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 = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5406504",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
}
@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 = "http://dx.doi.org/10.1145/1880022.1880035",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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 = "http://dx.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 = "http://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 = "EMV; Chip and PIN; card fraud; bank security; protocol
failure; security economics; authentication",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.doi.org/10.1142/S0129626410000193",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:04 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
}
@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 = "http://dx.doi.org/10.1142/S0129626410000211",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:04 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
}
@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 = "http://dx.doi.org/10.1142/S012962641000020X",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:04 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
}
@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 = "http://dx.doi.org/10.1109/CICN.2010.75",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
bibdate = "Tue Sep 7 07:27:06 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
series = "IT-Security",
acknowledgement = ack-nhfb,
}
@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;
http://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,
}
@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",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://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 = "http://dx.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 = "http://portal.acm.org/;
http://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,
keywords = "Authentication; Continuous monitoring; Database
outsourcing; Data streams",
}
@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 = "http://doi.acm.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 = "http://portal.acm.org/;
http://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)",
keywords = "data compression; FPGA; hardware algorithms;
networking; parallel processing; reconfigurable
computing; Stream processing",
}
@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)",
bibdate = "Wed Jun 23 19:08:58 MDT 2010",
bibsource = "http://computer.org/computer/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
}
@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",
bibdate = "Tue Sep 7 07:27:06 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.doi.org/10.1109/MSP.2010.65",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
bibdate = "Thu May 13 09:49:48 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@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 = "http://dx.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;
http://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,
}
@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)",
bibdate = "Tue Nov 23 11:41:55 MST 2010",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "Linux Journal",
}
@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 = "http://dx.doi.org/10.1109/MC.2010.112",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
bibdate = "Wed May 12 22:57:42 MDT 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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)",
bibdate = "Thu Mar 31 12:46:44 MDT 2011",
bibsource = "http://www.sciencedirect.com/science/journal/00200190;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
}
@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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
}
@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)",
bibdate = "Thu Mar 31 12:46:34 MDT 2011",
bibsource = "http://www.sciencedirect.com/science/journal/00200190;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
}
@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)",
bibdate = "Thu Mar 31 12:46:31 MDT 2011",
bibsource = "http://www.sciencedirect.com/science/journal/00200190;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
}
@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 = "http://dx.doi.org/10.1145/1880022.1880027",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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 = "http://dx.doi.org/10.1109/FOCS.2010.9",
bibdate = "Thu Apr 12 09:34:12 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.doi.org/10.1201/9781584888215-c15",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "http://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 = "http://dx.doi.org/10.1145/1880022.1880028",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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",
bibdate = "Sat Apr 2 08:42:38 MDT 2011",
bibsource = "http://www.sciencedirect.com/science/journal/13891286;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
}
@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 = "http://dx.doi.org/10.1201/9781584888215-c12",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "http://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 = "http://dx.doi.org/10.1201/9781584888215-c13",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "http://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 = "http://dx.doi.org/10.1109/MSP.2009.144",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
bibdate = "Wed May 26 15:44:06 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Shparlinski:2003:CAA}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
}
@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 = "http://dx.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 = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5477413",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
}
@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)",
bibdate = "Mon Feb 22 15:35:29 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.ams.org/notices/201003/",
acknowledgement = ack-nhfb,
keywords = "algebraic number theory; lattice-based cryptography;
pairing-based cryptography; Pell equations",
}
@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 = "http://dx.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;
http://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",
onlinedate = "November 30, 2010",
}
@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 = "http://dx.doi.org/10.1109/PDGC.2010.5679895",
bibdate = "Thu Apr 21 10:52:19 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://doi.acm.org/10.1145/1740390.1740401",
ISSN = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "http://portal.acm.org/;
http://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,
}
@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 = "http://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)",
bibdate = "Thu Mar 31 12:46:33 MDT 2011",
bibsource = "http://www.sciencedirect.com/science/journal/00200190;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
}
@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",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.doi.org/10.1145/1880022.1880033",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://hpc.sagepub.com/content/24/2/154.full.pdf+html",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.doi.org/10.1109/MC.2010.31",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
bibdate = "Wed May 12 22:57:42 MDT 2010",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.doi.org/10.5075/epfl-thesis-4769",
bibdate = "Fri May 13 06:36:07 2011",
bibsource = "http://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 = "http://dx.doi.org/10.1201/9781584888215-c11",
bibdate = "Sat May 14 09:37:55 2011",
bibsource = "http://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 = "http://doi.acm.org/10.1145/1698750.1698758",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Tue Mar 16 10:18:15 MDT 2010",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
articleno = "18",
}
@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 = "http://dx.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 = "z3950.gbv.de:20011/gvk;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
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 = "NTRUSign; ANSI X9.98-2010",
}
@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 = "http://dx.doi.org/10.1145/1880022.1880029",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Wed Jan 12 17:10:07 MST 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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",
bibdate = "Sat Apr 2 08:42:38 MDT 2011",
bibsource = "http://www.sciencedirect.com/science/journal/13891286;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
}
@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 = "http://dx.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;
http://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,
}
@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 = "http://doi.acm.org/10.1145/1735886.1735887",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
bibdate = "Wed Apr 28 13:44:08 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://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",
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 = "http://dx.doi.org/10.1109/ICCASM.2010.5623043",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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{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 = "http://doi.acm.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/;
http://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",
}
@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",
bibdate = "Mon Nov 1 11:40:41 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://doi.acm.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 = "http://portal.acm.org/;
http://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)",
keywords = "cryptography; Oscillator rings; true random number
generators",
}
@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 = "http://www.sciencedirect.com/science/journal/03043975;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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: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",
bibdate = "Sat Apr 2 08:42:40 MDT 2011",
bibsource = "http://www.sciencedirect.com/science/journal/13891286;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
}
@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 = "http://doi.acm.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 = "http://portal.acm.org/;
http://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",
keywords = "difc; memory tainting; qemu; virtualization; xen",
}
@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",
bibdate = "Mon Nov 1 11:40:40 MDT 2010",
bibsource = "http://www.sciencedirect.com/science/journal/01641212;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://www.sciencedirect.com/science/journal/03043975;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
}
@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 = "http://dx.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/;
http://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",
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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
http://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",
}
@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 = "http://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 = "http://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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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)",
bibdate = "Thu Mar 31 12:47:01 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
}
@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 = "http://dx.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/;
http://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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;
http://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 = "Computer Journal",
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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://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 = "http://dx.doi.org/10.1145/1952982.1952986",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Thu Jun 2 07:27:23 MDT 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "Computer",
volume = "44",
number = "7",
pages = "100--102",
month = jul,
year = "2011",
CODEN = "CPTRB4",
DOI = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
}
@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 = "http://dx.doi.org/10.1109/FOCS.2011.12",
bibdate = "Thu Apr 12 09:34:22 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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/;
http://www.math.utah.edu/pub/tex/bib/amstat.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.doi.org/10.1145/1952982.1952993",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Thu Jun 2 07:27:23 MDT 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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",
bibdate = "Tue Jun 21 10:22:32 MDT 2011",
bibsource = "http://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",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://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{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",
bibdate = "Tue Jun 21 10:22:32 MDT 2011",
bibsource = "http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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",
bibdate = "Tue Jun 21 10:22:26 MDT 2011",
bibsource = "http://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",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
}
@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",
bibdate = "Tue Jun 21 10:22:31 MDT 2011",
bibsource = "http://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",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
}
@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 = "http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
}
@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 = "http://dx.doi.org/10.1145/1952982.1952992",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Thu Jun 2 07:27:23 MDT 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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 = "http://dx.doi.org/10.1145/1952982.1952996",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Thu Jun 2 07:27:23 MDT 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.doi.org/10.1109/FOCS.2011.35",
bibdate = "Thu Apr 12 09:34:29 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/focs2010.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6108120",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
bibdate = "Tue Jun 21 10:22:28 MDT 2011",
bibsource = "http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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;
http://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)",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 Oystein 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 = "http://dx.doi.org/10.1109/MSP.2010.204",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
bibdate = "Fri Apr 1 22:34:08 2011",
bibsource = "http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.doi.org/10.1109/FOCS.2011.94",
bibdate = "Thu Apr 12 09:34:22 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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{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;
http://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,
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.doi.org/10.1145/2049697.2049698",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
bibdate = "Thu Dec 15 09:33:01 MST 2011",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.doi.org/10.1109/FOCS.2011.74",
bibdate = "Thu Apr 12 09:34:29 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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/;
http://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
http://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",
}
@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 = "http://dx.doi.org/10.1109/MSP.2011.69",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
bibdate = "Wed May 25 15:29:11 2011",
bibsource = "http://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 = "http://dx.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/;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/prng.bib;
http://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",
keywords = "cryptography; hardness amplification; one-way
functions; pseudorandom generator",
onlinedate = "December 06, 2011",
}
@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 = "http://dx.doi.org/10.1145/1993060.1993062",
ISSN = "1073-0516",
bibdate = "Wed Aug 17 09:31:44 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/tochi/;
http://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",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/compj2010.bib;
http://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 = "Computer Journal",
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)",
bibdate = "Thu Mar 31 12:47:00 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
}
@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 = "http://dx.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 = "http://www.computer.org/tc/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/ccpe.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
onlinedate = "7 Dec 2010",
}
@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 = "http://dx.doi.org/10.1145/1993636.1993650",
bibdate = "Tue Jun 7 18:53:27 MDT 2011",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
}
@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",
bibdate = "Tue Jun 21 10:22:23 MDT 2011",
bibsource = "http://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",
}
@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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.jucs.org/jucs_17_6/improving_security_levels_of",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.doi.org/10.1145/1883612.1883619",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
bibdate = "Sun Jan 30 14:27:08 MST 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
http://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",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.doi.org/10.1109/MSP.2010.169",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
bibdate = "Tue Feb 8 15:50:31 2011",
bibsource = "http://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{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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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: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 = "http://dx.doi.org/10.1145/1925109.1925110",
ISSN = "0734-2071",
bibdate = "Mon Feb 28 16:17:43 MST 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/tocs/;
http://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",
}
@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 = "http://dx.doi.org/10.1145/1989727.1989732",
ISSN = "0004-5411",
bibdate = "Mon Jul 18 12:34:51 MDT 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/compj2010.bib;
http://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 = "Computer Journal",
onlinedate = "May 6, 2011",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.doi.org/10.1142/S0129626411000047",
ISSN = "0129-6264",
bibdate = "Tue Feb 28 11:32:06 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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: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",
bibdate = "Tue Jun 21 10:22:30 MDT 2011",
bibsource = "http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
}
@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 = "http://dx.doi.org/10.1145/1993636.1993730",
bibdate = "Tue Jun 7 18:53:27 MDT 2011",
bibsource = "http://portal.acm.org/;
http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (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 = "http://dx.doi.org/10.1145/2000486.2000492",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
bibdate = "Mon Sep 5 17:00:22 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
articleno = "18",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
}
@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 = "http://dx.doi.org/10.1145/1929943.1929952",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
bibdate = "Fri Apr 1 16:07:45 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://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;
http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (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",
bibdate = "Tue Jun 21 10:22:28 MDT 2011",
bibsource = "http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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{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 = "http://dx.doi.org/10.1145/1952982.1952987",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
bibdate = "Thu Jun 2 07:27:23 MDT 2011",
bibsource = "http://portal.acm.org/;
http://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",
}
@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;
http://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 Crytosystems 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{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 = "http://dx.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/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/tois.bib",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
}
@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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (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 = "http://dx.doi.org/10.1109/MSP.2011.1",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
bibdate = "Fri Apr 1 22:34:08 2011",
bibsource = "http://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 = "http://dx.doi.org/10.1145/1993636.1993642",
bibdate = "Tue Jun 7 18:53:27 MDT 2011",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
}
@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",
bibdate = "Tue Jun 21 10:22:28 MDT 2011",
bibsource = "http://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",
}
@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 = "http://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
http://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{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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (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 = "http://dx.doi.org/10.1145/2063384.2063405",
bibdate = "Fri Dec 16 11:05:47 MST 2011",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/supercomputing2011.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
}
@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 = "http://dx.doi.org/10.1109/ISDA.2011.6121728",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.doi.org/10.1109/AISP.2011.5960982",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.jucs.org/jucs_17_11/security_analysis_of_three",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.doi.org/10.1109/MSP.2011.89",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
bibdate = "Wed Nov 16 15:22:23 2011",
bibsource = "http://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;
http://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,
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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{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 = "http://dx.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/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://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;
http://www.math.utah.edu/pub/tex/bib/adabooks.bib;
http://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 = "http://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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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)",
bibdate = "Thu Mar 31 12:47:00 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
}
@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;
http://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,
}
@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",
bibdate = "Tue Jun 21 10:22:31 MDT 2011",
bibsource = "http://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",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (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:??",
month = feb,
year = "2011",
CODEN = "ACMSCU",
DOI = "http://dx.doi.org/10.1145/1916461.1916465",
ISSN = "0098-3500 (print), 1557-7295 (electronic)",
bibdate = "Tue Mar 1 16:05:18 MST 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/toms/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.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)",
}
@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 = "http://dx.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 = "http://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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Nievergelt:2002:FLM}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://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",
}
@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",
bibdate = "Tue Jun 21 10:22:26 MDT 2011",
bibsource = "http://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",
}
@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 = "http://dx.doi.org/10.1109/FOCS.2011.98",
bibdate = "Thu Apr 12 09:34:22 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/focs2010.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6108120",
}
@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",
bibdate = "Tue Jun 21 10:22:24 MDT 2011",
bibsource = "http://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",
}
@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)",
bibdate = "Thu Mar 31 12:47:00 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/compj2010.bib;
http://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 = "Computer Journal",
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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/compgraph.bib;
http://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 \& Graphics",
}
@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",
bibdate = "Tue Jun 21 10:22:32 MDT 2011",
bibsource = "http://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",
}
@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 = "http://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 = "http://dx.doi.org/10.1109/MSP.2010.201",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
bibdate = "Tue Feb 8 15:50:31 2011",
bibsource = "http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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{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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://www.jucs.org/jucs_17_2/security_and_privacy_preservation",
acknowledgement = ack-nhfb,
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/compj2010.bib;
http://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 = "Computer Journal",
onlinedate = "July 27, 2011",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
http://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",
}
@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 = "http://dx.doi.org/10.1145/2000502.2000503",
ISSN = "1550-4832",
bibdate = "Thu Aug 18 12:25:13 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/jetc/;
http://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)",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/compj2010.bib;
http://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 = "Computer Journal",
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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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",
bibdate = "Sat Apr 2 08:42:42 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.doi.org/10.1145/2421119.2421122",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
bibdate = "Sun May 5 10:25:40 MDT 2013",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/ccpe.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://ieeexplore.ieee.org/servlet/opac?punumber=5288520;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/hash.bib;
http://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)",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Beissinger:2006:CUM}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/compj2010.bib;
http://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 = "Computer Journal",
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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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{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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.doi.org/10.1145/2160158.2160159",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
bibdate = "Fri Apr 27 16:20:34 MDT 2012",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Elbirt:2009:UAC}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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{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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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)",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.doi.org/10.1007/978-3-642-29011-4_14;
http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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{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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.doi.org/10.1109/MC.2012.16",
ISSN = "0018-9162",
ISSN-L = "0018-9162",
bibdate = "Tue Jan 24 17:27:23 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/computer2010.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/compj2010.bib;
http://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 = "Computer Journal",
onlinedate = "February 16, 2012",
}
@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 = "1",
year = "2012",
CODEN = "BJHSAT",
DOI = "http://dx.doi.org/10.1017/S0007087412000088",
ISSN = "0007-0874 (print), 1474-001X (electronic)",
bibdate = "Sat Mar 24 11:54:12 MDT 2012",
bibsource = "http://journals.cambridge.org/action/displayJournal?jid=BJH;
http://www.math.math.utah.edu/pub/tex/bib/bjhs2010.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
ajournal = "British J. Hist. Sci.",
fjournal = "British Journal the History of Science",
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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/compsurv.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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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{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 = "http://dx.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 = "http://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
http://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 = "http://dx.doi.org/10.1007/978-3-642-29011-4_4;
http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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{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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.doi.org/10.1007/978-3-642-29011-4_39;
http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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/;
http://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/;
http://www.math.utah.edu/pub/tex/bib/bstj2010.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Bell Labs Technical Journal",
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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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)",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.doi.org/10.1007/978-3-642-29011-4_12;
http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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)",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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: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 = "http://dx.doi.org/10.1007/978-3-642-29011-4_29;
http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/comp2010.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
URL = "http://comjnl.oxfordjournals.org/content/55/4/439.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
onlinedate = "September 15, 2011",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/comp2010.bib;
http://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 = "Computer Journal",
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 = "http://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
http://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",
}
@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 = "http://dx.doi.org/10.1007/978-3-642-29011-4_26;
http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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{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 = "http://dx.doi.org/10.1145/2261417.2261426",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
bibdate = "Tue Nov 6 17:32:01 MST 2012",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
}
@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 = "http://dx.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/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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)",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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/;
http://www.math.utah.edu/pub/tex/bib/canjmath2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://portal.acm.org/;
http://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",
}
@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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.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 = "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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/comp2010.bib;
http://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 = "Computer Journal",
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",
bibdate = "Thu Nov 8 12:03:11 MST 2012",
bibsource = "http://www.jucs.org/jucs;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_18_12/new_results_of_related",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.doi.org/10.1007/978-3-642-29011-4_21;
http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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)",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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)",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.doi.org//doi/abs/10.1142/S0129054112500086",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:16:05 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/applmathcomput2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.doi.org/10.1007/978-3-642-29011-4_20;
http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/ccpe.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
onlinedate = "2 Oct 2011",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.acm.org/pubs/contents/journals/tomccap/;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/amermathmonthly2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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",
bibdate = "Thu Nov 8 12:03:13 MST 2012",
bibsource = "http://www.jucs.org/jucs;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_18_14/multilevel_steganography_improving_hidden",
acknowledgement = ack-nhfb,
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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{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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.acm.org/pubs/contents/journals/tomccap/;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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)",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.doi.org/10.1007/978-3-642-29011-4_27;
http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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{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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/ccpe.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
onlinedate = "12 Oct 2011",
}
@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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.doi.org/10.1145/2220357.2220358",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
bibdate = "Mon Jul 9 16:30:52 MDT 2012",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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: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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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{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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.doi.org/10.1007/978-3-642-29011-4_38;
http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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{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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://doi.ieeecomputersociety.org/10.1109/MC.2012.364",
ISSN = "0018-9162",
ISSN-L = "0018-9162",
bibdate = "Wed Nov 14 18:24:24 2012",
bibsource = "http://computer.org/computer/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/computer2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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{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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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{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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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,
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/;
http://www.math.utah.edu/pub/tex/bib/bstj2010.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Bell Labs Technical Journal",
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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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{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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
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 = "http://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
http://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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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",
}
@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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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{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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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: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 = "http://dx.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;
http://www.math.utah.edu/pub/tex/bib/ccpe.bib;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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: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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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",
}
@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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://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 = "http://dx.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 = "http://dx.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 = "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
http://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.sprin